Остановите войну!
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 38 matches
- 2023
- Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Luís Fernando Schultz Xavier da Silveira, Michiel Smid:
The Minimum Moving Spanning Tree Problem. J. Graph Algorithms Appl. 27(1): 1-18 (2023) - Patrizio Angelini, Reinhard von Hanxleden:
Guest Editors' Foreword. J. Graph Algorithms Appl. 27(8): 621-623 (2023) - Emmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, Petra Wolf:
Order Reconfiguration under Width Constraints. J. Graph Algorithms Appl. 27(6): 409-431 (2023) - Alan Arroyo, Stefan Felsner:
Approximating the Bundled Crossing Number. J. Graph Algorithms Appl. 27(6): 433-457 (2023) - Elena Arseneva, Rahul Gangopadhyay, Aleksandra Istomina:
Morphing tree drawings in a small 3D grid. J. Graph Algorithms Appl. 27(4): 241-279 (2023) - Giuseppe Di Battista, Walter Didimo, Luca Grilli, Fabrizio Grosso, Giacomo Ortali, Maurizio Patrignani, Alessandra Tappini:
Small Point-Sets Supporting Graph Stories. J. Graph Algorithms Appl. 27(8): 651-677 (2023) - Carla Binucci, Walter Didimo, Maurizio Patrignani:
$st$-Orientations with Few Transitive Edges. J. Graph Algorithms Appl. 27(8): 625-650 (2023) - Luca Calderoni, Luciano Margara, Moreno Marzolla:
A Heuristic for Direct Product Graph Decomposition. J. Graph Algorithms Appl. 27(7): 581-601 (2023) - Sarah Carmesin, André Schulz:
Arrangements of orthogonal circles with many intersections. J. Graph Algorithms Appl. 27(2): 49-70 (2023) - Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff:
The Complexity of Drawing Graphs on Few Lines and Few Planes. J. Graph Algorithms Appl. 27(6): 459-488 (2023) - Markus Chimani, Petr Hlinený:
Inserting Multiple Edges into a Planar Graph. J. Graph Algorithms Appl. 27(6): 489-522 (2023) - Markus Chimani, Max Ilsen, Tilo Wiedera:
Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics. J. Graph Algorithms Appl. 27(2): 71-94 (2023) - Sean Cleary:
Restricted rotation distance between k-ary trees. J. Graph Algorithms Appl. 27(1): 19-33 (2023) - Sabine Cornelsen, Gregor Diatzko:
Planar Confluent Orthogonal Drawings of 4-Modal Digraphs. J. Graph Algorithms Appl. 27(7): 523-540 (2023) - Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
Rectilinear Planarity of Partial 2-Trees. J. Graph Algorithms Appl. 27(8): 679-719 (2023) - Dominik Dürrschnabel, Tom Hanika, Gerd Stumme:
Drawing Order Diagrams Through Two-Dimension Extension. J. Graph Algorithms Appl. 27(9): 783-802 (2023) - David Eppstein, Andrea Lincoln, Virginia Vassilevska Williams:
Quasipolynomiality of the Smallest Missing Induced Subgraph. J. Graph Algorithms Appl. 27(5): 329-339 (2023) - Jeff Erickson, Patrick Lin:
Planar and Toroidal Morphs Made Easier. J. Graph Algorithms Appl. 27(2): 95-118 (2023) - Alfredo García, Javier Tejel, Birgit Vogtenhuber, Alexandra Weinberger:
Empty Triangles in Generalized Twisted Drawings of $K_n$. J. Graph Algorithms Appl. 27(8): 721-735 (2023) - Vasileios Geladaris, Panagiotis Lionakis, Ioannis G. Tollis:
Effective Computation of a Feedback Arc Set Using PageRank. J. Graph Algorithms Appl. 27(8): 737-757 (2023) - Craig Gotsman, Kai Hormann:
Efficient Point-to-Point Resistance Distance Queries in Large Graphs. J. Graph Algorithms Appl. 27(1): 35-44 (2023) - Katharina T. Huber, Vincent Moulton, Andreas Spillner:
Computing consensus networks for collections of 1-nested phylogenetic networks. J. Graph Algorithms Appl. 27(7): 541-563 (2023) - Mathieu Jacomy:
Connected-closeness: A Visual Quantification of Distances in Network Layouts. J. Graph Algorithms Appl. 27(5): 341-404 (2023) - Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
Improved (In-)Approximability Bounds for d-Scattered Set. J. Graph Algorithms Appl. 27(3): 219-238 (2023) - Philipp Kindermann, Jan Sauer, Alexander Wolff:
The Computational Complexity of the ChordLink Model. J. Graph Algorithms Appl. 27(9): 759-767 (2023) - Jonathan Klawitter, Johannes Zink:
Upward Planar Drawings with Three and More Slopes. J. Graph Algorithms Appl. 27(2): 49-70 (2023) - Boris Klemz, Kristin Knorr, Meghana M. Reddy, Felix Schröder:
Simplifying Non-Simple Fan-Planar Drawings. J. Graph Algorithms Appl. 27(2): 147-172 (2023) - Alane M. de Lima, Murilo V. G. da Silva, André Luís Vignatti:
A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs. J. Graph Algorithms Appl. 27(7): 603-619 (2023) - Giordano Da Lozzo, Philipp Kindermann:
Guest Editors' Foreword. J. Graph Algorithms Appl. 27(6): 405-408 (2023) - Rahnuma Islam Nishat, Venkatesh Srinivasan, Sue Whitesides:
1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids. J. Graph Algorithms Appl. 27(4): 281-327 (2023)
skipping 8 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-10 05:20 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