On the hardness of orthogonal-order preserving graph drawing
| Type of Publication: | Contribution to a conference |
| URI (citable link): | http://nbn-resolving.de/urn:nbn:de:bsz:352-opus-104772 |
| Author: | Brandes, Ulrik; Pampel, Barbara |
| Year of publication: | 2009 |
| Published in: | Graph Drawing / Tollis, Ioannis G.; Patrignani, Maurizio (ed.). - Berlin, Heidelberg : Springer Berlin Heidelberg, 2009. - (Lecture Notes in Computer Science ; 5417). - pp. 266-277. - ISBN 978-3-642-00218-2 |
| DOI (citable link): | https://dx.doi.org/10.1007/978-3-642-00219-9_25 |
| Subject (DDC): | 004 Computer Science |
| Keywords: | algo |
| Link to License: | Terms of use |
| Bibliography of Konstanz: | Yes |
Cite This
Files in this item
![[PDF]](/themes/Kops/images/mimes/pdf.png "PDF file"){kind=small}
BRANDES, Ulrik, Barbara PAMPEL, 2009. On the hardness of orthogonal-order preserving graph drawing. In: TOLLIS, Ioannis G., ed., Maurizio PATRIGNANI, ed.. Graph Drawing. Berlin, Heidelberg:Springer Berlin Heidelberg, pp. 266-277. ISBN 978-3-642-00218-2. Available under: doi: 10.1007/978-3-642-00219-9_25
@inproceedings{Brandes2009hardn-3002, title={On the hardness of orthogonal-order preserving graph drawing}, year={2009}, doi={10.1007/978-3-642-00219-9_25}, number={5417}, isbn={978-3-642-00218-2}, address={Berlin, Heidelberg}, publisher={Springer Berlin Heidelberg}, series={Lecture Notes in Computer Science}, booktitle={Graph Drawing}, pages={266--277}, editor={Tollis, Ioannis G. and Patrignani, Maurizio}, author={Brandes, Ulrik and Pampel, Barbara} }
<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/rdf/resource/123456789/3002"> <dc:creator>Pampel, Barbara</dc:creator> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/3002/1/Brandes_opus-104772.pdf"/> <dc:language>eng</dc:language> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/3002/1/Brandes_opus-104772.pdf"/> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/3002"/> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:title>On the hardness of orthogonal-order preserving graph drawing</dcterms:title> <dc:contributor>Pampel, Barbara</dc:contributor> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:rights>terms-of-use</dc:rights> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:issued>2009</dcterms:issued> <dc:creator>Brandes, Ulrik</dc:creator> <dc:contributor>Brandes, Ulrik</dc:contributor> <dcterms:bibliographicCitation>Publ. in: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008; revised papers / Ioannis G. Tollis ... (eds.). Berlin; Heidelberg: Springer, 2009, pp. 266-277 (= Lecture Notes in Computer Science ; vol. 5417)</dcterms:bibliographicCitation> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T10:15:43Z</dc:date> <dcterms:rights rdf:resource="https://kops.uni-konstanz.de/page/termsofuse"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T10:15:43Z</dcterms:available> </rdf:Description> </rdf:RDF>
Downloads since Oct 1, 2014 (Information about access statistics)
| Brandes_opus-104772.pdf | 51 |
This item appears in the following Collection(s)
Search KOPS
Browse
My Account
