Meirav Zehavi

ORCID

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 243

Top Venues

CoRR

SODA

Algorithmica

ACM Trans. Algorithms

Publications

Juhi Chaudhary, Hendrik Molter, Meirav Zehavi
Parameterized Analysis of Bribery in Challenge the Champ Tournaments. CoRR (2024)
Harmender Gahlawat, Meirav Zehavi
Learning Small Decision Trees with Few Outliers: A Parameterized Perspective. AAAI (2024)
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3. CoRR (2024)
Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Kernelization of Counting Problems. ITCS (2024)
Akanksha Agrawal, Kristine V. K. Knudsen, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
The Parameterized Complexity of Guarding Almost Convex Polygons. Discret. Comput. Geom. 71 (2) (2024)
Juhi Chaudhary, Hendrik Molter, Meirav Zehavi
How to Make Knockout Tournaments More Popular? AAAI (2024)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
Hybrid k-Clustering: Blending k-Median and k-Center. CoRR (2024)
Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
Meta-theorems for Parameterized Streaming Algorithms‡. SODA (2024)
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs. SoCG (2024)
Fahad Panolan, Saket Saurabh, Meirav Zehavi
Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity. ACM Trans. Algorithms 20 (2) (2024)
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
A Framework for Approximation Schemes on Disk Graphs. SODA (2023)
Harmender Gahlawat, Meirav Zehavi
Parameterized Analysis of the Cops and Robber Game. MFCS (2023)
Pascal Kunz, Hendrik Molter, Meirav Zehavi
In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks? CoRR (2023)
Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Polynomial Kernel for Interval Vertex Deletion. ACM Trans. Algorithms 19 (2) (2023)
Siddharth Gupta, Guy Sa'ar, Meirav Zehavi
Grid recognition: Classical and parameterized computational perspectives. J. Comput. Syst. Sci. 136 (2023)
Juhi Chaudhary, Meirav Zehavi
P-matchings Parameterized by Treewidth. CoRR (2023)
Siddharth Gupta, Guy Sa'ar, Meirav Zehavi
Collective Graph Exploration Parameterized by Vertex Cover. CoRR (2023)
Michal Wlodarczyk, Meirav Zehavi
Planar Disjoint Paths, Treewidth, and Kernels. FOCS (2023)
Michal Wlodarczyk, Meirav Zehavi
Planar Disjoint Paths, Treewidth, and Kernels. CoRR (2023)
Juhi Chaudhary, Meirav Zehavi
Parameterized Results on Acyclic Matchings with Implications for Related Problems. WG (2023)
Ashwin Jacob, Michal Wlodarczyk, Meirav Zehavi
Long Directed Detours: Reduction to 2-Disjoint Paths. CoRR (2023)
Sujoy Bhore, Paz Carmi, Sudeshna Kolay, Meirav Zehavi
Parameterized Study of Steiner Tree on Unit Disk Graphs. Algorithmica 85 (1) (2023)
Ioannis Koutis, Michal Wlodarczyk, Meirav Zehavi
Sidestepping Barriers for Dominating Set in Parameterized Complexity. IPEC (2023)
Ashwin Jacob, Michal Wlodarczyk, Meirav Zehavi
Finding Long Directed Cycles Is Hard Even When DFVS Is Small Or Girth Is Large. CoRR (2023)
Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi
Lossy Kernelization for (Implicit) Hitting Set Problems. ESA (2023)
Ulrich Bauer, Abhishek Rathod, Meirav Zehavi
On Computing Homological Hitting Sets. ITCS (2023)
Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi
An ETH-Tight Algorithm for Bidirected Steiner Connectivity. WADS (2023)
Eden Ozeri, Meirav Zehavi, Michal Ziv-Ukelson
New algorithms for structure informed genome rearrangement. Algorithms Mol. Biol. 18 (1) (2023)
Juhi Chaudhary, Meirav Zehavi
-Matchings Parameterized by Treewidth. WG (2023)
Juhi Chaudhary, Meirav Zehavi
Parameterized Results on Acyclic Matchings with Implications for Related Problems. CoRR (2023)
Pascal Kunz, Hendrik Molter, Meirav Zehavi
In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks? IJCAI (2023)
Juhi Chaudhary, Harmender Gahlawat, Michal Wlodarczyk, Meirav Zehavi
Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs. CoRR (2023)
Meirav Zehavi
Tournament Fixing Parameterized by Feedback Vertex Set Number Is FPT. AAAI (2023)
Siddharth Gupta, Guy Sa'ar, Meirav Zehavi
Collective Graph Exploration Parameterized by Vertex Cover. IPEC (2023)
Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Erdős-Pósa property of obstructions to interval graphs. J. Graph Theory 102 (4) (2023)
Karthik C. S., Parinya Chalermsook, Joachim Spoerhase, Meirav Zehavi, Martin Herold
Parameterized Approximation: Algorithms and Hardness (Dagstuhl Seminar 23291). Dagstuhl Reports 13 (7) (2023)
Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff, Meirav Zehavi
Parameterized Approaches to Orthogonal Compaction. SOFSEM (2023)
Ioannis Koutis, Michal Wlodarczyk, Meirav Zehavi
Sidestepping Barriers for Dominating Set in Parameterized Complexity. CoRR (2023)
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
Hitting Subgraphs in Sparse Graphs and Geometric Intersection Graphs. CoRR (2023)
Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
Meta-theorems for Parameterized Streaming Algorithms. CoRR (2023)
Harmender Gahlawat, Meirav Zehavi
Parameterized Complexity of Incomplete Connected Fair Division. CoRR (2023)
Siddharth Gupta, Guy Sa'ar, Meirav Zehavi
Drawn Tree Decomposition: New Approach for Graph Drawing Problems. CoRR (2023)
Siddharth Gupta, Guy Sa'ar, Meirav Zehavi
Drawn Tree Decomposition: New Approach for Graph Drawing Problems. IPEC (2023)
Ashwin Jacob, Michal Wlodarczyk, Meirav Zehavi
Finding Long Directed Cycles Is Hard Even When DFVS Is Small or Girth Is Large. ESA (2023)
Juhi Chaudhary, Hendrik Molter, Meirav Zehavi
How to Make Knockout Tournaments More Popular? CoRR (2023)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
Kernelization for Spreading Points. CoRR (2023)
Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, Meirav Zehavi, Liana Khazaliya
New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162). Dagstuhl Reports 13 (4) (2023)
Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi
Lossy Kernelization for (Implicit) Hitting Set Problems. CoRR (2023)
Juhi Chaudhary, Harmender Gahlawat, Michal Wlodarczyk, Meirav Zehavi
Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs. IPEC (2023)
Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. Algorithmica 85 (7) (2023)
Harmender Gahlawat, Meirav Zehavi
Parameterized Complexity of Incomplete Connected Fair Division. FSTTCS (2023)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
Kernelization for Spreading Points. ESA (2023)
Saket Saurabh, Meirav Zehavi
Parameterized complexity of multi-node hubs. J. Comput. Syst. Sci. 131 (2023)
Harmender Gahlawat, Meirav Zehavi
Parameterized Analysis of the Cops and Robber Problem. CoRR (2023)
Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Kernelization of Counting Problems. CoRR (2023)
Sushmita Gupta, Saket Saurabh, Meirav Zehavi
On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization). SIAM J. Discret. Math. 36 (1) (2022)
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
A Framework for Approximation Schemes on Disk Graphs. CoRR (2022)
Eden Ozery, Meirav Zehavi, Michal Ziv-Ukelson
New Algorithms for Structure Informed Genome Rearrangement. WABI (2022)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
(Re)packing Equal Disks into Rectangle. CoRR (2022)
Petr A. Golovach, Meirav Zehavi
Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation. Algorithmica 84 (11) (2022)
Akanksha Agrawal, Saket Saurabh, Meirav Zehavi
A Finite Algorithm for the Realizabilty of a Delaunay Triangulation. CoRR (2022)
Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff, Meirav Zehavi
Parameterized Approaches to Orthogonal Compaction. CoRR (2022)
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
Resolute control: Forbidding candidates from winning an election is hard. Theor. Comput. Sci. 915 (2022)
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract). SODA (2022)
Akanksha Agrawal, Saket Saurabh, Meirav Zehavi
A Finite Algorithm for the Realizabilty of a Delaunay Triangulation. IPEC (2022)
Meirav Zehavi
Parameterized analysis and crossing minimization problems. Comput. Sci. Rev. 45 (2022)
Akanksha Agrawal, Sudeshna Kolay, Meirav Zehavi
Parameter Analysis for Guarding Terrains. Algorithmica 84 (4) (2022)
Barak Steindl, Meirav Zehavi
Verification of multi-layered assignment problems. Auton. Agents Multi Agent Syst. 36 (1) (2022)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Meirav Zehavi
(Re)packing Equal Disks into Rectangle. ICALP (2022)
Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent. SODA (2022)
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
Parameterized Analysis for the Group Activity Selection Problem on Graphs. ISAIM (2022)
Akanksha Agrawal, Fahad Panolan, Saket Saurabh, Meirav Zehavi
Simultaneous Feedback Edge Set: A Parameterized Perspective. Algorithmica 83 (2) (2021)
Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, Meirav Zehavi
Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293). Dagstuhl Reports 11 (6) (2021)
Siddharth Gupta, Guy Sa'ar, Meirav Zehavi
Grid Recognition: Classical and Parameterized Computational Perspectives. ISAAC (2021)
Barak Steindl, Meirav Zehavi
Verification of Multi-Layered Assignment Problems. CoRR (2021)
William Lochet, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
Exploiting Dense Structures in Parameterized Complexity. STACS (2021)
Daniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk, Saket Saurabh, Meirav Zehavi
An Exponential Time Parameterized Algorithm for Planar Disjoint Paths. CoRR (2021)
Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Popular Matching in Roommates Setting Is NP-hard. ACM Trans. Comput. Theory 13 (2) (2021)
Pallavi Jain, Krzysztof Sornat, Nimrod Talmon, Meirav Zehavi
Participatory Budgeting with Project Groups. IJCAI (2021)
Stéphane Bessy, Marin Bougeret, R. Krithika, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut, Meirav Zehavi
Packing Arc-Disjoint Cycles in Tournaments. Algorithmica 83 (5) (2021)
Meirav Zehavi, Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. J. Comput. Geom. 12 (2) (2021)
Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting (Extended Version). SODA (2021)
Barak Steindl, Meirav Zehavi
Verification of Multi-layered Assignment Problems. EUMAS (2021)
Galia R. Zimerman, Dina Svetlitsky, Meirav Zehavi, Michal Ziv-Ukelson
Approximate search for known gene clusters in new genomes using PQ-trees. Algorithms Mol. Biol. 16 (1) (2021)
Ulrich Bauer, Abhishek Rathod, Meirav Zehavi
The complexity of high-dimensional cuts. CoRR (2021)
Barak Steindl, Meirav Zehavi
Parameterized Analysis of Assignment Under Multiple Preferences. EUMAS (2021)
Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
FPT-approximation for FPT Problems. SODA (2021)
Siddharth Gupta, Meirav Zehavi
Multivariate Analysis of Scheduling Fair Competitions. CoRR (2021)
Jayakrishnan Madathil, Roohani Sharma, Meirav Zehavi
A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs. Algorithmica 83 (6) (2021)
Siddharth Gupta, Guy Sa'ar, Meirav Zehavi
Grid Recognition: Classical and Parameterized Computational Perspectives. CoRR (2021)
Siddharth Gupta, Meirav Zehavi
Multivariate Analysis of Scheduling Fair Competitions. AAMAS (2021)
Fedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, Meirav Zehavi
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. ACM Trans. Comput. Theory 13 (2) (2021)
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
Multiplicative Parameterization Above a Guarantee. ACM Trans. Comput. Theory 13 (3) (2021)
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
Balanced stable marriage: How close is close enough? Theor. Comput. Sci. 883 (2021)
Gregory Z. Gutin, Magnus Wahlström, Meirav Zehavi
. ACM Trans. Algorithms 17 (1) (2021)
Daniel Lokshtanov, Andreas Björklund, Saket Saurabh, Meirav Zehavi
-Paths: Simpler, Deterministic, and in Polynomial Space. ACM Trans. Algorithms 17 (3) (2021)
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
Quadratic Vertex Kernel for Rainbow Matching. Algorithmica 82 (4) (2020)
Akanksha Agrawal, Meirav Zehavi
Parameterized Analysis of Art Gallery and Terrain Guarding. CSR (2020)
Siddharth Gupta, Guy Sa'ar, Meirav Zehavi
The Parameterized Complexity of Motion Planning for Snake-Like Robots. J. Artif. Intell. Res. 69 (2020)
Fedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, Meirav Zehavi
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. CoRR (2020)

Meirav Zehavi.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Meirav Zehavi