Author of the publication

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

. Technical University of Berlin, Germany, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters., , , and . ISAAC, volume 149 of LIPIcs, page 44:1-44:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)A Map of Diverse Synthetic Stable Roommates Instances., , and . AAMAS, page 1003-1011. ACM, (2023)Single Machine Scheduling with Few Deadlines., , and . IPEC, volume 285 of LIPIcs, page 24:1-24:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Fully Polynomial-time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication., , and . CoRR, (2024)A Fine-Grained View on Stable Many-To-One Matching Problems with Lower and Upper Quotas., and . WINE, volume 12495 of Lecture Notes in Computer Science, page 31-44. Springer, (2020)Bribery and Control in Stable Marriage., , , and . SAGT, volume 12283 of Lecture Notes in Computer Science, page 163-177. Springer, (2020)Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions., , and . STACS, volume 254 of LIPIcs, page 35:1-35:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters., , and . ISAAC, volume 181 of LIPIcs, page 36:1-36:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Minimizing the Number of Tardy Jobs with Uniform Processing Times on Parallel Machines., and . CoRR, (2024)Multistage Problems on a Global Budget., , , , , and . CoRR, (2019)