Fabian Klute

According to our database, Fabian Klute authored at least 29 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Computing crossing numbers with topological and geometric restrictions.

Thekla Hamm, Fabian Klute, Irene Parada

CoRR, 2024

Barking dogs: A Fréchet distance variant for detour detection.

Ivor van der Hoog, Fabian Klute, Irene Parada, Patrick Schnider

CoRR, 2024

The PACE 2024 Parameterized Algorithms and Computational Experiments Challenge: One-Sided Crossing Minimization.

Philipp Kindermann, Fabian Klute, Soeren Terziadis

Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

On k-Plane Insertion into Plane Drawings.

Julia Katheder, Philipp Kindermann, Fabian Klute, Irene Parada, Ignaz Rutter

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

Graph Drawing Contest Report (Graph Drawing Contest Report).

Sara Di Bartolomeo, Fabian Klute, Debajyoti Mondal, Jules Wulms

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

2023

Inserting One Edge into a Simple Drawing is Hard.

Alan Arroyo, Fabian Klute, Irene Parada, Birgit Vogtenhuber, Raimund Seidel, Tilo Wiedera

Discret. Comput. Geom., April, 2023

2022

Efficient segment folding is hard.

Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka

Comput. Geom., 2022

On Fully Diverse Sets of Geometric Objects and Graphs.

Fabian Klute, Marc J. van Kreveld

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

On Streaming Algorithms for Geometric Independent Set and Clique.

Sujoy Bhore, Fabian Klute, Jelle J. Oostveen

Proceedings of the Approximation and Online Algorithms - 20th International Workshop, 2022

Minimum Link Fencing.

Sujoy Bhore, Fabian Klute, Maarten Löffler, Martin Nöllenburg, Soeren Terziadis, Anaïs Villedieu

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Graph Drawing Contest Report.

Philipp Kindermann, Fabian Klute, Tamara Mchedlidze, Wouter Meulemans

Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

2021

On Strict (Outer-)Confluent Graphs.

Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg

J. Graph Algorithms Appl., 2021

Local Complexity of Polygons.

Fabian Klute, Meghana M. Reddy, Tillmann Miltzow

CoRR, 2021

Labeling nonograms: Boundary labeling for curve arrangements.

Fabian Klute, Maarten Löffler, Martin Nöllenburg

Comput. Geom., 2021

On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem.

Robert Ganian, Fabian Klute, Sebastian Ordyniak

Algorithmica, 2021

Balanced Independent and Dominating Sets on Colored Interval Graphs.

Sujoy Bhore, Jan-Henrik Haunert, Fabian Klute, Guangping Li, Martin Nöllenburg

Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

Crossing-Optimal Extension of Simple Drawings.

Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, Birgit Vogtenhuber

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Edge-Minimum Saturated k-Planar Drawings.

Steven Chaplick, Fabian Klute, Irene Parada, Jonathan Rollin, Torsten Ueckerdt

Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

2020

Four Pages Are Indeed Necessary for Planar Graphs.

Michael A. Bekos, Michael Kaufmann, Fabian Klute, Sergey Pupyrev, Chrysanthi N. Raftopoulou, Torsten Ueckerdt

J. Comput. Geom., 2020

Saturated k-Plane Drawings with Few Edges.

Fabian Klute, Irene Parada

CoRR, 2020

Finding Large Matchings in 1-Planar Graphs of Minimum Degree 3.

Therese Biedl, Fabian Klute

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

Extending Nearly Complete 1-Planar Drawings in Polynomial Time.

Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Extending Partial 1-Planar Drawings.

Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

Minimizing crossings in constrained two-sided circular graph layouts.

Fabian Klute, Martin Nöllenburg

J. Comput. Geom., 2019

Extending simple drawings with one edge is hard.

Alan Arroyo, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber, Tilo Wiedera

CoRR, 2019

Exploring Semi-Automatic Map Labeling.

Fabian Klute, Guangping Li, Raphael Löffler, Martin Nöllenburg, Manuela Schmidt

Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2019

Maximizing Ink in Partial Edge Drawings of k-plane Graphs.

Matthias Hummel, Fabian Klute, Soeren Nickel, Martin Nöllenburg

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Mixed Linear Layouts: Complexity, Heuristics, and Experiments.

Philipp de Col, Fabian Klute, Martin Nöllenburg

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Ecient Segment Folding is Hard.

Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka

Proceedings of the 31st Canadian Conference on Computational Geometry, 2019