Fabian Klute

Fabian Klute

Universiteit Utrecht

H-index: 9

Europe-Netherlands

About Fabian Klute

Fabian Klute, With an exceptional h-index of 9 and a recent h-index of 8 (since 2020), a distinguished researcher at Universiteit Utrecht, specializes in the field of Computational geometry, Graph drawing, Parametrized complexity.

His recent articles reflect a diverse array of research interests and contributions to the field:

Faces in Rectilinear Drawings of Complete Graphs

On -Plane Insertion into Plane Drawings

Barking dogs: A Fr\'echet distance variant for detour detection

Inserting one edge into a simple drawing is hard

Minimum link fencing

On streaming algorithms for geometric independent set and clique

On Fully Diverse Sets of Geometric Objects and Graphs

Efficient segment folding is hard

Fabian Klute Information

University

Position

___

Citations(all)

201

Citations(since 2020)

192

Cited By

42

hIndex(all)

9

hIndex(since 2020)

8

i10Index(all)

7

i10Index(since 2020)

6

Email

University Profile Page

Google Scholar

Fabian Klute Skills & Research Interests

Computational geometry

Graph drawing

Parametrized complexity

Top articles of Fabian Klute

Faces in Rectilinear Drawings of Complete Graphs

2024

Fabian Klute
Fabian Klute

H-Index: 3

Josef Tkadlec
Josef Tkadlec

H-Index: 6

On -Plane Insertion into Plane Drawings

arXiv preprint arXiv:2402.14552

2024/2/22

Barking dogs: A Fr\'echet distance variant for detour detection

arXiv preprint arXiv:2402.13159

2024/2/20

Inserting one edge into a simple drawing is hard

Discrete & Computational Geometry

2023/4

Minimum link fencing

arXiv preprint arXiv:2209.14804

2022/9/29

On streaming algorithms for geometric independent set and clique

2022/9/8

Fabian Klute
Fabian Klute

H-Index: 3

On Fully Diverse Sets of Geometric Objects and Graphs

2022/6/22

Fabian Klute
Fabian Klute

H-Index: 3

Marc Van Kreveld
Marc Van Kreveld

H-Index: 24

Efficient segment folding is hard

Computational Geometry

2022/6/1

Labeling nonograms: Boundary labeling for curve arrangements

Computational Geometry

2021/10/1

Local complexity of polygons

arXiv preprint arXiv:2101.07554

2021/1/19

Fabian Klute
Fabian Klute

H-Index: 3

Tillmann Miltzow
Tillmann Miltzow

H-Index: 11

On Strict (Outer-) Confluent Graphs.

J. Graph Algorithms Appl.

2021

Edge-Minimum Saturated k-Planar Drawings

2021

Balanced independent and dominating sets on colored interval graphs

2021

On structural parameterizations of the bounded-degree vertex deletion problem

Algorithmica

2021/1

Robert Ganian
Robert Ganian

H-Index: 16

Fabian Klute
Fabian Klute

H-Index: 3

Crossing-optimal extension of simple drawings

arXiv preprint arXiv:2012.07457

2020/12/14

Saturated -Plane Drawings with Few Edges

arXiv preprint arXiv:2012.02281

2020/12/3

Fabian Klute
Fabian Klute

H-Index: 3

Irene Parada
Irene Parada

H-Index: 4

Extending nearly complete 1-planar drawings in polynomial time

arXiv preprint arXiv:2007.05346

2020/7/8

Finding large matchings in 1-planar graphs of minimum degree 3

2020/6/24

Therese Biedl
Therese Biedl

H-Index: 14

Fabian Klute
Fabian Klute

H-Index: 3

Extending partial 1-planar drawings

arXiv preprint arXiv:2004.12222

2020/4/25

Four pages are indeed necessary for planar graphs

arXiv preprint arXiv:2004.07630

2020/4/16

See List of Professors in Fabian Klute University(Universiteit Utrecht)

Co-Authors

academic-engine