Author of the publication

Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties.

, , , and . STACS, volume 219 of LIPIcs, page 31:1-31:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

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

SAT-Varible Complexity of Hard Combinatorial Problems., and . IFIP Congress (1), volume A-51 of IFIP Transactions, page 253-258. North-Holland, (1994)A 1.875: approximation algorithm for the stable marriage problem., , and . SODA, page 288-297. SIAM, (2007)Privacy Oriented Attribute Exchange in Shibboleth Using Magic Protocols., , , and . SAINT, page 293-296. IEEE Computer Society, (2008)A tight bound on online buffer management for two-port shared-memory switches., , and . SPAA, page 358-364. ACM, (2007)A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties., , and . ESA (2), volume 6347 of Lecture Notes in Computer Science, page 135-146. Springer, (2010)Implementation and evaluation of image recognition algorithm for an intelligent vehicle using heterogeneous multi-core SoC., , , , , , and . ASP-DAC, page 410-415. IEEE, (2015)Strategy-Proof Approximation Algorithms for the Stable Marriage Problem with Ties and Incomplete Lists., , and . ISAAC, volume 149 of LIPIcs, page 9:1-9:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Marriage and Roommate., and . CoRR, (2023)Total Stability in Stable Matching Games., , and . SWAT, volume 53 of LIPIcs, page 23:1-23:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Local Search Algorithms for Partial MAXSAT., , , and . AAAI/IAAI, page 263-268. AAAI Press / The MIT Press, (1997)