Остановите войну!
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 44 matches
- 2018
- Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt:
The Number of Crossings in Multigraphs with No Empty Lens. GD 2018: 242-254 - Hugo A. Akitaya, Maarten Löffler, Irene Parada:
How to Fit a Tree in a Box. GD 2018: 361-367 - Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
Queue Layouts of Planar 3-Trees. GD 2018: 213-226 - Patrizio Angelini, Michael A. Bekos, Walter Didimo, Luca Grilli, Philipp Kindermann, Tamara Mchedlidze, Roman Prutkin, Antonios Symvonis, Alessandra Tappini:
Greedy Rectilinear Drawings. GD 2018: 495-508 - Patrizio Angelini, Michael A. Bekos, Henry Förster, Michael Kaufmann:
On RAC Drawings of Graphs with One Bend per Edge. GD 2018: 123-136 - Patrizio Angelini, Peter Eades, Seok-Hee Hong, Karsten Klein, Stephen G. Kobourov, Giuseppe Liotta, Alfredo Navarra, Alessandra Tappini:
Turning Cliques into Paths to Achieve Planarity. GD 2018: 67-74 - Evmorfia N. Argyriou, Sabine Cornelsen, Henry Förster, Michael Kaufmann, Martin Nöllenburg, Yoshio Okamoto, Chrysanthi N. Raftopoulou, Alexander Wolff:
Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity. GD 2018: 509-523 - Elena Arseneva, Prosenjit Bose, Pilar Cano, Anthony D'Angelo, Vida Dujmovic, Fabrizio Frati, Stefan Langerman, Alessandra Tappini:
Pole Dancing: 3D Morphs for Tree Drawings. GD 2018: 371-384 - Michael A. Bekos, Henry Förster, Christian Geckeler, Lukas Holländer, Michael Kaufmann, Amadäus M. Spallek, Jan Splett:
A Heuristic Approach Towards Drawings of Graphs with High Crossing Resolution. GD 2018: 271-285 - Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
Universal Slope Sets for Upward Planar Drawings. GD 2018: 77-91 - Guido Brückner, Ignaz Rutter, Peter Stumpf:
Level Planarity: Transitivity vs. Even Crossings. GD 2018: 39-52 - Thom Castermans, Mereke van Garderen, Wouter Meulemans, Martin Nöllenburg, Xiaoru Yuan:
Short Plane Supports for Spatial Hypergraphs. GD 2018: 53-66 - Steven Chaplick, Fabian Lipp, Alexander Wolff, Johannes Zink:
Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends. GD 2018: 137-151 - Hang Chen, Utkarsh Soni, Yafeng Lu, Ross Maciejewski, Stephen G. Kobourov:
Same Stats, Different Graphs - (Graph Statistics and Why We Need Graph Drawings). GD 2018: 463-477 - Markus Chimani, Hanna Döring, Matthias Reitzner:
Crossing Numbers and Stress of Random Graphs. GD 2018: 255-268 - Pier Francesco Cortese, Maurizio Patrignani:
Clustered Planarity = Flat Clustered Planarity. GD 2018: 23-38 - Almut Demel, Dominik Dürrschnabel, Tamara Mchedlidze, Marcel Radermacher, Lasse Wulf:
A Greedy Heuristic for Crossing-Angle Maximization. GD 2018: 286-299 - Zakir Deniz, Esther Galby, Andrea Munaro, Bernard Ries:
On Contact Graphs of Paths on a Grid. GD 2018: 317-330 - William E. Devanny, Philipp Kindermann, Maarten Löffler, Ignaz Rutter:
Graph Drawing Contest Report. GD 2018: 609-617 - Walter Didimo, Giuseppe Liotta, Maurizio Patrignani:
Bend-Minimum Orthogonal Drawings in Quadratic Time. GD 2018: 481-494 - Peter Eades, Patrick Healy, Nikola S. Nikolov:
The Weighted Barycenter Drawing Recognition Problem. GD 2018: 569-575 - David Eppstein:
Realization and Connectivity of the Graphs of Origami Flat Foldings. GD 2018: 541-554 - Stefan Felsner, Manfred Scheucher:
Arrangements of Pseudocircles: On Circularizability. GD 2018: 555-568 - Radoslav Fulek, Csaba D. Tóth:
Crossing Minimization in Perturbed Drawings. GD 2018: 229-241 - Michael Jünger, Petra Mutzel, Christiane Spisla:
A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width. GD 2018: 187-199 - Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf, André Schulz:
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles. GD 2018: 152-166 - Moritz Klammler, Tamara Mchedlidze, Alexey Pak:
Aesthetic Discrimination of Graph Layouts. GD 2018: 169-184 - Linda Kleist:
On the Area-Universality of Triangulations. GD 2018: 333-346 - Kolja Knauer, Piotr Micek, Torsten Ueckerdt:
The Queue-Number of Posets of Bounded Width or Height. GD 2018: 200-212 - Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini:
Ortho-Polygon Visibility Representations of 3-Connected 1-Plane Graphs. GD 2018: 524-537
skipping 14 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-07-19 14:38 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