default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKlaus Heeger
Person information
- affiliation: TU Berlin, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2023
[b1]Klaus Heeger:
Stable matchings beyond stable marriage: models, algorithms, complexity. Technical University of Berlin, Germany, 2023
Journal Articles
- 2025
- [j13]Niclas Boehmer, Klaus Heeger:
Adapting stable matchings to forced and forbidden pairs. J. Comput. Syst. Sci. 147: 103579 (2025) - 2024
- [j12]Niclas Boehmer, Robert Bredereck, Klaus Heeger, Dusan Knop, Junjie Luo:
Multivariate algorithmics for eliminating envy by donating goods. Auton. Agents Multi Agent Syst. 38(2): 43 (2024) - [j11]Klaus Heeger, Ágnes Cseh
:
Popular matchings with weighted voters. Games Econ. Behav. 144: 300-328 (2024) - [j10]Niclas Boehmer, Klaus Heeger, Stanislaw Szufa:
A Map of Diverse Synthetic Stable Matching Instances. J. Artif. Intell. Res. 79: 1113-1166 (2024) - 2023
- [j9]Matthias Bentert, Niclas Boehmer, Klaus Heeger, Tomohiro Koana:
Stable matching with multilayer approval preferences: Approvals can be harder than strict preferences. Games Econ. Behav. 142: 508-526 (2023) - [j8]Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay:
Equitable scheduling on a single machine. J. Sched. 26(2): 209-225 (2023) - 2022
- [j7]Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier:
Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters. Inf. Comput. 289(Part): 104943 (2022) - [j6]Matthias Bentert, Klaus Heeger, Dusan Knop:
Length-bounded cuts: Proper interval graphs and structural parameters. J. Comput. Syst. Sci. 126: 21-43 (2022) - [j5]Niclas Boehmer, Klaus Heeger:
A Fine-grained View on Stable Many-to-one Matching Problems with Lower and Upper Quotas. ACM Trans. Economics and Comput. 10(2): 9:1-9:53 (2022) - 2021
- [j4]Niclas Boehmer, Robert Bredereck, Klaus Heeger, Rolf Niedermeier:
Bribery and Control in Stable Marriage. J. Artif. Intell. Res. 71: 993-1048 (2021) - [j3]Klaus Heeger, Anne-Sophie Himmel, Frank Kammer, Rolf Niedermeier, Malte Renken, Andrej Sajenko:
Multistage graph problems on a global budget. Theor. Comput. Sci. 868: 46-64 (2021) - 2020
- [j2]Ágnes Cseh, Klaus Heeger:
The stable marriage problem with ties and restricted edges. Discret. Optim. 36: 100571 (2020) - 2017
- [j1]Klaus Heeger, Jens Vygen:
Two-Connected Spanning Subgraphs with at Most $\frac{10}{7}{OPT}$ Edges. SIAM J. Discret. Math. 31(3): 1820-1835 (2017)
Conference and Workshop Papers
- 2024
- [c17]Klaus Heeger, Danny Hermelin:
Minimizing the Weighted Number of Tardy Jobs Is W[1]-Hard. ESA 2024: 68:1-68:14 - [c16]Klaus Heeger, Danny Hermelin, Matthias Mnich, Dvir Shabtay:
No Polynomial Kernels for Knapsack. ICALP 2024: 83:1-83:17 - 2023
- [c15]Niclas Boehmer, Klaus Heeger:
Adapting Stable Matchings to Forced and Forbidden Pairs. AAMAS 2023: 985-993 - [c14]Niclas Boehmer, Klaus Heeger, Stanislaw Szufa:
A Map of Diverse Synthetic Stable Roommates Instances. AAMAS 2023: 1003-1011 - [c13]Matthias Bentert, Klaus Heeger, Tomohiro Koana:
Fully Polynomial-Time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication. ESA 2023: 16:1-16:16 - [c12]Klaus Heeger, Danny Hermelin, Dvir Shabtay:
Single Machine Scheduling with Few Deadlines. IPEC 2023: 24:1-24:15 - [c11]Klaus Heeger, André Nichterlein, Rolf Niedermeier:
Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions. STACS 2023: 35:1-35:19 - 2022
- [c10]Niclas Boehmer, Klaus Heeger, Rolf Niedermeier:
Theory of and Experiments on Minimally Invasive Stability Preservation in Changing Two-Sided Matching Markets. AAAI 2022: 4851-4858 - [c9]Niclas Boehmer, Robert Bredereck, Klaus Heeger, Dusan Knop, Junjie Luo:
Multivariate Algorithmics for Eliminating Envy by Donating Goods. AAMAS 2022: 127-135 - [c8]Niclas Boehmer, Klaus Heeger, Rolf Niedermeier:
Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems. MFCS 2022: 21:1-21:15 - [c7]Matthias Bentert, Niclas Boehmer, Klaus Heeger, Tomohiro Koana:
Stable Matching with Multilayer Approval Preferences: Approvals Can Be Harder Than Strict Preferences. SAGT 2022: 436-453 - 2021
- [c6]Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay:
Equitable Scheduling on a Single Machine. AAAI 2021: 11818-11825 - 2020
- [c5]Matthias Bentert, Klaus Heeger, Dusan Knop:
Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters. ISAAC 2020: 36:1-36:14 - [c4]Niclas Boehmer, Robert Bredereck, Klaus Heeger, Rolf Niedermeier:
Bribery and Control in Stable Marriage. SAGT 2020: 163-177 - [c3]Niclas Boehmer, Klaus Heeger:
A Fine-Grained View on Stable Many-To-One Matching Problems with Lower and Upper Quotas. WINE 2020: 31-44 - [c2]Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier:
Multidimensional Stable Roommates with Master List. WINE 2020: 59-73 - 2019
- [c1]Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier:
Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters. ISAAC 2019: 44:1-44:14
Informal and Other Publications
- 2024
- [i24]Klaus Heeger, Danny Hermelin:
Minimizing the Weighted Number of Tardy Jobs is W[1]-hard. CoRR abs/2401.01740 (2024) - [i23]Matthias Bentert, Klaus Heeger, Tomohiro Koana:
Fully Polynomial-time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication. CoRR abs/2403.01839 (2024) - [i22]Klaus Heeger, Danny Hermelin, Michael L. Pinedo, Dvir Shabtay:
Minimizing the Number of Tardy Jobs and Maximal Tardiness on a Single Machine is NP-hard. CoRR abs/2404.02784 (2024) - [i21]Klaus Heeger, Hendrik Molter:
Minimizing the Number of Tardy Jobs with Uniform Processing Times on Parallel Machines. CoRR abs/2404.14208 (2024) - [i20]Klaus Heeger, Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay:
Fair Repetitive Interval Scheduling. CoRR abs/2407.03987 (2024) - 2023
- [i19]Klaus Heeger, André Nichterlein, Rolf Niedermeier:
Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions. CoRR abs/2301.00797 (2023) - [i18]Klaus Heeger, Danny Hermelin, Matthias Mnich, Dvir Shabtay:
No Polynomial Kernels for Knapsack. CoRR abs/2308.12593 (2023) - 2022
- [i17]Niclas Boehmer, Robert Bredereck, Klaus Heeger, Dusan Knop, Junjie Luo:
Multivariate Algorithmics for Eliminating Envy by Donating Goods. CoRR abs/2202.01716 (2022) - [i16]Niclas Boehmer, Klaus Heeger:
Adapting Stable Matchings to Forced and Forbidden Pairs. CoRR abs/2204.10040 (2022) - [i15]Matthias Bentert, Niclas Boehmer, Klaus Heeger, Tomohiro Koana:
Stable Matching with Multilayer Approval Preferences: Approvals can be Harder than Strict Preferences. CoRR abs/2205.07550 (2022) - [i14]Niclas Boehmer, Klaus Heeger, Rolf Niedermeier:
Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems. CoRR abs/2208.01563 (2022) - [i13]Niclas Boehmer, Klaus Heeger, Stanislaw Szufa:
A Map of Diverse Synthetic Stable Roommates Instances. CoRR abs/2208.04041 (2022) - 2021
- [i12]Till Fluschnik, Klaus Heeger, Danny Hermelin:
Polynomial Turing Kernels for Clique with an Optimal Number of Queries. CoRR abs/2110.03279 (2021) - [i11]Klaus Heeger, Ágnes Cseh:
Popular matchings with weighted voters. CoRR abs/2110.05901 (2021) - [i10]Niclas Boehmer, Klaus Heeger, Rolf Niedermeier:
Theory of and Experiments on Minimally Invasive Stability Preservation in Changing Two-Sided Matching Markets. CoRR abs/2112.05777 (2021) - 2020
- [i9]Niclas Boehmer, Robert Bredereck, Klaus Heeger, Rolf Niedermeier:
Bribery and Control in Stable Marriage. CoRR abs/2007.04948 (2020) - [i8]Niclas Boehmer, Klaus Heeger:
A Fine-Grained View on Stable Many-To-One Matching Problems with Lower and Upper Quotas. CoRR abs/2009.14171 (2020) - [i7]Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier:
Multidimensional Stable Roommates with Master List. CoRR abs/2009.14191 (2020) - [i6]Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay:
Equitable Scheduling on a Single Machine. CoRR abs/2010.04643 (2020) - 2019
- [i5]Ágnes Cseh, Klaus Heeger:
The stable marriage problem with ties and restricted edges. CoRR abs/1907.10458 (2019) - [i4]Matthias Bentert, Klaus Heeger, Dusan Knop:
Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters. CoRR abs/1910.03409 (2019) - [i3]Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier:
Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters. CoRR abs/1911.09379 (2019) - [i2]Klaus Heeger, Anne-Sophie Himmel, Frank Kammer, Rolf Niedermeier, Malte Renken, Andrej Sajenko:
Multistage Problems on a Global Budget. CoRR abs/1912.04392 (2019) - 2016
- [i1]Klaus Heeger, Jens Vygen:
Two-connected spanning subgraphs with at most 10/7 OPT edges. CoRR abs/1609.00147 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 20:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
