Two-connected spanning subgraphs with at most 10/7 OPT edges. - Klaus Heeger; Jens Vygen (CoRR, 2016)

Two-Connected Spanning Subgraphs with at Most $ frac{10}{7}{OPT}$ Edges. - Klaus Heeger; Jens Vygen (SIAM J. Discret. Math., 2017)

Multistage Problems on a Global Budget. - Klaus Heeger; Anne-Sophie Himmel; Frank Kammer; Rolf Niedermeier; Malte Renken; Andrej Sajenko (CoRR, 2019)

Multidimensional Stable Roommates with Master List. - Robert Bredereck; Klaus Heeger; Dusan Knop; Rolf Niedermeier (WINE, 2020)

The stable marriage problem with ties and restricted edges. - Ágnes Cseh; Klaus Heeger (Discret. Optim., 2020)

Polynomial Turing Kernels for Clique with an Optimal Number of Queries. - Till Fluschnik; Klaus Heeger; Danny Hermelin (CoRR, 2021)

Bribery and Control in Stable Marriage. - Niclas Boehmer; Robert Bredereck; Klaus Heeger; Rolf Niedermeier (J. Artif. Intell. Res., 2021)

Multistage graph problems on a global budget. - Klaus Heeger; Anne-Sophie Himmel; Frank Kammer; Rolf Niedermeier; Malte Renken; Andrej Sajenko (Theor. Comput. Sci., 2021)

Theory of and Experiments on Minimally Invasive Stability Preservation in Changing Two-Sided Matching Markets. - Niclas Boehmer; Klaus Heeger; Rolf Niedermeier (AAAI, 2022)

Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems. - Niclas Boehmer; Klaus Heeger; Rolf Niedermeier (MFCS, 2022)

Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters. - Robert Bredereck; Klaus Heeger; Dusan Knop; Rolf Niedermeier (Inf. Comput., 2022)

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

A Fine-grained View on Stable Many-to-one Matching Problems with Lower and Upper Quotas. - Niclas Boehmer; Klaus Heeger (ACM Trans. Economics and Comput., 2022)

A Map of Diverse Synthetic Stable Roommates Instances. - Niclas Boehmer; Klaus Heeger; Stanislaw Szufa (AAMAS, 2023)

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

Single Machine Scheduling with Few Deadlines. - Klaus Heeger; Danny Hermelin; Dvir Shabtay (IPEC, 2023)

Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions. - Klaus Heeger; André Nichterlein; Rolf Niedermeier (STACS, 2023)

Equitable scheduling on a single machine. - Klaus Heeger; Danny Hermelin; George B. Mertzios; Hendrik Molter; Rolf Niedermeier; Dvir Shabtay (J. Sched., 2023)

Stable matchings beyond stable marriage: models, algorithms, complexity. - Klaus Heeger (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)

Minimizing the Weighted Number of Tardy Jobs Is W[1]-Hard. - Klaus Heeger; Danny Hermelin (ESA, 2024)

No Polynomial Kernels for Knapsack. - Klaus Heeger; Danny Hermelin; Matthias Mnich; Dvir Shabtay (ICALP, 2024)

Minimizing the Number of Tardy Jobs and Maximal Tardiness on a Single Machine is NP-hard. - Klaus Heeger; Danny Hermelin; Michael L. Pinedo; Dvir Shabtay (CoRR, 2024)

Popular matchings with weighted voters. - Klaus Heeger; Ágnes Cseh (Games Econ. Behav., 2024)

A Map of Diverse Synthetic Stable Matching Instances. - Niclas Boehmer; Klaus Heeger; Stanislaw Szufa (J. Artif. Intell. Res., 2024)

Multivariate algorithmics for eliminating envy by donating goods. - Niclas Boehmer; Robert Bredereck; Klaus Heeger; Dusan Knop; Junjie Luo 001 (Auton. Agents Multi Agent Syst., 2024)

Minimizing the Number of Tardy Jobs with Uniform Processing Times on Parallel Machines. - Klaus Heeger; Hendrik Molter (STACS, 2025)

Repairing Schedules by Removing Waiting Times: A Parameterized Complexity Analysis. - Niels Grüttemeier; Klaus Heeger (WADS, 2025)

Effective data reduction for strongly stable matching in very sparse graphs. - Rosa Wolf; Klaus Heeger; André Nichterlein (Inf. Process. Lett., 2025)

Adapting stable matchings to forced and forbidden pairs. - Niclas Boehmer; Klaus Heeger (J. Comput. Syst. Sci., 2025)

Fair Repetitive Interval Scheduling. - Klaus Heeger; Danny Hermelin; Yuval Itzhaki; Hendrik Molter; Dvir Shabtay (Algorithmica, 2025)