Author of the publication

Improved Approximation of the Stable Marriage Problem.

, , , and . ESA, volume 2832 of Lecture Notes in Computer Science, page 266-277. 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

Worst-Case Upper Bounds for kSAT (Column: Algorithmics).. Bulletin of the EATCS, (2004)Avoiding Routing Loops on the Internet., , , and . SIROCCO, volume 13 of Proceedings in Informatics, page 197-210. Carleton Scientific, (2002)Approximating vertex cover on dense graphs., and . SODA, page 582-589. SIAM, (2005)Improved upper bounds for 3-SAT., and . SODA, page 328. SIAM, (2004)Online Independent Sets., , , and . COCOON, volume 1858 of Lecture Notes in Computer Science, page 202-209. Springer, (2000)Separating Oblivious and Non-oblivious BPs., , and . COCOON, volume 2108 of Lecture Notes in Computer Science, page 28-38. Springer, (2001)A (2.954 epsilon)n oblivious routing algorithm on 2D meshes., and . SPAA, page 186-195. ACM, (2000)A (2-c*(1/sqrt(N)))-Approximation Algorithm for the Stable Marriage Problem., , and . ISAAC, volume 3827 of Lecture Notes in Computer Science, page 902-914. Springer, (2005)Negation-Limited Complexity of Parity and Inverters., , and . ISAAC, volume 4288 of Lecture Notes in Computer Science, page 223-232. Springer, (2006)Max-stretch Reduction for Tree Spanners., , and . WADS, volume 3608 of Lecture Notes in Computer Science, page 122-133. Springer, (2005)