Klaus Heeger

Orcid: 0000-0001-8779-0890

Affiliations:
  • TU Berlin, Germany


According to our database1, Klaus Heeger authored at least 26 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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

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

2023
Stable matching with multilayer approval preferences: Approvals can be harder than strict preferences.
Games Econ. Behav., November, 2023

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

Equitable scheduling on a single machine.
J. Sched., 2023

No Polynomial Kernels for Knapsack.
CoRR, 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
A Fine-grained View on Stable Many-to-one Matching Problems with Lower and Upper Quotas.
ACM Trans. Economics and Comput., 2022

Length-bounded cuts: Proper interval graphs and structural parameters.
J. Comput. Syst. Sci., 2022

Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters.
Inf. Comput., 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

Bribery and Control in Stable Marriage.
J. Artif. Intell. Res., 2021

Popular matchings with weighted voters.
CoRR, 2021

Polynomial Turing Kernels for Clique with an Optimal Number of Queries.
CoRR, 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

2019
Multistage Problems on a Global Budget.
CoRR, 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...