default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 45 matches
- 2011
- Ulrik Brandes, Sabine Cornelsen:
Graph Drawing - 18th International Symposium, GD 2010, Konstanz, Germany, September 21-24, 2010. Revised Selected Papers. Lecture Notes in Computer Science 6502, Springer 2011, ISBN 978-3-642-18468-0 [contents] - 2010
- Eyal Ackerman, Radoslav Fulek, Csaba D. Tóth:
On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles. GD 2010: 1-12 - Patrizio Angelini, Enrico Colasante, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Monotone Drawings of Graphs. GD 2010: 13-24 - Patrizio Angelini, Fabrizio Frati, Markus Geyer, Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis:
Upward Geometric Graph Embeddings into Point Sets. GD 2010: 25-37 - Patrizio Angelini, Markus Geyer, Michael Kaufmann, Daniel Neuwirth:
On a Tree and a Path with No Geometric Simultaneous Embedding. GD 2010: 38-49 - Daniel Archambault, Helen C. Purchase, Bruno Pinaud:
Difference Map Readability for Dynamic Graphs. GD 2010: 50-61 - Evmorfia N. Argyriou, Michael A. Bekos, Antonios Symvonis:
Maximizing the Total Resolution of Graphs. GD 2010: 62-67 - Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Andreas Gleißner:
Plane Drawings of Queue and Deque Graphs. GD 2010: 68-79 - Gereon Bartel, Carsten Gutwenger, Karsten Klein, Petra Mutzel:
An Experimental Evaluation of Multilevel Layout Methods. GD 2010: 80-91 - Thomas Bläsius, Marcus Krug, Ignaz Rutter, Dorothea Wagner:
Orthogonal Graph Drawing with Flexibility Constraints. GD 2010: 92-104 - Jürgen Bregenzer:
GraphML-Based Exploration and Evaluation of Efficient Parallelization Alternatives for Automation Firmware. GD 2010: 389-390 - Wolfgang Brunner, Marco Matzeder:
Drawing Ordered (k - 1)-Ary Trees on k-Grids. GD 2010: 105-116 - Kevin Buchin, Bettina Speckmann, Sander Verdonschot:
Optimizing Regular Edge Labelings. GD 2010: 117-128 - Erin W. Chambers, David Eppstein, Michael T. Goodrich, Maarten Löffler:
Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area. GD 2010: 129-140 - Markus Chimani, Carsten Gutwenger, Petra Mutzel, Miro Spönemann, Hoi-Ming Wong:
Crossing Minimization and Layouts of Directed Hypergraphs with Port Constraints. GD 2010: 141-152 - Walter Didimo, Giuseppe Liotta, Salvatore Agostino Romeo:
Topology-Driven Force-Directed Algorithms. GD 2010: 165-176 - Vida Dujmovic, William S. Evans, Stephen G. Kobourov, Giuseppe Liotta, Christophe Weibel, Stephen K. Wismath:
On Graphs Supported by Line Sets. GD 2010: 177-182 - Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg:
Drawing Trees with Perfect Angular Resolution and Polynomial Area. GD 2010: 183-194 - Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg:
Lombardi Drawings of Graphs. GD 2010: 195-207 - Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, Georg Sander:
Graph Drawing Contest Report. GD 2010: 406-411 - David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg:
Optimal 3D Angular Resolution for Low-Degree Graphs. GD 2010: 208-219 - Fabrizio Frati:
Improved Lower Bounds on the Area Requirements of Series-Parallel Graphs. GD 2010: 220-225 - Radoslav Fulek, János Pach:
A Computational Approach to Conway's Thrackle Conjecture. GD 2010: 226-237 - Graeme Gange, Peter J. Stuckey, Kim Marriott:
Optimal k-Level Planarization and Crossing Minimization. GD 2010: 238-249 - Emden R. Gansner, Yifan Hu, Stephen G. Kobourov:
On Touching Triangle Graphs. GD 2010: 250-261 - Mereke van Garderen, Giuseppe Liotta, Henk Meijer:
Universal Pointsets for 2-Coloured Trees. GD 2010: 365-370 - Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, Ignaz Rutter:
Automatic Generation of Route Sketches. GD 2010: 391-392 - Markus Geyer, Michael Kaufmann, Robert Krug:
Visualizing Differences between Two Large Graphs. GD 2010: 393-394 - Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou:
Triangle Contact Representations and Duality. GD 2010: 262-273 - Yifan Hu, Stephen G. Kobourov, Sankar Veeramoni:
On Maximum Differential Graph Coloring. GD 2010: 274-286
skipping 15 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-10-03 03:59 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint