Katarzyna Paluch

1. Rectangle Tiling [ps].  Co-author: Krzysztof Lorys. APPROX 2000, 206-213
2. New approximation algorithm for RTILE problem. . [ps].  Co-author: Krzysztof Lorys Theor. Comput. Sci. 2-3(303): 517-537 (2003)
3. Rank-maximal matchings. [ps]  Co-authors: Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail SODA 2004: 68-75
4. Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem. [ps]  Co-authors: Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail. STACS 2004: 222-233
5. A Faster Algorithm for Minimum Cycle Basis of Graphs. [ps]  Co-authors: Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail. ICALP 2004: 846-857
6. A 17/8-Approximation Algorithm for Rectangle Tiling. [ps]  ICALP 2004: 1054-1065
7. A New Approximation Algorithm for Multidimensional Rectangle Tiling. [ps]  ISAAC 2006: 712-721
8. Rank-maximal matchings. [ps]  Co-authors: Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail ACM Transactions on Algorithms 2(4): 602-610 (2006)
9. Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem. [ps]  Co-authors: Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail. ACM Transactions on Algorithms 3(2): (2007)
10. An O(m^{2}n) Algorithm for Minimum Cycle Basis of Graphs. Co-authors: Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail. Algorithmica 52(3): 333-349 (2008)
11. A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem. [ps]  Co-authors: Marcin Mucha, Aleksander Madry CoRR abs/0812.5101: (2008), APPROX-RANDOM 2009: 298-311
12. Faster and simpler approximation of stable matchings. CoRR abs/0911.5660: (2009) http://arxiv.org/abs/0911.5660 There is a new version at arxiv (01.07.2011 pages 19-28) WAOA 2011
13. Popular b-matchings. Submitted.
14. Rank-maximal b-matchings. Arxiv 2010.
15. A combinatorial algorithm for two matchings: fair and maximum rank-maximal. Manuscript.