Fabian Klute

Orcid: 0000-0002-7791-3604

Affiliations:
  • Utrecht University, The Netherlands


According to our database1, Fabian Klute authored at least 26 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On k-Plane Insertion into Plane Drawings.
CoRR, 2024

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

2023
Inserting One Edge into a Simple Drawing is Hard.
Discret. Comput. Geom., April, 2023

2022
Efficient segment folding is hard.
Comput. Geom., 2022

On Fully Diverse Sets of Geometric Objects and Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

On Streaming Algorithms for Geometric Independent Set and Clique.
Proceedings of the Approximation and Online Algorithms - 20th International Workshop, 2022

Minimum Link Fencing.
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

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

2021
On Strict (Outer-)Confluent Graphs.
J. Graph Algorithms Appl., 2021

Local Complexity of Polygons.
CoRR, 2021

Labeling nonograms: Boundary labeling for curve arrangements.
Comput. Geom., 2021

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

Balanced Independent and Dominating Sets on Colored Interval Graphs.
Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

Crossing-Optimal Extension of Simple Drawings.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Edge-Minimum Saturated k-Planar Drawings.
Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

2020
Four Pages Are Indeed Necessary for Planar Graphs.
J. Comput. Geom., 2020

Saturated k-Plane Drawings with Few Edges.
CoRR, 2020

Finding Large Matchings in 1-Planar Graphs of Minimum Degree 3.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

Extending Nearly Complete 1-Planar Drawings in Polynomial Time.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Extending Partial 1-Planar Drawings.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019
Minimizing crossings in constrained two-sided circular graph layouts.
J. Comput. Geom., 2019

Extending simple drawings with one edge is hard.
CoRR, 2019

Exploring Semi-Automatic Map Labeling.
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.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Mixed Linear Layouts: Complexity, Heuristics, and Experiments.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Ecient Segment Folding is Hard.
Proceedings of the 31st Canadian Conference on Computational Geometry, 2019


  Loading...