Остановите войну!
for scientists:
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 40 matches
- 2001
- Joe Marks:
Graph Drawing, 8th International Symposium, GD 2000, Colonial Williamsburg, VA, USA, September 20-23, 2000, Proceedings. Lecture Notes in Computer Science 1984, Springer 2001, ISBN 3-540-41554-8 [contents] - 2000
- Gill Barequet:
w-Searchlight Obedient Graph Drawings. GD 2000: 321-327 - Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides:
Orthogonal Drawings of Cycles in 3D Space (Extended Abstract). GD 2000: 272-283 - François Bertault, Peter Eades:
Drawing Hypergraphs in the Subset Standard (Short Demo Paper). GD 2000: 164-169 - Therese C. Biedl, Torsten Thiele, David R. Wood:
Three-Dimensional Orthogonal Graph Drawing with Optimal Volume. GD 2000: 284-295 - Jean-Daniel Boissonnat, Frédéric Cazals, Julia Flötotto:
2D-Structure Drawings of Similar Molecules. GD 2000: 115-126 - Franz-Josef Brandenburg, Ulrik Brandes, Michael Himsolt, Marcus Raitner:
Graph-Drawing Contest Report. GD 2000: 410-418 - Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner:
How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract). GD 2000: 103-114 - Ulrik Brandes, M. Scott Marshall, Stephen C. North:
Graph Data Format Workshop Report. GD 2000: 407-409 - Ulrik Brandes, Galina Shubina, Roberto Tamassia, Dorothea Wagner:
Fast Layout Methods for Timetable Graphs. GD 2000: 127-138 - Stina S. Bridgeman, Roberto Tamassia:
A User Study in Similarity Measures for Graph Drawing. GD 2000: 19-30 - Christoph Buchheim, Michael Jünger, Sebastian Leipert:
A Fast Layout Algorithm for k-Level Graphs. GD 2000: 229-240 - Andrea Carmignani, Giuseppe Di Battista, Walter Didimo, Francesco Matera, Maurizio Pizzonia:
Visualization of the Autonomous Systems Interconnections with HERMES. GD 2000: 150-163 - Rodolfo Castelló, Rym Mili, Ioannis G. Tollis:
An Algorithmic Framework for Visualizing Statecharts. GD 2000: 139-149 - Ho-Lin Chen, Hsueh-I Lu, Hsu-Chun Yen:
On Maximum Symmetric Subgraphs. GD 2000: 372-383 - Alice M. Dean:
A Layout Algorithm for Bar-Visibility Graphs on the Möbius Band. GD 2000: 350-359 - Carsten Friedrich, Peter Eades:
The Marey Graph Animation Tool Demo. GD 2000: 396-406 - Pawel Gajer, Michael T. Goodrich, Stephen G. Kobourov:
A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs. GD 2000: 211-221 - Pawel Gajer, Stephen G. Kobourov:
GRIP: Graph dRawing with Intelligent Placement. GD 2000: 222-228 - Wolfgang Günther, Robby Schönfeld, Bernd Becker, Paul Molitor:
k-Layer Straightline Crossing Minimization by Speeding Up Sifting. GD 2000: 253-258 - Carsten Gutwenger, Petra Mutzel:
A Linear Time Implementation of SPQR-Trees. GD 2000: 77-90 - David Harel, Yehuda Koren:
A Fast Multi-scale Method for Drawing Large Graphs. GD 2000: 183-196 - Ivan Herman, M. Scott Marshall:
GraphXML - An XML-Based Graph Description Format. GD 2000: 52-62 - Seok-Hee Hong, Peter Eades:
An Algorithm for Finding Three Dimensional Symmetry in Trees. GD 2000: 360-371 - Joan P. Hutchinson:
On Polar Visibility Representations of Graphs. GD 2000: 63-76 - David D. Jensen:
Knowledge Discovery from Graphs (Invited Talk). GD 2000: 170 - Gunnar W. Klau, Karsten Klein, Petra Mutzel:
An Experimental Comparison of Orthogonal Compaction Algorithms (Extended Abstract). GD 2000: 37-51 - William J. Lenhart, Giuseppe Liotta:
Minimum Weight Drawings of Maximal Triangulations (Extended Abstract). GD 2000: 338-349 - Neal Lesh, Joe Marks, Maurizio Patrignani:
Interactive Partitioning (System Demonstration, Short). GD 2000: 31-36 - Benjamin Yin-Sun Lynn, Antonios Symvonis, David R. Wood:
Refinement of Three-Dimensional Orthogonal Graph Drawings. GD 2000: 308-320
skipping 10 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-04-24 21:10 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