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
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 52 matches
- 2024
- Patrizio Angelini, Giordano Da Lozzo, Henry Förster, Thomas Schneck:
2-Layer k-Planar Graphs Density, Crossing Lemma, Relationships And Pathwidth. Comput. J. 67(3): 1005-1016 (2024) - Henry Förster, Philipp Kindermann, Tillmann Miltzow, Irene Parada, Soeren Terziadis, Birgit Vogtenhuber:
Geometric Thickness of Multigraphs is ∃ ℝ-Complete. LATIN (1) 2024: 336-349 - Emilio Di Giacomo, Henry Förster, Daria Kokhovich, Tamara Mchedlidze, Fabrizio Montecchiani, Antonios Symvonis, Anaïs Villedieu:
On 1-Bend Upward Point-Set Embeddings of st-Digraphs. LATIN (1) 2024: 3-18 - Emilio Di Giacomo, Henry Förster, Daria Kokhovich, Tamara Mchedlidze, Fabrizio Montecchiani, Antonios Symvonis, Anaïs Villedieu:
On 1-bend Upward Point-set Embeddings of st-digraphs. CoRR abs/2401.03226 (2024) - Steven Chaplick, Henry Förster, Michael Hoffmann, Michael Kaufmann:
Monotone Arc Diagrams with few Biarcs. CoRR abs/2408.14299 (2024) - Henry Förster, Felix Klesen, Tim Dwyer, Peter Eades, Seok-Hee Hong, Stephen G. Kobourov, Giuseppe Liotta, Kazuo Misue, Fabrizio Montecchiani, Alexander Pastukhov, Falk Schreiber:
GraphTrials: Visual Proofs of Graph Properties. CoRR abs/2409.02907 (2024) - Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, János Pach, Henry Förster:
Beyond-Planar Graphs: Models, Structures and Geometric Representations (Dagstuhl Seminar 24062). Dagstuhl Reports 14(2): 71-94 (2024) - 2023
- Patrizio Angelini, Michael A. Bekos, Henry Förster, Martin Gronemann:
Bitonic st-Orderings for Upward Planar Graphs: Splits and Bends in the Variable Embedding Scenario. Algorithmica 85(9): 2667-2692 (2023) - Carla Binucci, Henry Förster, Julia Katheder, Alessandra Tappini:
Evaluating Animation Parameters for Morphing Edge Drawings. GD (1) 2023: 246-262 - Otfried Cheong, Henry Förster, Julia Katheder, Maximilian Pfister, Lena Schlipf:
Weakly and Strongly Fan-Planar Graphs. GD (1) 2023: 53-68 - Michael A. Bekos, Henry Förster, Michael Kaufmann, Stephen G. Kobourov, Myroslav Kryven, Axel Kuckuk, Lena Schlipf:
On the 2-Layer Window Width Minimization Problem. SOFSEM 2023: 209-221 - Henry Förster, Michael Kaufmann, Laura Merker, Sergey Pupyrev, Chrysanthi N. Raftopoulou:
Linear Layouts of Bipartite Planar Graphs. WADS 2023: 444-459 - Henry Förster, Michael Kaufmann, Laura Merker, Sergey Pupyrev, Chrysanthi N. Raftopoulou:
Linear Layouts of Bipartite Planar Graphs. CoRR abs/2305.16087 (2023) - Otfried Cheong, Henry Förster, Julia Katheder, Maximilian Pfister, Lena Schlipf:
Weakly and Strongly Fan-Planar Graphs. CoRR abs/2308.08966 (2023) - Carla Binucci, Henry Förster, Julia Katheder, Alessandra Tappini:
Evaluating Animation Parameters for Morphing Edge Drawings. CoRR abs/2309.00456 (2023) - Henry Förster, Philipp Kindermann, Tillmann Miltzow, Irene Parada, Soeren Terziadis, Birgit Vogtenhuber:
Geometric Thickness of Multigraphs is ∃R-complete. CoRR abs/2312.05010 (2023) - 2022
- Sabine Cornelsen, Maximilian Pfister, Henry Förster, Martin Gronemann, Michael Hoffmann, Stephen G. Kobourov, Thomas Schneck:
Drawing Shortest Paths in Geodetic Graphs. J. Graph Algorithms Appl. 26(3): 353-361 (2022) - 2021
- Michael A. Bekos, Henry Förster, Christian Geckeler, Lukas Holländer, Michael Kaufmann, Amadäus M. Spallek, Jan Splett:
A Heuristic Approach Towards Drawings of Graphs With High Crossing Resolution. Comput. J. 64(1): 7-26 (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) - Henry Förster, Michael Kaufmann, Chrysanthi N. Raftopoulou:
Recognizing and Embedding Simple Optimal 2-Planar Graphs. GD 2021: 87-100 - Henry Förster, Michael Kaufmann, Chrysanthi N. Raftopoulou:
Recognizing and Embedding Simple Optimal 2-Planar Graphs. CoRR abs/2108.00665 (2021) - 2020
- Edward M. Hill, Stavros Petrou, Henry Forster, Simon de Lusignan, Ivelina Yonova, Matt J. Keeling:
Optimising age coverage of seasonal influenza vaccination in England: A mathematical and health economic evaluation. PLoS Comput. Biol. 16(10) (2020) - Patrizio Angelini, Michael A. Bekos, Henry Förster, Michael Kaufmann:
On RAC drawings of graphs with one bend per edge. Theor. Comput. Sci. 828-829: 42-54 (2020) - Henry Förster, Michael Kaufmann:
On Compact RAC Drawings. ESA 2020: 53:1-53:21 - Patrizio Angelini, Giordano Da Lozzo, Henry Förster, Thomas Schneck:
2-Layer k-Planar Graphs - Density, Crossing Lemma, Relationships, and Pathwidth. GD 2020: 403-419 - Sabine Cornelsen, Maximilian Pfister, Henry Förster, Martin Gronemann, Michael Hoffmann, Stephen G. Kobourov, Thomas Schneck:
Drawing Shortest Paths in Geodetic Graphs. GD 2020: 333-340 - Steven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff:
Drawing Graphs with Circular Arcs and Right-Angle Crossings. SWAT 2020: 21:1-21:14 - Patrizio Angelini, Michael A. Bekos, Henry Förster, Martin Gronemann:
Bitonic st-Orderings for Upward Planar Graphs: The Variable Embedding Setting. WG 2020: 339-351 - Steven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff:
Drawing Graphs with Circular Arcs and Right Angle Crossings. CoRR abs/2003.04740 (2020) - Steven Chaplick, Henry Förster, Michael Hoffmann, Michael Kaufmann:
Monotone Arc Diagrams with few Biarcs. CoRR abs/2003.05332 (2020)
skipping 22 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-10-18 03:59 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