Matthias Bentert

University of Bergen — Norway

Computer Science · Physical Sciences

6h-index192citations75works0.22yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Advanced Graph Theory Research(38), Complexity and Algorithms in Graphs(24), Interconnection Networks and Systems(11), Game Theory and Voting Systems(11), Optimization and Search Problems(10)

Publications75 total

Density Matters: A Complexity Dichotomy of Deleting Edges to Bound Subgraph Density
arXiv (Cornell University)·2026Open Access
Density Matters: A Complexity Dichotomy of Deleting Edges to Bound Subgraph Density
ArXiv.org·2026Open Access
Fast Re-Routing in Networks: On the Complexity of Perfect Resilience
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2026Open Access
When Does FTP Become FPT?
Lecture notes in computer science·2026
The Directed Disjoint Paths Problem with Congestion
Society for Industrial and Applied Mathematics eBooks·2026
The parameterized complexity landscape of two-sets cut-uncut
Theoretical Computer Science·2025Open Access
Packing Short Cycles
ACM Transactions on Algorithms·2025Open Access
How to Resolve Envy by Adding Goods
2025
How to Resolve Envy by Adding Goods
arXiv (Cornell University)·2025Open Access
The Directed Disjoint Paths Problem with Congestion
arXiv (Cornell University)·2025Open Access
Overlapping Biclustering
arXiv (Cornell University)·2025Open Access
Cluster Editing with Vertex Splitting
Discrete Applied Mathematics·2025· 3 citedOpen Access
Planar Network Diversion
arXiv (Cornell University)·2025Open Access
Exponential-Time Approximation (Schemes) for Vertex-Ordering Problems
arXiv (Cornell University)·2025Open Access
Packing Short Cycles
Society for Industrial and Applied Mathematics eBooks·2025
A Space-Efficient Algebraic Approach to Robotic Motion Planning
Society for Industrial and Applied Mathematics eBooks·2025
Correlation Clustering with Vertex Splitting
SSRN Electronic Journal·2025Open Access
The Parameterized Complexity Landscape of Two-Sets Cut-Uncut
SSRN Electronic Journal·2025Open Access
On the Complexity of Minimum Membership Dominating Set
Lecture notes in computer science·2025· 3 cited
Fault-Tolerant Matroid Bases
arXiv (Cornell University)·2025Open Access
page 1 of 4Next →

Frequent Co-authors

Rolf Niedermeier(24), André Nichterlein(19), Tomohiro Koana(8), Leon Kellerhals(7), Klaus Heeger(5), René van Bevern(5), Fedor V. Fomin(5), Anne-Sophie Himmel(4), Till Fluschnik(4), Saket Saurabh(4), Petr A. Golovach(4), Tuukka Korhonen(4), Roman Haag(3), Dušan Knop(3), Alexander J. Dittmann(3), Robert Bredereck(3), Péter Györgyi(3), Andrzej Kaczmarczyk(3), Pål Grønås Drange(3), William Lochet(3)