Остановите войну!
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 32 matches
- 2013
- Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis:
Geometric RAC Simultaneous Drawings of Graphs. J. Graph Algorithms Appl. 17(1): 11-34 (2013) - Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Josef Reislhuber:
Optical Graph Recognition. J. Graph Algorithms Appl. 17(4): 541-565 (2013) - Christian Bachmaier, Marco Matzeder:
Drawing Unordered Trees on k-Grids. J. Graph Algorithms Appl. 17(2): 103-128 (2013) - Reinhard Bauer, Moritz Baum, Ignaz Rutter, Dorothea Wagner:
On the Complexity of Partitioning Graphs for Arc-Flags. J. Graph Algorithms Appl. 17(3): 265-299 (2013) - Michael A. Bekos, Michael Kaufmann, Stephen G. Kobourov, Antonios Symvonis:
Smooth Orthogonal Layouts. J. Graph Algorithms Appl. 17(5): 575-595 (2013) - Ulrik Brandes, Barbara Pampel:
Orthogonal-Ordering Constraints are Tough. J. Graph Algorithms Appl. 17(1): 1-10 (2013) - Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin:
Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching. J. Graph Algorithms Appl. 17(6): 647-670 (2013) - Erin W. Chambers, David Eppstein:
Flows in One-Crossing-Minor-Free Graphs. J. Graph Algorithms Appl. 17(3): 201-220 (2013) - Steven Chaplick, Torsten Ueckerdt:
Planar Graphs as VPG-Graphs. J. Graph Algorithms Appl. 17(4): 475-494 (2013) - Markus Chimani, Philipp Hungerländer:
Multi-level Verticality Optimization: Concept, Strategies, and Drawing Scheme. J. Graph Algorithms Appl. 17(3): 329-362 (2013) - Walter Didimo, Maurizio Patrignani:
Guest Editors' Foreword. J. Graph Algorithms Appl. 17(4): 363-365 (2013) - Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides:
A Note on Minimum-Segment Drawings of Planar Graphs. J. Graph Algorithms Appl. 17(3): 301-328 (2013) - David Eppstein:
The Complexity of Bendless Three-Dimensional Orthogonal Graph Drawing. J. Graph Algorithms Appl. 17(1): 35-55 (2013) - David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg:
Optimal 3D Angular Resolution for Low-Degree Graphs. J. Graph Algorithms Appl. 17(3): 173-200 (2013) - David Eppstein, Joseph A. Simons:
Confluent Hasse Diagrams. J. Graph Algorithms Appl. 17(7): 689-710 (2013) - Fabrizio Frati, Radoslav Fulek, Andres J. Ruiz-Vargas:
On the Page Number of Upward Planar Directed Acyclic Graphs. J. Graph Algorithms Appl. 17(3): 221-244 (2013) - Emden R. Gansner, Yifan Hu, Stephen C. North:
Interactive Visualization of Streaming Text Data with Dynamic Maps. J. Graph Algorithms Appl. 17(4): 515-540 (2013) - Subir Kumar Ghosh:
Guest Editor's Foreword. J. Graph Algorithms Appl. 17(6): 597-598 (2013) - Bernhard Haeupler, Krishnam Raju Jampani, Anna Lubiw:
Testing Simultaneous Planarity when the Common Graph is 2-Connected. J. Graph Algorithms Appl. 17(3): 147-171 (2013) - Md. Manzurul Hasan, Md. Saidur Rahman, Muhammad Rezaul Karim:
Box-Rectangular Drawings of Planar Graphs. J. Graph Algorithms Appl. 17(6): 629-646 (2013) - Md. Iqbal Hossain, Debajyoti Mondal, Md. Saidur Rahman, Sammi Abida Salma:
Universal Line-Sets for Drawing Planar 3-Trees. J. Graph Algorithms Appl. 17(2): 59-79 (2013) - R. Krithika, N. S. Narayanaswamy:
Parameterized Algorithms for (r, l)-Partization. J. Graph Algorithms Appl. 17(2): 129-146 (2013) - Peng Li, Yaokun Wu:
Maximal Neighborhood Search and Rigid Interval Graphs. J. Graph Algorithms Appl. 17(3): 245-264 (2013) - Tapas Kumar Mishra, Sudebkumar Prasant Pal:
Lower bounds for Ramsey numbers for complete bipartite and 3-uniform tripartite subgraphs. J. Graph Algorithms Appl. 17(6): 671-688 (2013) - Shin-Ichi Nakano:
Guest Editor's Foreword. J. Graph Algorithms Appl. 17(2): 57-58 (2013) - Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
Edge-weighted contact representations of planar graphs. J. Graph Algorithms Appl. 17(4): 441-473 (2013) - Martin Olsen, Morten Revsbæk:
On Alliance Partitions and Bisection Width for Planar Graphs. J. Graph Algorithms Appl. 17(6): 599-614 (2013) - Venkatesh Raman, Saket Saurabh, Ondrej Suchý:
An FPT algorithm for Tree Deletion Set. J. Graph Algorithms Appl. 17(6): 615-628 (2013) - Sammi Abida Salma, Md. Saidur Rahman, Md. Iqbal Hossain:
Triangle-Free Outerplanar 3-Graphs are Pairwise Compatibility Graphs. J. Graph Algorithms Appl. 17(2): 81-102 (2013) - Atish Das Sarma, Amita Gajewar, Richard J. Lipton, Danupon Nanongkai:
An Approximate Restatement of the Four-Color Theorem. J. Graph Algorithms Appl. 17(5): 567-573 (2013)
skipping 2 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-04 00:01 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