Остановите войну!
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
- 2019
- Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl:
Minimal Representations of Order Types by Geometric Graphs. GD 2019: 101-113 - Oswin Aichholzer, Linda Kleist, Boris Klemz, Felix Schröder, Birgit Vogtenhuber:
On the Edge-Vertex Ratio of Maximal Thrackles. GD 2019: 482-495 - Oswin Aichholzer, Matias Korman, Yoshio Okamoto, Irene Parada, Daniel Perz, André van Renssen, Birgit Vogtenhuber:
Graphs with Large Total Angular Resolution. GD 2019: 193-199 - Oswin Aichholzer, Ruy Fabila Monroy, Adrian Fuchs, Carlos Hidalgo-Toscano, Irene Parada, Birgit Vogtenhuber, Francisco Zaragoza:
On the 2-Colored Crossing Number. GD 2019: 87-100 - Luca Castelli Aleardi:
Balanced Schnyder Woods for Planar Triangulations: An Experimental Study with Applications to Graph Drawing and Graph Separators. GD 2019: 114-121 - Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Thomas Schneck:
Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity. GD 2019: 253-267 - Patrizio Angelini, Henry Förster, Michael Hoffmann, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Maurizio Patrignani:
The QuaSEFE Problem. GD 2019: 268-275 - Lorenzo Angori, Walter Didimo, Fabrizio Montecchiani, Daniele Pagliuca, Alessandra Tappini:
ChordLink: A New Hybrid Visualization Model. GD 2019: 276-290 - Alan Arroyo, Martin Derka, Irene Parada:
Extending Simple Drawings. GD 2019: 230-243 - Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg:
Parameterized Algorithms for Book Embedding Problems. GD 2019: 365-378 - Therese Biedl, Erin Wolf Chambers, David Eppstein, Arnaud de Mesmay, Tim Ophelders:
Homotopy Height, Grid-Major Height and Graph-Drawing Height. GD 2019: 468-481 - Therese Biedl, Stefan Felsner, Henk Meijer, Alexander Wolff:
Line and Plane Cover Numbers Revisited. GD 2019: 409-415 - Manuel Borrazzo, Fabrizio Frati:
On the Edge-Length Ratio of Planar Graphs. GD 2019: 165-178 - Manuel Borrazzo, Giordano Da Lozzo, Fabrizio Frati, Maurizio Patrignani:
Graph Stories in Small Area. GD 2019: 545-558 - Guido Brückner, Markus Himmel, Ignaz Rutter:
An SPQR-Tree-Like Embedding Representation for Upward Planarity. GD 2019: 517-531 - Guido Brückner, Nadine Davina Krisam, Tamara Mchedlidze:
Level-Planar Drawings with Few Slopes. GD 2019: 559-572 - Steven Chaplick, Thomas C. van Dijk, Myroslav Kryven, Ji-won Park, Alexander Ravsky, Alexander Wolff:
Bundled Crossings Revisited. GD 2019: 63-77 - Steven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff:
On Arrangements of Orthogonal Circles. GD 2019: 216-229 - Steven Chaplick, Philipp Kindermann, Andre Löffler, Florian Thiele, Alexander Wolff, Alexander Zaft, Johannes Zink:
Stick Graphs with Length Constraints. GD 2019: 3-17 - Fati Chen, Laurent Piccinini, Pascal Poncelet, Arnaud Sallaberry:
Node Overlap Removal Algorithms: A Comparative Study. GD 2019: 179-192 - Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani, Pavel Valtr:
Crossing Numbers of Beyond-Planar Graphs. GD 2019: 78-86 - Philipp de Col, Fabian Klute, Martin Nöllenburg:
Mixed Linear Layouts: Complexity, Heuristics, and Experiments. GD 2019: 460-467 - Sabin Devkota, Abu Reyan Ahmed, Felice De Luca, Katherine E. Isaacs, Stephen G. Kobourov:
Stress-Plus-X (SPX) Graph Layout. GD 2019: 291-304 - William S. Evans, Pawel Rzazewski, Noushin Saeedi, Chan-Su Shin, Alexander Wolff:
Representing Graphs and Hypergraphs by Touching Polygons in 3D. GD 2019: 18-32 - Stefan Felsner:
4-Connected Triangulations on Few Lines. GD 2019: 395-408 - Oksana Firman, Philipp Kindermann, Alexander Ravsky, Alexander Wolff, Johannes Zink:
Computing Height-Optimal Tangles Faster. GD 2019: 203-215 - Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg:
On Strict (Outer-)Confluent Graphs. GD 2019: 147-161 - Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs. GD 2019: 379-392 - Arthur van Goethem, Bettina Speckmann, Kevin Verbeek:
Optimal Morphs of Planar Orthogonal Drawings II. GD 2019: 33-45 - Petr Hlinený, Abhisekh Sankaran:
Exact Crossing Number Parameterized by Vertex Cover. GD 2019: 307-319
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-03-29 16:40 CET 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