Остановите войну!
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 45 matches
- 2013
- Nieke Aerts, Stefan Felsner:
Straight Line Triangle Representations. GD 2013: 119-130 - Md. Jawaherul Alam, Franz J. Brandenburg, Stephen G. Kobourov:
Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs. GD 2013: 83-94 - Patrizio Angelini, Carla Binucci, Giordano Da Lozzo, Walter Didimo, Luca Grilli, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis:
Drawing Non-Planar Graphs with Crossing-Free Subgraphs. GD 2013: 292-303 - Patrizio Angelini, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
Morphing Planar Graph Drawings Efficiently. GD 2013: 49-60 - Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati:
Strip Planarity Testing. GD 2013: 37-48 - Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber:
Recognizing Outer 1-Planar Graphs in Linear Time. GD 2013: 107-118 - Christopher Auer, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer:
Characterizing Planarity by the Splittable Deque. GD 2013: 25-36 - Michael J. Bannister, Zhanpeng Cheng, William E. Devanny, David Eppstein:
Superpatterns and Universal Point Sets. GD 2013: 208-219 - Michael J. Bannister, David Eppstein, Joseph A. Simons:
Fixed Parameter Tractability of Crossing Minimization of Almost-Trees. GD 2013: 340-351 - Michael A. Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis:
Many-to-One Boundary Labeling with Backbones. GD 2013: 244-255 - Michael A. Bekos, Michael Kaufmann, Robert Krug, Stefan Näher, Vincenzo Roselli:
Slanted Orthogonal Drawings. GD 2013: 424-435 - Sergey Bereg, Alexander E. Holroyd, Lev Nachmanson, Sergey Pupyrev:
Drawing Permutations with Few Corners. GD 2013: 484-495 - Therese Biedl, Thomas Bläsius, Benjamin Niedermann, Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings. GD 2013: 460-471 - Thomas Bläsius, Annette Karrer, Ignaz Rutter:
Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices. GD 2013: 220-231 - Massimo Candela, Marco Di Bartolomeo, Giuseppe Di Battista, Claudio Squarcella:
Dynamic Traceroute Visualization at Multiple Abstraction Levels. GD 2013: 496-507 - Timothy M. Chan, Hella-Franziska Hoffmann, Stephen Kiazyk, Anna Lubiw:
Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations. GD 2013: 376-387 - Yi-Jun Chang, Hsu-Chun Yen:
On Orthogonally Convex Drawings of Plane Graphs - (Extended Abstract). GD 2013: 400-411 - Steven Chaplick, Radoslav Fulek, Pavel Klavík:
Extending Partial Representations of Circle Graphs. GD 2013: 131-142 - Markus Chimani, Robert Zeranski:
Upward Planarity Testing: A Computational Study. GD 2013: 13-24 - Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, Georg Sander:
Graph Drawing Contest Report. GD 2013: 508-513 - Stephane Durocher, Debajyoti Mondal:
On Balanced ✛-Contact Representations. GD 2013: 143-154 - David Eppstein:
Drawing Arrangement Graphs in Small Grids, or How to Play Planarity. GD 2013: 436-447 - David Eppstein, Danny Holten, Maarten Löffler, Martin Nöllenburg, Bettina Speckmann, Kevin Verbeek:
Strict Confluent Drawing. GD 2013: 352-363 - Stefan Felsner:
Exploiting Air-Pressure to Map Floorplans on Point Sets. GD 2013: 196-207 - Martin Fink, Sergey Pupyrev:
Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases. GD 2013: 328-339 - J. Joseph Fowler:
Strongly-Connected Outerplanar Graphs with Proper Touching Triangle Representations. GD 2013: 155-160 - Fabrizio Frati, Michael Kaufmann, János Pach, Csaba D. Tóth, David R. Wood:
On the Upward Planarity of Mixed Plane Graphs. GD 2013: 1-12 - Emden R. Gansner, Yifan Hu, Shankar Krishnan:
COAST: A Convex Optimization Approach to Stress-Based Embedding. GD 2013: 268-279 - Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Ioannis G. Tollis:
Exploring Complex Drawings via Edge Stratification. GD 2013: 304-315 - Michael T. Goodrich, Pawel Pszona:
Achieving Good Angular Resolution in 3D Arc Diagrams. GD 2013: 161-172
skipping 15 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-05-30 13:20 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