@unpublished{Brandes2000Fully-6279,
  year={2000},
  title={Fully Dynamic Orthogonal Graph Layout for Interactive Systems},
  author={Brandes, Ulrik and Güdemann, Michael and Wagner, Dorothea}
}

<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/6279">
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6279/1/preprint_111.pdf"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6279/1/preprint_111.pdf"/>
    <dc:contributor>Brandes, Ulrik</dc:contributor>
    <dc:format>application/pdf</dc:format>
    <dc:creator>Güdemann, Michael</dc:creator>
    <dcterms:title>Fully Dynamic Orthogonal Graph Layout for Interactive Systems</dcterms:title>
    <dc:language>eng</dc:language>
    <dc:contributor>Güdemann, Michael</dc:contributor>
    <dc:creator>Wagner, Dorothea</dc:creator>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:10:44Z</dcterms:available>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:10:44Z</dc:date>
    <dc:contributor>Wagner, Dorothea</dc:contributor>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:abstract xml:lang="eng">We combine and supplement existing approaches to arrive at a general algorithm for dynamic orthogonal graph drawing with few bends. Our approach is applicable to non-planar graphs with vertices of arbitrary degree, reduces the number of bends if possible, allows explicit control of the bend-number/modification trade-off and does not suffer from the so-called rotation problem, all of which have been limitations in earlier approaches.</dcterms:abstract>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6279"/>
    <dc:creator>Brandes, Ulrik</dc:creator>
    <dcterms:issued>2000</dcterms:issued>
    <dc:rights>terms-of-use</dc:rights>
  </rdf:Description>
</rdf:RDF>