Kernelization: theory of parameterized preprocessing FV Fomin, D Lokshtanov, S Saurabh, M Zehavi Cambridge University Press, 2019 | 317 | 2019 |

Mixing color coding-related techniques M Zehavi Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015 | 70 | 2015 |

Representative families: A unified tradeoff-based approach H Shachnai, M Zehavi Journal of Computer and System Sciences 82 (3), 488-502, 2016 | 64* | 2016 |

Parameterized complexity and approximability of directed odd cycle transversal D Lokshtanov, MS Ramanujan, S Saurab, M Zehavi Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 56 | 2020 |

Complexity and algorithms for copy-number evolution problems M El-Kebir, BJ Raphael, R Shamir, R Sharan, S Zaccaria, M Zehavi, ... Algorithms for Molecular Biology 12, 1-11, 2017 | 53* | 2017 |

Popular matching in roommates setting is NP-hard S Gupta, P Misra, S Saurabh, M Zehavi ACM Transactions on Computation Theory (TOCT) 13 (2), 1-20, 2021 | 46 | 2021 |

Clique-width III: Hamiltonian cycle and the odd case of graph coloring FV Fomin, PA Golovach, D Lokshtanov, S Saurabh, M Zehavi ACM Transactions on Algorithms (TALG) 15 (1), 1-27, 2018 | 46* | 2018 |

Feedback vertex set inspired kernel for chordal vertex deletion A Agrawal, D Lokshtanov, P Misra, S Saurabh, M Zehavi ACM Transactions on Algorithms (TALG) 15 (1), 1-28, 2018 | 35 | 2018 |

Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems FV Fomin, TN Le, D Lokshtanov, S Saurabh, S Thomassé, M Zehavi ACM Transactions on Algorithms (TALG) 15 (1), 1-44, 2019 | 32* | 2019 |

Finding, hitting and packing cycles in subexponential time on unit disk graphs FV Fomin, D Lokshtanov, F Panolan, S Saurabh, M Zehavi Discrete & Computational Geometry, 1-33, 2017 | 30 | 2017 |

Maximum minimal vertex cover parameterized by vertex cover M Zehavi SIAM Journal on Discrete Mathematics 31 (4), 2440-2456, 2017 | 28 | 2017 |

Hitting topological minors is FPT FV Fomin, D Lokshtanov, F Panolan, S Saurabh, M Zehavi Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 27 | 2020 |

A linear-time algorithm for the copy number transformation problem R Zeira, M Zehavi, R Shamir Journal of Computational Biology 24 (12), 1179-1194, 2017 | 27* | 2017 |

Exact algorithms for terrain guarding P Ashok, FV Fomin, S Kolay, S Saurabh, M Zehavi LIPIcs-Leibniz International Proceedings in Informatics 77, 2017 | 27 | 2017 |

Reducing CMSO model checking to highly connected graphs D Lokshtanov, MS Ramanujan, S Saurabh, M Zehavi arXiv preprint arXiv:1802.01453, 2018 | 26 | 2018 |

Polylogarithmic approximation algorithms for weighted-ℱ-deletion problems A Agrawal, D Lokshtanov, P Misra, S Saurabh, M Zehavi ACM Transactions on Algorithms (TALG) 16 (4), 1-38, 2020 | 24 | 2020 |

Deterministic algorithms for matching and packing problems based on representative sets P Goyal, N Misra, F Panolan, M Zehavi SIAM Journal on Discrete Mathematics 29 (4), 1815-1836, 2015 | 24* | 2015 |

Split contraction: The untold story A Agrawal, D Lokshtanov, S Saurabh, M Zehavi ACM Transactions on Computation Theory (TOCT) 11 (3), 1-22, 2019 | 22 | 2019 |

Algorithms for *k*-Internal Out-Branching and *k*-Tree in Bounded Degree GraphsM Zehavi Algorithmica 78, 319-341, 2017 | 22* | 2017 |

Spotting trees with few leaves A Bjorklund, V Kamat, Ł Kowalik, M Zehavi SIAM Journal on Discrete Mathematics 31 (2), 687-713, 2017 | 22 | 2017 |