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 1,398 matches
- 2023
- Oswin Aichholzer, Stefan Felsner, Rosna Paul, Manfred Scheucher, Birgit Vogtenhuber:
Bichromatic Perfect Matchings with Crossings. GD (1) 2023: 124-132 - Oswin Aichholzer, Birgit Vogtenhuber, Alexandra Weinberger:
Different Types of Isomorphisms of Drawings of Complete Multipartite Graphs. GD (2) 2023: 34-50 - Patricia Bachmann, Ignaz Rutter, Peter Stumpf:
On 3-Coloring Circle Graphs. GD (1) 2023: 152-160 - Olivier Bernardi, Éric Fusy, Shizhe Liang:
A Schnyder-Type Drawing Algorithm for 5-Connected Triangulations. GD (2) 2023: 117-132 - Daniel Bertschinger, Nicolas El Maalouly, Linda Kleist, Tillmann Miltzow, Simon Weber:
The Complexity of Recognizing Geometric Hypergraphs. GD (1) 2023: 163-179 - Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
Min-k-planar Drawings of Graphs. GD (1) 2023: 39-52 - Carla Binucci, Henry Förster, Julia Katheder, Alessandra Tappini:
Evaluating Animation Parameters for Morphing Edge Drawings. GD (1) 2023: 246-262 - Cornelius Brand, Robert Ganian, Sebastian Röder, Florian Schager:
Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs. GD (2) 2023: 66-81 - Marco Caoduro, András Sebö:
Boxicity and Interval-Orders: Petersen and the Complements of Line Graphs. GD (1) 2023: 283-295 - Otfried Cheong, Henry Förster, Julia Katheder, Maximilian Pfister, Lena Schlipf:
Weakly and Strongly Fan-Planar Graphs. GD (1) 2023: 53-68 - Alvin Chiu, David Eppstein, Michael T. Goodrich:
Manipulating Weights to Improve Stress-Graph Drawings of 3-Connected Planar Graphs. GD (2) 2023: 141-149 - Petr Chmel, Vít Jelínek:
String Graphs with Precise Number of Intersections. GD (1) 2023: 78-92 - Sabine Cornelsen, Giordano Da Lozzo, Luca Grilli, Siddharth Gupta, Jan Kratochvíl, Alexander Wolff:
The Parametrized Complexity of the Segment Number. GD (2) 2023: 97-113 - Matt DeVos, Danielle Rogers, Alexandra Wesolek:
On Minimizing the Energy of a Spherical Graph Representation. GD (2) 2023: 218-231 - Walter Didimo, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Stephen G. Kobourov, Marie Diana Sieper:
Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem. GD (2) 2023: 189-202 - Stephane Durocher, Shahin Kamali, Myroslav Kryven, Fengyi Liu, Amirhossein Mashghdoust, Avery Miller, Pouria Zamani Nezhad, Ikaro Penha Costa, Timothy Zapp:
Cops and Robbers on 1-Planar Graphs. GD (2) 2023: 3-17 - Peter Eades, Niklas Gröne, Karsten Klein, Patrick Eades, Leo Schreiber, Ulf Hailer, Falk Schreiber:
CelticGraph: Drawing Graphs as Celtic Knots and Links. GD (1) 2023: 18-35 - David Eppstein:
On the Biplanarity of Blowups. GD (1) 2023: 3-17 - Velitchko Andreev Filipov, Davide Ceneda, Daniel Archambault, Alessio Arleo:
TimeLighting: Guidance-Enhanced Exploration of 2D Projections of Temporal Graphs. GD (1) 2023: 231-245 - Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter:
Parameterized Complexity of Simultaneous Planarity. GD (2) 2023: 82-96 - Niloufar Fuladi, Alfredo Hubard, Arnaud de Mesmay:
Degenerate Crossing Number and Signed Reversal Distance. GD (1) 2023: 95-109 - Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali:
On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity. GD (2) 2023: 53-65 - Carolina Haase, Philipp Kindermann, William J. Lenhart, Giuseppe Liotta:
Mutual Witness Proximity Drawings of Isomorphic Trees. GD (1) 2023: 304-319 - Tim Hegemann, Alexander Wolff:
A Simple Pipeline for Orthogonal Graph Drawing. GD (2) 2023: 170-186 - Petr Hlinený, Tomás Masarík:
Minimizing an Uncrossed Collection of Drawings. GD (1) 2023: 110-123 - Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov:
Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth. GD (2) 2023: 203-217 - Paul Jungeblut:
On the Complexity of Lombardi Graph Drawing. GD (1) 2023: 180-194 - Philipp Kindermann, Jan Kratochvíl, Giuseppe Liotta, Pavel Valtr:
Three Edge-Disjoint Plane Spanning Paths in a Point Set. GD (1) 2023: 323-338 - Jonathan Klawitter, Johannes Zink:
Tree Drawings with Columns. GD (1) 2023: 195-210 - Jacob Miller, Mohammad Ghoniem, Hsiang-Yun Wu, Helen C. Purchase:
On the Perception of Small Sub-graphs. GD (1) 2023: 213-230
skipping 1,368 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-09-29 08:03 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