Остановите войну!
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 37 matches
- 2015
- Nieke Aerts, Stefan Felsner:
Straight-Line Triangle Representations via Schnyder Labelings. J. Graph Algorithms Appl. 19(1): 467-505 (2015) - Nieke Aerts, Stefan Felsner:
Vertex Contact Representations of Paths on a Grid. J. Graph Algorithms Appl. 19(3): 817-849 (2015) - Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Katerina Cech Dobiásová, Bert Jüttler, Günter Rote:
Triangulations with Circular Arcs. J. Graph Algorithms Appl. 19(1): 43-65 (2015) - Oswin Aichholzer, Thomas Hackl, Sarah Lutteropp, Tamara Mchedlidze, Alexander Pilz, Birgit Vogtenhuber:
Monotone Simultaneous Embeddings of Upward Planar Digraphs. J. Graph Algorithms Appl. 19(1): 87-110 (2015) - Oswin Aichholzer, Thomas Hackl, Sarah Lutteropp, Tamara Mchedlidze, Birgit Vogtenhuber:
Embedding Four-directional Paths on Convex Point Sets. J. Graph Algorithms Appl. 19(2): 743-759 (2015) - Md. Jawaherul Alam, Michael Kaufmann, Stephen G. Kobourov, Tamara Mchedlidze:
Fitting Planar Graphs on Planar Maps. J. Graph Algorithms Appl. 19(1): 413-440 (2015) - Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Graph Orientations Optimizing the Number of Light or Heavy Vertices. J. Graph Algorithms Appl. 19(1): 441-465 (2015) - Christopher Auer, Franz J. Brandenburg, Andreas Gleißner, Josef Reislhuber:
1-Planarity of Graphs with a Rotation System. J. Graph Algorithms Appl. 19(1): 67-86 (2015) - Matthew Babbitt, Jesse Geneson, Tanya Khovanova:
On k-visibility graphs. J. Graph Algorithms Appl. 19(1): 345-360 (2015) - Michael J. Bannister, William E. Devanny, David Eppstein, Michael T. Goodrich:
The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings. J. Graph Algorithms Appl. 19(2): 619-656 (2015) - 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. J. Graph Algorithms Appl. 19(3): 779-816 (2015) - Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Robert Krug:
Planar Octilinear Drawings with One Bend Per Edge. J. Graph Algorithms Appl. 19(2): 657-680 (2015) - Stéphane Bessy, Daniel Gonçalves, Jean-Sébastien Sereni:
Two-floor buildings need eight colors. J. Graph Algorithms Appl. 19(1): 1-9 (2015) - Glencora Borradaile, David Eppstein, Pingan Zhu:
Planar Induced Subgraphs of Sparse Graphs. J. Graph Algorithms Appl. 19(1): 281-297 (2015) - Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
Optimal Data Structures for Farthest-Point Queries in Cactus Networks. J. Graph Algorithms Appl. 19(1): 11-41 (2015) - Jean Cardinal, Michael Hoffmann, Vincent Kusters:
On Universal Point Sets for Planar Graphs. J. Graph Algorithms Appl. 19(1): 529-547 (2015) - Jean Cardinal, Vincent Kusters:
The Complexity of Simultaneous Geometric Graph Embedding. J. Graph Algorithms Appl. 19(1): 259-272 (2015) - Timothy M. Chan, Fabrizio Frati, Carsten Gutwenger, Anna Lubiw, Petra Mutzel, Marcus Schaefer:
Drawing Partially Embedded and Simultaneously Planar Graphs. J. Graph Algorithms Appl. 19(2): 681-706 (2015) - Markus Chimani, Carsten Gutwenger:
Hypergraph and Minor Crossing Number Problems. J. Graph Algorithms Appl. 19(1): 191-222 (2015) - Hooman Reisi Dehkordi, Fabrizio Frati, Joachim Gudmundsson:
Increasing-Chord Graphs On Point Sets. J. Graph Algorithms Appl. 19(2): 761-778 (2015) - Alon Efrat, Yifan Hu, Stephen G. Kobourov, Sergey Pupyrev:
MapSets: Visualizing Embedded and Clustered Graphs. J. Graph Algorithms Appl. 19(2): 571-593 (2015) - Khaled M. Elbassioni:
A Polynomial Delay Algorithm for Generating Connected Induced Subgraphs of a Given Cardinality. J. Graph Algorithms Appl. 19(1): 273-280 (2015) - David Eppstein:
Metric Dimension Parameterized by Max Leaf Number. J. Graph Algorithms Appl. 19(1): 313-323 (2015) - Martin Fink, Sergey Pupyrev, Alexander Wolff:
Ordering Metro Lines by Block Crossings. J. Graph Algorithms Appl. 19(1): 111-153 (2015) - Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
Drawing Outer 1-planar Graphs with Few Slopes. J. Graph Algorithms Appl. 19(2): 707-741 (2015) - Alexander Grigoriev, Steven Kelk, Nela Lekic:
On Low Treewidth Graphs and Supertrees. J. Graph Algorithms Appl. 19(1): 325-343 (2015) - Sepp Hartung, Christian Komusiewicz, André Nichterlein:
Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs. J. Graph Algorithms Appl. 19(1): 155-190 (2015) - Tommi Larjomaa, Alexandru Popa:
The Min-Max Edge q-Coloring Problem. J. Graph Algorithms Appl. 19(1): 507-528 (2015) - Henk Meijer, Stephen K. Wismath:
Point Set Embedding in 3D. J. Graph Algorithms Appl. 19(1): 243-257 (2015) - N. S. Narayanaswamy, N. Sadagopan:
Connected (s, t)-Vertex Separator Parameterized by Chordality. J. Graph Algorithms Appl. 19(1): 549-565 (2015)
skipping 7 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-25 23:47 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