| Maximum matchings via Gaussian elimination M Mucha, P Sankowski 45th Annual IEEE Symposium on Foundations of Computer Science, 248-255, 2004 | 379 | 2004 |
| -Approximation for Graphic TSP M Mucha Theory of computing systems 55 (4), 640-657, 2014 | 122 | 2014 |
| On problems equivalent to (min,+)-convolution M Cygan, M Mucha, K Węgrzycki, M Włodarczyk ACM Transactions on Algorithms (TALG) 15 (1), 1-25, 2019 | 110 | 2019 |
| Applying deep learning to right whale photo identification R Bogucki, M Cygan, CB Khan, M Klimek, JK Milczek, M Mucha Conservation Biology 33 (3), 676-684, 2019 | 95 | 2019 |
| Maximum matchings in planar graphs via Gaussian elimination M Mucha, P Sankowski Algorithmica 45 (1), 3-20, 2006 | 70 | 2006 |
| Lyndon words and short superstrings M Mucha Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013 | 63 | 2013 |
| 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 | 53 | 2009 |
| A subquadratic approximation scheme for partition M Mucha, K Węgrzycki, M Włodarczyk Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 44 | 2019 |
| Deterministic 7/8-approximation for the metric maximum TSP L Kowalik, M Mucha Theoretical Computer Science 410 (47-49), 5000-5009, 2009 | 42 | 2009 |
| Fast dynamic transitive closure with lookahead P Sankowski, M Mucha Algorithmica 56, 180-197, 2010 | 39 | 2010 |
| Online facility location with deletions M Cygan, A Czumaj, M Mucha, P Sankowski arXiv preprint arXiv:1807.03839, 2018 | 28 | 2018 |
| 35/44-approximation for Asymmetric Maximum TSP with Triangle Inequality L Kowalik, M Mucha Algorithmica 59 (2), 240-255, 2011 | 25* | 2011 |
| Equal-subset-sum faster than the meet-in-the-middle M Mucha, J Nederlof, J Pawlewicz, K Węgrzycki arXiv preprint arXiv:1905.02424, 2019 | 21 | 2019 |
| Dynamic beats fixed: On phase-based algorithms for file migration M Bienkowski, J Byrka, M Mucha ACM Transactions on Algorithms (TALG) 15 (4), 1-21, 2019 | 20 | 2019 |
| The PACE 2020 parameterized algorithms and computational experiments challenge: Treedepth Ł Kowalik, M Mucha, W Nadara, M Pilipczuk, M Sorge, P Wygocki 15th International Symposium on Parameterized and Exact Computation (IPEC …, 2020 | 14 | 2020 |
| Finding maximum matchings via Gaussian elimination M Mucha | 12 | 2005 |
| Approximation algorithms for union and intersection covering problems M Cygan, F Grandoni, S Leonardi, M Mucha, M Pilipczuk, P Sankowski arXiv preprint arXiv:1102.5105, 2011 | 6 | 2011 |
| Matroid-based TSP rounding for half-integral solutions A Gupta, E Lee, J Li, M Mucha, H Newman, S Sarkar International Conference on Integer Programming and Combinatorial …, 2022 | 5 | 2022 |
| A 9k kernel for nonseparating independent set in planar graphs Ł Kowalik, M Mucha Theoretical Computer Science 516, 86-95, 2014 | 5 | 2014 |
| No-wait flowshop scheduling is as hard as asymmetric traveling salesman problem M Mucha, M Sviridenko International Colloquium on Automata, Languages, and Programming, 769-779, 2013 | 5 | 2013 |
Piotr SankowskiUniversity of Warsaw, MIM Solutions,E-mailová adresa ověřena na: mimuw.edu.pl
