Остановите войну!
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
- 2018
- Fabrizio Frati, Kwan-Liu Ma:
Graph Drawing and Network Visualization - 25th International Symposium, GD 2017, Boston, MA, USA, September 25-27, 2017, Revised Selected Papers. Lecture Notes in Computer Science 10692, Springer 2018, ISBN 978-3-319-73914-4 [contents] - 2017
- Hugo A. Akitaya, Erik D. Demaine, Adam Hesterberg, Quanquan C. Liu:
Upward Partitioned Book Embeddings. GD 2017: 210-223 - Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Thomas Schneck:
1-Fan-Bundle-Planar Drawings of Graphs. GD 2017: 517-530 - Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Fabrizio Montecchiani:
3D Visibility Representations of 1-planar Graphs. GD 2017: 102-109 - Patrizio Angelini, Steven Chaplick, Felice De Luca, Jirí Fiala, Jaroslav Hancl Jr., Niklas Heinsohn, Michael Kaufmann, Stephen G. Kobourov, Jan Kratochvíl, Pavel Valtr:
On Vertex- and Empty-Ply Proximity Drawings. GD 2017: 24-37 - Alessio Arleo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
GiViP: A Visual Profiler for Distributed Graph Processing Systems. GD 2017: 256-271 - Sang Won Bae, Jean-François Baffier, Jinhee Chun, Peter Eades, Kord Eickmeyer, Luca Grilli, Seok-Hee Hong, Matias Korman, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth:
Gap-Planar Graphs. GD 2017: 531-545 - Kathrin Ballweg, Margit Pohl, Günter Wallner, Tatiana von Landesberger:
Visual Similarity Perception of Directed Acyclic Graphs: A Study on Influencing Factors. GD 2017: 241-255 - Michael A. Bekos, Henry Förster, Michael Kaufmann:
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings. GD 2017: 169-183 - Michael A. Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze, Martin Nöllenburg, Antonios Symvonis, Ioannis G. Tollis:
Planar Drawings of Fixed-Mobile Bigraphs. GD 2017: 426-439 - Therese Biedl, Timothy M. Chan, Martin Derka, Kshitij Jain, Anna Lubiw:
Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges. GD 2017: 305-317 - Therese Biedl, Martin Derka, Vida Dujmovic, Pat Morin:
EPG-representations with Small Grid-Size. GD 2017: 184-196 - Therese Biedl, Veronika Irvine:
Drawing Bobbin Lace Graphs, or, Fundamental Cycles for a Subclass of Periodic Graphs. GD 2017: 140-152 - Therese Biedl, Saeed Mehrabi:
Grid-Obstacle Representations with Connections to Staircase Guarding. GD 2017: 81-87 - Therese Biedl, Debajyoti Mondal:
On Upward Drawings of Trees on a Given Grid. GD 2017: 318-325 - Tiziana Calamoneri, Valentino Di Donato, Diego Mariottini, Maurizio Patrignani:
Visualizing Co-phylogenetic Reconciliations. GD 2017: 334-347 - Steven Chaplick, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Martin Nöllenburg, Maurizio Patrignani, Ioannis G. Tollis, Alexander Wolff:
Planar L-Drawings of Directed Graphs. GD 2017: 465-478 - Steven Chaplick, Myroslav Kryven, Giuseppe Liotta, Andre Löffler, Alexander Wolff:
Beyond Outerplanarity. GD 2017: 546-559 - William E. Devanny, Philipp Kindermann, Maarten Löffler, Ignaz Rutter:
Graph Drawing Contest Report. GD 2017: 575-582 - Thomas C. van Dijk, Fabian Lipp, Peter Markfelder, Alexander Wolff:
Computing Storyline Visualizations with Few Block Crossings. GD 2017: 365-378 - Peter Eades, Quan Hoang Nguyen, Seok-Hee Hong:
Drawing Big Graphs Using Spectral Sparsification. GD 2017: 272-286 - David Eppstein:
Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count. GD 2017: 506-513 - David Eppstein:
The Effect of Planarization on Width. GD 2017: 560-572 - Stefan Felsner, Manfred Scheucher:
Arrangements of Pseudocircles: Triangles and Drawings. GD 2017: 127-139 - Radoslav Fulek, János Pach:
Thrackles: An Improved Upper Bound. GD 2017: 160-166 - Emilio Di Giacomo, Leszek Gasieniec, Giuseppe Liotta, Alfredo Navarra:
Colored Point-Set Embeddings of Acyclic Graphs. GD 2017: 413-425 - Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani, Alessandra Tappini:
NodeTrix Planarity Testing with Small Clusters. GD 2017: 479-491 - John Gimbel, Patrice Ossona de Mendez, Pavel Valtr:
Obstacle Numbers of Planar Graphs. GD 2017: 67-80 - Arthur van Goethem, Irina Kostitsyna, Marc J. van Kreveld, Wouter Meulemans, Max Sondag, Jules Wulms:
The Painter's Problem: Covering a Grid with Colored Connected Polygons. GD 2017: 492-505 - Niklas Heinsohn, Michael Kaufmann:
An Interactive Tool to Explore and Improve the Ply Number of Drawings. GD 2017: 38-51
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-06-04 22:28 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