Rank-maximal matchings RW Irving, T Kavitha, K Mehlhorn, D Michail, KE Paluch
ACM Transactions on Algorithms (TALG) 2 (4), 602-610, 2006
110 2006 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
79 2004 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
47 2009 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
33 2007 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
33 2004 Faster and simpler approximation of stable matchings K Paluch
Algorithms 7 (2), 189-202, 2014
27 2014 An T Kavitha, K Mehlhorn, D Michail, KE Paluch
Algorithmica 52 (3), 333-349, 2008
25 2008 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
23 2012 Capacitated rank-maximal matchings K Paluch
International Conference on Algorithms and Complexity, 324-335, 2013
17 2013 Faster and simpler approximation of stable matchings K Paluch
International Workshop on Approximation and Online Algorithms, 176-187, 2011
16 2011 Better approximation algorithms for maximum asymmetric traveling salesman and shortest superstring K Paluch
arXiv preprint arXiv:1401.3670, 2014
15 2014 Rectangle tiling K Loryś, K Paluch
International Workshop on Approximation Algorithms for Combinatorial …, 2000
14 2000 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
11 2017 Popular and clan-popular b-matchings K Paluch
Theoretical Computer Science 544, 3-13, 2014
10 2014 New approximation algorithm for RTILE problem K Lorys, KE Paluch
Theoretical computer science 303 (2-3), 517-537, 2003
10 2003 Characterisation of strongly stable matchings A Kunysz, K Paluch, P Ghosal
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
9 2016 A new approximation algorithm for multidimensional rectangle tiling K Paluch
International Symposium on Algorithms and Computation, 712-721, 2006
9 2006 A K Paluch
International Colloquium on Automata, Languages, and Programming, 1054-1065, 2004
9 2004 Maximum ATSP with weights zero and one via half-edges K Paluch
Theory of Computing Systems 62 (2), 319-336, 2018
4 2018 New approximation algorithms for (1, 2)-tsp A Adamaszek, M Mnich, K Paluch
45th International Colloquium on Automata, Languages, and Programming (ICALP …, 2018
4 2018 