default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHenry Förster
Person information
- affiliation: University of Tübingen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]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)- [c23]Steven Chaplick, Henry Förster, Michael Hoffmann, Michael Kaufmann:
Monotone Arc Diagrams with Few Biarcs. GD 2024: 11:1-11:16 - [c22]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. GD 2024: 16:1-16:18 - [c21]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 - [c20]Henry Förster, Philipp Kindermann, Tillmann Miltzow, Irene Parada, Soeren Terziadis, Birgit Vogtenhuber:
Geometric Thickness of Multigraphs is ∃ ℝ-Complete. LATIN (1) 2024: 336-349 - [i21]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) - [i20]Steven Chaplick, Henry Förster, Michael Hoffmann, Michael Kaufmann:
Monotone Arc Diagrams with few Biarcs. CoRR abs/2408.14299 (2024) - [i19]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) - [i18]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
- [j8]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) - [c19]Otfried Cheong, Henry Förster, Julia Katheder, Maximilian Pfister, Lena Schlipf:
Weakly and Strongly Fan-Planar Graphs. GD (1) 2023: 53-68 - [c18]Carla Binucci, Henry Förster, Julia Katheder, Alessandra Tappini:
Evaluating Animation Parameters for Morphing Edge Drawings. GD (1) 2023: 246-262 - [c17]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 - [c16]Henry Förster, Michael Kaufmann, Laura Merker, Sergey Pupyrev, Chrysanthi N. Raftopoulou:
Linear Layouts of Bipartite Planar Graphs. WADS 2023: 444-459 - [i17]Henry Förster, Michael Kaufmann, Laura Merker, Sergey Pupyrev, Chrysanthi N. Raftopoulou:
Linear Layouts of Bipartite Planar Graphs. CoRR abs/2305.16087 (2023) - [i16]Otfried Cheong, Henry Förster, Julia Katheder, Maximilian Pfister, Lena Schlipf:
Weakly and Strongly Fan-Planar Graphs. CoRR abs/2308.08966 (2023) - [i15]Carla Binucci, Henry Förster, Julia Katheder, Alessandra Tappini:
Evaluating Animation Parameters for Morphing Edge Drawings. CoRR abs/2309.00456 (2023) - [i14]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
- [j7]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
- [j6]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) - [j5]Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg:
On Strict (Outer-)Confluent Graphs. J. Graph Algorithms Appl. 25(1): 481-512 (2021) - [c15]Henry Förster, Michael Kaufmann, Chrysanthi N. Raftopoulou:
Recognizing and Embedding Simple Optimal 2-Planar Graphs. GD 2021: 87-100 - [i13]Henry Förster, Michael Kaufmann, Chrysanthi N. Raftopoulou:
Recognizing and Embedding Simple Optimal 2-Planar Graphs. CoRR abs/2108.00665 (2021) - 2020
- [j4]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) - [c14]Henry Förster, Michael Kaufmann:
On Compact RAC Drawings. ESA 2020: 53:1-53:21 - [c13]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 - [c12]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 - [c11]Steven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff:
Drawing Graphs with Circular Arcs and Right-Angle Crossings. SWAT 2020: 21:1-21:14 - [c10]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 - [i12]Steven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff:
Drawing Graphs with Circular Arcs and Right Angle Crossings. CoRR abs/2003.04740 (2020) - [i11]Steven Chaplick, Henry Förster, Michael Hoffmann, Michael Kaufmann:
Monotone Arc Diagrams with few Biarcs. CoRR abs/2003.05332 (2020) - [i10]Sabine Cornelsen, Maximilian Pfister, Henry Förster, Martin Gronemann, Michael Hoffmann, Stephen G. Kobourov, Thomas Schneck:
Drawing Shortest Paths in Geodetic Graphs. CoRR abs/2008.07637 (2020) - [i9]Patrizio Angelini, Giordano Da Lozzo, Henry Förster, Thomas Schneck:
2-Layer k-Planar Graphs: Density, Crossing Lemma, Relationships, and Pathwidth. CoRR abs/2008.09329 (2020)
2010 – 2019
- 2019
- [j3]Michael A. Bekos, Henry Förster, Michael Kaufmann:
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings. Algorithmica 81(5): 2046-2071 (2019) - [j2]Michael A. Bekos, Henry Förster, Martin Gronemann, Tamara Mchedlidze, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Torsten Ueckerdt:
Planar Graphs of Bounded Degree Have Bounded Queue Number. SIAM J. Comput. 48(5): 1487-1502 (2019) - [c9]Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg:
On Strict (Outer-)Confluent Graphs. GD 2019: 147-161 - [c8]Steven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff:
On Arrangements of Orthogonal Circles. GD 2019: 216-229 - [c7]Patrizio Angelini, Henry Förster, Michael Hoffmann, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Maurizio Patrignani:
The QuaSEFE Problem. GD 2019: 268-275 - [c6]Michael A. Bekos, Henry Förster, Martin Gronemann, Tamara Mchedlidze, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Torsten Ueckerdt:
Planar graphs of bounded degree have bounded queue number. STOC 2019: 176-184 - [i8]Steven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff:
On Arrangements of Orthogonal Circles. CoRR abs/1907.08121 (2019) - [i7]Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg:
On Strict (Outer-)Confluent Graphs. CoRR abs/1908.05345 (2019) - [i6]Patrizio Angelini, Henry Förster, Michael Hoffmann, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Maurizio Patrignani:
The QuaSEFE Problem. CoRR abs/1908.08708 (2019) - 2018
- [j1]Michael A. Bekos, Till Bruckdorfer, Henry Förster, Michael Kaufmann, Simon Poschenrieder, Thomas Stüber:
Algorithms and insights for RaceTrack. Theor. Comput. Sci. 748: 2-16 (2018) - [c5]Patrizio Angelini, Michael A. Bekos, Henry Förster, Michael Kaufmann:
On RAC Drawings of Graphs with One Bend per Edge. GD 2018: 123-136 - [c4]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. GD 2018: 271-285 - [c3]Evmorfia N. Argyriou, Sabine Cornelsen, Henry Förster, Michael Kaufmann, Martin Nöllenburg, Yoshio Okamoto, Chrysanthi N. Raftopoulou, Alexander Wolff:
Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity. GD 2018: 509-523 - [i5]Patrizio Angelini, Michael A. Bekos, Henry Förster, Michael Kaufmann:
On RAC Drawings of Graphs with one Bend per Edge. CoRR abs/1808.10470 (2018) - [i4]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. CoRR abs/1808.10519 (2018) - [i3]Evmorfia N. Argyriou, Sabine Cornelsen, Henry Förster, Michael Kaufmann, Martin Nöllenburg, Yoshio Okamoto, Chrysanthi N. Raftopoulou, Alexander Wolff:
Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity. CoRR abs/1808.10536 (2018) - [i2]Michael A. Bekos, Henry Förster, Martin Gronemann, Tamara Mchedlidze, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Torsten Ueckerdt:
Planar Graphs of Bounded Degree have Constant Queue Number. CoRR abs/1811.00816 (2018) - 2017
- [c2]Michael A. Bekos, Henry Förster, Michael Kaufmann:
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings. GD 2017: 169-183 - [i1]Michael A. Bekos, Henry Förster, Michael Kaufmann:
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings. CoRR abs/1708.09197 (2017) - 2016
- [c1]Michael A. Bekos, Till Bruckdorfer, Henry Förster, Michael Kaufmann, Simon Poschenrieder, Thomas Stüber:
Algorithms and Insights for RaceTrack. FUN 2016: 6:1-6:14
Coauthor Index
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.
last updated on 2024-10-30 20:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
