Katarzyna E. Paluch

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 12

Top Topics

Traveling Salesman

Weighted Average

Approximation Algorithms

Top Venues

Theory Comput. Syst.

Publications

Katarzyna E. Paluch, Mateusz Wasylkiewicz
Clique-free t-matchings in degree-bounded graphs. CoRR (2024)
Katarzyna E. Paluch
Maximum ATSP with Weights Zero and One via Half-Edges. Theory Comput. Syst. 62 (2) (2018)
Pratik Ghosal, Katarzyna E. Paluch
Manipulation Strategies for the Rank-Maximal Matching Problem. COCOON (2018)
Szymon Dudycz, Jan Marcinkowski, Katarzyna E. Paluch, Bartosz Rybicki
A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem. IPCO (2017)
Pratik Ghosal, Adam Kunysz, Katarzyna E. Paluch
The Dynamics of Rank-Maximal and Popular Matchings. CoRR (2017)
Pratik Ghosal, Katarzyna E. Paluch
Manipulation Strategies for the Rank Maximal Matching Problem. CoRR (2017)
Szymon Dudycz, Katarzyna E. Paluch
Optimal General Matchings. CoRR (2017)
Adam Kunysz, Katarzyna E. Paluch, Pratik Ghosal
Characterisation of Strongly Stable Matchings. SODA (2016)
Pratik Ghosal, Adam Kunysz, Katarzyna E. Paluch
Characterisation of Strongly Stable Matchings. CoRR (2015)
Szymon Dudycz, Jan Marcinkowski, Katarzyna E. Paluch, Bartosz Rybicki
A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem. CoRR (2015)
Katarzyna E. Paluch
Maximum ATSP with Weights Zero and One via Half-Edges. WAOA (2015)
Katarzyna E. Paluch
Balanced matchings, unbalanced ones and related problems. CTW (2015)
Katarzyna E. Paluch
Faster and Simpler Approximation of Stable Matchings. Algorithms 7 (2) (2014)
Katarzyna E. Paluch
Popular and clan-popular b-matchings. Theor. Comput. Sci. 544 (2014)
Katarzyna E. Paluch
Better Approximation Algorithms for Maximum Asymmetric Traveling Salesman and Shortest Superstring. CoRR (2014)
Katarzyna E. Paluch
Maximum ATSP with Weights Zero and One via Half-Edges. CoRR (2014)
Katarzyna E. Paluch
Capacitated Rank-Maximal Matchings. CIAC (2013)
Katarzyna E. Paluch, Khaled M. Elbassioni, Anke van Zuylen
Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem. STACS (2012)
Katarzyna E. Paluch
Popular and Clan-Popular b-Matchings. ISAAC (2012)
Katarzyna E. Paluch
Popular b-matchings CoRR (2011)
Katarzyna E. Paluch
Faster and Simpler Approximation of Stable Matchings. WAOA (2011)
Katarzyna E. Paluch, Marcin Mucha, Aleksander Madry
A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem. APPROX-RANDOM (2009)
Katarzyna E. Paluch
Faster and simpler approximation of stable matchings CoRR (2009)
Katarzyna E. Paluch, Marcin Mucha, Aleksander Madry
A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem CoRR (2008)
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
)\tilde{O}(m^{2}n) Algorithm for Minimum Cycle Basis of Graphs. Algorithmica 52 (3) (2008)
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
) and extension to the hospitals-residents problem. ACM Trans. Algorithms 3 (2) (2007)
Katarzyna E. Paluch
A New Approximation Algorithm for Multidimensional Rectangle Tiling. ISAAC (2006)
Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
Rank-maximal matchings. ACM Trans. Algorithms 2 (4) (2006)
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem. STACS (2004)
Katarzyna E. Paluch
A 2(1/8)-Approximation Algorithm for Rectangle Tiling. ICALP (2004)
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
A Faster Algorithm for Minimum Cycle Basis of Graphs. ICALP (2004)
Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
Rank-maximal matchings. SODA (2004)
Krzysztof Lorys, Katarzyna E. Paluch
New approximation algorithm for RTILE problem. Theor. Comput. Sci. 303 (2-3) (2003)
Krzysztof Lorys, Katarzyna E. Paluch
Rectangle tiling. APPROX (2000)