Torsten Ueckerdt

About Torsten Ueckerdt

Torsten Ueckerdt, With an exceptional h-index of 20 and a recent h-index of 14 (since 2020), a distinguished researcher at Karlsruher Institut für Technologie,

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

Partitioning a Planar Graph into two Triangle-Forests

Recognition Complexity of Subgraphs of 2-and 3-Connected Planar Cubic Graphs

The Density Formula: One Lemma to Bound Them All

Colouring bottomless rectangles and arborescences

Directed acyclic outerplanar graphs have constant stack number

Polychromatic Colorings of Geometric Hypergraphs via Shallow Hitting Sets

Shallow Hitting Edge Sets in Uniform Hypergraphs

Axis-parallel right angle crossing graphs

Torsten Ueckerdt Information

University

Position

___

Citations(all)

1314

Citations(since 2020)

779

Cited By

869

hIndex(all)

20

hIndex(since 2020)

14

i10Index(all)

31

i10Index(since 2020)

18

Email

University Profile Page

Google Scholar

Top articles of Torsten Ueckerdt

Partitioning a Planar Graph into two Triangle-Forests

arXiv preprint arXiv:2401.15394

2024/1/27

Kolja Knauer
Kolja Knauer

H-Index: 12

Torsten Ueckerdt
Torsten Ueckerdt

H-Index: 13

Recognition Complexity of Subgraphs of 2-and 3-Connected Planar Cubic Graphs

2024

Paul Jungeblut
Paul Jungeblut

H-Index: 1

Torsten Ueckerdt
Torsten Ueckerdt

H-Index: 13

The Density Formula: One Lemma to Bound Them All

arXiv preprint arXiv:2311.06193

2023/11/10

Michael Kaufmann
Michael Kaufmann

H-Index: 10

Torsten Ueckerdt
Torsten Ueckerdt

H-Index: 13

Colouring bottomless rectangles and arborescences

Computational Geometry

2023/12/1

Directed acyclic outerplanar graphs have constant stack number

2023

Paul Jungeblut
Paul Jungeblut

H-Index: 1

Torsten Ueckerdt
Torsten Ueckerdt

H-Index: 13

Polychromatic Colorings of Geometric Hypergraphs via Shallow Hitting Sets

arXiv preprint arXiv:2310.19982

2023/10/30

Torsten Ueckerdt
Torsten Ueckerdt

H-Index: 13

Shallow Hitting Edge Sets in Uniform Hypergraphs

arXiv preprint arXiv:2307.05757

2023/7/7

Torsten Ueckerdt
Torsten Ueckerdt

H-Index: 13

Axis-parallel right angle crossing graphs

arXiv preprint arXiv:2306.17073

2023/6/29

Michael Kaufmann
Michael Kaufmann

H-Index: 10

Torsten Ueckerdt
Torsten Ueckerdt

H-Index: 13

Cops and Robber-When Capturing Is Not Surrounding

2023/6/28

On the complexity of embedding in graph products

arXiv preprint arXiv:2303.17028

2023/3/29

Clustered independence and bounded treewidth

arXiv preprint arXiv:2303.13655

2023/3/23

Kolja Knauer
Kolja Knauer

H-Index: 12

Torsten Ueckerdt
Torsten Ueckerdt

H-Index: 13

Primal-dual cops and robber

Computing in Geometry and Topology

2024/1

A sublinear bound on the page number of upward planar graphs

SIAM Journal on Discrete Mathematics

2023/12/31

Paul Jungeblut
Paul Jungeblut

H-Index: 1

Torsten Ueckerdt
Torsten Ueckerdt

H-Index: 13

Tight bound on treedepth in terms of pathwidth and longest path

Combinatorica

2023/12/19

Polychromatic colorings of unions of geometric hypergraphs

2022/6/22

Torsten Ueckerdt
Torsten Ueckerdt

H-Index: 13

An improved planar graph product structure theorem

Electronic J. Combinatorics

2022

Torsten Ueckerdt
Torsten Ueckerdt

H-Index: 13

David R. Wood
David R. Wood

H-Index: 24

Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs

2022/9/1

Paul Jungeblut
Paul Jungeblut

H-Index: 1

Torsten Ueckerdt
Torsten Ueckerdt

H-Index: 13

On comparable box dimension

arXiv preprint arXiv:2203.07686

2022/3/15

Torsten Ueckerdt
Torsten Ueckerdt

H-Index: 13

An Evaluation of Graph Algorithms for the Wind Farm Cable Layout Problem under Electrical Aspects

2021/8/31

Weak coloring numbers of intersection graphs

arXiv preprint arXiv:2103.17094

2021/3/31

Zdeněk Dvořák
Zdeněk Dvořák

H-Index: 7

Torsten Ueckerdt
Torsten Ueckerdt

H-Index: 13

See List of Professors in Torsten Ueckerdt University(Karlsruher Institut für Technologie)

Co-Authors

academic-engine