Остановите войну!
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 49 matches
- 2010
- David Eppstein, Emden R. Gansner:
Graph Drawing, 17th International Symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009. Revised Papers. Lecture Notes in Computer Science 5849, Springer 2010, ISBN 978-3-642-11804-3 [contents] - 2009
- Benjamin Albrecht, Philip Effinger, Markus Held, Michael Kaufmann, Stephan Kottler:
Visualization of Complex BPEL Models. GD 2009: 421-423 - Mario Albrecht, Andreas Kerren, Karsten Klein, Oliver Kohlbacher, Petra Mutzel, Wolfgang Paul, Falk Schreiber, Michael Wybrow:
On Open Problems in Biological Network Visualization. GD 2009: 256-267 - Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati:
Succinct Greedy Drawings Do Not Always Exist. GD 2009: 171-182 - Patrizio Angelini, Luca Cittadini, Giuseppe Di Battista, Walter Didimo, Fabrizio Frati, Michael Kaufmann, Antonios Symvonis:
On the Perspectives Opened by Right Angle Crossing Drawings. GD 2009: 21-32 - Patrizio Angelini, Fabrizio Frati, Maurizio Patrignani:
Splitting Clusters to Get C-Planarity. GD 2009: 57-68 - Melanie Badent, Michael Baur, Ulrik Brandes, Sabine Cornelsen:
Leftist Canonical Ordering. GD 2009: 159-170 - Lali Barrière, Clemens Huemer:
4-Labelings and Grid Embeddings of Plane Quadrangulations. GD 2009: 413-414 - Therese C. Biedl:
Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar Graphs. GD 2009: 280-291 - Therese C. Biedl, Lesvia Elena Ruiz Velázquez:
Drawing Planar 3-Trees with Given Face-Areas. GD 2009: 316-322 - Carla Binucci, Ulrik Brandes, Giuseppe Di Battista, Walter Didimo, Marco Gaertler, Pietro Palladino, Maurizio Patrignani, Antonios Symvonis, Katharina Anna Zweig:
Drawing Trees in a Streaming Model. GD 2009: 292-303 - Ulrik Brandes, Christian Pich:
More Flexible Radial Layout. GD 2009: 107-118 - Stina S. Bridgeman:
Using High Dimensions to Compare Drawings of Graphs. GD 2009: 408-410 - Kevin Buchin, Marc J. van Kreveld, Henk Meijer, Bettina Speckmann, Kevin Verbeek:
On Planar Supports for Hypergraphs. GD 2009: 345-356 - Sergio Cabello, Marc J. van Kreveld, Giuseppe Liotta, Henk Meijer, Bettina Speckmann, Kevin Verbeek:
Geometric Simultaneous Embeddings of a Graph and a Matching. GD 2009: 183-194 - Markus Chimani, Carsten Gutwenger, Petra Mutzel, Hoi-Ming Wong:
Upward Planarization Layout. GD 2009: 94-106 - Adrian Dumitrescu, János Pach, Géza Tóth:
Drawing Hamiltonian Cycles with No Large Angles. GD 2009: 3-14 - Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov:
Planar Drawings of Higher-Genus Graphs. GD 2009: 45-56 - Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, Georg Sander:
Graph Drawing Contest Report. GD 2009: 428-433 - Tim Dwyer, Lev Nachmanson:
Fast Edge-Routing for Large Graphs. GD 2009: 147-158 - Tim Dwyer, George G. Robertson:
Layout with Circular and Other Non-linear Constraints Using Procrustes Projection. GD 2009: 393-404 - Peter Eades, Seok-Hee Hong, Sheung-Hung Poon:
On Rectilinear Drawing of Graphs. GD 2009: 232-243 - Philip Effinger, Gero Decker:
Layout Techniques Coupled with Web2.0-Based Business Process Modeling. GD 2009: 417-418 - Ioannis Z. Emiris, Elias P. Tsigaridas, Antonios Varvitsiotis:
Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs. GD 2009: 195-200 - Alejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G. Kobourov:
On the Characterization of Level Planar Trees by Minimal Patterns. GD 2009: 69-80 - J. Joseph Fowler:
Characterization of Unlabeled Radial Level Planar Graphs. GD 2009: 81-93 - Emden R. Gansner, Yifan Hu, Stephen G. Kobourov:
GMap: Drawing Graphs as Maps. GD 2009: 405-407 - Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer:
Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings. GD 2009: 15-20 - Brynjar Gretarsson, Svetlin Bostandjiev, John O'Donovan, Tobias Höllerer:
WiGis: A Framework for Scalable Web-Based Interactive Graph Visualizations. GD 2009: 119-134 - Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesar, Tomás Vyskocil:
The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree. GD 2009: 304-315
skipping 19 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-06-06 00:09 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