Author of the publication

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)

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

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)Capacity-Insensitive Algorithms for Online Facility Assignment Problems on a Line., , and . CoRR, (2022)Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties., , , and . CoRR, (2021)Improved approximation bounds for the Student-Project Allocation problem with preferences over projects., , and . J. Discrete Algorithms, (2012)On the advice complexity of online bipartite matching and online stable marriage.. Inf. Process. Lett., 114 (12): 714-717 (2014)Improving the Competitive Ratio of the Online OVSF Code Assignment Problem., and . ISAAC, volume 5369 of Lecture Notes in Computer Science, page 64-76. Springer, (2008)Identifying link layer home network topologies using HTIP., , , , and . CCNC, page 891-898. IEEE, (2017)Incomplete List Setting of the Hospitals/Residents Problem with Maximally Satisfying Lower Quotas., , and . SAGT, volume 13584 of Lecture Notes in Computer Science, page 544-561. Springer, (2022)