From post

Improved Approximation Bounds for the Student-Project Allocation Problem with Preferences over Projects.

, , и . TAMC, том 6648 из Lecture Notes in Computer Science, стр. 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.

 

Другие публикации лиц с тем же именем

Approximation of coNP Sets by NP-complete Sets., и . COCOON, том 959 из Lecture Notes in Computer Science, стр. 11-20. Springer, (1995)Properties of Symmetric Incentive Compatible Auctions., , , , и . COCOON, том 4598 из Lecture Notes in Computer Science, стр. 264-273. Springer, (2007)Approximated Vertex Cover for Graphs with Perfect Matchings., , и . COCOON, том 3106 из Lecture Notes in Computer Science, стр. 132-142. Springer, (2004)Stable Marriage with Incomplete Lists and Ties., , , и . ICALP, том 1644 из Lecture Notes in Computer Science, стр. 443-452. Springer, (1999)Reconstructing Strings from Substrings with Quantum Queries., , , , , , и . SWAT, том 7357 из Lecture Notes in Computer Science, стр. 388-397. Springer, (2012)Parameterized testability., и . ITCS, стр. 507-516. ACM, (2014)Verifying Nash Equilibria in PageRank Games on Undirected Web Graphs., , и . ISAAC, том 7074 из Lecture Notes in Computer Science, стр. 415-424. Springer, (2011)Approximation Algorithms for the Sex-Equal Stable Marriage Problem., , и . WADS, том 4619 из Lecture Notes in Computer Science, стр. 201-213. Springer, (2007)Quantum Identification of Boolean Oracles., , , , , и . STACS, том 2996 из Lecture Notes in Computer Science, стр. 105-116. Springer, (2004)Undecidability on Quantum Finite Automata., и . STOC, стр. 368-375. ACM, (1999)