Rectangle tiling. - Krzysztof Lorys; Katarzyna E. Paluch 001 (APPROX, 2000)

New approximation algorithm for RTILE problem. - Krzysztof Lorys; Katarzyna E. Paluch 001 (Theor. Comput. Sci., 2003)

A Faster Algorithm for Minimum Cycle Basis of Graphs. - Telikepalli Kavitha; Kurt Mehlhorn; Dimitrios Michail 001; Katarzyna E. Paluch 001 (ICALP, 2004)

A 2(1/8)-Approximation Algorithm for Rectangle Tiling. - Katarzyna E. Paluch 001 (ICALP, 2004)

Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem. - Telikepalli Kavitha; Kurt Mehlhorn; Dimitrios Michail 001; Katarzyna E. Paluch 001 (STACS, 2004)

A New Approximation Algorithm for Multidimensional Rectangle Tiling. - Katarzyna E. Paluch 001 (ISAAC, 2006)

Rank-maximal matchings. - Robert W. Irving; Telikepalli Kavitha; Kurt Mehlhorn; Dimitrios Michail 001; Katarzyna E. Paluch 001 (ACM Trans. Algorithms, 2006)

Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem. - Telikepalli Kavitha; Kurt Mehlhorn; Dimitrios Michail 001; Katarzyna E. Paluch 001 (ACM Trans. Algorithms, 2007)

An [(O) tilde](m2n) tilde{O}(m^{2}n) Algorithm for Minimum Cycle Basis of Graphs. - Telikepalli Kavitha; Kurt Mehlhorn; Dimitrios Michail 001; Katarzyna E. Paluch 001 (Algorithmica, 2008)

A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem. - Katarzyna E. Paluch 001; Marcin Mucha; Aleksander Madry (APPROX-RANDOM, 2009)

Popular b-matchings - Katarzyna E. Paluch 001 (CoRR, 2011)

Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem. - Katarzyna E. Paluch 001; Khaled M. Elbassioni; Anke van Zuylen (STACS, 2012)

Capacitated Rank-Maximal Matchings. - Katarzyna E. Paluch 001 (CIAC, 2013)

Faster and Simpler Approximation of Stable Matchings. - Katarzyna E. Paluch 001 (Algorithms, 2014)

Better Approximation Algorithms for Maximum Asymmetric Traveling Salesman and Shortest Superstring. - Katarzyna E. Paluch 001 (CoRR, 2014)

Popular and clan-popular b-matchings. - Katarzyna E. Paluch 001 (Theor. Comput. Sci., 2014)

Balanced matchings, unbalanced ones and related problems. - Katarzyna E. Paluch 001 (CTW, 2015)

Characterisation of Strongly Stable Matchings. - Adam Kunysz; Katarzyna E. Paluch 001; Pratik Ghosal (SODA, 2016)

A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem. - Szymon Dudycz; Jan Marcinkowski; Katarzyna E. Paluch 001; Bartosz Rybicki (IPCO, 2017)

Manipulation Strategies for the Rank-Maximal Matching Problem. - Pratik Ghosal; Katarzyna E. Paluch 001 (COCOON, 2018)

New Approximation Algorithms for (1, 2)-TSP. - Anna Adamaszek; Matthias Mnich; Katarzyna Paluch 001 (ICALP, 2018)

Optimal General Matchings. - Szymon Dudycz; Katarzyna Paluch 001 (WG, 2018)

Maximum ATSP with Weights Zero and One via Half-Edges. - Katarzyna E. Paluch 001 (Theory Comput. Syst., 2018)

New Approximation Algorithms for Maximum Asymmetric Traveling Salesman and Shortest Superstring. - Katarzyna Paluch 001 (CoRR, 2020)

Restricted t-Matchings via Half-Edges. - Katarzyna Paluch 001; Mateusz Wasylkiewicz (ESA, 2021)

A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs - via half-edges. - Katarzyna Paluch 001; Mateusz Wasylkiewicz (Inf. Process. Lett., 2021)

Triangle-free 2-matchings. - Katarzyna Paluch 001 (CoRR, 2023)

The dynamics of rank-maximal and popular matchings. - Pratik Ghosal; Adam Kunysz; Katarzyna Paluch 001 (Theor. Comput. Sci., 2023)

Rectangle Tiling Binary Arrays. - Pratik Ghosal; Syed Mohammad Meesum; Katarzyna Paluch 001 (APPROX/RANDOM, 2024)

Clique-free t-matchings in degree-bounded graphs. - Katarzyna E. Paluch 001; Mateusz Wasylkiewicz (CoRR, 2024)