Klaus Heeger

According to our database, Klaus Heeger authored at least 29 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Multivariate algorithmics for eliminating envy by donating goods.

Niclas Boehmer, Robert Bredereck, Klaus Heeger, Dusan Knop, Junjie Luo

Auton. Agents Multi Agent Syst., December, 2024

A Map of Diverse Synthetic Stable Matching Instances.

Niclas Boehmer, Klaus Heeger, Stanislaw Szufa

J. Artif. Intell. Res., 2024

Popular matchings with weighted voters.

Klaus Heeger, Ágnes Cseh

Games Econ. Behav., 2024

Fair Repetitive Interval Scheduling.

Klaus Heeger, Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay

CoRR, 2024

Minimizing the Number of Tardy Jobs with Uniform Processing Times on Parallel Machines.

Klaus Heeger, Hendrik Molter

CoRR, 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

Minimizing the Weighted Number of Tardy Jobs is W[1]-hard.

Klaus Heeger, Danny Hermelin

CoRR, 2024

No Polynomial Kernels for Knapsack.

Klaus Heeger, Danny Hermelin, Matthias Mnich, Dvir Shabtay

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

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., November, 2023

Stable matchings beyond stable marriage: models, algorithms, complexity.

Klaus Heeger

PhD thesis, 2023

Equitable scheduling on a single machine.

Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay

J. Sched., 2023

Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions.

Klaus Heeger, André Nichterlein, Rolf Niedermeier

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

Single Machine Scheduling with Few Deadlines.

Klaus Heeger, Danny Hermelin, Dvir Shabtay

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Fully Polynomial-Time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication.

Matthias Bentert, Klaus Heeger, Tomohiro Koana

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

A Map of Diverse Synthetic Stable Roommates Instances.

Niclas Boehmer, Klaus Heeger, Stanislaw Szufa

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Adapting Stable Matchings to Forced and Forbidden Pairs.

Niclas Boehmer, Klaus Heeger

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

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

Length-bounded cuts: Proper interval graphs and structural parameters.

Matthias Bentert, Klaus Heeger, Dusan Knop

J. Comput. Syst. Sci., 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

Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems.

Niclas Boehmer, Klaus Heeger, Rolf Niedermeier

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Theory of and Experiments on Minimally Invasive Stability Preservation in Changing Two-Sided Matching Markets.

Niclas Boehmer, Klaus Heeger, Rolf Niedermeier

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

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

Bribery and Control in Stable Marriage.

Niclas Boehmer, Robert Bredereck, Klaus Heeger, Rolf Niedermeier

J. Artif. Intell. Res., 2021

Polynomial Turing Kernels for Clique with an Optimal Number of Queries.

Till Fluschnik, Klaus Heeger, Danny Hermelin

CoRR, 2021

2020

The stable marriage problem with ties and restricted edges.

Ágnes Cseh, Klaus Heeger

Discret. Optim., 2020

Multidimensional Stable Roommates with Master List.

Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier

Proceedings of the Web and Internet Economics - 16th International Conference, 2020

2019

Multistage Problems on a Global Budget.

Klaus Heeger, Anne-Sophie Himmel, Frank Kammer, Rolf Niedermeier, Malte Renken, Andrej Sajenko

CoRR, 2019

2017

Two-Connected Spanning Subgraphs with at Most $\frac{10}{7}{OPT}$ Edges.

Klaus Heeger, Jens Vygen

SIAM J. Discret. Math., 2017

2016

Two-connected spanning subgraphs with at most 10/7 OPT edges.

Klaus Heeger, Jens Vygen

CoRR, 2016