Tillmann Miltzow

About Tillmann Miltzow

Tillmann Miltzow, With an exceptional h-index of 16 and a recent h-index of 16 (since 2020), a distinguished researcher at Universiteit Utrecht, specializes in the field of Computational geometry.

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

On classifying continuous constraint satisfaction problems

Recognition of Unit Segment and Polyline Graphs is -Complete

The complexity of the Hausdorff distance

Geometric Thickness of Multigraphs is -complete

The Complexity of Recognizing Geometric Hypergraphs

Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain

Token swapping on trees

Representing Matroids over the Reals is -complete

Tillmann Miltzow Information

University

Position

___

Citations(all)

845

Citations(since 2020)

685

Cited By

364

hIndex(all)

16

hIndex(since 2020)

16

i10Index(all)

26

i10Index(since 2020)

22

Email

University Profile Page

Google Scholar

Tillmann Miltzow Skills & Research Interests

Computational geometry

Top articles of Tillmann Miltzow

On classifying continuous constraint satisfaction problems

TheoretiCS

2024/4/16

Tillmann Miltzow
Tillmann Miltzow

H-Index: 11

Recognition of Unit Segment and Polyline Graphs is -Complete

arXiv preprint arXiv:2401.02172

2024/1/4

The complexity of the Hausdorff distance

Discrete & Computational Geometry

2023/9/27

Paul Jungeblut
Paul Jungeblut

H-Index: 1

Tillmann Miltzow
Tillmann Miltzow

H-Index: 11

Geometric Thickness of Multigraphs is -complete

arXiv preprint arXiv:2312.05010

2023/12/8

The Complexity of Recognizing Geometric Hypergraphs

2023/9/20

Tillmann Miltzow
Tillmann Miltzow

H-Index: 11

Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain

arXiv preprint arXiv:2303.00666

2023/3/1

Tillmann Miltzow
Tillmann Miltzow

H-Index: 11

Token swapping on trees

Discrete Mathematics & Theoretical Computer Science

2023/1/18

Representing Matroids over the Reals is -complete

arXiv preprint arXiv:2301.03221

2023/1/9

Eunjung Kim
Eunjung Kim

H-Index: 1

Tillmann Miltzow
Tillmann Miltzow

H-Index: 11

Sometimes two irrational guards are needed

arXiv preprint arXiv:2212.01211

2022/12/2

Tillmann Miltzow
Tillmann Miltzow

H-Index: 11

Avoider-enforcer game is np-hard

arXiv preprint arXiv:2208.06687

2022/8/13

Tillmann Miltzow
Tillmann Miltzow

H-Index: 11

Miloš Stojaković
Miloš Stojaković

H-Index: 8

Training Fully Connected Neural Networks is -Complete

2023

Paul Jungeblut
Paul Jungeblut

H-Index: 1

Tillmann Miltzow
Tillmann Miltzow

H-Index: 11

The complexity of drawing a graph in a polygonal region

2018

Topological Art in Simple Galleries

2022

Tillmann Miltzow
Tillmann Miltzow

H-Index: 11

Between shapes, using the Hausdorff distance

Computational Geometry

2022/1/1

Training neural networks is ER-complete

Advances in Neural Information Processing Systems

2021/12/6

Mikkel Abrahamsen
Mikkel Abrahamsen

H-Index: 7

Tillmann Miltzow
Tillmann Miltzow

H-Index: 11

On the VC-dimension of half-spaces with respect to convex sets

Discrete Mathematics & Theoretical Computer Science

2021/8/19

Tillmann Miltzow
Tillmann Miltzow

H-Index: 11

Geometric Embeddability of Complexes is -complete

2021/8/5

Mikkel Abrahamsen
Mikkel Abrahamsen

H-Index: 7

Tillmann Miltzow
Tillmann Miltzow

H-Index: 11

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

A Practical Algorithm with Performance Guarantees for the Art Gallery Problem

arXiv preprint arXiv:2007.06920

2020/7/14

Tillmann Miltzow
Tillmann Miltzow

H-Index: 11

See List of Professors in Tillmann Miltzow University(Universiteit Utrecht)

Co-Authors

academic-engine