Henry Förster

69 papers A* 1A 15B 6Misc 1Journal 40Unranked 6
YearRankTypeTitle / Venue / Authors
2026 J jnl
Geometric Thickness of Multigraphs is $\exists \mathbb {R}$-Complete.
Algorithmica
Henry Förster, Philipp Kindermann, Tillmann Miltzow, Irene Parada, Soeren Terziadis, Birgit Vogtenhuber
2026 B conf
Hypergraphs as Metro Maps: Drawing Paths with Few Bends in Trees, Cacti, and Plane 4-Graphs.
SOFSEM
Sabine Cornelsen, Henry Förster, Siddharth Gupta, Stephen G. Kobourov, Johannes Zink
2026 B conf
On Compaction and Realizability of Almost Convex Octilinear Representations.
WALCOM
Henry Förster, Giacomo Ortali, Lena Schlipf
2025 A conf
Drawing Trees and Cacti with Integer Edge Lengths on a Polynomial-Size Grid (Poster Abstract).
GD
Henry Förster, Stephen G. Kobourov, Jacob Miller, Johannes Zink
2025 J jnl
Drawing Trees and Cacti with Integer Edge Lengths on a Polynomial-Size Grid.
CoRR
Henry Förster, Stephen G. Kobourov, Jacob Miller, Johannes Zink
2025 J jnl
Exploring MLLMs Perception of Network Visualization Principles.
CoRR
Jacob Miller, Markus Wallinger, Ludwig Felder, Timo Brand, Henry Förster, Johannes Zink, Chunyang Chen, Stephen G. Kobourov
2025 J jnl
GraphTrials: Visual Proofs of Graph Properties.
IEEE Trans. Vis. Comput. Graph.
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
2025 J jnl
Hypergraphs as Metro Maps: Drawing Paths with Few Bends in Trees, Cacti, and Plane 4-Graphs.
CoRR
Sabine Cornelsen, Henry Förster, Siddharth Gupta, Stephen G. Kobourov, Johannes Zink
2025 B conf
Linear Layouts of Graphs with Priority Queues.
WADS
Emilio Di Giacomo, Walter Didimo, Henry Förster, Torsten Ueckerdt, Johannes Zink
2025 J jnl
Linear Layouts of Graphs with Priority Queues.
CoRR
Emilio Di Giacomo, Walter Didimo, Henry Förster, Torsten Ueckerdt, Johannes Zink
2025 J jnl
On Compaction and Realizability of Almost Convex Octilinear Representations.
CoRR
Henry Förster, Giacomo Ortali, Lena Schlipf
2025 — conf
Outer-(ap)RAC Graphs.
SOFSEM (1)
Henry Förster, Julia Katheder, Giacomo Ortali
2025 A conf
Using Reinforcement Learning to Optimize the Global and Local Crossing Number (Poster Abstract).
GD
Timo Brand, Henry Förster, Stephen G. Kobourov, Robin Schukrafft, Markus Wallinger, Johannes Zink
2025 J jnl
Using Reinforcement Learning to Optimize the Global and Local Crossing Number.
CoRR
Timo Brand, Henry Förster, Stephen G. Kobourov, Robin Schukrafft, Markus Wallinger, Johannes Zink
2025 J jnl
Visualization Biases MLLM's Decision Making in Network Data Tasks.
CoRR
Timo Brand, Henry Förster, Stephen G. Kobourov, Jacob Miller
2024 J jnl
2-Layer
Comput. J.
Patrizio Angelini, Giordano Da Lozzo, Henry Förster, Thomas Schneck
2024 J jnl
Beyond-Planar Graphs: Models, Structures and Geometric Representations (Dagstuhl Seminar 24062).
Dagstuhl Reports
Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, János Pach, Henry Förster
2024 — conf
Geometric Thickness of Multigraphs is ∃ ℝ-Complete.
LATIN (1)
Henry Förster, Philipp Kindermann, Tillmann Miltzow, Irene Parada, Soeren Terziadis, Birgit Vogtenhuber
2024 A conf
GraphTrials: Visual Proofs of Graph Properties.
GD
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
2024 J jnl
GraphTrials: Visual Proofs of Graph Properties.
CoRR
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
2024 A conf
Monotone Arc Diagrams with Few Biarcs.
GD
Steven Chaplick, Henry Förster, Michael Hoffmann, Michael Kaufmann
2024 J jnl
Monotone Arc Diagrams with few Biarcs.
CoRR
Steven Chaplick, Henry Förster, Michael Hoffmann, Michael Kaufmann
2024 — conf
On 1-Bend Upward Point-Set Embeddings of st-Digraphs.
LATIN (1)
Emilio Di Giacomo, Henry Förster, Daria Kokhovich, Tamara Mchedlidze, Fabrizio Montecchiani, Antonios Symvonis, Anaïs Villedieu
2024 J jnl
On 1-bend Upward Point-set Embeddings of st-digraphs.
CoRR
Emilio Di Giacomo, Henry Förster, Daria Kokhovich, Tamara Mchedlidze, Fabrizio Montecchiani, Antonios Symvonis, Anaïs Villedieu
2024 J jnl
Outer-(ap)RAC Graphs.
CoRR
Henry Förster, Julia Katheder, Giacomo Ortali
2023 J jnl
Bitonic st-Orderings for Upward Planar Graphs: Splits and Bends in the Variable Embedding Scenario.
Algorithmica
Patrizio Angelini, Michael A. Bekos, Henry Förster, Martin Gronemann
2023 — conf
Evaluating Animation Parameters for Morphing Edge Drawings.
GD (1)
Carla Binucci, Henry Förster, Julia Katheder, Alessandra Tappini
2023 J jnl
Evaluating Animation Parameters for Morphing Edge Drawings.
CoRR
Carla Binucci, Henry Förster, Julia Katheder, Alessandra Tappini
2023 J jnl
Geometric Thickness of Multigraphs is ∃R-complete.
CoRR
Henry Förster, Philipp Kindermann, Tillmann Miltzow, Irene Parada, Soeren Terziadis, Birgit Vogtenhuber
2023 B conf
Linear Layouts of Bipartite Planar Graphs.
WADS
Henry Förster, Michael Kaufmann, Laura Merker, Sergey Pupyrev, Chrysanthi N. Raftopoulou
2023 J jnl
Linear Layouts of Bipartite Planar Graphs.
CoRR
Henry Förster, Michael Kaufmann, Laura Merker, Sergey Pupyrev, Chrysanthi N. Raftopoulou
2023 B conf
On the 2-Layer Window Width Minimization Problem.
SOFSEM
Michael A. Bekos, Henry Förster, Michael Kaufmann, Stephen G. Kobourov, Myroslav Kryven, Axel Kuckuk, Lena Schlipf
2023 — conf
Weakly and Strongly Fan-Planar Graphs.
GD (1)
Otfried Cheong, Henry Förster, Julia Katheder, Maximilian Pfister, Lena Schlipf
2023 J jnl
Weakly and Strongly Fan-Planar Graphs.
CoRR
Otfried Cheong, Henry Förster, Julia Katheder, Maximilian Pfister, Lena Schlipf
2022 J jnl
Drawing Shortest Paths in Geodetic Graphs.
J. Graph Algorithms Appl.
Sabine Cornelsen, Maximilian Pfister, Henry Förster, Martin Gronemann, Michael Hoffmann, Stephen G. Kobourov, Thomas Schneck
2021 J jnl
A Heuristic Approach Towards Drawings of Graphs With High Crossing Resolution.
Comput. J.
Michael A. Bekos, Henry Förster, Christian Geckeler, Lukas Holländer, Michael Kaufmann, Amadäus M. Spallek, Jan Splett
2021 J jnl
On Strict (Outer-)Confluent Graphs.
J. Graph Algorithms Appl.
Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg
2021 A conf
Recognizing and Embedding Simple Optimal 2-Planar Graphs.
GD
Henry Förster, Michael Kaufmann, Chrysanthi N. Raftopoulou
2021 J jnl
Recognizing and Embedding Simple Optimal 2-Planar Graphs.
CoRR
Henry Förster, Michael Kaufmann, Chrysanthi N. Raftopoulou
2020 A conf
2-Layer k-Planar Graphs - Density, Crossing Lemma, Relationships, and Pathwidth.
GD
Patrizio Angelini, Giordano Da Lozzo, Henry Förster, Thomas Schneck
2020 J jnl
2-Layer k-Planar Graphs: Density, Crossing Lemma, Relationships, and Pathwidth.
CoRR
Patrizio Angelini, Giordano Da Lozzo, Henry Förster, Thomas Schneck
2020 B conf
Bitonic st-Orderings for Upward Planar Graphs: The Variable Embedding Setting.
WG
Patrizio Angelini, Michael A. Bekos, Henry Förster, Martin Gronemann
2020 J jnl
Drawing Graphs with Circular Arcs and Right Angle Crossings.
CoRR
Steven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff
2020 — conf
Drawing Graphs with Circular Arcs and Right-Angle Crossings.
SWAT
Steven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff
2020 A conf
Drawing Shortest Paths in Geodetic Graphs.
GD
Sabine Cornelsen, Maximilian Pfister, Henry Förster, Martin Gronemann, Michael Hoffmann, Stephen G. Kobourov, Thomas Schneck
2020 J jnl
Drawing Shortest Paths in Geodetic Graphs.
CoRR
Sabine Cornelsen, Maximilian Pfister, Henry Förster, Martin Gronemann, Michael Hoffmann, Stephen G. Kobourov, Thomas Schneck
2020 J jnl
Monotone Arc Diagrams with few Biarcs.
CoRR
Steven Chaplick, Henry Förster, Michael Hoffmann, Michael Kaufmann
2020 A conf
On Compact RAC Drawings.
ESA
Henry Förster, Michael Kaufmann
2020 J jnl
On RAC drawings of graphs with one bend per edge.
Theor. Comput. Sci.
Patrizio Angelini, Michael A. Bekos, Henry Förster, Michael Kaufmann
2019 A conf
On Arrangements of Orthogonal Circles.
GD
Steven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff
2019 J jnl
On Arrangements of Orthogonal Circles.
CoRR
Steven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff
2019 J jnl
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings.
Algorithmica
Michael A. Bekos, Henry Förster, Michael Kaufmann
2019 A conf
On Strict (Outer-)Confluent Graphs.
GD
Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg
2019 J jnl
On Strict (Outer-)Confluent Graphs.
CoRR
Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg
2019 J jnl
Planar Graphs of Bounded Degree Have Bounded Queue Number.
SIAM J. Comput.
Michael A. Bekos, Henry Förster, Martin Gronemann, Tamara Mchedlidze, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Torsten Ueckerdt
2019 A* conf
Planar graphs of bounded degree have bounded queue number.
STOC
Michael A. Bekos, Henry Förster, Martin Gronemann, Tamara Mchedlidze, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Torsten Ueckerdt
2019 A conf
The QuaSEFE Problem.
GD
Patrizio Angelini, Henry Förster, Michael Hoffmann, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Maurizio Patrignani
2019 J jnl
The QuaSEFE Problem.
CoRR
Patrizio Angelini, Henry Förster, Michael Hoffmann, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Maurizio Patrignani
2018 A conf
A Heuristic Approach Towards Drawings of Graphs with High Crossing Resolution.
GD
Michael A. Bekos, Henry Förster, Christian Geckeler, Lukas Holländer, Michael Kaufmann, Amadäus M. Spallek, Jan Splett
2018 J jnl
A Heuristic Approach towards Drawings of Graphs with High Crossing Resolution.
CoRR
Michael A. Bekos, Henry Förster, Christian Geckeler, Lukas Holländer, Michael Kaufmann, Amadäus M. Spallek, Jan Splett
2018 J jnl
Algorithms and insights for RaceTrack.
Theor. Comput. Sci.
Michael A. Bekos, Till Bruckdorfer, Henry Förster, Michael Kaufmann, Simon Poschenrieder, Thomas Stüber
2018 A conf
On RAC Drawings of Graphs with One Bend per Edge.
GD
Patrizio Angelini, Michael A. Bekos, Henry Förster, Michael Kaufmann
2018 J jnl
On RAC Drawings of Graphs with one Bend per Edge.
CoRR
Patrizio Angelini, Michael A. Bekos, Henry Förster, Michael Kaufmann
2018 A conf
Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity.
GD
Evmorfia N. Argyriou, Sabine Cornelsen, Henry Förster, Michael Kaufmann, Martin Nöllenburg, Yoshio Okamoto, Chrysanthi N. Raftopoulou, Alexander Wolff
2018 J jnl
Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity.
CoRR
Evmorfia N. Argyriou, Sabine Cornelsen, Henry Förster, Michael Kaufmann, Martin Nöllenburg, Yoshio Okamoto, Chrysanthi N. Raftopoulou, Alexander Wolff
2018 J jnl
Planar Graphs of Bounded Degree have Constant Queue Number.
CoRR
Michael A. Bekos, Henry Förster, Martin Gronemann, Tamara Mchedlidze, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Torsten Ueckerdt
2017 A conf
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings.
GD
Michael A. Bekos, Henry Förster, Michael Kaufmann
2017 J jnl
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings.
CoRR
Michael A. Bekos, Henry Förster, Michael Kaufmann
2016 Misc conf
Algorithms and Insights for RaceTrack.
FUN
Michael A. Bekos, Till Bruckdorfer, Henry Förster, Michael Kaufmann, Simon Poschenrieder, Thomas Stüber