Matthias Bentert
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
30
Venues
19
Active years
2017–2026
Best venue rank
A*
Where they publish
Papers
30 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ESA | Computational Boundaries for Escaping Rectangles. | Akanksha Agrawal, Pradeesha Ashok, Matthias Bentert, Satyabrata Jana, Abhishek Sahu, Saket Saurabh, Kushal Singanporia |
| 2026 | PODC | A Separation Between Optimal Demand-Oblivious and Demand-Aware Network Throughput. | Matthias Bentert, Chen Avin, Stefan Schmid |
| 2026 | SODA | The Directed Disjoint Paths Problem with Congestion. | Matthias Bentert, Dario Cavallaro, Amelie Heindl, Ken-ichi Kawarabayashi, Stephan Kreutzer, Johannes Schrder |
| 2026 | STOC | Perfect Network Resilience in Polynomial Time. | Matthias Bentert, Stefan Schmid |
| 2026 | STACS | Density Matters: A Complexity Dichotomy of Deleting Edges to Bound Subgraph Density. | Matthias Bentert, Tom-Lukas Breitkopf, Vincent Froese, Anton Herrmann, Andr Nichterlein |
| 2026 | STACS | Line Cover and Related Problems. | Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Souvik Saha, Sanjay Seetharaman, Anannya Upasana |
| 2026 | SOFSEM | Overlapping Biclustering. | Matthias Bentert, Pl Grns Drange, Erlend Haugen |
| 2025 | ESA | Fault-Tolerant Matroid Bases. | Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Laure Morelle |
| 2025 | IJCAI | How to Resolve Envy by Adding Goods. | Matthias Bentert, Robert Bredereck, Eva Michelle Deltl, Pallavi Jain, Leon Kellerhals |
| 2025 | Networking | Demand-Aware Multi-Source IP-Multicast: Minimal Congestion via Link Weight Optimization. | Matthias Bentert, Max Franke, Darya Melnyk, Arash Pourdamghani, Stefan Schmid |
| 2025 | OPODIS | Fast Re-Routing in Networks: On the Complexity of Perfect Resilience. | Matthias Bentert, Esra Ceylan, Valentin Hbner, Stefan Schmid, Jir Srba |
| 2025 | SODA | Packing Short Cycles. | Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov |
| 2025 | STACS | Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths. | Matthias Bentert, Fedor V. Fomin, Petr A. Golovach |
| 2025 | SOFSEM | On the Complexity of Minimum Membership Dominating Set. | D. Karthika, R. Muthucumaraswamy, Matthias Bentert, Sriram Bhyravarapu, Saket Saurabh, Sanjay Seetharaman |
| 2025 | WG | When Does FTP Become FPT? | Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Laure Morelle |
| 2024 | ICALP | Two-Sets Cut-Uncut on Planar Graphs. | Matthias Bentert, Pl Grns Drange, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen |
| 2024 | MFCS | Breaking a Graph into Connected Components with Small Dominating Sets. | Matthias Bentert, Michael R. Fellows, Petr A. Golovach, Frances A. Rosamond, Saket Saurabh |
| 2023 | AAAI | Fair Short Paths in Vertex-Colored Graphs. | Matthias Bentert, Leon Kellerhals, Rolf Niedermeier |
| 2023 | ESA | Fully Polynomial-Time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication. | Matthias Bentert, Klaus Heeger, Tomohiro Koana |
| 2022 | SAGT | Stable Matching with Multilayer Approval Preferences: Approvals Can Be Harder Than Strict Preferences. | Matthias Bentert, Niclas Boehmer, Klaus Heeger, Tomohiro Koana |
| 2021 | AAAI | A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem. | Matthias Bentert, Robert Bredereck, Pter Gyrgyi, Andrzej Kaczmarczyk, Rolf Niedermeier |
| 2021 | ICALP | Using a Geometric Lens to Find k Disjoint Shortest Paths. | Matthias Bentert, Andr Nichterlein, Malte Renken, Philipp Zschoche |
| 2021 | WG | The Complexity of Gerrymandering over Graphs: Paths and Trees. | Matthias Bentert, Tomohiro Koana, Rolf Niedermeier |
| 2020 | AAAI | Comparing Election Methods Where Each Voter Ranks Only Few Candidates. | Matthias Bentert, Piotr Skowron |
| 2020 | ISAAC | Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters. | Matthias Bentert, Klaus Heeger, Dusan Knop |
| 2019 | CIAC | Parameterized Complexity of Diameter. | Matthias Bentert, Andr Nichterlein |
| 2019 | IWOCA | Parameterized Complexity of Min-Power Asymmetric Connectivity. | Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, Andr Nichterlein |
| 2018 | ISAAC | An Adaptive Version of Brandes' Algorithm for Betweenness Centrality. | Matthias Bentert, Alexander Dittmann, Leon Kellerhals, Andr Nichterlein, Rolf Niedermeier |
| 2017 | Algosensors | Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks. | Matthias Bentert, Ren van Bevern, Andr Nichterlein, Rolf Niedermeier |
| 2017 | FCT | Parameterized Aspects of Triangle Enumeration. | Matthias Bentert, Till Fluschnik, Andr Nichterlein, Rolf Niedermeier |