Остановите войну!
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 46 matches
- 2007
- Michael Kaufmann, Dorothea Wagner:
Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, Germany, September 18-20, 2006. Revised Papers. Lecture Notes in Computer Science 4372, Springer 2007, ISBN 978-3-540-70903-9 [contents] - 2006
- Wilhelm Barth, Petra Mutzel, Canan Yildiz:
A New Approximation Algorithm for Bend Minimization in the Kandinsky Model. GD 2006: 343-354 - Marc Benkert, Martin Nöllenburg, Takeaki Uno, Alexander Wolff:
Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps. GD 2006: 270-281 - Therese C. Biedl, Franz-Josef Brandenburg:
Partitions of Graphs into Trees. GD 2006: 430-439 - Ulrik Brandes, Christian Pich:
Eigensolver Methods for Progressive Multidimensional Scaling of Large Data. GD 2006: 42-53 - Ulrik Brandes, Barbara Schlieper:
Angle and Distance Constraints on Tree Drawings. GD 2006: 54-65 - Justin Cappos, Alejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G. Kobourov:
Simultaneous Graph Embedding with Bends and Circular Arcs. GD 2006: 95-107 - Josiah Carlson, David Eppstein:
Trees with Convex Faces and Optimal Angles. GD 2006: 77-88 - Ali Civril, Malik Magdon-Ismail, Eli Bocek-Rivele:
SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding. GD 2006: 30-41 - Cornelia Dangelmayr, Stefan Felsner:
Chordal Graphs as Intersection Graphs of Pseudosegments. GD 2006: 208-219 - Oliver Deussen:
The Algorithmic Beauty of Digital Nature. GD 2006: 5-7 - Michael B. Dillencourt, David Eppstein, Michael T. Goodrich:
Choosing Colors for Geometric Graphs Via Color Space Embeddings. GD 2006: 294-305 - Christian A. Duncan, Gunnar W. Klau, Stephen G. Kobourov, Georg Sander:
Graph-Drawing Contest Report. GD 2006: 448-452 - Tim Dwyer, Kim Marriott, Peter J. Stuckey:
Fast Node Overlap Removal - Correction. GD 2006: 446-447 - Tim Dwyer, Kim Marriott, Michael Wybrow:
Integrating Edge Routing into Force-Directed Layout. GD 2006: 8-19 - David Eppstein:
Upright-Quad Drawing of st -Planar Learning Spaces. GD 2006: 282-293 - Alejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G. Kobourov:
Characterization of Unlabeled Level Planar Trees. GD 2006: 367-379 - Stefan Felsner, Mareike Massow:
Thickness of Bar 1-Visibility Graphs. GD 2006: 330-342 - Stefan Felsner, Florian Zickfeld:
Schnyder Woods and Orthogonal Surfaces. GD 2006: 417-429 - Jacob Fox, Csaba D. Tóth:
On the Decay of Crossing Numbers. GD 2006: 174-183 - Fabrizio Frati:
Embedding Graphs Simultaneously with Fixed Edges. GD 2006: 108-113 - Fabrizio Frati, Giuseppe Di Battista:
Three-Dimensional Drawings of Bounded Degree Trees. GD 2006: 89-94 - Éric Fusy:
Straight-Line Drawing of Quadrangulations. GD 2006: 234-239 - Emden R. Gansner, Yehuda Koren:
Improved Circular Layouts. GD 2006: 386-398 - Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta:
Radial Drawings of Graphs: Geometric Constraints and Trade-Offs. GD 2006: 355-366 - Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Francesco Trotta, Stephen K. Wismath:
k -Colored Point-Set Embeddability of Outerplanar Graphs. GD 2006: 318-329 - Emilio Di Giacomo, Luca Grilli, Giuseppe Liotta:
Drawing Bipartite Graphs on Two Curves. GD 2006: 380-385 - Joachim Gudmundsson, Marc J. van Kreveld, Damian Merrick:
Schematisation of Tree Drawings. GD 2006: 66-76 - Carsten Gutwenger, Karsten Klein, Petra Mutzel:
Planarity Testing and Optimal Edge Insertion with Embedding Constraints. GD 2006: 126-137 - Michael Hirsch, Henk Meijer, David Rappaport:
Biclique Edge Cover Graphs and Confluent Drawings. GD 2006: 405-416
skipping 16 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-25 12:17 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