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 33 matches
- 1997
- Stephen C. North:
Graph Drawing, Symposium on Graph Drawing, GD '96, Berkeley, California, USA, September 18-20, Proceedings. Lecture Notes in Computer Science 1190, Springer 1997, ISBN 3-540-62495-3 [contents] - 1996
- Manuel Abellanas, Jesus Garcia-Lopez, Gregorio Hernández-Peñalver, Marc Noy, Pedro A. Ramos:
Bipartite Embeddings of Trees in the Plane. GD 1996: 1-10 - Mohammad Alzohairi, Ivan Rival:
Series-Parallel Planar Ordered Sets Have Pagenumber Two. GD 1996: 11-24 - Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Armando Parise, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu, Luca Vismara:
Drawing Directed Acyclic Graphs: An Experimental Study. GD 1996: 76-91 - Prosenjit Bose, Alice M. Dean, Joan P. Hutchinson, Thomas C. Shermer:
On Rectangle Visibility Graphs. GD 1996: 25-44 - Stina S. Bridgeman, Ashim Garg, Roberto Tamassia:
A Graph Drawing and Translation Service on the WWW. GD 1996: 45-52 - Tiziana Calamoneri, Andrea Sterbini:
Drawing 2-, 3- and 4-colorable Graphs in O(n2) Volume. GD 1996: 53-62 - Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia:
Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings. GD 1996: 63-75 - Ugur Dogrusöz, Brendan Madden, Patrick Madden:
Circular Layout in the Graph Layout Toolkit. GD 1996: 92-100 - Peter Eades, Qing-Wen Feng:
Multilevel Visualization of Clustered Graphs. GD 1996: 101-112 - Peter Eades, Qing-Wen Feng, Xuemin Lin:
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. GD 1996: 113-128 - Peter Eades, Joe Marks, Stephen C. North:
Graph-Drawing Contest Report. GD 1996: 129-138 - Peter Eades, Antonios Symvonis, Sue Whitesides:
Two Algorithms for Three Dimensional Orthogonal Graph Drawing. GD 1996: 139-154 - Ulrich Fößmeier, Goos Kant, Michael Kaufmann:
2-Visibility Drawings of Planar Graphs. GD 1996: 155-168 - Arne Frick:
Upper Bounds on the Number of Hidden Nodes in Sugiyama's Algorithm. GD 1996: 169-183 - Arne Frick, Can Keskin, Volker Vogelmann:
Integration of Declarative Approaches. GD 1996: 184-192 - Ashim Garg, Roberto Tamassia:
GIOTTO3D: A System for Visualizing Hierarchical Structures in 3D. GD 1996: 193-200 - Ashim Garg, Roberto Tamassia:
A New Minimum Cost Flow Algorithm with Applications to Graph Drawing. GD 1996: 201-216 - Weiqing He, Kim Marriott:
Constrained Graph Layout. GD 1996: 217-232 - Michael Himsolt:
The Graphlet System. GD 1996: 233-240 - Konstantinos G. Kakoulis, Ioannis G. Tollis:
On the Edge Label Placement Problem. GD 1996: 241-256 - Jan Kratochvíl:
Intersection Graphs of Noncrossing Arc-Connected Sets in the Plane. GD 1996: 257-270 - Ruth Kuchem, Dorothea Wagner:
Wiring Edge-Disjoint Layouts. GD 1996: 271-285 - William J. Lenhart, Giuseppe Liotta:
Proximity Drawings of Outerplanar Graphs. GD 1996: 286-302 - Luis Arturo Perez Lozada, Candido Ferreira Xavier de Mendonça Neto, R. M. Rosi, Jorge Stolfi:
Automatic Visualization of Two-Dimensional Cellular Complexes. GD 1996: 303-317 - Petra Mutzel:
An Alternative Method to Crossing Minimization on Hierarchical Graphs. GD 1996: 318-333 - Shin-Ichi Nakano, Md. Saidur Rahman, Takao Nishizeki:
A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs. GD 1996: 334-344 - János Pach, Géza Tóth:
Graphs Drawn with Few Crossings Per Edge. GD 1996: 345-354 - Achilleas Papakostas, Janet M. Six, Ioannis G. Tollis:
Experimental and Theoretical Results in Interactive Orthogonal Graph Drawing. GD 1996: 371-386 - Achilleas Papakostas, Ioannis G. Tollis:
A Pairing Technique for Area-Efficient Orthogonal Drawings. GD 1996: 355-370
skipping 3 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-09-21 10:13 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