Katarzyna Paluch
Katarzyna Paluch
Verified email at cs.uni.wroc.pl
Title
Cited by
Cited by
Year
Rank-maximal matchings
RW Irving, T Kavitha, K Mehlhorn, D Michail, KE Paluch
ACM Transactions on Algorithms (TALG) 2 (4), 602-610, 2006
1092006
A faster algorithm for minimum cycle basis of graphs
T Kavitha, K Mehlhorn, D Michail, K Paluch
International Colloquium on Automata, Languages, and Programming, 846-857, 2004
802004
A 7/9-approximation algorithm for the maximum traveling salesman problem
K Paluch, M Mucha, A Madry
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2009
462009
Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem
T Kavitha, K Mehlhorn, D Michail, KE Paluch
ACM Transactions on Algorithms (TALG) 3 (2), 15-es, 2007
332007
Strongly stable matchings in time O (nm) and extension to the hospitals-residents problem
T Kavitha, K Mehlhorn, D Michail, K Paluch
Annual Symposium on Theoretical Aspects of Computer Science, 222-233, 2004
322004
Faster and simpler approximation of stable matchings
K Paluch
Algorithms 7 (2), 189-202, 2014
262014
An Algorithm for Minimum Cycle Basis of Graphs
T Kavitha, K Mehlhorn, D Michail, KE Paluch
Algorithmica 52 (3), 333-349, 2008
252008
Simpler approximation of the maximum asymmetric traveling salesman problem
K Paluch, K Elbassioni, A Van Zuylen
222012
Capacitated rank-maximal matchings
K Paluch
International Conference on Algorithms and Complexity, 324-335, 2013
162013
Rectangle tiling
K Loryś, K Paluch
International Workshop on Approximation Algorithms for Combinatorial …, 2000
162000
Better approximation algorithms for maximum asymmetric traveling salesman and shortest superstring
K Paluch
arXiv preprint arXiv:1401.3670, 2014
152014
Faster and simpler approximation of stable matchings
K Paluch
International Workshop on Approximation and Online Algorithms, 176-187, 2011
152011
A 4/5-approximation algorithm for the maximum traveling salesman problem
S Dudycz, J Marcinkowski, K Paluch, B Rybicki
International Conference on Integer Programming and Combinatorial …, 2017
112017
Popular and clan-popular b-matchings
K Paluch
Theoretical Computer Science 544, 3-13, 2014
102014
New approximation algorithm for RTILE problem
K Lorys, KE Paluch
Theoretical computer science 303 (2-3), 517-537, 2003
102003
A -Approximation Algorithm for Rectangle Tiling
K Paluch
International Colloquium on Automata, Languages, and Programming, 1054-1065, 2004
92004
Characterisation of strongly stable matchings
A Kunysz, K Paluch, P Ghosal
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
82016
A new approximation algorithm for multidimensional rectangle tiling
K Paluch
International Symposium on Algorithms and Computation, 712-721, 2006
82006
New approximation algorithms for (1, 2)-tsp
A Adamaszek, M Mnich, K Paluch
45th International Colloquium on Automata, Languages, and Programming (ICALP …, 2018
42018
The dynamics of rank-maximal and popular matchings
P Ghosal, A Kunysz, K Paluch
arXiv preprint arXiv:1703.10594, 2017
42017
The system can't perform the operation now. Try again later.
Articles 1–20