Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks. - Matthias Bentert; René van Bevern; André Nichterlein; Rolf Niedermeier (ALGOSENSORS, 2017)

(Wireless) Scheduling, Graph Classes, and c-Colorable Subgraphs. - Matthias Bentert; René van Bevern; Rolf Niedermeier (CoRR, 2017)

Listing All Maximal k-Plexes in Temporal Graphs. - Matthias Bentert; Anne-Sophie Himmel; Hendrik Molter; Marco Morik; Rolf Niedermeier; René Saitenmacher (ASONAM, 2018)

Tree Containment With Soft Polytomies. - Matthias Bentert; Josef Malík; Mathias Weller (SWAT, 2018)

Towards Improving Brandes' Algorithm for Betweenness Centrality. - Matthias Bentert; Alexander Dittmann; Leon Kellerhals; André Nichterlein; Rolf Niedermeier (CoRR, 2018)

Good Things Come to Those Who Swap Objects on Paths. - Matthias Bentert; Jiehua Chen 001; Vincent Froese; Gerhard J. Woeginger (CoRR, 2019)

Polynomial-Time Preprocessing for Weighted Problems Beyond Additive Goal Functions. - Matthias Bentert; René van Bevern; Till Fluschnik; André Nichterlein; Rolf Niedermeier (CoRR, 2019)

Parameterized aspects of triangle enumeration. - Matthias Bentert; Till Fluschnik; André Nichterlein; Rolf Niedermeier (J. Comput. Syst. Sci., 2019)

Listing All Maximal k-Plexes in Temporal Graphs. - Matthias Bentert; Anne-Sophie Himmel; Hendrik Molter; Marco Morik; Rolf Niedermeier; René Saitenmacher (ACM J. Exp. Algorithmics, 2019)

Inductive $$k$$ k -independent graphs and c-colorable subgraphs in scheduling: a review. - Matthias Bentert; René van Bevern; Rolf Niedermeier (J. Sched., 2019)

Comparing Election Methods Where Each Voter Ranks Only Few Candidates. - Matthias Bentert; Piotr Skowron 001 (AAAI, 2020)

Efficient computation of optimal temporal walks under waiting-time constraints. - Matthias Bentert; Anne-Sophie Himmel; André Nichterlein; Rolf Niedermeier (Appl. Netw. Sci., 2020)

On Reachable Assignments in Cycles and Cliques. - Luis Müller; Matthias Bentert (CoRR, 2020)

An Adaptive Version of Brandes' Algorithm for Betweenness Centrality. - Matthias Bentert; Alexander Dittmann; Leon Kellerhals; André Nichterlein; Rolf Niedermeier (J. Graph Algorithms Appl., 2020)

Parameterized Complexity of Min-Power Asymmetric Connectivity. - Matthias Bentert; Roman Haag; Christian Hofer; Tomohiro Koana; André Nichterlein (Theory Comput. Syst., 2020)

On Reachable Assignments in Cycles. - Luis Müller; Matthias Bentert (ADT, 2021)

Using a Geometric Lens to Find k Disjoint Shortest Paths. - Matthias Bentert; André Nichterlein; Malte Renken; Philipp Zschoche (ICALP, 2021)

Tree Containment With Soft Polytomies. - Matthias Bentert; Mathias Weller (J. Graph Algorithms Appl., 2021)

Correction to: Parameterized Complexity of Min-Power Asymmetric Connectivity. - Matthias Bentert; Roman Haag; Christian Hofer; Tomohiro Koana; André Nichterlein (Theory Comput. Syst., 2021)

Elements of dynamic and 2-SAT programming: paths, trees, and cuts. - Matthias Bentert (2021)

Finding Balance-Fair Short Paths in Graphs. - Matthias Bentert; Leon Kellerhals; Rolf Niedermeier (CoRR, 2022)

Who won? Winner Determination and Robustness in Liquid Democracy. - Matthias Bentert; Niclas Boehmer; Maciej Rymar; Henri Tannenberg (CoRR, 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)

Length-bounded cuts: Proper interval graphs and structural parameters. - Matthias Bentert; Klaus Heeger; Dusan Knop (J. Comput. Syst. Sci., 2022)

The structural complexity landscape of finding balance-fair shortest paths. - Matthias Bentert; Leon Kellerhals; Rolf Niedermeier (Theor. Comput. Sci., 2022)

Fair Short Paths in Vertex-Colored Graphs. - Matthias Bentert; Leon Kellerhals; Rolf Niedermeier (AAAI, 2023)

Fully Polynomial-Time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication. - Matthias Bentert; Klaus Heeger; Tomohiro Koana (ESA, 2023)

Cluster Editing with Overlapping Communities. - Emmanuel Arrighi; Matthias Bentert; Pål Grønås Drange; Blair D. Sullivan; Petra Wolf 002 (IPEC, 2023)

On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model. - Matthias Bentert; Jannik Schestag; Frank Sommer (IPEC, 2023)

The complexity of gerrymandering over graphs: Paths and trees. - Matthias Bentert; Tomohiro Koana; Rolf Niedermeier (Discret. Appl. Math., 2023)

Parameterized Complexity of Diameter. - Matthias Bentert; André Nichterlein (Algorithmica, 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., 2023)

A multivariate complexity analysis of the material consumption scheduling problem. - Matthias Bentert; Robert Bredereck; Péter Györgyi; Andrzej Kaczmarczyk 001; Rolf Niedermeier (J. Sched., 2023)

Using a Geometric Lens to Find ( boldsymbol{k} )-Disjoint Shortest Paths. - Matthias Bentert; André Nichterlein; Malte Renken; Philipp Zschoche (SIAM J. Discret. Math., 2023)

Stable matching with multilayer approval preferences: Approvals can be harder than strict preferences. - Matthias Bentert; Niclas Boehmer; Klaus Heeger; Tomohiro Koana (Games Econ. Behav., 2023)

Two-Sets Cut-Uncut on Planar Graphs. - Matthias Bentert; Pål Grønås Drange; Fedor V. Fomin; Petr A. Golovach; Tuukka Korhonen (ICALP, 2024)

The Parameterized Complexity Landscape of Two-Sets Cut-Uncut. - Matthias Bentert; Fedor V. Fomin; Fanny Hauser; Saket Saurabh 001 (IPEC, 2024)

PACE Solver Description: LUNCH - Linear Uncrossing Heuristics. - Kenneth Langedal; Matthias Bentert; Thorgal Blanco; Pål Grønås Drange (IPEC, 2024)

Breaking a Graph into Connected Components with Small Dominating Sets. - Matthias Bentert; Michael R. Fellows; Petr A. Golovach; Frances A. Rosamond; Saket Saurabh 001 (MFCS, 2024)

Correlation Clustering with Vertex Splitting. - Matthias Bentert; Alex Crane; Pål Grønås Drange; Felix Reidl; Blair D. Sullivan (SWAT, 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)

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)

When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations. - Matthias Bentert; Fedor V. Fomin; Petr A. Golovach; M. S. Ramanujan 001; Saket Saurabh 001 (SoCG, 2025)

Exponential-Time Approximation (Schemes) for Vertex-Ordering Problems. - Matthias Bentert; Fedor V. Fomin; Tanmay Inamdar 002; Saket Saurabh 001 (ITCS, 2025)

Packing Short Cycles. - Matthias Bentert; Fedor V. Fomin; Petr A. Golovach; Tuukka Korhonen; William Lochet; Fahad Panolan; M. S. Ramanujan 001; Saket Saurabh 001; Kirill Simonov (SODA, 2025)

On the Complexity of Minimum Membership Dominating Set. - D. Karthika; R. Muthucumaraswamy; Matthias Bentert; Sriram Bhyravarapu; Saket Saurabh 001; Sanjay Seetharaman (SOFSEM (1), 2025)

Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths. - Matthias Bentert; Fedor V. Fomin; Petr A. Golovach (STACS, 2025)

Planar Network Diversion. - Matthias Bentert; Pål Grønås Drange; Fedor V. Fomin; Steinar Simonnes (SEA, 2025)

Conference Spotlight: ITCS and SODA. - Matthias Bentert (Bull. EATCS, 2025)

Overlapping Biclustering. - Matthias Bentert; Pål Grønås Drange; Erlend Haugen (CoRR, 2025)

When does FTP become FPT? - Matthias Bentert; Fedor V. Fomin; Petr A. Golovach; Laure Morelle (CoRR, 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, 2025)

Fault-Tolerant Matroid Bases. - Matthias Bentert; Fedor V. Fomin; Petr A. Golovach; Laure Morelle (CoRR, 2025)

The Directed Disjoint Paths Problem with Congestion. - Matthias Bentert; Dario Cavallaro; Amelie Heindl; Ken-ichi Kawarabayashi; Stephan Kreutzer; Johannes Schröder (CoRR, 2025)