Matthias Bentert

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 65

Top Topics

Strongly Connected Components

Correlation Clustering

Betweenness Centrality

Parameterized Complexity

Top Venues

J. Comput. Syst. Sci.

Publications

Matthias Bentert, Fedor V. Fomin, Petr A. Golovach
Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths. CoRR (2024)
Yosuke Mizutani, Daniel Coimbra Salomao, Alex Crane, Matthias Bentert, Pål Grønås Drange, Felix Reidl, Alan Kuntz, Blair D. Sullivan
Leveraging Fixed-Parameter Tractability for Robot Inspection Planning. CoRR (2024)
Matthias Bentert, Michael R. Fellows, Petr A. Golovach, Frances A. Rosamond, Saket Saurabh
Breaking a Graph into Connected Components with Small Dominating Sets. MFCS (2024)
Matthias Bentert, Alex Crane, Pål Grønås Drange, Felix Reidl, Blair D. Sullivan
Correlation Clustering with Vertex Splitting. SWAT (2024)
Matthias Bentert, Alex Crane, Pål Grønås Drange, Felix Reidl, Blair D. Sullivan
Correlation Clustering with Vertex Splitting. CoRR (2024)
Matthias Bentert, Klaus Heeger, Tomohiro Koana
Fully Polynomial-time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication. CoRR (2024)
Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen
Two-Sets Cut-Uncut on Planar Graphs. ICALP (2024)
Matthias Bentert, Leon Kellerhals, Rolf Niedermeier
The Structural Complexity Landscape of Finding Balance-Fair Shortest Paths. CoRR (2024)
Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen
Two-sets cut-uncut on planar graphs. CoRR (2023)
Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier
A multivariate complexity analysis of the material consumption scheduling problem. J. Sched. 26 (4) (2023)
Matthias Bentert, Leon Kellerhals, Rolf Niedermeier
Fair Short Paths in Vertex-Colored Graphs. AAAI (2023)
Matthias Bentert, Klaus Heeger, Tomohiro Koana
Fully Polynomial-Time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication. ESA (2023)
Matthias Bentert, Tomohiro Koana, Rolf Niedermeier
The complexity of gerrymandering over graphs: Paths and trees. Discret. Appl. Math. 324 (2023)
Matthias Bentert, René van Bevern, Till Fluschnik, André Nichterlein, Rolf Niedermeier
Polynomial-time data reduction for weighted problems beyond additive goal functions. Discret. Appl. Math. 328 (2023)
Matthias Bentert, Jannik Schestag, Frank Sommer
On the Complexity of Finding a Sparse Connected Spanning Subgraph in a non-Uniform Failure Model. CoRR (2023)
Matthias Bentert, André Nichterlein
Parameterized Complexity of Diameter. Algorithmica 85 (2) (2023)
Matthias Bentert, André Nichterlein, Malte Renken, Philipp Zschoche
Using a Geometric Lens to Find \(\boldsymbol{k}\)-Disjoint Shortest Paths. SIAM J. Discret. Math. 37 (3) (2023)
Matthias Bentert, Niclas Boehmer, Klaus Heeger, Tomohiro Koana
Stable matching with multilayer approval preferences: Approvals can be harder than strict preferences. Games Econ. Behav. 142 (2023)
Emmanuel Arrighi, Matthias Bentert, Pål Grønås Drange, Blair D. Sullivan, Petra Wolf
Cluster Editing with Overlapping Communities. IPEC (2023)
Matthias Bentert, Jannik Schestag, Frank Sommer
On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model. IPEC (2023)
Matthias Bentert, Niclas Boehmer, Klaus Heeger, Tomohiro Koana
Stable Matching with Multilayer Approval Preferences: Approvals Can Be Harder Than Strict Preferences. SAGT (2022)
Matthias Bentert, Leon Kellerhals, Rolf Niedermeier
The structural complexity landscape of finding balance-fair shortest paths. Theor. Comput. Sci. 933 (2022)
Matthias Bentert, Niclas Boehmer, Maciej Rymar, Henri Tannenberg
Who won? Winner Determination and Robustness in Liquid Democracy. CoRR (2022)
Matthias Bentert, Klaus Heeger, Dusan Knop
Length-bounded cuts: Proper interval graphs and structural parameters. J. Comput. Syst. Sci. 126 (2022)
Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier, Pavel V. Smirnov
Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments. INFORMS J. Comput. 34 (1) (2022)
Matthias Bentert, Niclas Boehmer, Klaus Heeger, Tomohiro Koana
Stable Matching with Multilayer Approval Preferences: Approvals can be Harder than Strict Preferences. CoRR (2022)
Matthias Bentert, Leon Kellerhals, Rolf Niedermeier
Finding Balance-Fair Short Paths in Graphs. CoRR (2022)
Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier
A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem. AAAI (2021)
Luis Müller, Matthias Bentert
On Reachable Assignments in Cycles. ADT (2021)
Matthias Bentert, Tomohiro Koana, Rolf Niedermeier
The Complexity of Gerrymandering Over Graphs: Paths and Trees. CoRR (2021)
Matthias Bentert, Mathias Weller
Tree Containment With Soft Polytomies. J. Graph Algorithms Appl. 25 (1) (2021)
Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier
A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem. CoRR (2021)
Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein
Correction to: Parameterized Complexity of Min-Power Asymmetric Connectivity. Theory Comput. Syst. 65 (7) (2021)
Matthias Bentert, Tomohiro Koana, Rolf Niedermeier
The Complexity of Gerrymandering over Graphs: Paths and Trees. WG (2021)
Matthias Bentert, André Nichterlein, Malte Renken, Philipp Zschoche
Using a Geometric Lens to Find k Disjoint Shortest Paths. ICALP (2021)
Matthias Bentert, Klaus Heeger, Dusan Knop
Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters. ISAAC (2020)
Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein
Parameterized Complexity of Min-Power Asymmetric Connectivity. CoRR (2020)
Matthias Bentert, Piotr Skowron
Comparing Election Methods Where Each Voter Ranks Only Few Candidates. AAAI (2020)
Matthias Bentert, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier
Efficient computation of optimal temporal walks under waiting-time constraints. Appl. Netw. Sci. 5 (1) (2020)
Luis Müller, Matthias Bentert
On Reachable Assignments in Cycles and Cliques. CoRR (2020)
Matthias Bentert, André Nichterlein, Malte Renken, Philipp Zschoche
Using a geometric lens to find k disjoint shortest paths. CoRR (2020)
Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality. J. Graph Algorithms Appl. 24 (3) (2020)
Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein
Parameterized Complexity of Min-Power Asymmetric Connectivity. Theory Comput. Syst. 64 (7) (2020)
Anne-Sophie Himmel, Matthias Bentert, André Nichterlein, Rolf Niedermeier
Efficient Computation of Optimal Temporal Walks under Waiting-Time Constraints. CoRR (2019)
Matthias Bentert, Klaus Heeger, Dusan Knop
Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters. CoRR (2019)
Matthias Bentert, André Nichterlein
Parameterized Complexity of Diameter. CIAC (2019)
Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier
Parameterized aspects of triangle enumeration. J. Comput. Syst. Sci. 103 (2019)
Matthias Bentert, René van Bevern, Rolf Niedermeier
Inductive $$k$$ k -independent graphs and c-colorable subgraphs in scheduling: a review. J. Sched. 22 (1) (2019)
Anne-Sophie Himmel, Matthias Bentert, André Nichterlein, Rolf Niedermeier
Efficient Computation of Optimal Temporal Walks Under Waiting-Time Constraints. COMPLEX NETWORKS (2) (2019)
Matthias Bentert, René van Bevern, Till Fluschnik, André Nichterlein, Rolf Niedermeier
Polynomial-Time Preprocessing for Weighted Problems Beyond Additive Goal Functions. CoRR (2019)
Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher
-Plexes in Temporal Graphs. ACM J. Exp. Algorithmics 24 (1) (2019)
Matthias Bentert, Piotr Skowron
Comparing Election Methods Where Each Voter Ranks Only Few Candidates. CoRR (2019)
Matthias Bentert, Jiehua Chen, Vincent Froese, Gerhard J. Woeginger
Good Things Come to Those Who Swap Objects on Paths. CoRR (2019)
Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein
Parameterized Complexity of Min-Power Asymmetric Connectivity. IWOCA (2019)
Matthias Bentert, Josef Malík, Mathias Weller
Tree Containment With Soft Polytomies. SWAT (2018)
Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality. ISAAC (2018)
Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher
Listing All Maximal k-Plexes in Temporal Graphs. CoRR (2018)
Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier
Towards Improving Brandes' Algorithm for Betweenness Centrality. CoRR (2018)
Matthias Bentert, André Nichterlein
Parameterized Complexity of Diameter. CoRR (2018)
Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher
Listing All Maximal k-Plexes in Temporal Graphs. ASONAM (2018)
Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier
Parameterized Aspects of Triangle Enumeration. FCT (2017)
Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier
Parameterized algorithms for power-efficient connected symmetric wireless sensor networks. CoRR (2017)
Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier
Parameterized Aspects of Triangle Enumeration. CoRR (2017)
Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier
Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks. ALGOSENSORS (2017)
Matthias Bentert, René van Bevern, Rolf Niedermeier
(Wireless) Scheduling, Graph Classes, and c-Colorable Subgraphs. CoRR (2017)