Klaus Heeger - RankMe

59 papers A* 3A 7B 7Journal 39Unranked 2

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Adapting stable matchings to forced and forbidden pairs. J. Comput. Syst. Sci. Niclas Boehmer, Klaus Heeger
2025	J	`jnl`	Effective data reduction for strongly stable matching in very sparse graphs. Inf. Process. Lett. Rosa Wolf, Klaus Heeger, André Nichterlein
2025	J	`jnl`	Fair Repetitive Interval Scheduling. Algorithmica Klaus Heeger, Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay
2025	A	`conf`	Minimizing the Number of Tardy Jobs with Uniform Processing Times on Parallel Machines. STACS Klaus Heeger, Hendrik Molter
2025	B	`conf`	Repairing Schedules by Removing Waiting Times: A Parameterized Complexity Analysis. WADS Niels Grüttemeier, Klaus Heeger
2024	J	`jnl`	A Map of Diverse Synthetic Stable Matching Instances. J. Artif. Intell. Res. Niclas Boehmer, Klaus Heeger, Stanislaw Szufa
2024	J	`jnl`	Fair Repetitive Interval Scheduling. CoRR Klaus Heeger, Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay
2024	J	`jnl`	Fully Polynomial-time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication. CoRR Matthias Bentert, Klaus Heeger, Tomohiro Koana
2024	J	`jnl`	Minimizing the Number of Tardy Jobs and Maximal Tardiness on a Single Machine is NP-hard. CoRR Klaus Heeger, Danny Hermelin, Michael L. Pinedo, Dvir Shabtay
2024	J	`jnl`	Minimizing the Number of Tardy Jobs with Uniform Processing Times on Parallel Machines. CoRR Klaus Heeger, Hendrik Molter
2024	A	`conf`	Minimizing the Weighted Number of Tardy Jobs Is W[1]-Hard. ESA Klaus Heeger, Danny Hermelin
2024	J	`jnl`	Minimizing the Weighted Number of Tardy Jobs is W[1]-hard. CoRR Klaus Heeger, Danny Hermelin
2024	J	`jnl`	Multivariate algorithmics for eliminating envy by donating goods. Auton. Agents Multi Agent Syst. Niclas Boehmer, Robert Bredereck, Klaus Heeger, Dusan Knop, Junjie Luo
2024	A*	`conf`	No Polynomial Kernels for Knapsack. ICALP Klaus Heeger, Danny Hermelin, Matthias Mnich, Dvir Shabtay
2024	J	`jnl`	Popular matchings with weighted voters. Games Econ. Behav. Klaus Heeger, Ágnes Cseh
2023	A	`conf`	A Map of Diverse Synthetic Stable Roommates Instances. AAMAS Niclas Boehmer, Klaus Heeger, Stanislaw Szufa
2023	A	`conf`	Adapting Stable Matchings to Forced and Forbidden Pairs. AAMAS Niclas Boehmer, Klaus Heeger
2023	J	`jnl`	Equitable scheduling on a single machine. J. Sched. Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay
2023	A	`conf`	Fully Polynomial-Time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication. ESA Matthias Bentert, Klaus Heeger, Tomohiro Koana
2023	J	`jnl`	No Polynomial Kernels for Knapsack. CoRR Klaus Heeger, Danny Hermelin, Matthias Mnich, Dvir Shabtay
2023	A	`conf`	Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions. STACS Klaus Heeger, André Nichterlein, Rolf Niedermeier
2023	J	`jnl`	Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions. CoRR Klaus Heeger, André Nichterlein, Rolf Niedermeier
2023	B	`conf`	Single Machine Scheduling with Few Deadlines. IPEC Klaus Heeger, Danny Hermelin, Dvir Shabtay
2023	J	`jnl`	Stable matching with multilayer approval preferences: Approvals can be harder than strict preferences. Games Econ. Behav. Matthias Bentert, Niclas Boehmer, Klaus Heeger, Tomohiro Koana
2023	—	`—`	Stable matchings beyond stable marriage: models, algorithms, complexity. Klaus Heeger
2022	J	`jnl`	A Fine-grained View on Stable Many-to-one Matching Problems with Lower and Upper Quotas. ACM Trans. Economics and Comput. Niclas Boehmer, Klaus Heeger
2022	J	`jnl`	A Map of Diverse Synthetic Stable Roommates Instances. CoRR Niclas Boehmer, Klaus Heeger, Stanislaw Szufa
2022	J	`jnl`	Adapting Stable Matchings to Forced and Forbidden Pairs. CoRR Niclas Boehmer, Klaus Heeger
2022	B	`conf`	Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems. MFCS Niclas Boehmer, Klaus Heeger, Rolf Niedermeier
2022	J	`jnl`	Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems. CoRR Niclas Boehmer, Klaus Heeger, Rolf Niedermeier
2022	J	`jnl`	Length-bounded cuts: Proper interval graphs and structural parameters. J. Comput. Syst. Sci. Matthias Bentert, Klaus Heeger, Dusan Knop
2022	A	`conf`	Multivariate Algorithmics for Eliminating Envy by Donating Goods. AAMAS Niclas Boehmer, Robert Bredereck, Klaus Heeger, Dusan Knop, Junjie Luo
2022	J	`jnl`	Multivariate Algorithmics for Eliminating Envy by Donating Goods. CoRR Niclas Boehmer, Robert Bredereck, Klaus Heeger, Dusan Knop, Junjie Luo
2022	J	`jnl`	Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters. Inf. Comput. Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier
2022	B	`conf`	Stable Matching with Multilayer Approval Preferences: Approvals Can Be Harder Than Strict Preferences. SAGT Matthias Bentert, Niclas Boehmer, Klaus Heeger, Tomohiro Koana
2022	J	`jnl`	Stable Matching with Multilayer Approval Preferences: Approvals can be Harder than Strict Preferences. CoRR Matthias Bentert, Niclas Boehmer, Klaus Heeger, Tomohiro Koana
2022	A*	`conf`	Theory of and Experiments on Minimally Invasive Stability Preservation in Changing Two-Sided Matching Markets. AAAI Niclas Boehmer, Klaus Heeger, Rolf Niedermeier
2021	J	`jnl`	Bribery and Control in Stable Marriage. J. Artif. Intell. Res. Niclas Boehmer, Robert Bredereck, Klaus Heeger, Rolf Niedermeier
2021	A*	`conf`	Equitable Scheduling on a Single Machine. AAAI Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay
2021	J	`jnl`	Multistage graph problems on a global budget. Theor. Comput. Sci. Klaus Heeger, Anne-Sophie Himmel, Frank Kammer, Rolf Niedermeier, Malte Renken, Andrej Sajenko
2021	J	`jnl`	Polynomial Turing Kernels for Clique with an Optimal Number of Queries. CoRR Till Fluschnik, Klaus Heeger, Danny Hermelin
2021	J	`jnl`	Popular matchings with weighted voters. CoRR Klaus Heeger, Ágnes Cseh
2021	J	`jnl`	Theory of and Experiments on Minimally Invasive Stability Preservation in Changing Two-Sided Matching Markets. CoRR Niclas Boehmer, Klaus Heeger, Rolf Niedermeier
2020	—	`conf`	A Fine-Grained View on Stable Many-To-One Matching Problems with Lower and Upper Quotas. WINE Niclas Boehmer, Klaus Heeger
2020	J	`jnl`	A Fine-Grained View on Stable Many-To-One Matching Problems with Lower and Upper Quotas. CoRR Niclas Boehmer, Klaus Heeger
2020	B	`conf`	Bribery and Control in Stable Marriage. SAGT Niclas Boehmer, Robert Bredereck, Klaus Heeger, Rolf Niedermeier
2020	J	`jnl`	Bribery and Control in Stable Marriage. CoRR Niclas Boehmer, Robert Bredereck, Klaus Heeger, Rolf Niedermeier
2020	J	`jnl`	Equitable Scheduling on a Single Machine. CoRR Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay
2020	B	`conf`	Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters. ISAAC Matthias Bentert, Klaus Heeger, Dusan Knop
2020	—	`conf`	Multidimensional Stable Roommates with Master List. WINE Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier
2020	J	`jnl`	Multidimensional Stable Roommates with Master List. CoRR Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier
2020	J	`jnl`	The stable marriage problem with ties and restricted edges. Discret. Optim. Ágnes Cseh, Klaus Heeger
2019	J	`jnl`	Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters. CoRR Matthias Bentert, Klaus Heeger, Dusan Knop
2019	J	`jnl`	Multistage Problems on a Global Budget. CoRR Klaus Heeger, Anne-Sophie Himmel, Frank Kammer, Rolf Niedermeier, Malte Renken, Andrej Sajenko
2019	B	`conf`	Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters. ISAAC Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier
2019	J	`jnl`	Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters. CoRR Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier
2019	J	`jnl`	The stable marriage problem with ties and restricted edges. CoRR Ágnes Cseh, Klaus Heeger
2017	J	`jnl`	Two-Connected Spanning Subgraphs with at Most $\frac{10}{7}{OPT}$ Edges. SIAM J. Discret. Math. Klaus Heeger, Jens Vygen
2016	J	`jnl`	Two-connected spanning subgraphs with at most 10/7 OPT edges. CoRR Klaus Heeger, Jens Vygen