Partial Information Network Queries. - Ron Y. Pinter; Meirav Zehavi (IWOCA, 2013)

Algorithms for k-Internal Out-Branching. - Meirav Zehavi (IPEC, 2013)

Parameterized Algorithms for Module Motif. - Meirav Zehavi (MFCS, 2013)

Deterministic Parameterized Algorithms for Matching and Packing Problems. - Meirav Zehavi (CoRR, 2013)

Faster Computation of Representative Families for Uniform Matroids with Applications. - Hadas Shachnai; Meirav Zehavi (CoRR, 2014)

FPT Algorithms for Weighted Graphs Can be (Almost) as Efficient as for Unweighted. - Hadas Shachnai; Meirav Zehavi (CoRR, 2014)

Solving Parameterized Problems by Mixing Color Coding-Related Techniques. - Meirav Zehavi (CoRR, 2014)

An Improved k-Exclusion Algorithm. - Meirav Zehavi (J. Comput., 2014)

Algorithms for topology-free and alignment network queries. - Ron Y. Pinter; Meirav Zehavi (J. Discrete Algorithms, 2014)

A Multivariate Approach for Weighted FPT Algorithms. - Hadas Shachnai; Meirav Zehavi (ESA, 2015)

Mixing Color Coding-Related Techniques. - Meirav Zehavi (ESA, 2015)

Maximization Problems Parameterized Using Their Minimization Versions: The Case of Vertex Cover. - Meirav Zehavi (CoRR, 2015)

Partial Information Network Queries. - Ron Y. Pinter; Hadas Shachnai; Meirav Zehavi (J. Discrete Algorithms, 2015)

Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets. - Prachi Goyal; Neeldhara Misra; Fahad Panolan; Meirav Zehavi (SIAM J. Discret. Math., 2015)

Parameterized Algorithms for List K-Cycle. - Fahad Panolan; Meirav Zehavi (FSTTCS, 2016)

(k, n-k)-Max-Cut: An 𝒪∗(2p)-Time Algorithm and a Polynomial Kernel. - Saket Saurabh 001; Meirav Zehavi (LATIN, 2016)

Copy-Number Evolution Problems: Complexity and Algorithms. - Mohammed El-Kebir; Benjamin J. Raphael; Ron Shamir; Roded Sharan; Simone Zaccaria; Meirav Zehavi; Ron Zeira (WABI, 2016)

Deterministic parameterized algorithms for the Graph Motif problem. - Ron Y. Pinter; Hadas Shachnai; Meirav Zehavi (Discret. Appl. Math., 2016)

Parameterized algorithms for the Module Motif problem. - Meirav Zehavi (Inf. Comput., 2016)

A randomized algorithm for long directed cycle. - Meirav Zehavi (Inf. Process. Lett., 2016)

Representative families: A unified tradeoff-based approach. - Hadas Shachnai; Meirav Zehavi (J. Comput. Syst. Sci., 2016)

The k-distinct language: Parameterized automata constructions. - Ran Ben-Basat; Ariel Gabizon; Meirav Zehavi (Theor. Comput. Sci., 2016)

Parameterized approximation algorithms for packing problems. - Meirav Zehavi (Theor. Comput. Sci., 2016)

Group Activity Selection on Graphs: Parameterized Analysis. - Sushmita Gupta; Sanjukta Roy 001; Saket Saurabh 001; Meirav Zehavi (SAGT, 2017)

Algorithms for k-Internal Out-Branching and k-Tree in Bounded Degree Graphs. - Meirav Zehavi (Algorithmica, 2017)

Complexity and algorithms for copy-number evolution problems. - Mohammed El-Kebir; Benjamin J. Raphael; Ron Shamir; Roded Sharan; Simone Zaccaria; Meirav Zehavi; Ron Zeira (Algorithms Mol. Biol., 2017)

Polylogarithmic Approximation Algorithms for Weighted-$ mathcal{F}$-Deletion Problems. - Akanksha Agrawal 001; Daniel Lokshtanov; Pranabendu Misra; Saket Saurabh 001; Meirav Zehavi (CoRR, 2017)

On Treewidth and Stable Marriage. - Sushmita Gupta; Saket Saurabh 001; Meirav Zehavi (CoRR, 2017)

Kirchoff Matrices and Pfaffians to Design Deterministic Polynomial-Space Parameterized Algorithms. - Gregory Z. Gutin; Felix Reidl; Magnus Wahlström; Meirav Zehavi (CoRR, 2017)

Balanced Judicious Partition is Fixed-Parameter Tractable. - Daniel Lokshtanov; Saket Saurabh 001; Roohani Sharma; Meirav Zehavi (CoRR, 2017)

A Linear-Time Algorithm for the Copy Number Transformation Problem. - Ron Zeira; Meirav Zehavi; Ron Shamir (J. Comput. Biol., 2017)

A multivariate framework for weighted FPT algorithms. - Hadas Shachnai; Meirav Zehavi (J. Comput. Syst. Sci., 2017)

Parameterized Algorithms for Graph Partitioning Problems. - Hadas Shachnai; Meirav Zehavi (Theory Comput. Syst., 2017)

Spotting Trees with Few Leaves. - Andreas Björklund; Vikram Kamat; Lukasz Kowalik; Meirav Zehavi (SIAM J. Discret. Math., 2017)

Maximum Minimal Vertex Cover Parameterized by Vertex Cover. - Meirav Zehavi (SIAM J. Discret. Math., 2017)

Max-Cut Above Spanning Tree is Fixed-Parameter Tractable. - Jayakrishnan Madathil; Saket Saurabh 001; Meirav Zehavi (CSR, 2018)

Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS. - Daniel Lokshtanov; M. S. Ramanujan 001; Saket Saurabh 001; Roohani Sharma; Meirav Zehavi (ICALP, 2018)

Reducing CMSO Model Checking to Highly Connected Graphs. - Daniel Lokshtanov; M. S. Ramanujan 001; Saket Saurabh 001; Meirav Zehavi (ICALP, 2018)

When Rigging a Tournament, Let Greediness Blind You. - Sushmita Gupta; Sanjukta Roy 001; Saket Saurabh 001; Meirav Zehavi (IJCAI, 2018)

Winning a Tournament by Any Means Necessary. - Sushmita Gupta; Sanjukta Roy 001; Saket Saurabh 001; Meirav Zehavi (IJCAI, 2018)

Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity. - Daniel Lokshtanov; Pranabendu Misra; Fahad Panolan; Saket Saurabh 001; Meirav Zehavi (ITCS, 2018)

Parameterized Algorithms for Survivable Network Design with Uniform Demands. - Jørgen Bang-Jensen; Manu Basavaraju; Kristine Vitting Klinkby; Pranabendu Misra; M. S. Ramanujan 001; Saket Saurabh 001; Meirav Zehavi (SODA, 2018)

Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth. - Petr A. Golovach; Daniel Lokshtanov; Saket Saurabh 001; Meirav Zehavi (SODA, 2018)

Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. - Tien-Nam Le; Daniel Lokshtanov; Saket Saurabh 001; Stéphan Thomassé; Meirav Zehavi (SODA, 2018)

$$(k, n-k)$$ ( k , n - k ) -Max-Cut: An $$ mathcal{O}^*(2^p)$$ O ∗ ( 2 p ) -Time Algorithm and a Polynomial Kernel. - Saket Saurabh 001; Meirav Zehavi (Algorithmica, 2018)

The Parameterized Complexity of Packing Arc-Disjoint Cycles in Tournaments. - R. Krithika 001; Abhishek Sahu; Saket Saurabh 001; Meirav Zehavi (CoRR, 2018)

The k-leaf spanning tree problem admits a klam value of 39. - Meirav Zehavi (Eur. J. Comb., 2018)

Long directed (s, t)-path: FPT algorithm. - Fedor V. Fomin; Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Meirav Zehavi (Inf. Process. Lett., 2018)

Kernels for deletion to classes of acyclic digraphs. - Akanksha Agrawal 001; Saket Saurabh 001; Roohani Sharma; Meirav Zehavi (J. Comput. Syst. Sci., 2018)

Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials. - Gregory Z. Gutin; Felix Reidl; Magnus Wahlström; Meirav Zehavi (J. Comput. Syst. Sci., 2018)

Parameterised Algorithms for Deletion to Classes of DAGs. - Akanksha Agrawal 001; Saket Saurabh 001; Roohani Sharma; Meirav Zehavi (Theory Comput. Syst., 2018)

Matrix Rigidity from the Viewpoint of Parameterized Complexity. - Fedor V. Fomin; Daniel Lokshtanov; Syed Mohammad Meesum; Saket Saurabh 001; Meirav Zehavi (SIAM J. Discret. Math., 2018)

Exact Algorithms for Terrain Guarding. - Pradeesha Ashok; Fedor V. Fomin; Sudeshna Kolay; Saket Saurabh 001; Meirav Zehavi (ACM Trans. Algorithms, 2018)

Parameterized algorithms for stable matching with ties and incomplete lists. - Deeksha Adil; Sushmita Gupta; Sanjukta Roy 001; Saket Saurabh 001; Meirav Zehavi (Theor. Comput. Sci., 2018)

Connecting the Dots (with Minimum Crossings). - Akanksha Agrawal 001; Grzegorz Guspiel; Jayakrishnan Madathil; Saket Saurabh 001; Meirav Zehavi (SoCG, 2019)

Approximate Counting of k-Paths: Deterministic and in Polynomial Space. - Andreas Björklund; Daniel Lokshtanov; Saket Saurabh 001; Meirav Zehavi (ICALP, 2019)

Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals. - Fedor V. Fomin; Petr A. Golovach; Daniel Lokshtanov; Saket Saurabh 001; Meirav Zehavi (ICALP, 2019)

Decomposition of Map Graphs with Applications. - Fedor V. Fomin; Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Meirav Zehavi (ICALP, 2019)

On Succinct Encodings for the Tournament Fixing Problem. - Sushmita Gupta; Saket Saurabh 001; Ramanujan Sridharan; Meirav Zehavi (IJCAI, 2019)

Interval Vertex Deletion Admits a Polynomial Kernel. - Akanksha Agrawal 001; Pranabendu Misra; Saket Saurabh 001; Meirav Zehavi (SODA, 2019)

On r-Simple k-Path and Related Problems Parameterized by k/r. - Gregory Z. Gutin; Magnus Wahlström; Meirav Zehavi (SODA, 2019)

Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS. - Daniel Lokshtanov; M. S. Ramanujan 001; Saket Saurabh 001; Roohani Sharma; Meirav Zehavi (WADS, 2019)

Parameterized Computational Geometry via Decomposition Theorems. - Fahad Panolan; Saket Saurabh 001; Meirav Zehavi (WALCOM, 2019)

Stability in barter exchange markets. - Sushmita Gupta; Fahad Panolan; Saket Saurabh 001; Meirav Zehavi (Auton. Agents Multi Agent Syst., 2019)

Parameterized Algorithms and Kernels for Rainbow Matching. - Sushmita Gupta; Sanjukta Roy 001; Saket Saurabh 001; Meirav Zehavi (Algorithmica, 2019)

The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue. - R. Krithika 001; Abhishek Sahu; Saket Saurabh 001; Meirav Zehavi (Algorithmica, 2019)

Parameterized Algorithms for List K-Cycle. - Fahad Panolan; Saket Saurabh 001; Meirav Zehavi (Algorithmica, 2019)

Improved Parameterized Algorithms for Network Query Problems. - Ron Y. Pinter; Hadas Shachnai; Meirav Zehavi (Algorithmica, 2019)

Reducing Topological Minor Containment to the Unique Linkage Theorem. - Fedor V. Fomin; Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Meirav Zehavi (CoRR, 2019)

A Brief Note on Single Source Fault Tolerant Reachability. - Daniel Lokshtanov; Pranabendu Misra; Saket Saurabh 001; Meirav Zehavi (CoRR, 2019)

New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041). - Fedor V. Fomin; Dániel Marx; Saket Saurabh 001; Meirav Zehavi (Dagstuhl Reports, 2019)

Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. - Fedor V. Fomin; Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Meirav Zehavi (Discret. Comput. Geom., 2019)

Packing Cycles Faster Than Erdos-Posa. - Daniel Lokshtanov; Amer E. Mouawad; Saket Saurabh 001; Meirav Zehavi (SIAM J. Discret. Math., 2019)

Balanced Judicious Bipartition is Fixed-Parameter Tractable. - Daniel Lokshtanov; Saket Saurabh 001; Roohani Sharma; Meirav Zehavi (SIAM J. Discret. Math., 2019)

Rank Vertex Cover as a Natural Problem for Algebraic Compression. - Syed Mohammad Meesum; Fahad Panolan; Saket Saurabh 001; Meirav Zehavi (SIAM J. Discret. Math., 2019)

Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. - Akanksha Agrawal 001; Daniel Lokshtanov; Pranabendu Misra; Saket Saurabh 001; Meirav Zehavi (ACM Trans. Algorithms, 2019)

Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring. - Fedor V. Fomin; Petr A. Golovach; Daniel Lokshtanov; Saket Saurabh 001; Meirav Zehavi (ACM Trans. Algorithms, 2019)

Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. - Fedor V. Fomin; Tien-Nam Le; Daniel Lokshtanov; Saket Saurabh 001; Stéphan Thomassé; Meirav Zehavi (ACM Trans. Algorithms, 2019)

The parameterized complexity landscape of finding 2-partitions of digraphs. - Jørgen Bang-Jensen; Kristine Vitting Klinkby; Saket Saurabh 001; Meirav Zehavi (Theor. Comput. Sci., 2019)

Split Contraction: The Untold Story. - Akanksha Agrawal 001; Daniel Lokshtanov; Saket Saurabh 001; Meirav Zehavi (ACM Trans. Comput. Theory, 2019)

Parameterized Algorithms. - Fedor V. Fomin; Daniel Lokshtanov; Saket Saurabh 001; Meirav Zehavi (Beyond the Worst-Case Analysis of Algorithms, 2020)

Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths. - Daniel Lokshtanov; Saket Saurabh 001; Meirav Zehavi (Treewidth, Kernels, and Algorithms, 2020)

Parameterized Analysis of Art Gallery and Terrain Guarding. - Akanksha Agrawal 001; Meirav Zehavi (CSR, 2020)

On the (Parameterized) Complexity of Almost Stable Marriage. - Sushmita Gupta; Pallavi Jain 001; Sanjukta Roy 001; Saket Saurabh 001; Meirav Zehavi (FSTTCS, 2020)

Parameterization Above a Multiplicative Guarantee. - Fedor V. Fomin; Petr A. Golovach; Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Meirav Zehavi (ITCS, 2020)

Fault Tolerant Subgraphs with Applications in Kernelization. - William Lochet; Daniel Lokshtanov; Pranabendu Misra; Saket Saurabh 001; Roohani Sharma; Meirav Zehavi (ITCS, 2020)

Graph Hamiltonicity Parameterized by Proper Interval Deletion Set. - Petr A. Golovach; R. Krithika 001; Abhishek Sahu; Saket Saurabh 001; Meirav Zehavi (LATIN, 2020)

Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs. - Fedor V. Fomin; Daniel Lokshtanov; Saket Saurabh 001; Meirav Zehavi (SODA, 2020)

Parameterized Complexity and Approximability of Directed Odd Cycle Transversal. - Daniel Lokshtanov; M. S. Ramanujan 001; Saket Saurabh 001; Meirav Zehavi (SODA, 2020)

Hitting topological minors is FPT. - Fedor V. Fomin; Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Meirav Zehavi (STOC, 2020)

Gehrlein stability in committee selection: parameterized hardness and algorithms. - Sushmita Gupta; Pallavi Jain 001; Sanjukta Roy 001; Saket Saurabh 001; Meirav Zehavi (Auton. Agents Multi Agent Syst., 2020)

Quadratic Vertex Kernel for Rainbow Matching. - Sushmita Gupta; Sanjukta Roy 001; Saket Saurabh 001; Meirav Zehavi (Algorithmica, 2020)

Special Issue "New Frontiers in Parameterized Complexity and Algorithms": Foreward by the Guest Editors. - Neeldhara Misra; Frances A. Rosamond; Meirav Zehavi (Algorithms, 2020)

Popular Matching in Roommates Setting is NP-hard. - Sushmita Gupta; Pranabendu Misra; Saket Saurabh 001; Meirav Zehavi (Bull. EATCS, 2020)

The Parameterized Complexity of Motion Planning for Snake-Like Robots. - Siddharth Gupta 002; Guy Sa'ar; Meirav Zehavi (J. Artif. Intell. Res., 2020)

A New Paradigm for Identifying Reconciliation-Scenario Altering Mutations Conferring Environmental Adaptation. - Roni Zoller; Meirav Zehavi; Michal Ziv-Ukelson (J. Comput. Biol., 2020)

Fixed-Parameter Tractable Algorithm and Polynomial Kernel for Max-Cut Above Spanning Tree. - Jayakrishnan Madathil; Saket Saurabh 001; Meirav Zehavi (Theory Comput. Syst., 2020)

Going Far from Degeneracy. - Fedor V. Fomin; Petr A. Golovach; Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Meirav Zehavi (SIAM J. Discret. Math., 2020)

Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems. - Akanksha Agrawal 001; Daniel Lokshtanov; Pranabendu Misra; Saket Saurabh 001; Meirav Zehavi (ACM Trans. Algorithms, 2020)

Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. - Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Roohani Sharma; Meirav Zehavi (ACM Trans. Algorithms, 2020)

A Note on GRegNetSim: A Tool for the Discrete Simulation and Analysis of Genetic Regulatory Networks. - Dor Ganor; Ron Y. Pinter; Meirav Zehavi (IEEE ACM Trans. Comput. Biol. Bioinform., 2020)

Revisiting the parameterized complexity of Maximum-Duo Preservation String Mapping. - Christian Komusiewicz; Mateus de Oliveira Oliveira; Meirav Zehavi (Theor. Comput. Sci., 2020)

Multivariate Analysis of Scheduling Fair Competitions. - Siddharth Gupta 002; Meirav Zehavi (AAMAS, 2021)

Parameterized Analysis of Assignment Under Multiple Preferences. - Barak Steindl; Meirav Zehavi (EUMAS, 2021)

Participatory Budgeting with Project Groups. - Pallavi Jain 001; Krzysztof Sornat; Nimrod Talmon; Meirav Zehavi (IJCAI, 2021)

FPT-approximation for FPT Problems. - Daniel Lokshtanov; Pranabendu Misra; M. S. Ramanujan 001; Saket Saurabh 001; Meirav Zehavi (SODA, 2021)

Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting (Extended Version). - Daniel Lokshtanov; Saket Saurabh 001; Meirav Zehavi (SODA, 2021)

Exploiting Dense Structures in Parameterized Complexity. - William Lochet; Daniel Lokshtanov; Saket Saurabh 001; Meirav Zehavi (STACS, 2021)

Simultaneous Feedback Edge Set: A Parameterized Perspective. - Akanksha Agrawal 001; Fahad Panolan; Saket Saurabh 001; Meirav Zehavi (Algorithmica, 2021)

Packing Arc-Disjoint Cycles in Tournaments. - Stéphane Bessy; Marin Bougeret; R. Krithika 001; Abhishek Sahu; Saket Saurabh 001; Jocelyn Thiebaut; Meirav Zehavi (Algorithmica, 2021)

A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs. - Jayakrishnan Madathil; Roohani Sharma; Meirav Zehavi (Algorithmica, 2021)

Approximate search for known gene clusters in new genomes using PQ-trees. - Galia R. Zimerman; Dina Svetlitsky; Meirav Zehavi; Michal Ziv-Ukelson (Algorithms Mol. Biol., 2021)

The complexity of high-dimensional cuts. - Ulrich Bauer; Abhishek Rathod; Meirav Zehavi (CoRR, 2021)

Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293). - Robert Ganian; Fabrizio Montecchiani; Martin Nöllenburg; Meirav Zehavi (Dagstuhl Reports, 2021)

ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. - Meirav Zehavi; Fedor V. Fomin; Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001 (J. Comput. Geom., 2021)

r-Simple k-Path and Related Problems Parameterized by k/r. - Gregory Z. Gutin; Magnus Wahlström; Meirav Zehavi (ACM Trans. Algorithms, 2021)

Approximate Counting of k-Paths: Simpler, Deterministic, and in Polynomial Space. - Daniel Lokshtanov; Andreas Björklund; Saket Saurabh 001; Meirav Zehavi (ACM Trans. Algorithms, 2021)

Balanced stable marriage: How close is close enough? - Sushmita Gupta; Sanjukta Roy 001; Saket Saurabh 001; Meirav Zehavi (Theor. Comput. Sci., 2021)

Multiplicative Parameterization Above a Guarantee. - Fedor V. Fomin; Petr A. Golovach; Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Meirav Zehavi (ACM Trans. Comput. Theory, 2021)

Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. - Fedor V. Fomin; Daniel Lokshtanov; Ivan Mihajlin; Saket Saurabh 001; Meirav Zehavi (ACM Trans. Comput. Theory, 2021)

(Re)packing Equal Disks into Rectangle. - Fedor V. Fomin; Petr A. Golovach; Tanmay Inamdar 002; Meirav Zehavi (ICALP, 2022)

Parameterized Analysis for the Group Activity Selection Problem on Graphs. - Sushmita Gupta; Sanjukta Roy 001; Saket Saurabh 001; Meirav Zehavi (ISAIM, 2022)

A Finite Algorithm for the Realizabilty of a Delaunay Triangulation. - Akanksha Agrawal 001; Saket Saurabh 001; Meirav Zehavi (IPEC, 2022)

Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent. - Akanksha Agrawal 001; Lawqueen Kanesh; Daniel Lokshtanov; Fahad Panolan; M. S. Ramanujan 001; Saket Saurabh 001; Meirav Zehavi (SODA, 2022)

Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract). - Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Jie Xue 003; Meirav Zehavi (SODA, 2022)

New Algorithms for Structure Informed Genome Rearrangement. - Eden Ozery; Meirav Zehavi; Michal Ziv-Ukelson (WABI, 2022)

Verification of multi-layered assignment problems. - Barak Steindl; Meirav Zehavi (Auton. Agents Multi Agent Syst., 2022)

Parameter Analysis for Guarding Terrains. - Akanksha Agrawal 001; Sudeshna Kolay; Meirav Zehavi (Algorithmica, 2022)

Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation. - Petr A. Golovach; Meirav Zehavi (Algorithmica, 2022)

Parameterized analysis and crossing minimization problems. - Meirav Zehavi (Comput. Sci. Rev., 2022)

On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization). - Sushmita Gupta; Saket Saurabh 001; Meirav Zehavi (SIAM J. Discret. Math., 2022)

Resolute control: Forbidding candidates from winning an election is hard. - Sushmita Gupta; Sanjukta Roy 001; Saket Saurabh 001; Meirav Zehavi (Theor. Comput. Sci., 2022)

Tournament Fixing Parameterized by Feedback Vertex Set Number Is FPT. - Meirav Zehavi (AAAI, 2023)

Kernelization for Spreading Points. - Fedor V. Fomin; Petr A. Golovach; Tanmay Inamdar 002; Saket Saurabh 001; Meirav Zehavi (ESA, 2023)

Lossy Kernelization for (Implicit) Hitting Set Problems. - Fedor V. Fomin; Tien-Nam Le; Daniel Lokshtanov; Saket Saurabh 001; Stéphan Thomassé; Meirav Zehavi (ESA, 2023)

Finding Long Directed Cycles Is Hard Even When DFVS Is Small or Girth Is Large. - Ashwin Jacob; Michal Wlodarczyk 001; Meirav Zehavi (ESA, 2023)

Planar Disjoint Paths, Treewidth, and Kernels. - Michal Wlodarczyk 001; Meirav Zehavi (FOCS, 2023)

Parameterized Complexity of Incomplete Connected Fair Division. - Harmender Gahlawat; Meirav Zehavi (FSTTCS, 2023)

In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks? - Pascal Kunz 001; Hendrik Molter; Meirav Zehavi (IJCAI, 2023)

On Computing Homological Hitting Sets. - Ulrich Bauer; Abhishek Rathod; Meirav Zehavi (ITCS, 2023)

Collective Graph Exploration Parameterized by Vertex Cover. - Siddharth Gupta 002; Guy Sa'ar; Meirav Zehavi (IPEC, 2023)

Drawn Tree Decomposition: New Approach for Graph Drawing Problems. - Siddharth Gupta 002; Guy Sa'ar; Meirav Zehavi (IPEC, 2023)

Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs. - Juhi Chaudhary; Harmender Gahlawat; Michal Wlodarczyk 001; Meirav Zehavi (IPEC, 2023)

Sidestepping Barriers for Dominating Set in Parameterized Complexity. - Ioannis Koutis; Michal Wlodarczyk 001; Meirav Zehavi (IPEC, 2023)

Parameterized Analysis of the Cops and Robber Game. - Harmender Gahlawat; Meirav Zehavi (MFCS, 2023)

A Framework for Approximation Schemes on Disk Graphs. - Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Jie Xue 003; Meirav Zehavi (SODA, 2023)

An ETH-Tight Algorithm for Bidirected Steiner Connectivity. - Daniel Lokshtanov; Pranabendu Misra; Fahad Panolan; Saket Saurabh 001; Meirav Zehavi (WADS, 2023)

P-Matchings Parameterized by Treewidth. - Juhi Chaudhary; Meirav Zehavi (WG, 2023)

Parameterized Study of Steiner Tree on Unit Disk Graphs. - Sujoy Bhore; Paz Carmi; Sudeshna Kolay; Meirav Zehavi (Algorithmica, 2023)

Hitting Subgraphs in Sparse Graphs and Geometric Intersection Graphs. - Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Jie Xue 003; Meirav Zehavi (CoRR, 2023)

Parameterized Analysis of the Cops and Robber Problem. - Harmender Gahlawat; Meirav Zehavi (CoRR, 2023)

P-matchings Parameterized by Treewidth. - Juhi Chaudhary; Meirav Zehavi (CoRR, 2023)

New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162). - Robert Ganian; Fabrizio Montecchiani; Martin Nöllenburg; Meirav Zehavi; Liana Khazaliya (Dagstuhl Reports, 2023)

Parameterized Approximation: Algorithms and Hardness (Dagstuhl Seminar 23291). - Karthik C. S. 001; Parinya Chalermsook; Joachim Spoerhase; Meirav Zehavi; Martin G. Herold (Dagstuhl Reports, 2023)

Grid recognition: Classical and parameterized computational perspectives. - Siddharth Gupta 002; Guy Sa'ar; Meirav Zehavi (J. Comput. Syst. Sci., 2023)

Parameterized complexity of multi-node hubs. - Saket Saurabh 001; Meirav Zehavi (J. Comput. Syst. Sci., 2023)

Forgetfulness Can Make You Faster: An O*(8.097k)-time Algorithm for Weighted 3-set k-packing. - Meirav Zehavi (ACM Trans. Comput. Theory, 2023)

Erdős-Pósa property of obstructions to interval graphs. - Akanksha Agrawal 001; Daniel Lokshtanov; Pranabendu Misra; Saket Saurabh 001; Meirav Zehavi (J. Graph Theory, 2023)

Polynomial Kernel for Interval Vertex Deletion. - Akanksha Agrawal 001; Daniel Lokshtanov; Pranabendu Misra; Saket Saurabh 001; Meirav Zehavi (ACM Trans. Algorithms, 2023)

Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. - Pranabendu Misra; Saket Saurabh 001; Roohani Sharma; Meirav Zehavi (Algorithmica, 2023)

New algorithms for structure informed genome rearrangement. - Eden Ozeri; Meirav Zehavi; Michal Ziv-Ukelson (Algorithms Mol. Biol., 2023)

How to Make Knockout Tournaments More Popular? - Juhi Chaudhary; Hendrik Molter; Meirav Zehavi (AAAI, 2024)

Learning Small Decision Trees with Few Outliers: A Parameterized Perspective. - Harmender Gahlawat; Meirav Zehavi (AAAI, 2024)

Hybrid k-Clustering: Blending k-Median and k-Center. - Fedor V. Fomin; Petr A. Golovach; Tanmay Inamdar 002; Saket Saurabh 001; Meirav Zehavi (APPROX/RANDOM, 2024)

Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3. - Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Jie Xue 003; Meirav Zehavi (APPROX/RANDOM, 2024)

A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs. - Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Jie Xue 003; Meirav Zehavi (SoCG, 2024)

Kernelization of Counting Problems. - Daniel Lokshtanov; Pranabendu Misra; Saket Saurabh 001; Meirav Zehavi (ITCS, 2024)

A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees. - Ashwin Jacob; Diptapriyo Majumdar; Meirav Zehavi (ISAAC, 2024)

Exact Algorithms for Clustered Planarity with Linear Saturators. - Giordano Da Lozzo; Robert Ganian; Siddharth Gupta 002; Bojan Mohar; Sebastian Ordyniak; Meirav Zehavi (ISAAC, 2024)

Meta-theorems for Parameterized Streaming Algorithms‡. - Daniel Lokshtanov; Pranabendu Misra; Fahad Panolan; M. S. Ramanujan 001; Saket Saurabh 001; Meirav Zehavi (SODA, 2024)

Maximum Partial List H-Coloring on P5-free graphs in polynomial time. - Daniel Lokshtanov; Pawel Rzazewski; Saket Saurabh 001; Roohani Sharma; Meirav Zehavi (CoRR, 2024)

Long directed detours: Reduction to 2-Disjoint Paths. - Ashwin Jacob; Michal Wlodarczyk 001; Meirav Zehavi (Inf. Process. Lett., 2024)

The Parameterized Complexity of Guarding Almost Convex Polygons. - Akanksha Agrawal 001; Kristine V. K. Knudsen; Daniel Lokshtanov; Saket Saurabh 001; Meirav Zehavi (Discret. Comput. Geom., 2024)

Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity. - Fahad Panolan; Saket Saurabh 001; Meirav Zehavi (ACM Trans. Algorithms, 2024)

(Re)packing Equal Disks into Rectangle. - Fedor V. Fomin; Petr A. Golovach; Tanmay Inamdar 002; Saket Saurabh 001; Meirav Zehavi (Discret. Comput. Geom., 2024)

Adaptive Manipulation for Coalitions in Knockout Tournaments. - Juhi Chaudhary; Hendrik Molter; Meirav Zehavi (AAAI, 2025)

(Almost-)Optimal FPT Algorithm and Kernel for T-Cycle on Planar Graphs. - Harmender Gahlawat; Abhishek Rathod; Meirav Zehavi (ICALP, 2025)

Treewidth Parameterized by Feedback Vertex Number. - Hendrik Molter; Meirav Zehavi; Amit Zivan (ICALP, 2025)

Parameterized Geometric Graph Modification with Disk Scaling. - Fedor V. Fomin; Petr A. Golovach; Tanmay Inamdar 002; Saket Saurabh 001; Meirav Zehavi (ITCS, 2025)

Quasipolynomial-Time Deterministic Kernelization and (Gammoid) Representation. - Rohit Gurjar; Daniel Lokshtanov; Pranabendu Misra; Fahad Panolan; Saket Saurabh 001; Meirav Zehavi (MFCS, 2025)

Tournament Robustness via Redundancy. - Klim Efremenko; Hendrik Molter; Meirav Zehavi (EC, 2025)

Crossing Number in Slightly Superexponential Time (Extended Abstract). - Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Roohani Sharma; Jie Xue 003; Meirav Zehavi (SODA, 2025)

Efficiently Finding and Counting Patterns with Distance Constraints in Sparse Graphs. - Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Jie Xue 003; Meirav Zehavi (STOC, 2025)

Subexponential Parameterized Algorithms for Hitting Subgraphs. - Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Jie Xue 003; Meirav Zehavi (STOC, 2025)

Min-Sum Disjoint Paths on Subclasses of Chordal Graphs. - Bar Menashe; Meirav Zehavi (WALCOM, 2025)

Parameterized algorithms on geometric intersection graphs. - Jie Xue 003; Meirav Zehavi (Comput. Sci. Rev., 2025)

Parameterized Analysis of Bribery in Challenge the Champ Tournaments. - Juhi Chaudhary; Hendrik Molter; Meirav Zehavi (J. Artif. Intell. Res., 2025)

Parameterized results on acyclic matchings with implications for related problems. - Juhi Chaudhary; Meirav Zehavi (J. Comput. Syst. Sci., 2025)

An Exponential Time Parameterized Algorithm for Planar Disjoint Paths. - Daniel Lokshtanov; Pranabendu Misra; Michal Pilipczuk; Saket Saurabh 001; Meirav Zehavi (SIAM J. Comput., 2025)

( mathcal{P} )-Matchings Parameterized by Treewidth. - Juhi Chaudhary; Meirav Zehavi (SIAM J. Discret. Math., 2025)

Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for Directed Feedback Vertex Set. - Daniel Lokshtanov; Ramanujan Maadapuzhi Sridharan; Saket Saurabh 001; Roohani Sharma; Meirav Zehavi (ACM Trans. Comput. Theory, 2025)

(Almost-)Optimal FPT Algorithm and Kernel for T-Cycle on Planar Graphs. - Harmender Gahlawat; Abhishek Rathod; Meirav Zehavi (CoRR, 2025)

What makes an Ensemble (Un) Interpretable? - Shahaf Bassan; Guy Amir; Meirav Zehavi; Guy Katz (CoRR, 2025)

A simple algorithm for Combinatorial n-fold ILPs using the Steinitz Lemma. - Sushmita Gupta; Pallavi Jain 001; Sanjay Seetharaman; Meirav Zehavi (CoRR, 2025)

On Kernelization with Access to NP-Oracles. - Hendrik Molter; Meirav Zehavi (CoRR, 2025)

A Parameterized Perspective on Uniquely Restricted Matchings. - Juhi Chaudhary; Ignasi Sau; Meirav Zehavi (CoRR, 2025)

Parameterized approaches to orthogonal compaction. - Walter Didimo; Siddharth Gupta 002; Philipp Kindermann; Giuseppe Liotta; Alexander Wolff 001; Meirav Zehavi (J. Comput. Syst. Sci., 2026)