Scholar
Matthias Bentert
Google Scholar ID: l3YerMsAAAAJ
UiB
Theoretical Computer Science
Algorithmic Graph Theory
Fine-Grained Hardness
Follow
Google Scholar
↗
Citations & Impact
All-time
Citations
429
H-index
12
i10-index
14
Publications
20
Co-authors
12
list available
Publications
19 items
Routing Multiple Agents Below the Sum of Distances
2026
Cited
0
The Carrier Pigeon Internet Protocol: An Algorithmic (and Lighthearted) Perspective
2026
Cited
0
A Separation Between Optimal Demand-Oblivious and Demand-Aware Network Throughput
2026
Cited
0
A Framework for Parameterized Subexponential-Subcubic-Time Algorithms for Weighted Problems in Planar Graphs
2026
Cited
0
Perfect Network Resilience in Polynomial Time
2026
Cited
0
Complexity of Perfect and Ideal Resilience Verification in Fast Re-Route Networks
arXiv.org · 2026
Cited
0
Density Matters: A Complexity Dichotomy of Deleting Edges to Bound Subgraph Density
arXiv.org · 2026
Cited
0
Line Cover and Related Problems
2025
Cited
0
Load more
Co-authors
9 total
Rolf Niedermeier
TU Berlin
André Nichterlein
TU Berlin
Leon Kellerhals
TU Clausthal
Tomohiro Koana
Keio University
Till Fluschnik
HU Berlin
Piotr Skowron
University of Warsaw
Mathias Weller
LIGM, Paris, France
Dusan Knop
Czech Technical University in Prague
