| Parameterized algorithms M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ... Springer 5 (4), 16, 2015 | 2378 | 2015 |
| Solving connectivity problems parameterized by treewidth in single exponential time M Cygan, J Nederlof, M Pilipczuk, M Pilipczuk, JMM van Rooij, ... 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 150-159, 2011 | 363 | 2011 |
| On problems as hard as CNF-SAT M Cygan, H Dell, D Lokshtanov, D Marx, J Nederlof, Y Okamoto, R Paturi, ... ACM Transactions on Algorithms (TALG) 12 (3), 1-24, 2016 | 219 | 2016 |
| Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth HL Bodlaender, M Cygan, S Kratsch, J Nederlof Information and Computation 243, 86-111, 2015 | 183 | 2015 |
| On multiway cut parameterized above lower bounds M Cygan, M Pilipczuk, M Pilipczuk, JO Wojtaszczyk ACM Transactions on Computation Theory (TOCT) 5 (1), 1-11, 2013 | 134 | 2013 |
| Exponential-time approximation of weighted set cover M Cygan, Ł Kowalik, M Wykurz Information Processing Letters 109 (16), 957-961, 2009 | 102 | 2009 |
| From gap-eth to fpt-inapproximability: Clique, dominating set, and more P Chalermsook, M Cygan, G Kortsarz, B Laekhanukit, P Manurangsi, ... 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017 | 96 | 2017 |
| Designing FPT algorithms for cut problems using randomized contractions R Chitnis, M Cygan, MT Hajiaghayi, M Pilipczuk, M Pilipczuk SIAM Journal on Computing 45 (4), 1171-1229, 2016 | 90 | 2016 |
| Subset feedback vertex set is fixed-parameter tractable M Cygan, M Pilipczuk, M Pilipczuk, JO Wojtaszczyk SIAM Journal on Discrete Mathematics 27 (1), 290-309, 2013 | 89 | 2013 |
| LP rounding for k-centers with non-uniform hard capacities M Cygan, MT Hajiaghayi, S Khuller 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 273-282, 2012 | 87 | 2012 |
| Known algorithms for edge clique cover are probably optimal M Cygan, M Pilipczuk, M Pilipczuk SIAM Journal on Computing 45 (1), 67-83, 2016 | 85 | 2016 |
| Directed subset feedback vertex set is fixed-parameter tractable R Chitnis, M Cygan, M Hajiaghayi, D Marx ACM Transactions on Algorithms (TALG) 11 (4), 1-28, 2015 | 82 | 2015 |
| Improved approximation for 3-dimensional matching via bounded pathwidth local search M Cygan 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 509-518, 2013 | 79 | 2013 |
| Exact and approximate bandwidth M Cygan, M Pilipczuk Theoretical Computer Science 411 (40-42), 3701-3713, 2010 | 79 | 2010 |
| 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 | 74 | 2019 |
| Fast hamiltonicity checking via bases of perfect matchings M Cygan, S Kratsch, J Nederlof Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013 | 72 | 2013 |
| Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth HL Bodlaender, M Cygan, S Kratsch, J Nederlof Automata, Languages, and Programming: 40th International Colloquium, ICALP …, 2013 | 71* | 2013 |
| Minimum bisection is fixed parameter tractable M Cygan, D Lokshtanov, M Pilipczuk, M Pilipczuk, S Saurabh Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 67 | 2014 |
| The planar directed k-vertex-disjoint paths problem is fixed-parameter tractable M Cygan, D Marx, M Pilipczuk, M Pilipczuk 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 197-206, 2013 | 67 | 2013 |
| Algorithmic applications of baur-strassen’s theorem: Shortest cycles, diameter, and matchings M Cygan, HN Gabow, P Sankowski Journal of the ACM (JACM) 62 (4), 1-30, 2015 | 62 | 2015 |
Marcin PilipczukInstytut Informatyki, Uniwersytet WarszawskiE-mailová adresa ověřena na: mimuw.edu.pl
