| Parameterized Algorithms M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ... Springer, 2015 | 2895 | 2015 |
| Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time M Cygan, J Nederlof, M Pilipczuk, M Pilipczuk, JMM Van Rooij, ... ACM Transactions on Algorithms (TALG) 18 (2), 1-31, 2022 | 404* | 2022 |
| Faster deterministic feedback vertex set T Kociumaka, M Pilipczuk Information Processing Letters 114 (10), 556-560, 2014 | 126 | 2014 |
| 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 | 103 | 2016 |
| A fast branching algorithm for cluster vertex deletion A Boral, M Cygan, T Kociumaka, M Pilipczuk Theory of Computing Systems 58 (2), 357-376, 2016 | 103* | 2016 |
| On multiway cut parameterized above lower bounds M Cygan, M Pilipczuk, M Pilipczuk, JO Wojtaszczyk ACM Transactions on Computation Theory (TOCT) 5 (1), 3, 2013 | 103 | 2013 |
| Tight bounds for Parameterized Complexity of Cluster Editing. FV Fomin, S Kratsch, M Pilipczuk, M Pilipczuk, Y Villanger STACS 20, 32-43, 2013 | 101* | 2013 |
| Polynomial-time Algorithm for Maximum Weight Independent Set on P6-free Graphs A Grzesik, T Klimošová, M Pilipczuk, M Pilipczuk ACM Transactions on Algorithms (TALG) 18 (1), 1-57, 2022 | 96 | 2022 |
| 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 | 96 | 2013 |
| Known algorithms for EDGE CLIQUE COVER are probably optimal M Cygan, M Pilipczuk, M Pilipczuk SIAM Journal on Computing 45 (1), 67-83, 2016 | 93 | 2016 |
| Exact and approximate bandwidth M Cygan, M Pilipczuk Theoretical Computer Science 411 (40), 3701-3713, 2010 | 92 | 2010 |
| Minimum bisection is fixed parameter tractable M Cygan, D Lokshtanov, M Pilipczuk, M Pilipczuk, S Saurabh Proceedings of the 46th Annual ACM Symposium on Theory of Computing, 323-332, 2014 | 78 | 2014 |
| The planar directed k-Vertex-Disjoint Paths problem is fixed-parameter tractable M Cygan, D Marx, M Pilipczuk, M Pilipczuk Foundations of Computer Science (FOCS), 2013 IEEE 54th Annual Symposium on …, 2013 | 78 | 2013 |
| Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth D Lokshtanov, M Pilipczuk, M Pilipczuk, S Saurabh Foundations of Computer Science (FOCS), 2014 IEEE 55th Annual Symposium on …, 2014 | 71 | 2014 |
| 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), 53, 2018 | 68* | 2018 |
| 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 | 63 | 2014 |
| On the Maximum Weight Independent Set Problem in graphs without induced cycles of length at least five M Chudnovsky, M Pilipczuk, M Pilipczuk, S Thomassé arXiv preprint arXiv:1903.04761, 2019 | 61* | 2019 |
| On multiway cut parameterized above lower bounds M Cygan, M Pilipczuk, M Pilipczuk, JO Wojtaszczyk Parameterized and Exact Computation: 6th International Symposium, IPEC 2011 …, 2012 | 59 | 2012 |
| 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 | 57 | 2014 |
| Parameterized complexity of eulerian deletion problems M Cygan, D Marx, M Pilipczuk, M Pilipczuk, I Schlotter Algorithmica 68 (1), 41-61, 2014 | 57 | 2014 |
Michał PilipczukUniversity of Warsaw在 mimuw.edu.pl 的电子邮件经过验证
