Follow
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
1452006
A faster algorithm for minimum cycle basis of graphs
T Kavitha, K Mehlhorn, D Michail, K Paluch
Automata, Languages and Programming: 31st International Colloquium, ICALP …, 2004
862004
A 7/9-approximation algorithm for the maximum traveling salesman problem
K Paluch, M Mucha, A Madry
International Workshop on Approximation Algorithms for Combinatorial …, 2009
502009
An algorithm for minimum cycle basis of graphs
T Kavitha, K Mehlhorn, D Michail, KE Paluch
Algorithmica 52 (3), 333-349, 2008
412008
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
402007
Faster and simpler approximation of stable matchings
K Paluch
Algorithms 7 (2), 189-202, 2014
362014
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
352004
Simpler approximation of the maximum asymmetric traveling salesman problem
K Paluch, K Elbassioni, A Van Zuylen
STACS'12 (29th Symposium on Theoretical Aspects of Computer Science) 14, 501-506, 2012
282012
Capacitated rank-maximal matchings
K Paluch
International Conference on Algorithms and Complexity, 324-335, 2013
272013
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
202017
Characterisation of strongly stable matchings
A Kunysz, K Paluch, P Ghosal
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
192016
Better approximation algorithms for maximum asymmetric traveling salesman and shortest superstring
K Paluch
arXiv preprint arXiv:1401.3670, 2014
182014
Faster and simpler approximation of stable matchings
K Paluch
International Workshop on Approximation and Online Algorithms, 176-187, 2011
182011
New approximation algorithms for (1, 2)-tsp
A Adamaszek, M Mnich, K Paluch
45th International Colloquium on Automata, Languages, and Programming (ICALP …, 2018
162018
Rectangle tiling
K Loryś, K Paluch
Approximation Algorithms for Combinatorial Optimization: Third International …, 2000
162000
Popular and clan-popular b-matchings
K Paluch
Theoretical Computer Science 544, 3-13, 2014
132014
A-Approximation Algorithm for Rectangle Tiling
K Paluch
International Colloquium on Automata, Languages, and Programming, 1054-1065, 2004
102004
New approximation algorithm for RTILE problem
K Lorys, KE Paluch
Theoretical computer science 303 (2-3), 517-537, 2003
102003
A new approximation algorithm for multidimensional rectangle tiling
K Paluch
International Symposium on Algorithms and Computation, 712-721, 2006
92006
Optimal general matchings
S Dudycz, K Paluch
Graph-Theoretic Concepts in Computer Science: 44th International Workshop …, 2018
82018
The system can't perform the operation now. Try again later.
Articles 1–20