Author of the publication

Randomized Approximation of the Stable Marriage Problem.

, , , and . COCOON, volume 2697 of Lecture Notes in Computer Science, page 339-350. Springer, (2003)

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)A tight bound on online buffer management for two-port shared-memory switches., , and . SPAA, page 358-364. ACM, (2007)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)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)Privacy Oriented Attribute Exchange in Shibboleth Using Magic Protocols., , , and . SAINT, page 293-296. IEEE Computer Society, (2008)Jointly Stable Matchings., and . ISAAC, volume 92 of LIPIcs, page 56:1-56:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number., , , and . IWOCA, volume 11638 of Lecture Notes in Computer Science, page 327-338. Springer, (2019)Online Independent Sets., , , and . COCOON, volume 1858 of Lecture Notes in Computer Science, page 202-209. Springer, (2000)