Matthias Bentert

According to our database, Matthias Bentert authored at least 56 papers between 2017 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

The Directed Disjoint Paths Problem with Congestion.

Matthias Bentert, Dario Cavallaro, Amelie Heindl, Ken-ichi Kawarabayashi, Stephan Kreutzer, Johannes Schröder

CoRR, July, 2025

Structural Optimal Jacobian Accumulation and Minimum Edge Count are NP-Complete Under Vertex Elimination.

Matthias Bentert, Alex Crane, Pål Grønås Drange, Yosuke Mizutani, Blair D. Sullivan

CoRR, June, 2025

When does FTP become FPT?

Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Laure Morelle

CoRR, June, 2025

Overlapping Biclustering.

Matthias Bentert, Pål Grønås Drange, Erlend Haugen

CoRR, May, 2025

Planar Network Diversion Source Code.

Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Steinar Simonnes

Dataset, May, 2025

Conference Spotlight: ITCS and SODA.

Matthias Bentert

Bull. EATCS, 2025

Planar Network Diversion.

Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Steinar Simonnes

Proceedings of the 23rd International Symposium on Experimental Algorithms, 2025

Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths.

Matthias Bentert, Fedor V. Fomin, Petr A. Golovach

Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

On the Complexity of Minimum Membership Dominating Set.

D. Karthika, R. Muthucumaraswamy, Matthias Bentert, Sriram Bhyravarapu, Saket Saurabh, Sanjay Seetharaman

Proceedings of the SOFSEM 2025: Theory and Practice of Computer Science, 2025

Packing Short Cycles.

Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Exponential-Time Approximation (Schemes) for Vertex-Ordering Problems.

Matthias Bentert, Fedor V. Fomin, Tanmay Inamdar, Saket Saurabh

Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

How to Resolve Envy by Adding Goods.

Matthias Bentert, Robert Bredereck, Eva Michelle Deltl, Pallavi Jain, Leon Kellerhals

Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, 2025

Fault-Tolerant Matroid Bases.

Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Laure Morelle

Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations.

Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan, Saket Saurabh

Proceedings of the 41st International Symposium on Computational Geometry, 2025

2024

Graph Inspection for Robotic Motion Planning: Do Arithmetic Circuits Help?

Matthias Bentert, Daniel Coimbra Salomao, Alex Crane, Yosuke Mizutani, Felix Reidl, Blair D. Sullivan

CoRR, 2024

Leveraging Fixed-Parameter Tractability for Robot Inspection Planning.

Yosuke Mizutani, Daniel Coimbra Salomao, Alex Crane, Matthias Bentert, Pål Grønås Drange, Felix Reidl, Alan Kuntz, Blair D. Sullivan

CoRR, 2024

Correlation Clustering with Vertex Splitting.

Matthias Bentert, Alex Crane, Pål Grønås Drange, Felix Reidl, Blair D. Sullivan

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Breaking a Graph into Connected Components with Small Dominating Sets.

Matthias Bentert, Michael R. Fellows, Petr A. Golovach, Frances A. Rosamond, Saket Saurabh

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

PACE Solver Description: LUNCH - Linear Uncrossing Heuristics.

Kenneth Langedal, Matthias Bentert, Thorgal Blanco, Pål Grønås Drange

Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

The Parameterized Complexity Landscape of Two-Sets Cut-Uncut.

Matthias Bentert, Fedor V. Fomin, Fanny Hauser, Saket Saurabh

Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

Two-Sets Cut-Uncut on Planar Graphs.

Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023

Using a Geometric Lens to Find \(\boldsymbol{k}\)-Disjoint Shortest Paths.

Matthias Bentert, André Nichterlein, Malte Renken, Philipp Zschoche

SIAM J. Discret. Math., September, 2023

Polynomial-time data reduction for weighted problems beyond additive goal functions.

Matthias Bentert, René van Bevern, Till Fluschnik, André Nichterlein, Rolf Niedermeier

Discret. Appl. Math., March, 2023

On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model.

Matthias Bentert, Jannik Schestag, Frank Sommer

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Cluster Editing with Overlapping Communities.

Emmanuel Arrighi, Matthias Bentert, Pål Grønås Drange, Blair D. Sullivan, Petra Wolf

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Fully Polynomial-Time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication.

Matthias Bentert, Klaus Heeger, Tomohiro Koana

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Fair Short Paths in Vertex-Colored Graphs.

Matthias Bentert, Leon Kellerhals, Rolf Niedermeier

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

The structural complexity landscape of finding balance-fair shortest paths.

Matthias Bentert, Leon Kellerhals, Rolf Niedermeier

Theor. Comput. Sci., 2022

Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments.

Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier, Pavel V. Smirnov

INFORMS J. Comput., 2022

Who won? Winner Determination and Robustness in Liquid Democracy.

Matthias Bentert, Niclas Boehmer, Maciej Rymar, Henri Tannenberg

CoRR, 2022

Finding Balance-Fair Short Paths in Graphs.

Matthias Bentert, Leon Kellerhals, Rolf Niedermeier

CoRR, 2022

Stable Matching with Multilayer Approval Preferences: Approvals Can Be Harder Than Strict Preferences.

Matthias Bentert, Niclas Boehmer, Klaus Heeger, Tomohiro Koana

Proceedings of the Algorithmic Game Theory - 15th International Symposium, 2022

2021

Elements of dynamic and 2-SAT programming: paths, trees, and cuts.

Matthias Bentert

PhD thesis, 2021

Correction to: Parameterized Complexity of Min-Power Asymmetric Connectivity.

Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein

Theory Comput. Syst., 2021

Tree Containment With Soft Polytomies.

Matthias Bentert, Mathias Weller

J. Graph Algorithms Appl., 2021

The Complexity of Gerrymandering over Graphs: Paths and Trees.

Matthias Bentert, Tomohiro Koana, Rolf Niedermeier

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

Using a Geometric Lens to Find k Disjoint Shortest Paths.

Matthias Bentert, André Nichterlein, Malte Renken, Philipp Zschoche

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

On Reachable Assignments in Cycles.

Luis Müller, Matthias Bentert

Proceedings of the Algorithmic Decision Theory - 7th International Conference, 2021

A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem.

Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

On Reachable Assignments in Cycles and Cliques.

Luis Müller, Matthias Bentert

CoRR, 2020

Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters.

Matthias Bentert, Klaus Heeger, Dusan Knop

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Comparing Election Methods Where Each Voter Ranks Only Few Candidates.

Matthias Bentert, Piotr Skowron

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Inductive $$k$$ k -independent graphs and c-colorable subgraphs in scheduling: a review.

Matthias Bentert, René van Bevern, Rolf Niedermeier

J. Sched., 2019

Listing All Maximal <i>k</i>-Plexes in Temporal Graphs.

Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher

ACM J. Exp. Algorithmics, 2019

Polynomial-Time Preprocessing for Weighted Problems Beyond Additive Goal Functions.

Matthias Bentert, René van Bevern, Till Fluschnik, André Nichterlein, Rolf Niedermeier

CoRR, 2019

Good Things Come to Those Who Swap Objects on Paths.

Matthias Bentert, Jiehua Chen, Vincent Froese, Gerhard J. Woeginger

CoRR, 2019

Parameterized Complexity of Min-Power Asymmetric Connectivity.

Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

Efficient Computation of Optimal Temporal Walks Under Waiting-Time Constraints.

Anne-Sophie Himmel, Matthias Bentert, André Nichterlein, Rolf Niedermeier

Proceedings of the Complex Networks and Their Applications VIII, 2019

Parameterized Complexity of Diameter.

Matthias Bentert, André Nichterlein

Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018

Towards Improving Brandes' Algorithm for Betweenness Centrality.

Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier

CoRR, 2018

Tree Containment With Soft Polytomies.

Matthias Bentert, Josef Malík, Mathias Weller

Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

An Adaptive Version of Brandes' Algorithm for Betweenness Centrality.

Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Listing All Maximal k-Plexes in Temporal Graphs.

Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher

Proceedings of the IEEE/ACM 2018 International Conference on Advances in Social Networks Analysis and Mining, 2018

2017

(Wireless) Scheduling, Graph Classes, and c-Colorable Subgraphs.

Matthias Bentert, René van Bevern, Rolf Niedermeier

CoRR, 2017

Parameterized Aspects of Triangle Enumeration.

Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier

Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks.

Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier

Proceedings of the Algorithms for Sensor Systems, 2017