Inhalt des Dokuments
| Address: | Technische Universität Berlin Fakultät IV Sekr. TEL 5-1 Ernst-Reuter-Platz 7 10587 Berlin |  |
| Room: | TEL 507a | |
| Phone: | +49(0)30-314 24921 | |
| E-Mail: | matthias.bentert 'at' tu-berlin.de | |
| Research Interests: | Graph Problems Parameterized ComplexityFine-Grained Hardness | |
| Links: | DBLP Google Scholar |
Journal Publications
2022
|
Matthias Bentert and Klaus Heeger and Dušan Knop. Length-bounded cuts: Proper interval graphs and structural parameters. Journal of Computer and System Sciences, 126:21-43, 2022. |
Bibtex entry
Link to publication Link to original publication |
2021
|
Matthias Bentert and René van Bevern and André Nichterlein and Rolf Niedermeier and Pavel V. Smirnov. Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments. Informs Journal on Computing, 1–29, 2021. |
Bibtex entry
Link to publication Link to original publication |
|
Matthias Bentert and Mathias Weller. Tree Containment With Soft Polytomies. Journal of Graph Algorithms and Applications, 25(1):417–436, 2021. |
Bibtex entry
Link to publication Link to original publication |
|
Matthias Bentert and Roman Haag and Christian Hofer and Tomohiro Koana and André Nichterlein. Parameterized Complexity of Min-Power Asymmetric Connectivity. Theory of Computing Systems, 65(7):1141–1142, 2021. |
Bibtex entry
Link to publication Link to original publication |
2020
|
Matthias Bentert and Anne-Sophie Himmel and André Nichterlein and Rolf Niedermeier. Efficient computation of optimal temporal walks under waiting-time constraints. Applied Network Science, 5(73):1–26, 2020. |
Bibtex entry
Link to publication Link to original publication |
|
Matthias Bentert and Alexander Dittmann and Leon Kellerhals and André Nichterlein and Rolf Niedermeier. An Adaptive Version of Brandes' Algorithm for Betweenness Centrality. Journal of Graph Algorithms and Applications, 24(3):483–522, 2020. |
Bibtex entry
Link to publication Link to original publication |
2019
|
Matthias Bentert and René van Bevern and Rolf Niedermeier. Inductive k-independent graphs and c-colorable subgraphs in scheduling: A review. Journal of Scheduling, 22(1):3–20, 2019. |
Bibtex entry
Link to publication Link to original publication |
|
Matthias Bentert and Till Fluschnik and André Nichterlein and Rolf Niedermeier. Parameterized aspects of triangle enumeration. Journal of Computer and System Sciences, 103:61 - 77, 2019. |
Bibtex entry
Link to publication Link to original publication |
|
Matthias Bentert and Anne-Sophie Himmel and Hendrik Molter and Marco Morik and Rolf Niedermeier and René Saitenmacher. Listing All Maximal k-Plexes in Temporal Graphs. ACM Journal of Experimental Algorithmics, 24(1):1–13, ACM, 2019. |
Bibtex entry
Link to publication Link to original publication |
Conference Publications
2022
|
Matthias Bentert and Niclas Boehmer and Klaus Heeger and Tomohiro Koana. Stable Matching with Multilayer Approval Preferences: Approvals can be Harder than Strict Preferences. In 15th International Symposium on Algorithmic Game Theory (SAGT '22), 2022. Accepted for publication. |
Bibtex entry
Link to publication |
2021
|
Matthias Bentert and Robert Bredereck and Péter Györgyi and Andrzej Kaczmarczyk and Rolf Niedermeier. A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem. In Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI '21), 2021. |
Bibtex entry
Link to publication Link to original publication |
|
Matthias Bentert and André Nichterlein and Malte Renken and Philipp Zschoche. Using a Geometric Lens to Find $k$ Disjoint Shortest Paths. In Proceedings of the 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), pages 26:1–26:14. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021. |
Bibtex entry
Link to publication Link to original publication |
|
Matthias Bentert and Tomohiro Koana and Rolf Niedermeier. The Complexity of Gerrymandering over Graphs: Paths and Trees. In Proceedings of the 47th International Workshop on Graph-Theoretic Concepts in Computer Science, pages 195–206. 2021. |
Bibtex entry
Link to publication Link to original publication |
|
Luis Müller and Matthias Bentert. On Reachable Assignments in Cycles. In Proceedings of 7th International Conference on Algorithmic Decision Theory, pages 273–288. 2021. |
Bibtex entry
Link to publication Link to original publication |
2020
|
Matthias Bentert and Piotr Skowron. Comparing Election Methods Where Each Voter Ranks Only Few Candidates. In Proceedings of the 34st AAAI Conference on Artificial Intelligence (AAAI '20), pages 2218–2225. AAAI Press, 2020. |
Bibtex entry
Link to publication Link to original publication |
|
Matthias Bentert and Klaus Heeger and Dusan Knop. Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters. In Proceedings of 31st International Symposium on Algorithms and Computation (ISAAC 2020), pages 36:1–36:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. |
Bibtex entry
Link to publication Link to original publication |
2019
|
Matthias Bentert and André Nichterlein. Parameterized Complexity of Diameter. In Proceedings of the 11th International Conference on Algorithms and Complexity (CIAC '19), pages 50–61. Springer, 2019. |
Bibtex entry
Link to publication Link to original publication |
|
Matthias Bentert and Roman Haag and Christian Hofer and Tomohiro Koana and André Nichterlein. Parameterized Complexity of Min-Power Asymmetric Connectivity. In Proceedings of the 30th International Workshop (IWOCA '19), pages 85–96. Springer, 2019. |
Bibtex entry
Link to publication Link to original publication |
|
Anne-Sophie Himmel and Matthias Bentert and André Nichterlein and Rolf Niedermeier. Efficient Computation of Optimal Temporal Walks under Waiting-Time Constraints. In Proceedings of the 8th International Conference on Complex Networks and their Applications, pages 494–506. Springer, 2019. |
Bibtex entry
Link to publication Link to original publication |
2018
|
Matthias Bentert and Josef Malík and Mathias Weller. Tree Containment With Soft Polytomies. In Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT '18), pages 9:1–9:14. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2018. |
Bibtex entry
Link to publication Link to original publication |
|
Matthias Bentert and Anne-Sophie Himmel and Hendrik Molter and Marco Morik and Rolf Niedermeier and René Saitenmacher. Listing All Maximal k-Plexes in Temporal Graphs. In Proceedings of the 2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM '18), pages 41–46. IEEE Computer Society, 2018. |
Bibtex entry
Link to publication Link to original publication |
|
Matthias Bentert and Alexander Dittmann and Leon Kellerhals and André Nichterlein and Rolf Niedermeier. An Adaptive Version of Brandes' Algorithm for Betweenness Centrality. In Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC '18), pages 36:1–36:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. |
Bibtex entry
Link to publication Link to original publication |
2017
|
Matthias Bentert and Till Fluschnik and André Nichterlein and Rolf Niedermeier. Parameterized Aspects of Triangle Enumeration. In Proceedings of the 21st Symposium on Fundamentals of Computation Theory (FCT '17), pages 96–110. Springer International Publishing, 2017. |
Bibtex entry
Link to publication Link to original publication |
|
Matthias Bentert and René van Bevern and André Nichterlein and Rolf Niedermeier. Parameterized algorithms for power-efficient connected symmetric wireless sensor networks. In Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS '17), pages 26–40. Springer International Publishing, 2017. |
Bibtex entry
Link to publication Link to original publication |
PhD Thesis
2021
|
Matthias Bentert. Elements of Dynamic and 2-SAT Programming: Paths, Trees, and Cuts. Technische Universität Berlin, November, 2021. Published by Universitätsverlag der TU Berlin. |
Bibtex entry Link to PDF |
Master Thesis
2016
|
Matthias Bentert. Parametrised Algorithms for Finding Triangles in Graphs. TU Berlin, December, 2016. Master thesis |
Bibtex entry Link to PDF |