Author of the publication

On the advice complexity of online bipartite matching and online stable marriage.

. Inf. Process. Lett., 114 (12): 714-717 (2014)

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

Database Queries as Combinatorial Optimization Problems., , and . CODAS, page 477-483. World Scientific, (1996)Improved Approximation of the Stable Marriage Problem., , , and . ESA, volume 2832 of Lecture Notes in Computer Science, page 266-277. Springer, (2003)Randomized Approximation of the Stable Marriage Problem., , , and . COCOON, volume 2697 of Lecture Notes in Computer Science, page 339-350. Springer, (2003)A (2-c(log N/N))-Approximation Algorithm for the Stable Marriage Problem., , and . SWAT, volume 3111 of Lecture Notes in Computer Science, page 349-361. Springer, (2004)Improved Approximation Bounds for the Student-Project Allocation Problem with Preferences over Projects., , and . TAMC, volume 6648 of Lecture Notes in Computer Science, page 440-451. Springer, (2011)Identifying link layer home network topologies using HTIP., , , , and . CCNC, page 891-898. IEEE, (2017)Hardness of Instance Generation with Optimal Solutions for the Stable Marriage Problem., and . J. Inf. Process., (2021)Identifying Link Layer Home Network Topologies Using HTIP., , , , and . IEICE Trans. Inf. Syst., 103-D (3): 566-577 (2020)Strongly Stable and Maximum Weakly Stable Noncrossing Matchings., , and . Algorithmica, 83 (9): 2678-2696 (2021)Improved approximation bounds for the Student-Project Allocation problem with preferences over projects., , and . J. Discrete Algorithms, (2012)