| 2026 | SOFSEM | Clique-Free t-Matchings in Degree-Bounded Graphs. | Katarzyna E. Paluch, Mateusz Wasylkiewicz |
| 2018 | COCOON | Manipulation Strategies for the Rank-Maximal Matching Problem. | Pratik Ghosal, Katarzyna E. Paluch |
| 2017 | IPCO | A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem. | Szymon Dudycz, Jan Marcinkowski, Katarzyna E. Paluch, Bartosz Rybicki |
| 2016 | SODA | Characterisation of Strongly Stable Matchings. | Adam Kunysz, Katarzyna E. Paluch, Pratik Ghosal |
| 2015 | WAOA | Maximum ATSP with Weights Zero and One via Half-Edges. | Katarzyna E. Paluch |
| 2013 | CIAC | Capacitated Rank-Maximal Matchings. | Katarzyna E. Paluch |
| 2012 | ISAAC | Popular and Clan-Popular b-Matchings. | Katarzyna E. Paluch |
| 2012 | STACS | Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem. | Katarzyna E. Paluch, Khaled M. Elbassioni, Anke van Zuylen |
| 2011 | WAOA | Faster and Simpler Approximation of Stable Matchings. | Katarzyna E. Paluch |
| 2006 | ISAAC | A New Approximation Algorithm for Multidimensional Rectangle Tiling. | Katarzyna E. Paluch |
| 2004 | ICALP | A Faster Algorithm for Minimum Cycle Basis of Graphs. | Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch |
| 2004 | ICALP | A 2(1/8)-Approximation Algorithm for Rectangle Tiling. | Katarzyna E. Paluch |
| 2004 | SODA | Rank-maximal matchings. | Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch |
| 2004 | STACS | Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem. | Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch |