Parameterized algorithms M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ... Springer 4 (8), 2015 | 1342 | 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 | 300 | 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 | 163 | 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 | 120 | 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 | 116 | 2013 |

Exponential-time approximation of weighted set cover M Cygan, Ł Kowalik, M Wykurz Information Processing Letters 109 (16), 957-961, 2009 | 83 | 2009 |

Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth HL Bodlaender, M Cygan, S Kratsch, J Nederlof International Colloquium on Automata, Languages, and Programming, 196-207, 2013 | 69* | 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 | 64 | 2012 |

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 | 63 | 2013 |

Exact and approximate bandwidth M Cygan, M Pilipczuk Theoretical Computer Science 411 (40-42), 3701-3713, 2010 | 57 | 2010 |

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 | 56 | 2017 |

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 | 55 | 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 | 54 | 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 | 54 | 2015 |

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 | 51 | 2019 |

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 | 47 | 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 | 47 | 2013 |

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 | 46 | 2013 |

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 | 45* | 2016 |

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 | 38 | 2019 |