Остановите войну!
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 31 matches
- 2021
- Vicente Acuña, Leandro Ishi Soares de Lima, Giuseppe F. Italiano, Luca Pepè Sciarria, Marie-France Sagot, Blerina Sinaimeri:
A family of tree-based generators for bubbles in directed graphs. J. Graph Algorithms Appl. 25(1): 563-580 (2021) - Patrizio Angelini, Ignaz Rutter, T. P. Sandhya:
Extending Partial Orthogonal Drawings. J. Graph Algorithms Appl. 25(1): 581-602 (2021) - Lukas Barth, Guido Brückner, Paul Jungeblut, Marcel Radermacher:
Multilevel Planarity. J. Graph Algorithms Appl. 25(1): 151-170 (2021) - Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Marco Tais:
Schematic Representation of Large Biconnected Graphs. J. Graph Algorithms Appl. 25(1): 311-352 (2021) - Matthias Bentert, Mathias Weller:
Tree Containment With Soft Polytomies. J. Graph Algorithms Appl. 25(1): 417-436 (2021) - John M. Boyer:
Revising the Fellows-Kaschube $K_{3, 3}$ Search. J. Graph Algorithms Appl. 25(1): 513-520 (2021) - Paul Brown, Trevor I. Fenner:
Fast Generation of Unlabelled Free Trees using Weight Sequences. J. Graph Algorithms Appl. 25(1): 219-240 (2021) - Guido Brückner, Ignaz Rutter:
Radial Level Planarity with Fixed Embedding. J. Graph Algorithms Appl. 25(1): 353-366 (2021) - Vida Dujmovic, Pat Morin, Céline Yelle:
Two Results on Layered Pathwidth and Linear Layouts. J. Graph Algorithms Appl. 25(1): 43-57 (2021) - David Eppstein:
Bipartite and Series-Parallel Graphs Without Planar Lombardi Drawings. J. Graph Algorithms Appl. 25(1): 549-562 (2021) - William S. Evans, Stefan Felsner, Linda Kleist, Stephen G. Kobourov:
On Area-Universal Quadrangulations. J. Graph Algorithms Appl. 25(1): 171-193 (2021) - William S. Evans, Ellen Gethner, Jack Spalding-Jamieson, Alexander Wolff:
Angle Covers: Algorithms and Complexity. J. Graph Algorithms Appl. 25(2): 643-661 (2021) - Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt:
Circumference of essentially 4-connected planar triangulations. J. Graph Algorithms Appl. 25(1): 121-132 (2021) - Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier:
On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering. J. Graph Algorithms Appl. 25(1): 521-547 (2021) - Mareike Fischer, Volkmar Liebscher:
On the Balance of Unrooted Trees. J. Graph Algorithms Appl. 25(1): 133-150 (2021) - Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg:
On Strict (Outer-)Confluent Graphs. J. Graph Algorithms Appl. 25(1): 481-512 (2021) - Alain Hertz:
Decycling bipartite graphs. J. Graph Algorithms Appl. 25(1): 461-480 (2021) - Remie Janssen:
Heading in the right direction? Using head moves to traverse phylogenetic network space. J. Graph Algorithms Appl. 25(1): 263-310 (2021) - Ming-Hsuan Kang, Wu-Hsiung Lin:
Equilateral Spherical Drawings of Planar Cayley Graphs. J. Graph Algorithms Appl. 25(1): 97-119 (2021) - Michael Kaufmann, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr:
The Stub Resolution of 1-planar Graphs. J. Graph Algorithms Appl. 25(2): 625-642 (2021) - Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt:
The number of crossings in multigraphs with no empty lens. J. Graph Algorithms Appl. 25(1): 383-396 (2021) - Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf, André Schulz:
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles. J. Graph Algorithms Appl. 25(1): 1-28 (2021) - Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath:
Packing Trees into 1-planar Graphs. J. Graph Algorithms Appl. 25(2): 605-624 (2021) - Gyula Pap, József Varnyú:
Synchronized Traveling Salesman Problem. J. Graph Algorithms Appl. 25(1): 437-459 (2021) - M. Sohel Rahman, Kunihiko Sadakane, Wing-Kin Sung:
Guest editors' foreword. J. Graph Algorithms Appl. 25(2): 603-604 (2021) - Marcus Schaefer:
Complexity of Geometric k-Planarity for Fixed k. J. Graph Algorithms Appl. 25(1): 29-41 (2021) - Marcus Schaefer:
On the Complexity of Some Geometric Problems With Fixed Parameters. J. Graph Algorithms Appl. 25(1): 195-218 (2021) - David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler:
Least resolved trees for two-colored best match graphs. J. Graph Algorithms Appl. 25(1): 397-416 (2021) - A. Arul Shantrinal, Sandi Klavzar, T. M. Rajalaxmi, R. Sundara Rajan:
An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength. J. Graph Algorithms Appl. 25(1): 367-381 (2021) - Espen Slettnes:
Minimal Embedding Dimensions of Rectangle k-Visibility Graphs. J. Graph Algorithms Appl. 25(1): 59-96 (2021)
skipping 1 more match
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-05 12:11 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