Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMeirav Zehavi
Person information
- affiliation: Ben-Gurion University of the Negev, Beer-Sheva, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j75]Sujoy Bhore
, Paz Carmi, Sudeshna Kolay, Meirav Zehavi:
Parameterized Study of Steiner Tree on Unit Disk Graphs. Algorithmica 85(1): 133-152 (2023)- [j74]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): 2065-2086 (2023) - [j73]Saket Saurabh, Meirav Zehavi:
Parameterized complexity of multi-node hubs. J. Comput. Syst. Sci. 131: 64-85 (2023) - [j72]Siddharth Gupta, Guy Sa'ar, Meirav Zehavi:
Grid recognition: Classical and parameterized computational perspectives. J. Comput. Syst. Sci. 136: 17-62 (2023) - [j71]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): 702-727 (2023) - [j70]Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Polynomial Kernel for Interval Vertex Deletion. ACM Trans. Algorithms 19(2): 11:1-11:68 (2023) - [c103]Meirav Zehavi:
Tournament Fixing Parameterized by Feedback Vertex Set Number Is FPT. AAAI 2023: 5876-5883 - [c102]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
Kernelization for Spreading Points. ESA 2023: 48:1-48:16 - [c101]Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi:
Lossy Kernelization for (Implicit) Hitting Set Problems. ESA 2023: 49:1-49:14 - [c100]Ashwin Jacob, Michal Wlodarczyk, Meirav Zehavi:
Finding Long Directed Cycles Is Hard Even When DFVS Is Small or Girth Is Large. ESA 2023: 65:1-65:17 - [c99]Pascal Kunz, Hendrik Molter, Meirav Zehavi:
In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks? IJCAI 2023: 180-188 - [c98]Ulrich Bauer, Abhishek Rathod, Meirav Zehavi:
On Computing Homological Hitting Sets. ITCS 2023: 13:1-13:21 - [c97]Harmender Gahlawat, Meirav Zehavi:
Parameterized Analysis of the Cops and Robber Game. MFCS 2023: 49:1-49:17 - [c96]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
A Framework for Approximation Schemes on Disk Graphs. SODA 2023: 2228-2241 - [c95]Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff, Meirav Zehavi:
Parameterized Approaches to Orthogonal Compaction. SOFSEM 2023: 111-125 - [c94]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
An ETH-Tight Algorithm for Bidirected Steiner Connectivity. WADS 2023: 588-604 - [i66]Ashwin Jacob, Michal Wlodarczyk, Meirav Zehavi:
Long Directed Detours: Reduction to 2-Disjoint Paths. CoRR abs/2301.06105 (2023) - [i65]Pascal Kunz, Hendrik Molter, Meirav Zehavi:
In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks? CoRR abs/2301.10503 (2023) - [i64]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
Hitting Subgraphs in Sparse Graphs and Geometric Intersection Graphs. CoRR abs/2304.13695 (2023) - [i63]Harmender Gahlawat, Meirav Zehavi:
Parameterized Analysis of the Cops and Robber Problem. CoRR abs/2307.04594 (2023) - [i62]Juhi Chaudhary, Meirav Zehavi:
Parameterized Results on Acyclic Matchings with Implications for Related Problems. CoRR abs/2307.05446 (2023) - [i61]Michal Wlodarczyk, Meirav Zehavi:
Planar Disjoint Paths, Treewidth, and Kernels. CoRR abs/2307.06792 (2023) - [i60]Juhi Chaudhary, Meirav Zehavi:
P-matchings Parameterized by Treewidth. CoRR abs/2307.09333 (2023) - [i59]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Meta-theorems for Parameterized Streaming Algorithms. CoRR abs/2308.01598 (2023) - [i58]Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Kernelization of Counting Problems. CoRR abs/2308.02188 (2023) - [i57]Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi:
Lossy Kernelization for (Implicit) Hitting Set Problems. CoRR abs/2308.05974 (2023) - [i56]Ashwin Jacob, Michal Wlodarczyk, Meirav Zehavi:
Finding Long Directed Cycles Is Hard Even When DFVS Is Small Or Girth Is Large. CoRR abs/2308.06145 (2023) - [i55]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
Kernelization for Spreading Points. CoRR abs/2308.07099 (2023) - [i54]Juhi Chaudhary, Hendrik Molter, Meirav Zehavi:
How to Make Knockout Tournaments More Popular? CoRR abs/2309.09967 (2023) - 2022
- [j69]Barak Steindl, Meirav Zehavi:
Verification of multi-layered assignment problems. Auton. Agents Multi Agent Syst. 36(1): 15 (2022) - [j68]Akanksha Agrawal, Sudeshna Kolay, Meirav Zehavi:
Parameter Analysis for Guarding Terrains. Algorithmica 84(4): 961-981 (2022) - [j67]Petr A. Golovach, Meirav Zehavi:
Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation. Algorithmica 84(11): 3107-3109 (2022) - [j66]Meirav Zehavi:
Parameterized analysis and crossing minimization problems. Comput. Sci. Rev. 45: 100490 (2022) - [j65]Sushmita Gupta, Saket Saurabh, Meirav Zehavi:
On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization). SIAM J. Discret. Math. 36(1): 596-681 (2022) - [j64]Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Resolute control: Forbidding candidates from winning an election is hard. Theor. Comput. Sci. 915: 74-89 (2022) - [c93]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Meirav Zehavi:
(Re)packing Equal Disks into Rectangle. ICALP 2022: 60:1-60:17 - [c92]Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Parameterized Analysis for the Group Activity Selection Problem on Graphs. ISAIM 2022 - [c91]Akanksha Agrawal, Saket Saurabh, Meirav Zehavi:
A Finite Algorithm for the Realizabilty of a Delaunay Triangulation. IPEC 2022: 1:1-1:16 - [c90]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: 1976-2004 - [c89]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract). SODA 2022: 2005-2031 - [c88]Eden Ozery, Meirav Zehavi, Michal Ziv-Ukelson:
New Algorithms for Structure Informed Genome Rearrangement. WABI 2022: 11:1-11:19 - [i53]Akanksha Agrawal, Saket Saurabh, Meirav Zehavi:
A Finite Algorithm for the Realizabilty of a Delaunay Triangulation. CoRR abs/2210.03932 (2022) - [i52]Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff, Meirav Zehavi:
Parameterized Approaches to Orthogonal Compaction. CoRR abs/2210.05019 (2022) - [i51]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
A Framework for Approximation Schemes on Disk Graphs. CoRR abs/2211.02717 (2022) - [i50]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
(Re)packing Equal Disks into Rectangle. CoRR abs/2211.09603 (2022) - 2021
- [j63]Akanksha Agrawal, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Simultaneous Feedback Edge Set: A Parameterized Perspective. Algorithmica 83(2): 753-774 (2021) - [j62]Stéphane Bessy, Marin Bougeret, R. Krithika, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut, Meirav Zehavi:
Packing Arc-Disjoint Cycles in Tournaments. Algorithmica 83(5): 1393-1420 (2021) - [j61]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): 1861-1884 (2021) - [j60]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): 16 (2021) - [j59]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): 126-148 (2021) - [j58]Gregory Z. Gutin, Magnus Wahlström, Meirav Zehavi:
r-Simple k-Path and Related Problems Parameterized by k/r. ACM Trans. Algorithms 17(1): 10:1-10:64 (2021) - [j57]Daniel Lokshtanov, Andreas Björklund, Saket Saurabh, Meirav Zehavi:
Approximate Counting of k-Paths: Simpler, Deterministic, and in Polynomial Space. ACM Trans. Algorithms 17(3): 26:1-26:44 (2021) - [j56]Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Balanced stable marriage: How close is close enough? Theor. Comput. Sci. 883: 19-43 (2021) - [j55]Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Popular Matching in Roommates Setting Is NP-hard. ACM Trans. Comput. Theory 13(2): 9:1-9:20 (2021) - [j54]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): 10:1-10:25 (2021) - [j53]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): 18:1-18:16 (2021) - [c87]Siddharth Gupta, Meirav Zehavi:
Multivariate Analysis of Scheduling Fair Competitions. AAMAS 2021: 555-564 - [c86]Barak Steindl, Meirav Zehavi:
Parameterized Analysis of Assignment Under Multiple Preferences. EUMAS 2021: 160-177 - [c85]Barak Steindl, Meirav Zehavi:
Verification of Multi-layered Assignment Problems. EUMAS 2021: 194-210 - [c84]Pallavi Jain, Krzysztof Sornat, Nimrod Talmon, Meirav Zehavi:
Participatory Budgeting with Project Groups. IJCAI 2021: 276-282 - [c83]Siddharth Gupta, Guy Sa'ar, Meirav Zehavi:
Grid Recognition: Classical and Parameterized Computational Perspectives. ISAAC 2021: 37:1-37:15 - [c82]Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting (Extended Version). SODA 2021: 179-198 - [c81]Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
FPT-approximation for FPT Problems. SODA 2021: 199-218 - [c80]William Lochet, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Exploiting Dense Structures in Parameterized Complexity. STACS 2021: 50:1-50:17 - [e1]Petr A. Golovach, Meirav Zehavi:
16th International Symposium on Parameterized and Exact Computation, IPEC 2021, September 8-10, 2021, Lisbon, Portugal. LIPIcs 214, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-216-7 [contents] - [i49]Siddharth Gupta, Meirav Zehavi:
Multivariate Analysis of Scheduling Fair Competitions. CoRR abs/2102.03857 (2021) - [i48]Daniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk, Saket Saurabh, Meirav Zehavi:
An Exponential Time Parameterized Algorithm for Planar Disjoint Paths. CoRR abs/2103.17041 (2021) - [i47]Barak Steindl, Meirav Zehavi:
Verification of Multi-Layered Assignment Problems. CoRR abs/2105.10434 (2021) - [i46]Siddharth Gupta, Guy Sa'ar, Meirav Zehavi:
Grid Recognition: Classical and Parameterized Computational Perspectives. CoRR abs/2106.16180 (2021) - [i45]Ulrich Bauer, Abhishek Rathod, Meirav Zehavi:
The complexity of high-dimensional cuts. CoRR abs/2108.10195 (2021) - [i44]Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, Meirav Zehavi:
Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293). Dagstuhl Reports 11(6): 82-123 (2021) - 2020
- [j52]Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Gehrlein stability in committee selection: parameterized hardness and algorithms. Auton. Agents Multi Agent Syst. 34(1): 27 (2020) - [j51]Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Quadratic Vertex Kernel for Rainbow Matching. Algorithmica 82(4): 881-897 (2020) - [j50]Neeldhara Misra, Frances A. Rosamond, Meirav Zehavi:
Special Issue "New Frontiers in Parameterized Complexity and Algorithms": Foreward by the Guest Editors. Algorithms 13(9): 236 (2020) - [j49]Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Popular Matching in Roommates Setting is NP-hard. Bull. EATCS 130 (2020) - [j48]Siddharth Gupta, Guy Sa'ar, Meirav Zehavi:
The Parameterized Complexity of Motion Planning for Snake-Like Robots. J. Artif. Intell. Res. 69: 191-229 (2020) - [j47]Roni Zoller, Meirav Zehavi, Michal Ziv-Ukelson:
A New Paradigm for Identifying Reconciliation-Scenario Altering Mutations Conferring Environmental Adaptation. J. Comput. Biol. 27(11): 1561-1580 (2020) - [j46]Jayakrishnan Madathil, Saket Saurabh, Meirav Zehavi:
Fixed-Parameter Tractable Algorithm and Polynomial Kernel for Max-Cut Above Spanning Tree. Theory Comput. Syst. 64(1): 62-100 (2020) - [j45]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Going Far from Degeneracy. SIAM J. Discret. Math. 34(3): 1587-1601 (2020) - [j44]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. ACM Trans. Algorithms 16(3): 32:1-32:31 (2020) - [j43]Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems. ACM Trans. Algorithms 16(4): 51:1-51:38 (2020) - [j42]Dor Ganor, Ron Y. Pinter, Meirav Zehavi:
A Note on GRegNetSim: A Tool for the Discrete Simulation and Analysis of Genetic Regulatory Networks. IEEE ACM Trans. Comput. Biol. Bioinform. 17(1): 316-320 (2020) - [j41]Christian Komusiewicz, Mateus de Oliveira Oliveira, Meirav Zehavi:
Revisiting the parameterized complexity of Maximum-Duo Preservation String Mapping. Theor. Comput. Sci. 847: 27-38 (2020) - [c79]Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths. Treewidth, Kernels, and Algorithms 2020: 112-128 - [c78]Akanksha Agrawal, Kristine V. K. Knudsen, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
The Parameterized Complexity of Guarding Almost Convex Polygons. SoCG 2020: 3:1-3:16 - [c77]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. SoCG 2020: 44:1-44:18 - [c76]Akanksha Agrawal, Meirav Zehavi:
Parameterized Analysis of Art Gallery and Terrain Guarding. CSR 2020: 16-29 - [c75]Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
On the (Parameterized) Complexity of Almost Stable Marriage. FSTTCS 2020: 24:1-24:17 - [c74]Fedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, Meirav Zehavi:
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. ICALP 2020: 49:1-49:18 - [c73]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Parameterization Above a Multiplicative Guarantee. ITCS 2020: 39:1-39:13 - [c72]William Lochet, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Fault Tolerant Subgraphs with Applications in Kernelization. ITCS 2020: 47:1-47:22 - [c71]Petr A. Golovach, R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi:
Graph Hamiltonicity Parameterized by Proper Interval Deletion Set. LATIN 2020: 104-115 - [c70]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Parameterized Complexity and Approximability of Directed Odd Cycle Transversal. SODA 2020: 2181-2200 - [c69]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs. SODA 2020: 2299-2318 - [c68]Daniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk, Saket Saurabh, Meirav Zehavi:
An exponential time parameterized algorithm for planar disjoint paths. STOC 2020: 1307-1316 - [c67]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Hitting topological minors is FPT. STOC 2020: 1317-1326 - [c66]Akanksha Agrawal, Sudeshna Kolay, Meirav Zehavi:
Parameter Analysis for Guarding Terrains. SWAT 2020: 4:1-4:18 - [c65]Sujoy Bhore, Paz Carmi, Sudeshna Kolay, Meirav Zehavi:
Parameterized Study of Steiner Tree on Unit Disk Graphs. SWAT 2020: 13:1-13:18 - [c64]Galia R. Zimerman, Dina Svetlitsky, Meirav Zehavi, Michal Ziv-Ukelson:
Approximate Search for Known Gene Clusters in New Genomes Using PQ-Trees. WABI 2020: 1:1-1:24 - [p1]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Parameterized Algorithms. Beyond the Worst-Case Analysis of Algorithms 2020: 27-51 - [i43]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. CoRR abs/2003.00938 (2020) - [i42]Akanksha Agrawal, Kristine V. K. Knudsen, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
The Parameterized Complexity of Guarding Almost Convex Polygons. CoRR abs/2003.07793 (2020) - [i41]Barak Steindl, Meirav Zehavi:
Parameterized Analysis of Assignment Under Multiple Preferences. CoRR abs/2004.00655 (2020) - [i40]Sujoy Bhore, Paz Carmi, Sudeshna Kolay, Meirav Zehavi:
Parameterized Study of Steiner Tree on Unit Disk Graphs. CoRR abs/2004.09220 (2020) - [i39]Fedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, Meirav Zehavi:
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. CoRR abs/2004.11621 (2020) - [i38]Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
On the (Parameterized) Complexity of Almost Stable Marriage. CoRR abs/2005.08150 (2020) - [i37]Galia R. Zimerman, Dina Svetlitsky, Meirav Zehavi, Michal Ziv-Ukelson:
Approximate Search for Known Gene Clusters in New Genomes Using PQ-Trees. CoRR abs/2007.03589 (2020) - [i36]Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths. CoRR abs/2008.08373 (2020) - [i35]Pallavi Jain, Krzysztof Sornat, Nimrod Talmon, Meirav Zehavi:
Participatory Budgeting with Project Groups. CoRR abs/2012.05213 (2020)
2010 – 2019
- 2019
- [j40]Sushmita Gupta, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Stability in barter exchange markets. Auton. Agents Multi Agent Syst. 33(5): 518-539 (2019) - [j39]Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Parameterized Algorithms for List K-Cycle. Algorithmica 81(3): 1267-1287 (2019) - [j38]Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Parameterized Algorithms and Kernels for Rainbow Matching. Algorithmica 81(4): 1684-1698 (2019) - [j37]Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi:
Improved Parameterized Algorithms for Network Query Problems. Algorithmica 81(6): 2270-2316 (2019) - [j36]R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi:
The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue. Algorithmica 81(9): 3803-3841 (2019) - [j35]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. Discret. Comput. Geom. 62(4): 879-911 (2019) - [j34]Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh, Meirav Zehavi:
Packing Cycles Faster Than Erdos-Posa. SIAM J. Discret. Math. 33(3): 1194-1215 (2019) - [j33]Syed Mohammad Meesum, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Rank Vertex Cover as a Natural Problem for Algebraic Compression. SIAM J. Discret. Math. 33(3): 1277-1296 (2019) - [j32]Daniel Lokshtanov, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Balanced Judicious Bipartition is Fixed-Parameter Tractable. SIAM J. Discret. Math. 33(4): 1878-1911 (2019) - [j31]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring. ACM Trans. Algorithms 15(1): 9:1-9:27 (2019) - [j30]Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. ACM Trans. Algorithms 15(1): 11:1-11:28 (2019) - [j29]Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi:
Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. ACM Trans. Algorithms 15(1): 13:1-13:44 (2019) - [j28]Jørgen Bang-Jensen, Kristine Vitting Klinkby, Saket Saurabh, Meirav Zehavi:
The parameterized complexity landscape of finding 2-partitions of digraphs. Theor. Comput. Sci. 795: 108-114 (2019) - [j27]Akanksha Agrawal, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Split Contraction: The Untold Story. ACM Trans. Comput. Theory 11(3): 18:1-18:22 (2019) - [c63]