Matthias Bentert
Scholar

Matthias Bentert

Google Scholar ID: l3YerMsAAAAJ
UiB
Theoretical Computer ScienceAlgorithmic Graph TheoryFine-Grained Hardness
Google Scholar↗
Citations & Impact
All-time
Citations
429
 
H-index
12
 
i10-index
14
 
Publications
20
 
Co-authors
12
list available
Contact
No contact links provided.
Publications
16 items
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
How to Resolve Envy by Adding Goods
2025
Cited
0
The Directed Disjoint Paths Problem with Congestion
2025
Cited
0
Fault-Tolerant Matroid Bases
2025
Cited
0
Resume (English only)
Co-authors
12 total
Rolf Niedermeier
Rolf Niedermeier
TU Berlin
André Nichterlein
André Nichterlein
TU Berlin
Co-author 3
Co-author 3
Leon Kellerhals
Leon Kellerhals
TU Clausthal
Tomohiro Koana
Tomohiro Koana
Keio University
Till Fluschnik
Till Fluschnik
HU Berlin
Piotr Skowron
Piotr Skowron
University of Warsaw
Co-author 8
Co-author 8