Fabian Klute

55 papers A* 3A 9B 10Journal 31Unranked 2
YearRankTypeTitle / Venue / Authors
2025 B conf
Algorithms for Distance Problems in Continuous Graphs.
WADS
Sergio Cabello, Delia Garijo, Antonia Kalb, Fabian Klute, Irene Parada, Rodrigo I. Silveira
2025 J jnl
Algorithms for Distance Problems in Continuous Graphs.
CoRR
Sergio Cabello, Delia Garijo, Antonia Kalb, Fabian Klute, Irene Parada, Rodrigo I. Silveira
2025 B conf
Crossing and Independent Families Among Polygons.
WADS
Anna Brötzner, Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada
2025 J jnl
Faces in rectilinear drawings of complete graphs.
CoRR
Martin Balko, Anna Brötzner, Fabian Klute, Josef Tkadlec
2025 J jnl
Faces in rectilinear drawings of complete graphs.
Eur. J. Comb.
Martin Balko, Anna Brötzner, Fabian Klute, Josef Tkadlec
2025 A conf
Graph Drawing Contest Report (Graph Drawing Contest Report).
GD
Sara Di Bartolomeo, Fabian Klute, Debajyoti Mondal, Jules Wulms
2024 J jnl
Barking dogs: A Fréchet distance variant for detour detection.
CoRR
Ivor van der Hoog, Fabian Klute, Irene Parada, Patrick Schnider
2024 J jnl
Computing crossing numbers with topological and geometric restrictions.
CoRR
Thekla Hamm, Fabian Klute, Irene Parada
2024 J jnl
Edge-minimum saturated k-planar drawings.
J. Graph Theory
Steven Chaplick, Fabian Klute, Irene Parada, Jonathan Rollin, Torsten Ueckerdt
2024 A conf
Graph Drawing Contest Report (Graph Drawing Contest Report).
GD
Sara Di Bartolomeo, Fabian Klute, Debajyoti Mondal, Jules Wulms
2024 A conf
On k-Plane Insertion into Plane Drawings.
GD
Julia Katheder, Philipp Kindermann, Fabian Klute, Irene Parada, Ignaz Rutter
2024 J jnl
On k-Plane Insertion into Plane Drawings.
CoRR
Julia Katheder, Philipp Kindermann, Fabian Klute, Irene Parada, Ignaz Rutter
2024 B conf
The PACE 2024 Parameterized Algorithms and Computational Experiments Challenge: One-Sided Crossing Minimization.
IPEC
Philipp Kindermann, Fabian Klute, Soeren Terziadis
2023 J jnl
Inserting One Edge into a Simple Drawing is Hard.
Discret. Comput. Geom.
Alan Arroyo, Fabian Klute, Irene Parada, Birgit Vogtenhuber, Raimund Seidel, Tilo Wiedera
2022 J jnl
Efficient segment folding is hard.
Comput. Geom.
Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka
2022 A conf
Graph Drawing Contest Report.
GD
Philipp Kindermann, Fabian Klute, Tamara Mchedlidze, Wouter Meulemans
2022 B conf
Minimum Link Fencing.
ISAAC
Sujoy Bhore, Fabian Klute, Maarten Löffler, Martin Nöllenburg, Soeren Terziadis, Anaïs Villedieu
2022 J jnl
Minimum Link Fencing.
CoRR
Sujoy Bhore, Fabian Klute, Maarten Löffler, Martin Nöllenburg, Soeren Terziadis, Anaïs Villedieu
2022 B conf
On Fully Diverse Sets of Geometric Objects and Graphs.
WG
Fabian Klute, Marc J. van Kreveld
2022 B conf
On Streaming Algorithms for Geometric Independent Set and Clique.
WAOA
Sujoy Bhore, Fabian Klute, Jelle J. Oostveen
2022 J jnl
On Streaming Algorithms for Geometric Independent Set and Clique.
CoRR
Sujoy Bhore, Fabian Klute, Jelle J. Oostveen
2021 B conf
Balanced Independent and Dominating Sets on Colored Interval Graphs.
SOFSEM
Sujoy Bhore, Jan-Henrik Haunert, Fabian Klute, Guangping Li, Martin Nöllenburg
2021 A* conf
Crossing-Optimal Extension of Simple Drawings.
ICALP
Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, Birgit Vogtenhuber
2021 A conf
Edge-Minimum Saturated k-Planar Drawings.
GD
Steven Chaplick, Fabian Klute, Irene Parada, Jonathan Rollin, Torsten Ueckerdt
2021 J jnl
Labeling nonograms: Boundary labeling for curve arrangements.
Comput. Geom.
Fabian Klute, Maarten Löffler, Martin Nöllenburg
2021 J jnl
Local Complexity of Polygons.
CoRR
Fabian Klute, Meghana M. Reddy, Tillmann Miltzow
2021 J jnl
On Strict (Outer-)Confluent Graphs.
J. Graph Algorithms Appl.
Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg
2021 J jnl
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem.
Algorithmica
Robert Ganian, Fabian Klute, Sebastian Ordyniak
2020 J jnl
Balanced Independent and Dominating Sets on Colored Interval Graphs.
CoRR
Sujoy Bhore, Jan-Henrik Haunert, Fabian Klute, Guangping Li, Martin Nöllenburg
2020 J jnl
Crossing-Optimal Extension of Simple Drawings.
CoRR
Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, Birgit Vogtenhuber
2020 J jnl
Efficient Segment Folding is Hard.
CoRR
Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka
2020 B conf
Extending Nearly Complete 1-Planar Drawings in Polynomial Time.
MFCS
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
2020 J jnl
Extending Nearly Complete 1-Planar Drawings in Polynomial Time.
CoRR
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
2020 A* conf
Extending Partial 1-Planar Drawings.
ICALP
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
2020 J jnl
Extending Partial 1-Planar Drawings.
CoRR
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
2020 B conf
Finding Large Matchings in 1-Planar Graphs of Minimum Degree 3.
WG
Therese Biedl, Fabian Klute
2020 J jnl
Finding large matchings in 1-planar graphs of minimum degree 3.
CoRR
Therese Biedl, Fabian Klute
2020 J jnl
Four Pages Are Indeed Necessary for Planar Graphs.
CoRR
Michael A. Bekos, Michael Kaufmann, Fabian Klute, Sergey Pupyrev, Chrysanthi N. Raftopoulou, Torsten Ueckerdt
2020 J jnl
Four Pages Are Indeed Necessary for Planar Graphs.
J. Comput. Geom.
Michael A. Bekos, Michael Kaufmann, Fabian Klute, Sergey Pupyrev, Chrysanthi N. Raftopoulou, Torsten Ueckerdt
2020 B conf
Inserting One Edge into a Simple Drawing Is Hard.
WG
Alan Arroyo, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber, Tilo Wiedera
2020 J jnl
Saturated k-Plane Drawings with Few Edges.
CoRR
Fabian Klute, Irene Parada
2019 — conf
Ecient Segment Folding is Hard.
CCCG
Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka
2019 — conf
Exploring Semi-Automatic Map Labeling.
SIGSPATIAL/GIS
Fabian Klute, Guangping Li, Raphael Löffler, Martin Nöllenburg, Manuela Schmidt
2019 J jnl
Exploring Semi-Automatic Map Labeling.
CoRR
Fabian Klute, Guangping Li, Raphael Löffler, Martin Nöllenburg, Manuela Schmidt
2019 J jnl
Extending simple drawings with one edge is hard.
CoRR
Alan Arroyo, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber, Tilo Wiedera
2019 A conf
Maximizing Ink in Partial Edge Drawings of k-plane Graphs.
GD
Matthias Hummel, Fabian Klute, Soeren Nickel, Martin Nöllenburg
2019 J jnl
Maximizing Ink in Partial Edge Drawings of k-plane Graphs.
CoRR
Matthias Hummel, Fabian Klute, Soeren Nickel, Martin Nöllenburg
2019 J jnl
Minimizing crossings in constrained two-sided circular graph layouts.
J. Comput. Geom.
Fabian Klute, Martin Nöllenburg
2019 A conf
Mixed Linear Layouts: Complexity, Heuristics, and Experiments.
GD
Philipp de Col, Fabian Klute, Martin Nöllenburg
2019 J jnl
Mixed Linear Layouts: Complexity, Heuristics, and Experiments.
CoRR
Philipp de Col, Fabian Klute, Martin Nöllenburg
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
2018 A* conf
Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts.
SoCG
Fabian Klute, Martin Nöllenburg
2018 J jnl
Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts.
CoRR
Fabian Klute, Martin Nöllenburg
2018 A conf
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem.
STACS
Robert Ganian, Fabian Klute, Sebastian Ordyniak