TU Berlin

Algorithmics and Computational Complexity Research GroupKlaus Heeger

isti-logo

Inhalt

zur Navigation

Es gibt keine deutsche Übersetzung dieser Webseite.

Klaus Heeger
Address:
Technische Universität Berlin
Fakultät IV
Sekr. TEL 5-1
Ernst-Reuter-Platz 7
10587 Berlin







Room:
TEL 510
Phone:
E-Mail:
heeger 'at' tu-berlin.de
Research Interests:
Parameterized complexity
Stable matchings
Combinatorial optimization

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 zur Publikation
Link zur Originalpublikation
Niclas Boehmer and Klaus Heeger.
A Fine-Grained View on Stable Many-To-One Matching Problems with Lower and Upper Quotas.
ACM Transactions on Economics and Computation, 2022. Accepted for publication
Bibtex entry Link zur Publikation
Robert Bredereck and Klaus Heeger and Dušan Knop and Rolf Niedermeier.
Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters.
Information and Computation, 104943, 2022.
Bibtex entry Link zur Publikation
Link zur Originalpublikation
Klaus Heeger and Danny Hermelin and George B. Mertzios and Hendrik Molter and Rolf Niedermeier and Dvir Shabtay.
Equitable Scheduling on a Single Machine.
Journal of Scheduling, Springer, 2022.
Bibtex entry Link zur Publikation
Link zur Originalpublikation

2021

Klaus Heeger and Anne-Sophie Himmel and Frank Kammer and Rolf Niedermeier and Malte Renken and Andrej Sajenko.
Multistage graph problems on a global budget.
Theoretical Computer Science, 868:46-64, 2021.
Bibtex entry Link zur Publikation
Link zur Originalpublikation
Niclas Boehmer and Robert Bredereck and Klaus Heeger and Rolf Niedermeier.
Bribery and Control in Stable Marriage.
Journal of Artificial Intelligence Research, 71:993–1048, 2021.
Bibtex entry Link zur Publikation
Link zur Originalpublikation

2020

Ágnes Cseh and Klaus Heeger.
The stable marriage problem with ties and restricted edges.
Discret. Optim., 36:100571, 2020.
Bibtex entry Link zur Publikation

2017

Klaus Heeger and Jens Vygen.
Two-Connected Spanning Subgraphs with at Most {\textdollar}{\textbackslash}frac\{10\}\{7\}\{OPT\}{\textdollar} Edges.
SIAM J. Discrete Math., 31(3):1820–1835, 2017.
Bibtex entry Link zur Publikation
Link zur Originalpublikation

Conference Publications

2022

Niclas Boehmer and Klaus Heeger and Stanisław Szufa.
A Map of Diverse Synthetic Stable Roommates Instances.
In Proceedings of the 6th International Workshop on Matching Under Preferences (MATCH-UP '22), 2022. Accepted for publication.
Bibtex entry
Niclas Boehmer and Klaus Heeger and Rolf Niedermeier.
Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems.
In Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science (MFCS '22), 2022. Accepted for publication.
Bibtex entry
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 Proceedings of the 15th International Symposium on Algorithmic Game Theory (SAGT '22), 2022. Accepted for publication.
Bibtex entry Link zur Publikation
Niclas Boehmer and Klaus Heeger and Rolf Niedermeier.
Theory of and Experiments on Minimally Invasive Stability Preservation in Changing Two-Sided Matching Markets.
In Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI '22), pages 4851–4858. 2022.
Bibtex entry Link zur Publikation
Link zur Originalpublikation
Niclas Boehmer and Robert Bredereck and Klaus Heeger and Dušan Knop and Junjie Luo.
Multivariate Algorithmics for Eliminating Envy by Donating Goods.
In Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems (AAMAS '22), pages 127–135. IFAAMAS, 2022.
Bibtex entry Link zur Publikation
Link zur Originalpublikation

2021

Klaus Heeger and Danny Hermelin and George B. Mertzios and Hendrik Molter and Rolf Niedermeier and Dvir Shabtay.
Equitable Scheduling on a Single Machine.
In Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI '21), AAAI Press, 2021.
Bibtex entry Link zur Publikation
Link zur Originalpublikation

2020

Robert Bredereck and Klaus Heeger and Dušan Knop and Rolf Niedermeier.
Multidimensional Stable Roommates with Master List.
In Proceedings of the 16th International Conference on Web and Internet Economics (WINE '20), pages 59–73. Springer, 2020.
Bibtex entry Link zur Publikation
Link zur Originalpublikation
Niclas Boehmer and Klaus Heeger.
A Fine-Grained View on Stable Many-To-One Matching Problems with Lower and Upper Quotas.
In Proceedings of the 16th International Conference on Web and Internet Economics (WINE '20), pages 31–44. Springer, 2020.
Bibtex entry Link zur Publikation
Link zur Originalpublikation
Niclas Boehmer and Robert Bredereck and Klaus Heeger and Rolf Niedermeier.
Bribery and Control in Stable Marriage.
In Proceedings of the 13th Symposium on Algorithmic Game Theory (SAGT '20), pages 163–177. 2020.
Bibtex entry Link zur Publikation
Link zur Originalpublikation
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 zur Publikation
Link zur Originalpublikation

2019

Robert Bredereck and Klaus Heeger and Dušan Knop and Rolf Niedermeier.
Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters.
In Proceedings of the 30th International Symposium on Algorithms and Computation (ISAAC '19), pages 44:1–44:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
Bibtex entry Link zur Publikation
Link zur Originalpublikation

Navigation

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe