| 2026 | SODA | Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization. | Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi |
| 2026 | STOC | Fine-Grained Bounds for Courcelle's Theorem. | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi |
| 2025 | AAAI | Adaptive Manipulation for Coalitions in Knockout Tournaments. | Juhi Chaudhary, Hendrik Molter, Meirav Zehavi |
| 2025 | ICALP | (Almost-)Optimal FPT Algorithm and Kernel for T-Cycle on Planar Graphs. | Harmender Gahlawat, Abhishek Rathod, Meirav Zehavi |
| 2025 | ICALP | Treewidth Parameterized by Feedback Vertex Number. | Hendrik Molter, Meirav Zehavi, Amit Zivan |
| 2025 | ICML | What makes an Ensemble (Un) Interpretable? | Shahaf Bassan, Guy Amir, Meirav Zehavi, Guy Katz |
| 2025 | LAGOS | A Parameterized Perspective on Uniquely Restricted Matchings. | Juhi Chaudhary, Ignasi Sau, Meirav Zehavi |
| 2025 | MFCS | Quasipolynomial-Time Deterministic Kernelization and (Gammoid) Representation. | Rohit Gurjar, Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2025 | SODA | Crossing Number in Slightly Superexponential Time (Extended Abstract). | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Jie Xue, Meirav Zehavi |
| 2025 | STOC | Efficiently Finding and Counting Patterns with Distance Constraints in Sparse Graphs. | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi |
| 2025 | STOC | Subexponential Parameterized Algorithms for Hitting Subgraphs. | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi |
| 2025 | WALCOM | Min-Sum Disjoint Paths on Subclasses of Chordal Graphs. | Bar Menashe, Meirav Zehavi |
| 2024 | AAAI | How to Make Knockout Tournaments More Popular? | Juhi Chaudhary, Hendrik Molter, Meirav Zehavi |
| 2024 | AAAI | Learning Small Decision Trees with Few Outliers: A Parameterized Perspective. | Harmender Gahlawat, Meirav Zehavi |
| 2024 | IJCAI | Parameterized Analysis of Bribery in Challenge the Champ Tournaments. | Juhi Chaudhary, Hendrik Molter, Meirav Zehavi |
| 2024 | ISAAC | A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees. | Ashwin Jacob, Diptapriyo Majumdar, Meirav Zehavi |
| 2024 | ISAAC | Exact Algorithms for Clustered Planarity with Linear Saturators. | Giordano Da Lozzo, Robert Ganian, Siddharth Gupta, Bojan Mohar, Sebastian Ordyniak, Meirav Zehavi |
| 2024 | SODA | Meta-theorems for Parameterized Streaming Algorithms‡. | Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi |
| 2023 | AAAI | Tournament Fixing Parameterized by Feedback Vertex Set Number Is FPT. | Meirav Zehavi |
| 2023 | ESA | Kernelization for Spreading Points. | Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi |
| 2023 | ESA | Lossy Kernelization for (Implicit) Hitting Set Problems. | Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stphan Thomass, Meirav Zehavi |
| 2023 | ESA | Finding Long Directed Cycles Is Hard Even When DFVS Is Small or Girth Is Large. | Ashwin Jacob, Michal Wlodarczyk, Meirav Zehavi |
| 2023 | FOCS | Planar Disjoint Paths, Treewidth, and Kernels. | Michal Wlodarczyk, Meirav Zehavi |
| 2023 | IJCAI | In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks? | Pascal Kunz, Hendrik Molter, Meirav Zehavi |
| 2023 | MFCS | Parameterized Analysis of the Cops and Robber Game. | Harmender Gahlawat, Meirav Zehavi |
| 2023 | SODA | A Framework for Approximation Schemes on Disk Graphs. | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi |
| 2023 | SOFSEM | Parameterized Approaches to Orthogonal Compaction. | Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff, Meirav Zehavi |
| 2023 | WADS | An ETH-Tight Algorithm for Bidirected Steiner Connectivity. | Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2023 | WG | Parameterized Results on Acyclic Matchings with Implications for Related Problems. | Juhi Chaudhary, Meirav Zehavi |
| 2023 | WG | Untitled record | Juhi Chaudhary, Meirav Zehavi |
| 2022 | ICALP | (Re)packing Equal Disks into Rectangle. | Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Meirav Zehavi |
| 2022 | ISAIM | Parameterized Analysis for the Group Activity Selection Problem on Graphs. | Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi |
| 2022 | SODA | Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent. | Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi |
| 2022 | SODA | Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract). | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi |
| 2022 | WABI | New Algorithms for Structure Informed Genome Rearrangement. | Eden Ozery, Meirav Zehavi, Michal Ziv-Ukelson |
| 2021 | EUMAS | Parameterized Analysis of Assignment Under Multiple Preferences. | Barak Steindl, Meirav Zehavi |
| 2021 | EUMAS | Verification of Multi-layered Assignment Problems. | Barak Steindl, Meirav Zehavi |
| 2021 | IJCAI | Participatory Budgeting with Project Groups. | Pallavi Jain, Krzysztof Sornat, Nimrod Talmon, Meirav Zehavi |
| 2021 | ISAAC | Grid Recognition: Classical and Parameterized Computational Perspectives. | Siddharth Gupta, Guy Sa'ar, Meirav Zehavi |
| 2021 | SODA | FPT-approximation for FPT Problems. | Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi |
| 2021 | SODA | Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting (Extended Version). | Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi |
| 2021 | STACS | Exploiting Dense Structures in Parameterized Complexity. | William Lochet, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi |
| 2020 | CSR | Parameterized Analysis of Art Gallery and Terrain Guarding. | Akanksha Agrawal, Meirav Zehavi |
| 2020 | ICALP | Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. | Fedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, Meirav Zehavi |
| 2020 | LATIN | Graph Hamiltonicity Parameterized by Proper Interval Deletion Set. | Petr A. Golovach, R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi |
| 2020 | SODA | Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs. | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi |
| 2020 | SODA | Parameterized Complexity and Approximability of Directed Odd Cycle Transversal. | Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi |
| 2020 | STOC | Hitting topological minors is FPT. | Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2020 | STOC | An exponential time parameterized algorithm for planar disjoint paths. | Daniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk, Saket Saurabh, Meirav Zehavi |
| 2020 | WABI | Approximate Search for Known Gene Clusters in New Genomes Using PQ-Trees. | Galia R. Zimerman, Dina Svetlitsky, Meirav Zehavi, Michal Ziv-Ukelson |
| 2019 | ESA | Going Far From Degeneracy. | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2019 | ICALP | Approximate Counting of k-Paths: Deterministic and in Polynomial Space. | Andreas Bjrklund, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi |
| 2019 | ICALP | Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals. | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi |
| 2019 | ICALP | Decomposition of Map Graphs with Applications. | Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2019 | IJCAI | The Parameterized Complexity of Motion Planning for Snake-Like Robots. | Siddharth Gupta, Guy Sa'ar, Meirav Zehavi |
| 2019 | IJCAI | On Succinct Encodings for the Tournament Fixing Problem. | Sushmita Gupta, Saket Saurabh, Ramanujan Sridharan, Meirav Zehavi |
| 2019 | MFCS | Packing Arc-Disjoint Cycles in Tournaments. | Stphane Bessy, Marin Bougeret, R. Krithika, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut, Meirav Zehavi |
| 2019 | MFCS | A Sub-Exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs. | Jayakrishnan Madathil, Roohani Sharma, Meirav Zehavi |
| 2019 | SODA | Interval Vertex Deletion Admits a Polynomial Kernel. | Akanksha Agrawal, Pranabendu Misra, Saket Saurabh, Meirav Zehavi |
| 2019 | SODA | Popular Matching in Roommates Setting is NP-hard. | Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi |
| 2019 | SODA | On r-Simple k-Path and Related Problems Parameterized by k/r. | Gregory Z. Gutin, Magnus Wahlstrm, Meirav Zehavi |
| 2019 | SODA | Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity. | Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2019 | WABI | A New Paradigm for Identifying Reconciliation-Scenario Altering Mutations Conferring Environmental Adaptation. | Roni Zoller, Meirav Zehavi, Michal Ziv-Ukelson |
| 2019 | WADS | Balanced Stable Marriage: How Close Is Close Enough? | Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi |
| 2019 | WADS | Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS. | Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi |
| 2019 | WALCOM | Parameterized Computational Geometry via Decomposition Theorems. | Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2018 | CSR | Max-Cut Above Spanning Tree is Fixed-Parameter Tractable. | Jayakrishnan Madathil, Saket Saurabh, Meirav Zehavi |
| 2018 | ICALP | Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS. | Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi |
| 2018 | ICALP | Reducing CMSO Model Checking to Highly Connected Graphs. | Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi |
| 2018 | IJCAI | When Rigging a Tournament, Let Greediness Blind You. | Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi |
| 2018 | IJCAI | Winning a Tournament by Any Means Necessary. | Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi |
| 2018 | LATIN | The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue. | R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi |
| 2018 | SODA | Parameterized Algorithms for Survivable Network Design with Uniform Demands. | Jrgen Bang-Jensen, Manu Basavaraju, Kristine Vitting Klinkby, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi |
| 2018 | SODA | Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth. | Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi |
| 2018 | SODA | Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. | Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stphan Thomass, Meirav Zehavi |
| 2018 | SODA | Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi |
| 2018 | STACS | Erds-Psa Property of Obstructions to Interval Graphs. | Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi |
| 2017 | CPM | Revisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping. | Christian Komusiewicz, Mateus de Oliveira Oliveira, Meirav Zehavi |
| 2017 | ICALP | Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. | Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2017 | ICALP | Packing Cycles Faster Than Erdos-Posa. | Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh, Meirav Zehavi |
| 2017 | MFCS | Parameterized Algorithms and Kernels for Rainbow Matching. | Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi |
| 2017 | SODA | Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. | Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi |
| 2017 | STACS | Split Contraction: The Untold Story. | Akanksha Agrawal, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi |
| 2017 | STACS | Matrix Rigidity from the Viewpoint of Parameterized Complexity. | Fedor V. Fomin, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh, Meirav Zehavi |
| 2017 | SAGT | Group Activity Selection on Graphs: Parameterized Analysis. | Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi |
| 2016 | CPM | A Linear-Time Algorithm for the Copy Number Transformation Problem. | Ron Shamir, Meirav Zehavi, Ron Zeira |
| 2016 | ISAAC | Simultaneous Feedback Edge Set: A Parameterized Perspective. | Akanksha Agrawal, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2016 | ISAAC | Kernels for Deletion to Classes of Acyclic Digraphs. | Akanksha Agrawal, Saket Saurabh, Roohani Sharma, Meirav Zehavi |
| 2016 | LATIN | (k, n-k)-Max-Cut: An 𝒪 | Saket Saurabh, Meirav Zehavi |
| 2016 | WABI | Copy-Number Evolution Problems: Complexity and Algorithms. | Mohammed El-Kebir, Benjamin J. Raphael, Ron Shamir, Roded Sharan, Simone Zaccaria, Meirav Zehavi, Ron Zeira |
| 2015 | ESA | A Multivariate Approach for Weighted FPT Algorithms. | Hadas Shachnai, Meirav Zehavi |
| 2015 | ESA | Mixing Color Coding-Related Techniques. | Meirav Zehavi |
| 2015 | ICALP | Spotting Trees with Few Leaves. | Andreas Bjrklund, Vikram Kamat, Lukasz Kowalik, Meirav Zehavi |
| 2015 | IWOCA | The k-Leaf Spanning Tree Problem Admits a Klam Value of 39. | Meirav Zehavi |
| 2015 | MFCS | Maximum Minimal Vertex Cover Parameterized by Vertex Cover. | Meirav Zehavi |
| 2014 | ESA | Representative Families: A Unified Tradeoff-Based Approach. | Hadas Shachnai, Meirav Zehavi |
| 2014 | MFCS | Deterministic Parameterized Algorithms for the Graph Motif Problem. | Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi |
| 2014 | WG | Parameterized Algorithms for Graph Partitioning Problems. | Hadas Shachnai, Meirav Zehavi |
| 2013 | IWOCA | Partial Information Network Queries. | Ron Y. Pinter, Meirav Zehavi |
| 2013 | MFCS | Parameterized Algorithms for Module Motif. | Meirav Zehavi |