Author of the publication

Improved approximation bounds for the Student-Project Allocation problem with preferences over projects.

, , and . J. Discrete Algorithms, (2012)

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

Avoiding Routing Loops on the Internet., , , and . SIROCCO, volume 13 of Proceedings in Informatics, page 197-210. Carleton Scientific, (2002)Worst-Case Upper Bounds for kSAT (Column: Algorithmics).. Bulletin of the EATCS, (2004)Exponential Lower Bounds for the Tree-Like Hajós Calculus., and . Inf. Process. Lett., 54 (5): 289-294 (1995)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)Random benchmark circuits with controlled attributes., , , and . ED&TC, page 90-97. IEEE Computer Society, (1997)08431 Abstracts Collection - Moderately Exponential Time Algorithms., , and . Moderately Exponential Time Algorithms, volume 08431 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2008)Harmonic algorithm for 3-dimensional strip packing problem., , , , and . SODA, page 1197-1206. SIAM, (2007)Finding Witnesses for Stability in the Hospitals/Residents Problem., , and . J. Inf. Process., 23 (2): 202-209 (2015)A family of NFAs which need 2n- deterministic states., , and . Theor. Comput. Sci., 301 (1-3): 451-462 (2003)