Publications

Journal Articles

Daniel Bertschinger, Henry Förster, Fabian Klute, Irene Parada, Patrick Schnider, Birgit Vogtenhuber
Bowties and hourglasses: Intersections of double-wedges or: Stabbing and avoiding line segments
Information Processing Letters, 194, article 106642, 2026
DOI arXiv
Martin Balko, Anna Brötzner, Fabian Klute, Josef Tkadlec
Faces in rectilinear drawings of complete graphs
European Journal of Combinatorics, 130, article 104217, 2025
DOI arXiv
Steven Chaplick, Fabian Klute, Irene Parada, Jonathan Rollin, Torsten Ueckerdt
Edge-minimum saturated k-planar drawings
Journal of Graph Theory, 106(4), pp. 741–762, 2024
DOI arXiv
Alan Arroyo, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber, Tilo Wiedera
Inserting one edge into a simple drawing is hard
Discrete and Computational Geometry, 69(3), pp. 745–770, 2022
DOI arXiv
Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka
Efficient segment folding is hard
Computational Geometry: Theory and Applications, 104, article 101860, 2022
DOI arXiv
Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg
On strict (outer-)confluent graphs
Journal of Graph Algorithms and Applications, 25(1), pp. 481–512, 2021
DOI arXiv
Robert Ganian, Fabian Klute, Sebastian Ordyniak
On structural parameterizations of the bounded-degree vertex deletion problem
Algorithmica, 83(1), pp. 297–336, 2021
DOI
Fabian Klute, Maarten Löffler, Martin Nöllenburg
Labeling nonograms: Boundary labeling for curve arrangements
Computational Geometry: Theory and Applications, 98, article 101791, 2021
DOI
Michael A. Bekos, Michael Kaufmann, Fabian Klute, Sergey Pupyrev, Chrysanthi Raftopoulou, Torsten Ueckerdt
Four pages are indeed necessary for planar graphs
Journal of Computational Geometry, 11(1), pp. 332–353, 2020
DOI arXiv
Fabian Klute, Martin Nöllenburg
Minimizing crossings in constrained two-sided circular graph layouts
Journal of Computational Geometry, 10(2), pp. 45–69, 2019
DOI arXiv

Conference Papers

Sergi Bons, Fabian Klute, Rodrigo I. Silveira, Oscar Argudo
Extracting hiking route descriptions from trajectory and terrain data
Spanish Computer Graphics Conference (CEIG'26), 2026
DOI
Anna Brötzner, Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada
Crossing and Independent Families Among Polygons
19th Algorithms and Data Structures Symposium (WADS'25), 349, pp. 11:1–11:15, 2025
DOI
Sergio Cabello, Delia Garijo, Antonia Kalb, Fabian Klute, Irene Parada, Rodrigo I. Silveira
Algorithms for Distance Problems in Continuous Graphs
19th Algorithms and Data Structures Symposium (WADS'25), 349, pp. 13:1–13:14, 2025
DOI arXiv
Julia Katheder, Philipp Kindermann, Fabian Klute, Irene Parada, Ignaz Rutter
On k-Plane Insertion into Plane Drawings
32nd International Symposium on Graph Drawing and Network Visualization (GD'24), 320, pp. 35:1–35:11, 2024
DOI arXiv
Fabian Klute, Marc van Kreveld
On Fully Diverse Sets of Geometric Objects and Graphs
48th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'22), 13453, pp. 328–341, 2022
DOI
Sujoy Bhore, Fabian Klute, Maarten Löffler, Martin Nöllenburg, Soeren Terziadis, Anaïs Villedieu
Minimum link fencing
33rd International Symposium on Algorithms and Computation (ISAAC'22), 248, pp. 34:1–34:14, 2022
DOI arXiv
Sujoy Bhore, Fabian Klute, Jelle J. Oostveen
On streaming algorithms for geometric independent set and clique
20th International Workshop on Approximation and Online Algorithms (WAOA'22), 13538, pp. 211–224, 2022
DOI arXiv
Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, Birgit Vogtenhuber
Crossing-optimal extension of simple drawings
48th International Colloquium on Automata, Languages, and Programming (ICALP'21), 198, pp. 72:1–72:17, 2021
DOI arXiv
Sujoy Bhore, Jan-Henrik Haunert, Fabian Klute, Guangping Li, Martin Nöllenburg
Balanced independent and dominating sets on colored interval graphs
47th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'21), 12607, pp. 89–103, 2021
DOI arXiv
Steven Chaplick, Fabian Klute, Irene Parada, Jonathan Rollin, Torsten Ueckerdt
Edge-minimum saturated k-planar drawings
29th International Symposium on Graph Drawing and Network Visualization (GD'21), 12868, pp. 3–17, 2021
DOI arXiv
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
Extending partial 1-planar drawings
47th International Colloquium on Automata, Languages, and Programming (ICALP'20), 168, pp. 43:1–43:19, 2020
DOI arXiv
Alan Arroyo, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber, Tilo Wiedera
Inserting one edge into a simple drawing is hard
46th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'20), 12301, pp. 325–338, 2020
DOI arXiv
Therese Biedl, Fabian Klute
Finding large matchings in 1-planar graphs of minimum degree 3
46th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'20), 12301, pp. 248–260, 2020
DOI arXiv
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
Extending nearly complete 1-planar drawings in polynomial time
45th International Symposium on Mathematical Foundations of Computer Science (MFCS'20), 170, pp. 31:1–31:16, 2020
DOI arXiv
Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka
Efficient segment folding is hard
31st Canadian Conference in Computational Geometry (CCCG'19), pp. 177–183, 2019
arXiv
Philipp de Col, Fabian Klute, Martin Nöllenburg
Mixed linear layouts: complexity, heuristics, and experiments
27th International Symposium on Graph Drawing and Network Visualization (GD'19), 11904, pp. 460–467, 2019
DOI arXiv
Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg
On strict (outer-)confluent graphs
27th International Symposium on Graph Drawing and Network Visualization (GD'19), 11904, pp. 147–161, 2019
DOI arXiv
Matthias Hummel, Fabian Klute, Soeren Nickel, Martin Nöllenburg
Maximizing ink in partial edge drawings of k-plane graphs
27th International Symposium on Graph Drawing and Network Visualization (GD'19), 11904, pp. 323–336, 2019
DOI arXiv
Fabian Klute, Guangping Li, Raphael Löffler, Martin Nöllenburg, Manuela Schmidt
Exploring semi-automatic map labeling
27th ACM International Conference on Advances in Geographic Information Systems (SIGSPATIAL'19), pp. 13–22, 2019
DOI arXiv
Robert Ganian, Fabian Klute, Sebastian Ordyniak
On structural parameterizations of the bounded-degree vertex deletion problem
35th Symposium on Theoretical Aspects of Computer Science (STACS'18), 96, pp. 33:1–33:14, 2018
DOI
Fabian Klute, Martin Nöllenburg
Minimizing crossings in constrained two-sided circular graph layouts
34th International Symposium on Computational Geometry (SoCG'18), 99, pp. 53:1–53:14, 2018
DOI arXiv

Workshop Papers and Abstracts

Martin Balko, Anna Brötzner, Fabian Klute, Josef Tkadlec
Faces in Rectilinear Drawings of Complete Graphs
40th European Workshop on Computational Geometry (EuroCG'24), pp. 8:1–8:7, 2024
Julia Katheder, Philipp Kindermann, Fabian Klute, Irene Parada, Ignaz Rutter
On k-Plane Insertion into Plane Drawings
40th European Workshop on Computational Geometry (EuroCG'24), pp. 56:1–56:9, 2024
Ivor van der Hoog, Fabian Klute, Irene Parada, Patrick Schnider
Barking dogs: A Fréchet distance variant for detour detection
40th European Workshop on Computational Geometry (EuroCG'24), pp. 23:1–23:6, 2024
Fabian Klute, Marc van Kreveld
On the Size of Fully Diverse Sets of Polygons using the Earth Movers Distance or Wasserstein Distance
39th European Workshop on Computational Geometry (EuroCG'23), pp. 17:1–17:6, 2023
Sujoy Bhore, Fabian Klute, Maarten Löffler, Soeren Nickel, Martin Nöllenburg, Anaïs Villedieu
Minimum Link Fencing
37th European Workshop on Computational Geometry (EuroCG'21), pp. 55:1–55:9, 2021
Fabian Klute, Meghana M. Reddy, Tillmann Miltzow
Local Complexity of Polygons
37th European Workshop on Computational Geometry (EuroCG'21), pp. 54:1–54:6, 2021
Sujoy Bhore, Jan-Henrik Haunert, Fabian Klute, Guangping Li, Martin Nöllenburg
Balanced independent and dominating sets on colored interval graphs
36th European Workshop on Computational Geometry (EuroCG'20), pp. 66:1–66:6, 2020
Thekla Hamm, Fabian Klute, Irene Parada
Extending to 1-plane drawings
Abstracts of the XVIII Spanish Meeting on Computational Geometry (EGC'19), pp. 30–33, 2019
Michael Höller, Fabian Klute, Soeren Nickel, Martin Nöllenburg, Birgit Schreiber
Maximizing ink in symmetric partial edge drawings of k-plane graphs
34th European Workshop on Computational Geometry (EuroCG'18), pp. 50:1–50:6, 2018
Fabian Klute, Martin Nöllenburg
Minimizing crossings in constrained two-sided circular graph layouts
33rd European Workshop on Computational Geometry (EuroCG'17), pp. 273–276, 2017
Fabian Klute, Martin Nöllenburg
Minimizing crossings in constrained two-sided circular graph layouts
3rd Vienna Young Scientists Symposium (VSS'17), pp. 98–99, 2017
Link

Reports

Sara Di Bartolomeo, Fabian Klute, Debajyoti Mondal, Jules Wulms
Graph Drawing Contest Report
33rd International Symposium on Graph Drawing and Network Visualization (GD'25), 357, pp. 41:1–41:11, 2025
DOI
Sara Di Bartolomeo, Fabian Klute, Debajyoti Mondal, Jules Wulms
Graph Drawing Contest Report
32nd International Symposium on Graph Drawing and Network Visualization (GD'24), 320, pp. 41:1–41:13, 2024
DOI
Philipp Kindermann, Fabian Klute, Soeren Terziadis
The PACE 2024 Parameterized Algorithms and Computational Experiments Challenge: One-Sided Crossing Minimization
19th International Symposium on Parameterized and Exact Computation (IPEC'24), 321, pp. 26:1–26:20, 2024
DOI
Philipp Kindermann, Fabian Klute, Tamara Mchedlidze, Wouter Meulemans, Debajyoti Mondal
Graph Drawing Contest Report
31st International Symposium on Graph Drawing and Network Visualization (GD'23), 14465, pp. 349–357, 2023
Philipp Kindermann, Fabian Klute, Tamara Mchedlidze, Wouter Meulemans
Graph Drawing Contest Report
30th International Symposium on Graph Drawing and Network Visualization (GD'22), 13764, pp. 459–470, 2023
DOI

Posters

Fabian Klute, Martin Nöllenburg
Towards characterizing strict outerconfluent graphs
25th International Symposium on Graph Drawing and Network Visualization (GD'17), 10692, pp. 612–614, 2017 (poster)
Fabian Klute
Robust Genealogy Drawings
24th International Symposium on Graph Drawing and Network Visualization (GD'16), 9801, pp. 637–639, 2016 (poster)
Thomas Bläsius, Fabian Klute, Benjamin Niedermann, Martin Nöllenburg
PiGra – a tool for pixelated graph representations
22nd International Symposium on Graph Drawing (GD'14), 8871, pp. 513–514, 2014 (poster)

Preprints

Miriam Goetze, Fabian Klute, Kolja Knauer, Irene Parada, Juan Pablo Peña, Torsten Ueckerdt
Strong odd coloring in minor-closed classes
arXiv preprint, 2025
arXiv
Thekla Hamm, Fabian Klute, Irene Parada
Computing crossing numbers with topological and geometric restrictions
arXiv preprint, 2024
arXiv
Ivor van der Hoog, Fabian Klute, Irene Parada, Patrick Schnider
Barking dogs: A Fréchet distance variant for detour detection
arXiv preprint, 2024
arXiv
Fabian Klute, Meghana M. Reddy, Tillmann Miltzow
Local Complexity of Polygons
arXiv preprint, 2021
arXiv

Theses

Fabian Klute
Avoiding Crossings in Non-Planar Graph Layouts
TU Wien, 2020
DOI
Fabian Klute
Connecting points with low-complexity polynomial curves in a polygon
Karlsruhe Institute of Technology (KIT), 2015
PDF
Fabian Klute
Serialisierung und Deserialisierung von Mustern in Zellularautomaten
Karlsruhe Institute of Technology (KIT), 2012