Henry Förster

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 50

Top Topics

Strongly Connected Components

Engineering Drawings

Top Venues

Theor. Comput. Sci.

Publications

Henry Förster, Philipp Kindermann, Tillmann Miltzow, Irene Parada, Soeren Terziadis, Birgit Vogtenhuber
Geometric Thickness of Multigraphs is ∃ ℝ-Complete. LATIN (1) (2024)
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 (2024)
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)
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) (2024)
Patrizio Angelini, Giordano Da Lozzo, Henry Förster, Thomas Schneck
-Planar Graphs Density, Crossing Lemma, Relationships And Pathwidth. Comput. J. 67 (3) (2024)
Henry Förster
From Tripods to Bipods: Reducing the Queue Number of Planar Graphs Costs Just One Leg. CoRR (2024)
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)
Carla Binucci, Henry Förster, Julia Katheder, Alessandra Tappini
Evaluating Animation Parameters for Morphing Edge Drawings. GD (1) (2023)
Henry Förster, Michael Kaufmann, Laura Merker, Sergey Pupyrev, Chrysanthi N. Raftopoulou
Linear Layouts of Bipartite Planar Graphs. WADS (2023)
Henry Förster, Philipp Kindermann, Tillmann Miltzow, Irene Parada, Soeren Terziadis, Birgit Vogtenhuber
Geometric Thickness of Multigraphs is ∃R-complete. CoRR (2023)
Henry Förster, Michael Kaufmann, Laura Merker, Sergey Pupyrev, Chrysanthi N. Raftopoulou
Linear Layouts of Bipartite Planar Graphs. CoRR (2023)
Carla Binucci, Henry Förster, Julia Katheder, Alessandra Tappini
Evaluating Animation Parameters for Morphing Edge Drawings. CoRR (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) (2023)
Otfried Cheong, Henry Förster, Julia Katheder, Maximilian Pfister, Lena Schlipf
Weakly and Strongly Fan-Planar Graphs. CoRR (2023)
Otfried Cheong, Henry Förster, Julia Katheder, Maximilian Pfister, Lena Schlipf
Weakly and Strongly Fan-Planar Graphs. GD (1) (2023)
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) (2022)
Henry Förster, Michael Kaufmann, Chrysanthi N. Raftopoulou
Recognizing and Embedding Simple Optimal 2-Planar Graphs. CoRR (2021)
Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg
On Strict (Outer-)Confluent Graphs. J. Graph Algorithms Appl. 25 (1) (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) (2021)
Henry Förster, Michael Kaufmann, Chrysanthi N. Raftopoulou
Recognizing and Embedding Simple Optimal 2-Planar Graphs. Graph Drawing (2021)
Patrizio Angelini, Michael A. Bekos, Henry Förster, Martin Gronemann
Bitonic st-Orderings for Upward Planar Graphs: The Variable Embedding Setting. WG (2020)
Steven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff
Drawing Graphs with Circular Arcs and Right Angle Crossings. CoRR (2020)
Henry Förster, Michael Kaufmann
On Compact RAC Drawings. ESA (2020)
Steven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff
Drawing Graphs with Circular Arcs and Right-Angle Crossings. SWAT (2020)
Patrizio Angelini, Michael A. Bekos, Henry Förster, Michael Kaufmann
On RAC drawings of graphs with one bend per edge. Theor. Comput. Sci. (2020)
Steven Chaplick, Henry Förster, Michael Hoffmann, Michael Kaufmann
Monotone Arc Diagrams with few Biarcs. CoRR (2020)
Patrizio Angelini, Giordano Da Lozzo, Henry Förster, Thomas Schneck
2-Layer k-Planar Graphs - Density, Crossing Lemma, Relationships, and Pathwidth. Graph Drawing (2020)
Sabine Cornelsen, Maximilian Pfister, Henry Förster, Martin Gronemann, Michael Hoffmann, Stephen G. Kobourov, Thomas Schneck
Drawing Shortest Paths in Geodetic Graphs. Graph Drawing (2020)
Sabine Cornelsen, Maximilian Pfister, Henry Förster, Martin Gronemann, Michael Hoffmann, Stephen G. Kobourov, Thomas Schneck
Drawing Shortest Paths in Geodetic Graphs. CoRR (2020)
Patrizio Angelini, Giordano Da Lozzo, Henry Förster, Thomas Schneck
2-Layer k-Planar Graphs: Density, Crossing Lemma, Relationships, and Pathwidth. CoRR (2020)
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)
Steven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff
On Arrangements of Orthogonal Circles. Graph Drawing (2019)
Michael A. Bekos, Henry Förster, Michael Kaufmann
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings. Algorithmica 81 (5) (2019)
Patrizio Angelini, Henry Förster, Michael Hoffmann, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Maurizio Patrignani
The QuaSEFE Problem. Graph Drawing (2019)
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) (2019)
Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg
On Strict (Outer-)Confluent Graphs. Graph Drawing (2019)
Steven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff
On Arrangements of Orthogonal Circles. CoRR (2019)
Patrizio Angelini, Henry Förster, Michael Hoffmann, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Maurizio Patrignani
The QuaSEFE Problem. CoRR (2019)
Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg
On Strict (Outer-)Confluent Graphs. CoRR (2019)
Patrizio Angelini, Michael A. Bekos, Henry Förster, Michael Kaufmann
On RAC Drawings of Graphs with One Bend per Edge. Graph Drawing (2018)
Michael A. Bekos, Till Bruckdorfer, Henry Förster, Michael Kaufmann, Simon Poschenrieder, Thomas Stüber
Algorithms and insights for RaceTrack. Theor. Comput. Sci. 748 (2018)
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. Graph Drawing (2018)
Patrizio Angelini, Michael A. Bekos, Henry Förster, Michael Kaufmann
On RAC Drawings of Graphs with one Bend per Edge. CoRR (2018)
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 (2018)
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 (2018)
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 (2018)
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. Graph Drawing (2018)
Michael A. Bekos, Henry Förster, Michael Kaufmann
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings. CoRR (2017)
Michael A. Bekos, Henry Förster, Michael Kaufmann
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings. Graph Drawing (2017)
Michael A. Bekos, Till Bruckdorfer, Henry Förster, Michael Kaufmann, Simon Poschenrieder, Thomas Stüber
Algorithms and Insights for RaceTrack. FUN (2016)