Fabian Klute

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 44

Top Topics

Energy Landscape

Engineering Drawings

Independent Set

Top Venues

J. Comput. Geom.

Publications

Julia Katheder, Philipp Kindermann, Fabian Klute, Irene Parada, Ignaz Rutter
On k-Plane Insertion into Plane Drawings. CoRR (2024)
Ivor van der Hoog, Fabian Klute, Irene Parada, Patrick Schnider
Barking dogs: A Fréchet distance variant for detour detection. CoRR (2024)
Alan Arroyo, Fabian Klute, Irene Parada, Birgit Vogtenhuber, Raimund Seidel, Tilo Wiedera
Inserting One Edge into a Simple Drawing is Hard. Discret. Comput. Geom. 69 (3) (2023)
Sujoy Bhore, Fabian Klute, Maarten Löffler, Martin Nöllenburg, Soeren Terziadis, Anaïs Villedieu
Minimum Link Fencing. CoRR (2022)
Sujoy Bhore, Fabian Klute, Maarten Löffler, Martin Nöllenburg, Soeren Terziadis, Anaïs Villedieu
Minimum Link Fencing. ISAAC (2022)
Philipp Kindermann, Fabian Klute, Tamara Mchedlidze, Wouter Meulemans
Graph Drawing Contest Report. GD (2022)
Sujoy Bhore, Fabian Klute, Jelle J. Oostveen
On Streaming Algorithms for Geometric Independent Set and Clique. WAOA (2022)
Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka
Efficient segment folding is hard. Comput. Geom. 104 (2022)
Fabian Klute, Marc J. van Kreveld
On Fully Diverse Sets of Geometric Objects and Graphs. WG (2022)
Sujoy Bhore, Fabian Klute, Jelle J. Oostveen
On Streaming Algorithms for Geometric Independent Set and Clique. CoRR (2022)
Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, Birgit Vogtenhuber
Crossing-Optimal Extension of Simple Drawings. ICALP (2021)
Fabian Klute, Meghana M. Reddy, Tillmann Miltzow
Local Complexity of Polygons. CoRR (2021)
Fabian Klute, Maarten Löffler, Martin Nöllenburg
Labeling nonograms: Boundary labeling for curve arrangements. Comput. Geom. 98 (2021)
Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg
On Strict (Outer-)Confluent Graphs. J. Graph Algorithms Appl. 25 (1) (2021)
Steven Chaplick, Fabian Klute, Irene Parada, Jonathan Rollin, Torsten Ueckerdt
Edge-Minimum Saturated k-Planar Drawings. Graph Drawing (2021)
Sujoy Bhore, Jan-Henrik Haunert, Fabian Klute, Guangping Li, Martin Nöllenburg
Balanced Independent and Dominating Sets on Colored Interval Graphs. SOFSEM (2021)
Robert Ganian, Fabian Klute, Sebastian Ordyniak
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem. Algorithmica 83 (1) (2021)
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
Extending Partial 1-Planar Drawings. CoRR (2020)
Michael A. Bekos, Michael Kaufmann, Fabian Klute, Sergey Pupyrev, Chrysanthi N. Raftopoulou, Torsten Ueckerdt
Four Pages Are Indeed Necessary for Planar Graphs. J. Comput. Geom. 11 (1) (2020)
Michael A. Bekos, Michael Kaufmann, Fabian Klute, Sergey Pupyrev, Chrysanthi N. Raftopoulou, Torsten Ueckerdt
Four Pages Are Indeed Necessary for Planar Graphs. CoRR (2020)
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
Extending Nearly Complete 1-Planar Drawings in Polynomial Time. CoRR (2020)
Alan Arroyo, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber, Tilo Wiedera
Inserting One Edge into a Simple Drawing Is Hard. WG (2020)
Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka
Efficient Segment Folding is Hard. CoRR (2020)
Therese C. Biedl, Fabian Klute
Finding Large Matchings in 1-Planar Graphs of Minimum Degree 3. WG (2020)
Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, Birgit Vogtenhuber
Crossing-Optimal Extension of Simple Drawings. CoRR (2020)
Therese C. Biedl, Fabian Klute
Finding large matchings in 1-planar graphs of minimum degree 3. CoRR (2020)
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
Extending Nearly Complete 1-Planar Drawings in Polynomial Time. MFCS (2020)
Fabian Klute, Irene Parada
Saturated k-Plane Drawings with Few Edges. CoRR (2020)
Sujoy Bhore, Jan-Henrik Haunert, Fabian Klute, Guangping Li, Martin Nöllenburg
Balanced Independent and Dominating Sets on Colored Interval Graphs. CoRR (2020)
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
Extending Partial 1-Planar Drawings. ICALP (2020)
Fabian Klute, Guangping Li, Raphael Löffler, Martin Nöllenburg, Manuela Schmidt
Exploring Semi-Automatic Map Labeling. SIGSPATIAL/GIS (2019)
Fabian Klute, Martin Nöllenburg
Minimizing crossings in constrained two-sided circular graph layouts. J. Comput. Geom. 10 (2) (2019)
Philipp de Col, Fabian Klute, Martin Nöllenburg
Mixed Linear Layouts: Complexity, Heuristics, and Experiments. Graph Drawing (2019)
Alan Arroyo, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber, Tilo Wiedera
Extending simple drawings with one edge is hard. CoRR (2019)
Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka
Ecient Segment Folding is Hard. CCCG (2019)
Matthias Hummel, Fabian Klute, Soeren Nickel, Martin Nöllenburg
Maximizing Ink in Partial Edge Drawings of k-plane Graphs. CoRR (2019)
Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg
On Strict (Outer-)Confluent Graphs. Graph Drawing (2019)
Fabian Klute, Guangping Li, Raphael Löffler, Martin Nöllenburg, Manuela Schmidt
Exploring Semi-Automatic Map Labeling. CoRR (2019)
Philipp de Col, Fabian Klute, Martin Nöllenburg
Mixed Linear Layouts: Complexity, Heuristics, and Experiments. CoRR (2019)
Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg
On Strict (Outer-)Confluent Graphs. CoRR (2019)
Matthias Hummel, Fabian Klute, Soeren Nickel, Martin Nöllenburg
Maximizing Ink in Partial Edge Drawings of k-plane Graphs. Graph Drawing (2019)
Fabian Klute, Martin Nöllenburg
Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts. CoRR (2018)
Robert Ganian, Fabian Klute, Sebastian Ordyniak
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem. STACS (2018)
Fabian Klute, Martin Nöllenburg
Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts. SoCG (2018)