


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.
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 56 matches
- 2004
- Giuseppe Liotta:
Graph Drawing, 11th International Symposium, GD 2003, Perugia, Italy, September 21-24, 2003, Revised Papers. Lecture Notes in Computer Science 2912, Springer 2004, ISBN 3-540-20831-3 [contents] - 2003
- Yasuhito Asano, Takao Nishizeki:
Web-Linkage Viewer: Drawing Links in the Web Based on a Site-Oriented Framework. GD 2003: 498-499 - Christian Bachmaier, Franz-Josef Brandenburg, Michael Forster
:
Radial Level Planarity Testing and Embedding in Linear Time. GD 2003: 393-405 - Giuseppe Di Battista, Federico Mariani, Maurizio Patrignani, Maurizio Pizzonia:
BGPlay: A System for Visualizing the Interdomain Routing Evolution. GD 2003: 295-306 - Thomas Baudel
, Bruno Haible, Georg Sander:
Visual Data Mining with ILOG Discovery. GD 2003: 502-503 - John M. Boyer
, Pier Francesco Cortese, Maurizio Patrignani, Giuseppe Di Battista:
Stop Minding Your P's and Q's: Implementing a Fast and Simple DFS-Based Planarity Testing and Embedding Algorithm. GD 2003: 25-36 - Franz-Josef Brandenburg, Ulrik Brandes, Peter Eades, Joe Marks:
Graph Drawing Contest Report. GD 2003: 504-508 - Franz-Josef Brandenburg, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov
, Giuseppe Liotta, Petra Mutzel
:
Selected Open Problems in Graph Drawing. GD 2003: 515-539 - Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner:
Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles. GD 2003: 357-368 - Ulrik Brandes, Tim Dwyer, Falk Schreiber:
Visualizing Related Metabolic Pathways in Two and a Half Dimensions. GD 2003: 111-122 - Stina S. Bridgeman:
GraphEx: An Improved Graph Translation Service. GD 2003: 307-313 - Christoph Buchheim, Michael Jünger:
An Integer Programming Approach to Fuzzy Symmetry Detection. GD 2003: 166-177 - Sergio Cabello, Erik D. Demaine, Günter Rote:
Planar Embeddings of Graphs with Specified Edge Lengths. GD 2003: 283-294 - Tiziana Calamoneri, Annalisa Massini:
Nearly Optimal Three Dimensional Layout of Hypercube Networks. GD 2003: 247-258 - Jakub Cerný, Zdenek Dvorák
, Vít Jelínek
, Jan Kára:
Noncrossing Hamiltonian Paths in Geometric Graphs. GD 2003: 86-97 - Stirling Chow, Frank Ruskey
:
Drawing Area-Proportional Venn and Euler Diagrams. GD 2003: 466-477 - Jen-Hui Chuang, Chun-Cheng Lin, Hsu-Chun Yen:
Drawing Graphs with Nonuniform Nodes Using Potential Fields. GD 2003: 460-465 - Olaf Delgado-Friedrichs
:
Barycentric Drawings of Periodic Graphs. GD 2003: 178-189 - Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano:
Engineering and Visualizing Algorithms. GD 2003: 509-513 - Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng:
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. GD 2003: 1-12 - Vida Dujmovic, Henning Fernau
, Michael Kaufmann:
Fixed Parameter Algorithms for one-sided crossing minimization Revisited. GD 2003: 332-344 - Vida Dujmovic, David R. Wood
:
Three-Dimensional Grid Drawings with Sub-quadratic Volume. GD 2003: 190-201 - Breanne Dyck, Jill Joevenazzo, Elspeth Nickle, Jon Wilsdon, Stephen K. Wismath:
GLuskap: Visualization and Manipulation of Graph Drawings in 3-Dimensions. GD 2003: 496-497 - Alon Efrat
, Cesim Erten, Stephen G. Kobourov
:
Fixed-Location Circular-Arc Drawing of Planar Graphs. GD 2003: 147-158 - Cesim Erten, Philip J. Harding, Stephen G. Kobourov
, Kevin Wampler, Gary V. Yee:
GraphAEL: Graph Animations with Evolving Layouts. GD 2003: 98-110 - Cesim Erten
, Stephen G. Kobourov
, Vu Le, Armand Navabi:
Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes. GD 2003: 437-449 - Cesim Erten
, Stephen G. Kobourov
, Chandan Pitta:
Intersection-Free Morphing of Planar Graphs. GD 2003: 320-331 - Hubert de Fraysseix, Patrice Ossona de Mendez:
Stretching of Jordan Arc Contact Systems. GD 2003: 71-85 - Ashim Garg, Adrian Rusu:
Area-Efficient Drawings of Outerplanar Graphs. GD 2003: 129-134 - Ashim Garg, Adrian Rusu:
A More Practical Algorithm for Drawing Binary Trees in Linear Area with Arbitrary Aspect Ratio. GD 2003: 159-165
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.
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.
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.
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 2025-06-27 08:26 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