Katarzyna E. Paluch

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