| Parameterized algorithms M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ... Springer 5 (4), 16, 2015 | 1491 | 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 | 306 | 2011 |
| A 5-Approximation Algorithm for Treewidth HL Bodlaender, PG Drange, MS Dregi, FV Fomin, D Lokshtanov, ... SIAM Journal on Computing 45 (2), 317-378, 2016 | 240 | 2016 |
| 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 | 120 | 2013 |
| How to hunt an invisible rabbit on a graph TV Abramovskaya, FV Fomin, PA Golovach, M Pilipczuk European Journal of Combinatorics 52, 12-26, 2016 | 85 | 2016 |
| Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams D Marx, M Pilipczuk Algorithms-ESA 2015, 865-877, 2015 | 76 | 2015 |
| Tight bounds for parameterized complexity of cluster editing with a small number of clusters FV Fomin, S Kratsch, M Pilipczuk, M Pilipczuk, Y Villanger Journal of Computer and System Sciences 80 (7), 1430-1447, 2014 | 75* | 2014 |
| 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 | 72 | 2013 |
| 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 | 71* | 2016 |
| Known algorithms for edge clique cover are probably optimal M Cygan, M Pilipczuk, M Pilipczuk SIAM Journal on Computing 45 (1), 67-83, 2016 | 61 | 2016 |
| Everything you always wanted to know about the parameterized complexity of subgraph isomorphism (but were afraid to ask) D Marx, M Pilipczuk arXiv preprint arXiv:1307.2187, 2013 | 61 | 2013 |
| Minimum Bisection is fixed-parameter tractable M Cygan, D Lokshtanov, M Pilipczuk, M Pilipczuk, S Saurabh SIAM Journal on Computing 48 (2), 417-450, 2019 | 56 | 2019 |
| Fully polynomial-time parameterized computations for graphs and matrices of low treewidth FV Fomin, D Lokshtanov, S Saurabh, M Pilipczuk, M Wrochna ACM Transactions on Algorithms (TALG) 14 (3), 1-45, 2018 | 55 | 2018 |
| 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 | 53 | 2013 |
| Fixed-parameter tractability of multicut in directed acyclic graphs S Kratsch, M Pilipczuk, M Pilipczuk, M Wahlström SIAM Journal on Discrete Mathematics 29 (1), 122-144, 2015 | 51 | 2015 |
| Clique cover and graph separation: New incompressibility results M Cygan, S Kratsch, M Pilipczuk, M Pilipczuk, M Wahlström ACM Transactions on Computation Theory (TOCT) 6 (2), 1-19, 2014 | 51 | 2014 |
| Kernelization hardness of connectivity problems in d-degenerate graphs M Cygan, M Pilipczuk, M Pilipczuk, JO Wojtaszczyk Discrete Applied Mathematics 160 (15), 2131-2141, 2012 | 50 | 2012 |
| Network sparsification for Steiner problems on planar and bounded-genus graphs M Pilipczuk, M Pilipczuk, P Sankowski, EJV Leeuwen ACM Transactions on Algorithms (TALG) 14 (4), 1-73, 2018 | 46* | 2018 |
| Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth D Lokshtanov, M Pilipczuk, M Pilipczuk, S Saurabh SIAM Journal on Computing 46 (1), 161-189, 2017 | 46 | 2017 |
| Kernelization and sparseness: the case of dominating set PG Drange, MS Dregi, FV Fomin, S Kreutzer, D Lokshtanov, M Pilipczuk, ... arXiv preprint arXiv:1411.4575, 2014 | 45 | 2014 |
Marcin PilipczukInstytut Informatyki, Uniwersytet WarszawskiVerified email at mimuw.edu.pl
