Ecient Segment Folding is Hard. - Takashi Horiyama; Fabian Klute; Matias Korman; Irene Parada; Ryuhei Uehara; Katsuhisa Yamanaka (CCCG, 2019)

Mixed Linear Layouts: Complexity, Heuristics, and Experiments. - Philipp de Col; Fabian Klute; Martin Nöllenburg (GD, 2019)

Maximizing Ink in Partial Edge Drawings of k-plane Graphs. - Matthias Hummel; Fabian Klute; Soeren Nickel; Martin Nöllenburg (GD, 2019)

Exploring Semi-Automatic Map Labeling. - Fabian Klute; Guangping Li 001; Raphael Löffler; Martin Nöllenburg; Manuela Schmidt (SIGSPATIAL/GIS, 2019)

Extending simple drawings with one edge is hard. - Alan Arroyo; Fabian Klute; Irene Parada; Raimund Seidel; Birgit Vogtenhuber; Tilo Wiedera (CoRR, 2019)

Minimizing crossings in constrained two-sided circular graph layouts. - Fabian Klute; Martin Nöllenburg (J. Comput. Geom., 2019)

Extending Partial 1-Planar Drawings. - Eduard Eiben; Robert Ganian; Thekla Hamm; Fabian Klute; Martin Nöllenburg (ICALP, 2020)

Extending Nearly Complete 1-Planar Drawings in Polynomial Time. - Eduard Eiben; Robert Ganian; Thekla Hamm; Fabian Klute; Martin Nöllenburg (MFCS, 2020)

Finding Large Matchings in 1-Planar Graphs of Minimum Degree 3. - Therese Biedl; Fabian Klute (WG, 2020)

Saturated k-Plane Drawings with Few Edges. - Fabian Klute; Irene Parada (CoRR, 2020)

Four Pages Are Indeed Necessary for Planar Graphs. - Michael A. Bekos; Michael Kaufmann 001; Fabian Klute; Sergey Pupyrev; Chrysanthi N. Raftopoulou; Torsten Ueckerdt (J. Comput. Geom., 2020)

Crossing-Optimal Extension of Simple Drawings. - Robert Ganian; Thekla Hamm; Fabian Klute; Irene Parada; Birgit Vogtenhuber (ICALP, 2021)

Balanced Independent and Dominating Sets on Colored Interval Graphs. - Sujoy Bhore; Jan-Henrik Haunert; Fabian Klute; Guangping Li 001; Martin Nöllenburg (SOFSEM, 2021)

On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem. - Robert Ganian; Fabian Klute; Sebastian Ordyniak (Algorithmica, 2021)

Labeling nonograms: Boundary labeling for curve arrangements. - Fabian Klute; Maarten Löffler; Martin Nöllenburg (Comput. Geom., 2021)

Local Complexity of Polygons. - Fabian Klute; Meghana M. Reddy; Tillmann Miltzow (CoRR, 2021)

On Strict (Outer-)Confluent Graphs. - Henry Förster; Robert Ganian; Fabian Klute; Martin Nöllenburg (J. Graph Algorithms Appl., 2021)

Graph Drawing Contest Report. - Philipp Kindermann; Fabian Klute; Tamara Mchedlidze; Wouter Meulemans (GD, 2022)

Minimum Link Fencing. - Sujoy Bhore; Fabian Klute; Maarten Löffler; Martin Nöllenburg; Soeren Terziadis; Anaïs Villedieu (ISAAC, 2022)

On Streaming Algorithms for Geometric Independent Set and Clique. - Sujoy Bhore; Fabian Klute; Jelle J. Oostveen (WAOA, 2022)

On Fully Diverse Sets of Geometric Objects and Graphs. - Fabian Klute; Marc J. van Kreveld (WG, 2022)

Efficient segment folding is hard. - Takashi Horiyama; Fabian Klute; Matias Korman; Irene Parada; Ryuhei Uehara; Katsuhisa Yamanaka (Comput. Geom., 2022)

Inserting One Edge into a Simple Drawing is Hard. - Alan Arroyo; Fabian Klute; Irene Parada; Birgit Vogtenhuber; Raimund Seidel; Tilo Wiedera (Discret. Comput. Geom., 2023)

Graph Drawing Contest Report (Graph Drawing Contest Report). - Sara Di Bartolomeo; Fabian Klute; Debajyoti Mondal; Jules Wulms (GD, 2024)

On k-Plane Insertion into Plane Drawings. - Julia Katheder; Philipp Kindermann; Fabian Klute; Irene Parada; Ignaz Rutter (GD, 2024)

The PACE 2024 Parameterized Algorithms and Computational Experiments Challenge: One-Sided Crossing Minimization. - Philipp Kindermann; Fabian Klute; Soeren Terziadis (IPEC, 2024)

Barking dogs: A Fréchet distance variant for detour detection. - Ivor van der Hoog; Fabian Klute; Irene Parada; Patrick Schnider (CoRR, 2024)

Computing crossing numbers with topological and geometric restrictions. - Thekla Hamm; Fabian Klute; Irene Parada (CoRR, 2024)

Edge-minimum saturated k-planar drawings. - Steven Chaplick; Fabian Klute; Irene Parada; Jonathan Rollin; Torsten Ueckerdt (J. Graph Theory, 2024)

Crossing and Independent Families Among Polygons. - Anna Brötzner; Robert Ganian; Thekla Hamm; Fabian Klute; Irene Parada (WADS, 2025)

Algorithms for Distance Problems in Continuous Graphs. - Sergio Cabello; Delia Garijo; Antonia Kalb; Fabian Klute; Irene Parada; Rodrigo I. Silveira (WADS, 2025)

Faces in rectilinear drawings of complete graphs. - Martin Balko; Anna Brötzner; Fabian Klute; Josef Tkadlec (Eur. J. Comb., 2025)