Christian Knauer

About Christian Knauer

Christian Knauer, With an exceptional h-index of 28 and a recent h-index of 15 (since 2020), a distinguished researcher at Universität Bayreuth, specializes in the field of Algorithms, Data structures, Complexity, Computational Geometry.

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

Geometric Assignment and Geometric Bottleneck

Geometric Matching and Bottleneck Problems

Parallel near-optimal pathfinding based on landmarks

Using landmarks for near-optimal pathfinding on the CPU and GPU

Corrigendum to: Approximating minimum-area rectangular and convex containers for packing convex polygons

Christian Knauer Information

University

Position

Institut für Informatik

Citations(all)

2552

Citations(since 2020)

780

Cited By

2118

hIndex(all)

28

hIndex(since 2020)

15

i10Index(all)

59

i10Index(since 2020)

28

Email

University Profile Page

Google Scholar

Christian Knauer Skills & Research Interests

Algorithms

Data structures

Complexity

Computational Geometry

Top articles of Christian Knauer

Geometric Assignment and Geometric Bottleneck

arXiv preprint arXiv:2310.02637

2023/10/4

Sergio Cabello
Sergio Cabello

H-Index: 18

Christian Knauer
Christian Knauer

H-Index: 16

Geometric Matching and Bottleneck Problems

arXiv e-prints

2023/10

Sergio Cabello
Sergio Cabello

H-Index: 18

Christian Knauer
Christian Knauer

H-Index: 16

Parallel near-optimal pathfinding based on landmarks

Computers & Graphics

2022/2/1

Christian Knauer
Christian Knauer

H-Index: 16

Michael Guthe
Michael Guthe

H-Index: 11

Using landmarks for near-optimal pathfinding on the CPU and GPU

2020

Christian Knauer
Christian Knauer

H-Index: 16

Michael Guthe
Michael Guthe

H-Index: 11

Corrigendum to: Approximating minimum-area rectangular and convex containers for packing convex polygons

Journal of Computational Geometry

2020

See List of Professors in Christian Knauer University(Universität Bayreuth)

Co-Authors

academic-engine