Klaus Heeger

Orcid: 0000-0001-8779-0890

Affiliations:
  • TU Berlin, Germany


According to our database1, Klaus Heeger authored at least 31 papers between 2016 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Fair Repetitive Interval Scheduling.
Algorithmica, September, 2025

Effective data reduction for strongly stable matching in very sparse graphs.
Inf. Process. Lett., 2025

Repairing Schedules by Removing Waiting Times: A Parameterized Complexity Analysis.
Proceedings of the 19th International Symposium on Algorithms and Data Structures, 2025

Minimizing the Number of Tardy Jobs with Uniform Processing Times on Parallel Machines.
Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

2024
A Map of Diverse Synthetic Stable Matching Instances.
J. Artif. Intell. Res., 2024

Popular matchings with weighted voters.
Games Econ. Behav., 2024

Minimizing the Number of Tardy Jobs and Maximal Tardiness on a Single Machine is NP-hard.
CoRR, 2024

No Polynomial Kernels for Knapsack.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Minimizing the Weighted Number of Tardy Jobs Is W[1]-Hard.
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023
Stable matchings beyond stable marriage: models, algorithms, complexity.
PhD thesis, 2023

Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions.
Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

Single Machine Scheduling with Few Deadlines.
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Fully Polynomial-Time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

A Map of Diverse Synthetic Stable Roommates Instances.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Adapting Stable Matchings to Forced and Forbidden Pairs.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022
Stable Matching with Multilayer Approval Preferences: Approvals Can Be Harder Than Strict Preferences.
Proceedings of the Algorithmic Game Theory - 15th International Symposium, 2022

Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Multivariate Algorithmics for Eliminating Envy by Donating Goods.
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

Theory of and Experiments on Minimally Invasive Stability Preservation in Changing Two-Sided Matching Markets.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Multistage graph problems on a global budget.
Theor. Comput. Sci., 2021

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

Equitable Scheduling on a Single Machine.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
The stable marriage problem with ties and restricted edges.
Discret. Optim., 2020

Multidimensional Stable Roommates with Master List.
Proceedings of the Web and Internet Economics - 16th International Conference, 2020

A Fine-Grained View on Stable Many-To-One Matching Problems with Lower and Upper Quotas.
Proceedings of the Web and Internet Economics - 16th International Conference, 2020

Bribery and Control in Stable Marriage.
Proceedings of the Algorithmic Game Theory - 13th International Symposium, 2020

Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

2019
Multistage Problems on a Global Budget.
CoRR, 2019

Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2017
Two-Connected Spanning Subgraphs with at Most $\frac{10}{7}{OPT}$ Edges.
SIAM J. Discret. Math., 2017

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


  Loading...