Matthias Bentert

104 papers A* 9A 6B 16C 3Journal 63Unranked 6

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Complexity of Perfect and Ideal Resilience Verification in Fast Re-Route Networks. CoRR Matthias Bentert, Esra Ceylan-Kettler, Valentin Hübner, Stefan Schmid, Jirí Srba
2026	A	`conf`	Density Matters: A Complexity Dichotomy of Deleting Edges to Bound Subgraph Density. STACS Matthias Bentert, Tom-Lukas Breitkopf, Vincent Froese, Anton Herrmann, André Nichterlein
2026	J	`jnl`	Density Matters: A Complexity Dichotomy of Deleting Edges to Bound Subgraph Density. CoRR Matthias Bentert, Tom-Lukas Breitkopf, Vincent Froese, Anton Herrmann, André Nichterlein
2026	A	`conf`	Line Cover and Related Problems. STACS Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Souvik Saha, Sanjay Seetharaman, Anannya Upasana
2026	B	`conf`	Overlapping Biclustering. SOFSEM Matthias Bentert, Pål Grønås Drange, Erlend Haugen
2026	J	`jnl`	Packing Short Cycles. ACM Trans. Algorithms Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov
2026	J	`jnl`	Perfect Network Resilience in Polynomial Time. CoRR Matthias Bentert, Stefan Schmid
2026	A*	`conf`	The Directed Disjoint Paths Problem with Congestion. SODA Matthias Bentert, Dario Cavallaro, Amelie Heindl, Ken-ichi Kawarabayashi, Stephan Kreutzer, Johannes Schröder
2026	J	`jnl`	The parameterized complexity landscape of two-sets cut-uncut. Theor. Comput. Sci. Matthias Bentert, Fedor V. Fomin, Fanny Hauser, Saket Saurabh
2026	J	`jnl`	Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths. Theory Comput. Syst. Matthias Bentert, Fedor V. Fomin, Petr A. Golovach
2025	—	`conf`	A Space-Efficient Algebraic Approach to Robotic Motion Planning. ACDA Matthias Bentert, Daniel Coimbra Salomao, Alex Crane, Yosuke Mizutani, Felix Reidl, Blair D. Sullivan
2025	J	`jnl`	Conference Spotlight: ITCS and SODA. Bull. EATCS Matthias Bentert
2025	B	`conf`	Demand-Aware Multi-Source IP-Multicast: Minimal Congestion via Link Weight Optimization. Networking Matthias Bentert, Max Franke, Darya Melnyk, Arash Pourdamghani, Stefan Schmid
2025	A	`conf`	Exponential-Time Approximation (Schemes) for Vertex-Ordering Problems. ITCS Matthias Bentert, Fedor V. Fomin, Tanmay Inamdar, Saket Saurabh
2025	J	`jnl`	Exponential-Time Approximation (Schemes) for Vertex-Ordering Problems. CoRR Matthias Bentert, Fedor V. Fomin, Tanmay Inamdar, Saket Saurabh
2025	B	`conf`	Fast Re-Routing in Networks: On the Complexity of Perfect Resilience. OPODIS Matthias Bentert, Esra Ceylan, Valentin Hübner, Stefan Schmid, Jirí Srba
2025	A	`conf`	Fault-Tolerant Matroid Bases. ESA Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Laure Morelle
2025	J	`jnl`	Fault-Tolerant Matroid Bases. CoRR Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Laure Morelle
2025	A*	`conf`	How to Resolve Envy by Adding Goods. IJCAI Matthias Bentert, Robert Bredereck, Eva Michelle Deltl, Pallavi Jain, Leon Kellerhals
2025	J	`jnl`	How to Resolve Envy by Adding Goods. CoRR Matthias Bentert, Robert Bredereck, Eva Michelle Deltl, Pallavi Jain, Leon Kellerhals
2025	J	`jnl`	Line Cover and Related Problems. CoRR Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Souvik Saha, Sanjay Seetharaman, Anannya Upasana
2025	—	`conf`	On the Complexity of Minimum Membership Dominating Set. SOFSEM (1) D. Karthika, R. Muthucumaraswamy, Matthias Bentert, Sriram Bhyravarapu, Saket Saurabh, Sanjay Seetharaman
2025	J	`jnl`	Overlapping Biclustering. CoRR Matthias Bentert, Pål Grønås Drange, Erlend Haugen
2025	A*	`conf`	Packing Short Cycles. SODA Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov
2025	B	`conf`	Planar Network Diversion. SEA Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Steinar Simonnes
2025	J	`jnl`	Planar Network Diversion. CoRR Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Steinar Simonnes
2025	J	`jnl`	Structural Optimal Jacobian Accumulation and Minimum Edge Count are NP-Complete Under Vertex Elimination. CoRR Matthias Bentert, Alex Crane, Pål Grønås Drange, Yosuke Mizutani, Blair D. Sullivan
2025	J	`jnl`	The Directed Disjoint Paths Problem with Congestion. CoRR Matthias Bentert, Dario Cavallaro, Amelie Heindl, Ken-ichi Kawarabayashi, Stephan Kreutzer, Johannes Schröder
2025	A	`conf`	Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths. STACS Matthias Bentert, Fedor V. Fomin, Petr A. Golovach
2025	A*	`conf`	When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations. SoCG Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan, Saket Saurabh
2025	J	`jnl`	When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations. CoRR Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan, Saket Saurabh
2025	B	`conf`	When Does FTP Become FPT? WG Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Laure Morelle
2025	J	`jnl`	When does FTP become FPT? CoRR Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Laure Morelle
2024	B	`conf`	Breaking a Graph into Connected Components with Small Dominating Sets. MFCS Matthias Bentert, Michael R. Fellows, Petr A. Golovach, Frances A. Rosamond, Saket Saurabh
2024	—	`conf`	Correlation Clustering with Vertex Splitting. SWAT Matthias Bentert, Alex Crane, Pål Grønås Drange, Felix Reidl, Blair D. Sullivan
2024	J	`jnl`	Correlation Clustering with Vertex Splitting. CoRR Matthias Bentert, Alex Crane, Pål Grønås Drange, Felix Reidl, Blair D. Sullivan
2024	J	`jnl`	Fully Polynomial-time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication. CoRR Matthias Bentert, Klaus Heeger, Tomohiro Koana
2024	J	`jnl`	Graph Inspection for Robotic Motion Planning: Do Arithmetic Circuits Help? CoRR Matthias Bentert, Daniel Coimbra Salomao, Alex Crane, Yosuke Mizutani, Felix Reidl, Blair D. Sullivan
2024	J	`jnl`	Leveraging Fixed-Parameter Tractability for Robot Inspection Planning. CoRR Yosuke Mizutani, Daniel Coimbra Salomao, Alex Crane, Matthias Bentert, Pål Grønås Drange, Felix Reidl, Alan Kuntz, Blair D. Sullivan
2024	B	`conf`	PACE Solver Description: LUNCH - Linear Uncrossing Heuristics. IPEC Kenneth Langedal, Matthias Bentert, Thorgal Blanco, Pål Grønås Drange
2024	J	`jnl`	Packing Short Cycles. CoRR Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov
2024	B	`conf`	The Parameterized Complexity Landscape of Two-Sets Cut-Uncut. IPEC Matthias Bentert, Fedor V. Fomin, Fanny Hauser, Saket Saurabh
2024	J	`jnl`	The Parameterized Complexity Landscape of Two-Sets Cut-Uncut. CoRR Matthias Bentert, Fedor V. Fomin, Fanny Hauser, Saket Saurabh
2024	J	`jnl`	The Structural Complexity Landscape of Finding Balance-Fair Shortest Paths. CoRR Matthias Bentert, Leon Kellerhals, Rolf Niedermeier
2024	J	`jnl`	Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths. CoRR Matthias Bentert, Fedor V. Fomin, Petr A. Golovach
2024	A*	`conf`	Two-Sets Cut-Uncut on Planar Graphs. ICALP Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen
2023	J	`jnl`	A multivariate complexity analysis of the material consumption scheduling problem. J. Sched. Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier
2023	B	`conf`	Cluster Editing with Overlapping Communities. IPEC Emmanuel Arrighi, Matthias Bentert, Pål Grønås Drange, Blair D. Sullivan, Petra Wolf
2023	A*	`conf`	Fair Short Paths in Vertex-Colored Graphs. AAAI Matthias Bentert, Leon Kellerhals, Rolf Niedermeier
2023	A	`conf`	Fully Polynomial-Time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication. ESA Matthias Bentert, Klaus Heeger, Tomohiro Koana
2023	B	`conf`	On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model. IPEC Matthias Bentert, Jannik Schestag, Frank Sommer
2023	J	`jnl`	On the Complexity of Finding a Sparse Connected Spanning Subgraph in a non-Uniform Failure Model. CoRR Matthias Bentert, Jannik Schestag, Frank Sommer
2023	J	`jnl`	Parameterized Complexity of Diameter. Algorithmica Matthias Bentert, André Nichterlein
2023	J	`jnl`	Polynomial-time data reduction for weighted problems beyond additive goal functions. Discret. Appl. Math. Matthias Bentert, René van Bevern, Till Fluschnik, André Nichterlein, Rolf Niedermeier
2023	J	`jnl`	Stable matching with multilayer approval preferences: Approvals can be harder than strict preferences. Games Econ. Behav. Matthias Bentert, Niclas Boehmer, Klaus Heeger, Tomohiro Koana
2023	J	`jnl`	The complexity of gerrymandering over graphs: Paths and trees. Discret. Appl. Math. Matthias Bentert, Tomohiro Koana, Rolf Niedermeier
2023	J	`jnl`	Two-sets cut-uncut on planar graphs. CoRR Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen
2023	J	`jnl`	Using a Geometric Lens to Find $\boldsymbol{k}$-Disjoint Shortest Paths. SIAM J. Discret. Math. Matthias Bentert, André Nichterlein, Malte Renken, Philipp Zschoche
2022	J	`jnl`	Finding Balance-Fair Short Paths in Graphs. CoRR Matthias Bentert, Leon Kellerhals, Rolf Niedermeier
2022	J	`jnl`	Length-bounded cuts: Proper interval graphs and structural parameters. J. Comput. Syst. Sci. Matthias Bentert, Klaus Heeger, Dusan Knop
2022	J	`jnl`	Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments. INFORMS J. Comput. Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier, Pavel V. Smirnov
2022	B	`conf`	Stable Matching with Multilayer Approval Preferences: Approvals Can Be Harder Than Strict Preferences. SAGT Matthias Bentert, Niclas Boehmer, Klaus Heeger, Tomohiro Koana
2022	J	`jnl`	Stable Matching with Multilayer Approval Preferences: Approvals can be Harder than Strict Preferences. CoRR Matthias Bentert, Niclas Boehmer, Klaus Heeger, Tomohiro Koana
2022	J	`jnl`	The structural complexity landscape of finding balance-fair shortest paths. Theor. Comput. Sci. Matthias Bentert, Leon Kellerhals, Rolf Niedermeier
2022	J	`jnl`	Who won? Winner Determination and Robustness in Liquid Democracy. CoRR Matthias Bentert, Niclas Boehmer, Maciej Rymar, Henri Tannenberg
2021	A*	`conf`	A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem. AAAI Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier
2021	J	`jnl`	A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem. CoRR Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier
2021	J	`jnl`	Correction to: Parameterized Complexity of Min-Power Asymmetric Connectivity. Theory Comput. Syst. Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein
2021	—	`—`	Elements of dynamic and 2-SAT programming: paths, trees, and cuts. Matthias Bentert
2021	—	`conf`	On Reachable Assignments in Cycles. ADT Luis Müller, Matthias Bentert
2021	J	`jnl`	The Complexity of Gerrymandering Over Graphs: Paths and Trees. CoRR Matthias Bentert, Tomohiro Koana, Rolf Niedermeier
2021	B	`conf`	The Complexity of Gerrymandering over Graphs: Paths and Trees. WG Matthias Bentert, Tomohiro Koana, Rolf Niedermeier
2021	J	`jnl`	Tree Containment With Soft Polytomies. J. Graph Algorithms Appl. Matthias Bentert, Mathias Weller
2021	A*	`conf`	Using a Geometric Lens to Find k Disjoint Shortest Paths. ICALP Matthias Bentert, André Nichterlein, Malte Renken, Philipp Zschoche
2020	J	`jnl`	An Adaptive Version of Brandes' Algorithm for Betweenness Centrality. J. Graph Algorithms Appl. Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier
2020	A*	`conf`	Comparing Election Methods Where Each Voter Ranks Only Few Candidates. AAAI Matthias Bentert, Piotr Skowron
2020	J	`jnl`	Efficient computation of optimal temporal walks under waiting-time constraints. Appl. Netw. Sci. Matthias Bentert, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier
2020	B	`conf`	Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters. ISAAC Matthias Bentert, Klaus Heeger, Dusan Knop
2020	J	`jnl`	On Reachable Assignments in Cycles and Cliques. CoRR Luis Müller, Matthias Bentert
2020	J	`jnl`	Parameterized Complexity of Min-Power Asymmetric Connectivity. CoRR Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein
2020	J	`jnl`	Parameterized Complexity of Min-Power Asymmetric Connectivity. Theory Comput. Syst. Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein
2020	J	`jnl`	Using a geometric lens to find k disjoint shortest paths. CoRR Matthias Bentert, André Nichterlein, Malte Renken, Philipp Zschoche
2019	J	`jnl`	Comparing Election Methods Where Each Voter Ranks Only Few Candidates. CoRR Matthias Bentert, Piotr Skowron
2019	—	`conf`	Efficient Computation of Optimal Temporal Walks Under Waiting-Time Constraints. COMPLEX NETWORKS (2) Anne-Sophie Himmel, Matthias Bentert, André Nichterlein, Rolf Niedermeier
2019	J	`jnl`	Efficient Computation of Optimal Temporal Walks under Waiting-Time Constraints. CoRR Anne-Sophie Himmel, Matthias Bentert, André Nichterlein, Rolf Niedermeier
2019	J	`jnl`	Good Things Come to Those Who Swap Objects on Paths. CoRR Matthias Bentert, Jiehua Chen, Vincent Froese, Gerhard J. Woeginger
2019	J	`jnl`	Inductive $$k$$ k -independent graphs and c-colorable subgraphs in scheduling: a review. J. Sched. Matthias Bentert, René van Bevern, Rolf Niedermeier
2019	J	`jnl`	Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters. CoRR Matthias Bentert, Klaus Heeger, Dusan Knop
2019	J	`jnl`	Listing All Maximal ACM J. Exp. Algorithmics Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher
2019	C	`conf`	Parameterized Complexity of Diameter. CIAC Matthias Bentert, André Nichterlein
2019	C	`conf`	Parameterized Complexity of Min-Power Asymmetric Connectivity. IWOCA Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein
2019	J	`jnl`	Parameterized aspects of triangle enumeration. J. Comput. Syst. Sci. Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier
2019	J	`jnl`	Polynomial-Time Preprocessing for Weighted Problems Beyond Additive Goal Functions. CoRR Matthias Bentert, René van Bevern, Till Fluschnik, André Nichterlein, Rolf Niedermeier
2018	B	`conf`	An Adaptive Version of Brandes' Algorithm for Betweenness Centrality. ISAAC Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier
2018	B	`conf`	Listing All Maximal k-Plexes in Temporal Graphs. ASONAM Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher
2018	J	`jnl`	Listing All Maximal k-Plexes in Temporal Graphs. CoRR Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher
2018	J	`jnl`	Parameterized Complexity of Diameter. CoRR Matthias Bentert, André Nichterlein
2018	J	`jnl`	Towards Improving Brandes' Algorithm for Betweenness Centrality. CoRR Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier
2018	—	`conf`	Tree Containment With Soft Polytomies. SWAT Matthias Bentert, Josef Malík, Mathias Weller
2017	J	`jnl`	(Wireless) Scheduling, Graph Classes, and c-Colorable Subgraphs. CoRR Matthias Bentert, René van Bevern, Rolf Niedermeier
2017	C	`conf`	Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks. ALGOSENSORS Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier
2017	B	`conf`	Parameterized Aspects of Triangle Enumeration. FCT Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier
2017	J	`jnl`	Parameterized Aspects of Triangle Enumeration. CoRR Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier
2017	J	`jnl`	Parameterized algorithms for power-efficient connected symmetric wireless sensor networks. CoRR Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier