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
- 2024
[j80]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): 358-398 (2024)- [j79]Ashwin Jacob, Michal Wlodarczyk, Meirav Zehavi:
Long directed detours: Reduction to 2-Disjoint Paths. Inf. Process. Lett. 186: 106491 (2024) - [j78]Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity. ACM Trans. Algorithms 20(2): 15 (2024) - [c119]Juhi Chaudhary, Hendrik Molter, Meirav Zehavi:
How to Make Knockout Tournaments More Popular? AAAI 2024: 9582-9589 - [c118]Harmender Gahlawat, Meirav Zehavi:
Learning Small Decision Trees with Few Outliers: A Parameterized Perspective. AAAI 2024: 12100-12108 - [c117]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
Hybrid k-Clustering: Blending k-Median and k-Center. APPROX/RANDOM 2024: 4:1-4:19 - [c116]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3. APPROX/RANDOM 2024: 6:1-6:14 - [c115]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs. SoCG 2024: 72:1-72:11 - [c114]Juhi Chaudhary, Hendrik Molter, Meirav Zehavi:
Parameterized Analysis of Bribery in Challenge the Champ Tournaments. IJCAI 2024: 2704-2712 - [c113]Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Kernelization of Counting Problems. ITCS 2024: 77:1-77:23 - [c112]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Meta-theorems for Parameterized Streaming Algorithms‡. SODA 2024: 712-739 - [i79]Juhi Chaudhary, Hendrik Molter, Meirav Zehavi:
Parameterized Analysis of Bribery in Challenge the Champ Tournaments. CoRR abs/2403.17587 (2024) - [i78]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
Hybrid k-Clustering: Blending k-Median and k-Center. CoRR abs/2407.08295 (2024) - [i77]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3. CoRR abs/2407.09356 (2024) - [i76]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
Subexponential Parameterized Algorithms for Hitting Subgraphs. CoRR abs/2409.04786 (2024) - [i75]Ashwin Jacob, Diptapriyo Majumdar, Meirav Zehavi:
A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees. CoRR abs/2409.14209 (2024) - [i74]Giordano Da Lozzo, Robert Ganian, Siddharth Gupta, Bojan Mohar, Sebastian Ordyniak, Meirav Zehavi:
Exact Algorithms for Clustered Planarity with Linear Saturators. CoRR abs/2409.19410 (2024) - 2023
- [j77]Sujoy Bhore, Paz Carmi, Sudeshna Kolay, Meirav Zehavi:
Parameterized Study of Steiner Tree on Unit Disk Graphs. Algorithmica 85(1): 133-152 (2023) - [j76]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) - [j75]Eden Ozeri, Meirav Zehavi, Michal Ziv-Ukelson:
New algorithms for structure informed genome rearrangement. Algorithms Mol. Biol. 18(1): 17 (2023) - [j74]Saket Saurabh, Meirav Zehavi:
Parameterized complexity of multi-node hubs. J. Comput. Syst. Sci. 131: 64-85 (2023) - [j73]Siddharth Gupta, Guy Sa'ar, Meirav Zehavi:
Grid recognition: Classical and parameterized computational perspectives. J. Comput. Syst. Sci. 136: 17-62 (2023) - [j72]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) - [j71]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) - [j70]Meirav Zehavi:
Forgetfulness Can Make You Faster: An O*(8.097k)-time Algorithm for Weighted 3-set k-packing. ACM Trans. Comput. Theory 15(3-4): 6:1-6:13 (2023) - [c111]Meirav Zehavi:
Tournament Fixing Parameterized by Feedback Vertex Set Number Is FPT. AAAI 2023: 5876-5883 - [c110]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
Kernelization for Spreading Points. ESA 2023: 48:1-48:16 - [c109]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 - [c108]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 - [c107]Michal Wlodarczyk, Meirav Zehavi:
Planar Disjoint Paths, Treewidth, and Kernels. FOCS 2023: 649-662 - [c106]Harmender Gahlawat, Meirav Zehavi:
Parameterized Complexity of Incomplete Connected Fair Division. FSTTCS 2023: 14:1-14:18 - [c105]Pascal Kunz, Hendrik Molter, Meirav Zehavi:
In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks? IJCAI 2023: 180-188 - [c104]Ulrich Bauer, Abhishek Rathod, Meirav Zehavi:
On Computing Homological Hitting Sets. ITCS 2023: 13:1-13:21 - [c103]Juhi Chaudhary, Harmender Gahlawat, Michal Wlodarczyk, Meirav Zehavi:
Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs. IPEC 2023: 10:1-10:22 - [c102]Siddharth Gupta, Guy Sa'ar, Meirav Zehavi:
Collective Graph Exploration Parameterized by Vertex Cover. IPEC 2023: 22:1-22:18 - [c101]Siddharth Gupta, Guy Sa'ar, Meirav Zehavi:
Drawn Tree Decomposition: New Approach for Graph Drawing Problems. IPEC 2023: 23:1-23:22 - [c100]Ioannis Koutis, Michal Wlodarczyk, Meirav Zehavi:
Sidestepping Barriers for Dominating Set in Parameterized Complexity. IPEC 2023: 31:1-31:17 - [c99]Harmender Gahlawat, Meirav Zehavi:
Parameterized Analysis of the Cops and Robber Game. MFCS 2023: 49:1-49:17 - [c98]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
A Framework for Approximation Schemes on Disk Graphs. SODA 2023: 2228-2241 - [c97]Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff, Meirav Zehavi:
Parameterized Approaches to Orthogonal Compaction. SOFSEM 2023: 111-125 - [c96]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
An ETH-Tight Algorithm for Bidirected Steiner Connectivity. WADS 2023: 588-604 - [c95]Juhi Chaudhary, Meirav Zehavi:
Parameterized Results on Acyclic Matchings with Implications for Related Problems. WG 2023: 201-216 - [c94]Juhi Chaudhary, Meirav Zehavi:
P-Matchings Parameterized by Treewidth. WG 2023: 217-231 - [i73]Ashwin Jacob, Michal Wlodarczyk, Meirav Zehavi:
Long Directed Detours: Reduction to 2-Disjoint Paths. CoRR abs/2301.06105 (2023) - [i72]Pascal Kunz, Hendrik Molter, Meirav Zehavi:
In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks? CoRR abs/2301.10503 (2023) - [i71]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
Hitting Subgraphs in Sparse Graphs and Geometric Intersection Graphs. CoRR abs/2304.13695 (2023) - [i70]Harmender Gahlawat, Meirav Zehavi:
Parameterized Analysis of the Cops and Robber Problem. CoRR abs/2307.04594 (2023) - [i69]Juhi Chaudhary, Meirav Zehavi:
Parameterized Results on Acyclic Matchings with Implications for Related Problems. CoRR abs/2307.05446 (2023) - [i68]Michal Wlodarczyk, Meirav Zehavi:
Planar Disjoint Paths, Treewidth, and Kernels. CoRR abs/2307.06792 (2023) - [i67]Juhi Chaudhary, Meirav Zehavi:
P-matchings Parameterized by Treewidth. CoRR abs/2307.09333 (2023) - [i66]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Meta-theorems for Parameterized Streaming Algorithms. CoRR abs/2308.01598 (2023) - [i65]Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Kernelization of Counting Problems. CoRR abs/2308.02188 (2023) - [i64]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) - [i63]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) - [i62]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
Kernelization for Spreading Points. CoRR abs/2308.07099 (2023) - [i61]Juhi Chaudhary, Hendrik Molter, Meirav Zehavi:
How to Make Knockout Tournaments More Popular? CoRR abs/2309.09967 (2023) - [i60]Ioannis Koutis, Michal Wlodarczyk, Meirav Zehavi:
Sidestepping Barriers for Dominating Set in Parameterized Complexity. CoRR abs/2309.15645 (2023) - [i59]Juhi Chaudhary, Harmender Gahlawat, Michal Wlodarczyk, Meirav Zehavi:
Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs. CoRR abs/2309.16892 (2023) - [i58]Harmender Gahlawat, Meirav Zehavi:
Parameterized Complexity of Incomplete Connected Fair Division. CoRR abs/2310.01310 (2023) - [i57]Siddharth Gupta, Guy Sa'ar, Meirav Zehavi:
Drawn Tree Decomposition: New Approach for Graph Drawing Problems. CoRR abs/2310.05471 (2023) - [i56]Siddharth Gupta, Guy Sa'ar, Meirav Zehavi:
Collective Graph Exploration Parameterized by Vertex Cover. CoRR abs/2310.05480 (2023) - [i55]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): 58-97 (2023) - [i54]Karthik C. S., Parinya Chalermsook, Joachim Spoerhase, Meirav Zehavi, Martin G. Herold:
Parameterized Approximation: Algorithms and Hardness (Dagstuhl Seminar 23291). Dagstuhl Reports 13(7): 96-107 (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]Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Gehrlein Stability in Committee Selection: Parameterized Hardness and Algorithms. AAMAS 2019: 511-519 - [c62]Akanksha Agrawal, Grzegorz Guspiel, Jayakrishnan Madathil, Saket Saurabh, Meirav Zehavi:
Connecting the Dots (with Minimum Crossings). SoCG 2019: 7:1-7:17 - [c61]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Going Far From Degeneracy. ESA 2019: 47:1-47:14 - [c60]Andreas Björklund, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Approximate Counting of k-Paths: Deterministic and in Polynomial Space. ICALP 2019: 24:1-24:15 - [c59]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals. ICALP 2019: 59:1-59:13 - [c58]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Decomposition of Map Graphs with Applications. ICALP 2019: 60:1-60:15 - [c57]Sushmita Gupta, Saket Saurabh, Ramanujan Sridharan, Meirav Zehavi:
On Succinct Encodings for the Tournament Fixing Problem. IJCAI 2019: 322-328 - [c56]Siddharth Gupta, Guy Sa'ar, Meirav Zehavi:
The Parameterized Complexity of Motion Planning for Snake-Like Robots. IJCAI 2019: 5670-5676 - [c55]Stéphane Bessy, Marin Bougeret, R. Krithika, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut, Meirav Zehavi:
Packing Arc-Disjoint Cycles in Tournaments. MFCS 2019: 27:1-27:14 - [c54]Jayakrishnan Madathil, Roohani Sharma, Meirav Zehavi:
A Sub-Exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs. MFCS 2019: 28:1-28:14 - [c53]Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity. SODA 2019: 1035-1054 - [c52]Akanksha Agrawal, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Interval Vertex Deletion Admits a Polynomial Kernel. SODA 2019: 1711-1730 - [c51]Gregory Z. Gutin, Magnus Wahlström, Meirav Zehavi:
On r-Simple k-Path and Related Problems Parameterized by k/r. SODA 2019: 1750-1769 - [c50]Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Popular Matching in Roommates Setting is NP-hard. SODA 2019: 2810-2822 - [c49]Roni Zoller, Meirav Zehavi, Michal Ziv-Ukelson:
A New Paradigm for Identifying Reconciliation-Scenario Altering Mutations Conferring Environmental Adaptation. WABI 2019: 9:1-9:13 - [c48]Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Balanced Stable Marriage: How Close Is Close Enough? WADS 2019: 423-437 - [c47]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS. WADS 2019: 523-537 - [c46]Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Parameterized Computational Geometry via Decomposition Theorems. WALCOM 2019: 15-27 - [i34]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Going Far From Degeneracy. CoRR abs/1902.02526 (2019) - [i33]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals. CoRR abs/1902.06957 (2019) - [i32]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Decomposition of Map Graphs with Applications. CoRR abs/1903.01291 (2019) - [i31]Siddharth Gupta, Guy Sa'ar, Meirav Zehavi:
The Parameterized Complexity of Motion Planning for Snake-Like Robots. CoRR abs/1903.02445 (2019) - [i30]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Reducing Topological Minor Containment to the Unique Linkage Theorem. CoRR abs/1904.02944 (2019) - [i29]Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
A Brief Note on Single Source Fault Tolerant Reachability. CoRR abs/1904.08150 (2019) - [i28]Roni Zoller, Meirav Zehavi, Michal Ziv-Ukelson:
A New Paradigm for Identifying Reconciliation-Scenario Altering Mutations Conferring Environmental Adaptation. CoRR abs/1912.01934 (2019) - [i27]Fedor V. Fomin, Dániel Marx, Saket Saurabh, Meirav Zehavi:
New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041). Dagstuhl Reports 9(1): 67-87 (2019) - 2018
- [j26]Saket Saurabh, Meirav Zehavi:
$$(k, n-k)$$ ( k , n - k ) -Max-Cut: An $$\mathcal{O}^*(2^p)$$ O ∗ ( 2 p ) -Time Algorithm and a Polynomial Kernel. Algorithmica 80(12): 3844-3860 (2018) - [j25]Meirav Zehavi:
The k-leaf spanning tree problem admits a klam value of 39. Eur. J. Comb. 68: 175-203 (2018) - [j24]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Long directed (s, t)-path: FPT algorithm. Inf. Process. Lett. 140: 8-12 (2018) - [j23]Akanksha Agrawal, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Kernels for deletion to classes of acyclic digraphs. J. Comput. Syst. Sci. 92: 9-21 (2018) - [j22]Gregory Z. Gutin, Felix Reidl, Magnus Wahlström, Meirav Zehavi:
Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials. J. Comput. Syst. Sci. 95: 69-85 (2018) - [j21]Akanksha Agrawal, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Parameterised Algorithms for Deletion to Classes of DAGs. Theory Comput. Syst. 62(8): 1880-1909 (2018) - [j20]Fedor V. Fomin, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh, Meirav Zehavi:
Matrix Rigidity from the Viewpoint of Parameterized Complexity. SIAM J. Discret. Math. 32(2): 966-985 (2018) - [j19]Pradeesha Ashok, Fedor V. Fomin, Sudeshna Kolay, Saket Saurabh, Meirav Zehavi:
Exact Algorithms for Terrain Guarding. ACM Trans. Algorithms 14(2): 25:1-25:20 (2018) - [j18]Deeksha Adil, Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Parameterized algorithms for stable matching with ties and incomplete lists. Theor. Comput. Sci. 723: 1-10 (2018) - [c45]Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems. APPROX-RANDOM 2018: 1:1-1:15 - [c44]Sushmita Gupta, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Stability in Barter Exchange Markets. AAMAS 2018: 1371-1379 - [c43]Jayakrishnan Madathil, Saket Saurabh, Meirav Zehavi:
Max-Cut Above Spanning Tree is Fixed-Parameter Tractable. CSR 2018: 244-256 - [c42]Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. FSTTCS 2018: 35:1-35:19 - [c41]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS. ICALP 2018: 110:1-110:4 - [c40]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Reducing CMSO Model Checking to Highly Connected Graphs. ICALP 2018: 135:1-135:14 - [c39]Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
When Rigging a Tournament, Let Greediness Blind You. IJCAI 2018: 275-281 - [c38]Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Winning a Tournament by Any Means Necessary. IJCAI 2018: 282-288 - [c37]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity. ITCS 2018: 32:1-32:13 - [c36]Saket Saurabh, Meirav Zehavi:
Parameterized Complexity of Multi-Node Hubs. IPEC 2018: 8:1-8:14 - [c35]R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi:
The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue. LATIN 2018: 712-726 - [c34]Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth. SODA 2018: 262-273 - [c33]Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi:
Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. SODA 2018: 331-342 - [c32]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. SODA 2018: 2785-2800 - [c31]Jørgen Bang-Jensen, Manu Basavaraju, Kristine Vitting Klinkby, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Parameterized Algorithms for Survivable Network Design with Uniform Demands. SODA 2018: 2838-2850 - [c30]Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Erdös-Pósa Property of Obstructions to Interval Graphs. STACS 2018: 7:1-7:15 - [i26]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Reducing CMSO Model Checking to Highly Connected Graphs. CoRR abs/1802.01453 (2018) - [i25]R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi:
The Parameterized Complexity of Packing Arc-Disjoint Cycles in Tournaments. CoRR abs/1802.07090 (2018) - [i24]Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Popular Matching in Roommates Setting is NP-hard. CoRR abs/1803.09370 (2018) - [i23]Gregory Z. Gutin, Magnus Wahlström, Meirav Zehavi:
On r-Simple k-Path and Related Problems Parameterized by k/r. CoRR abs/1806.09108 (2018) - 2017
- [j17]Meirav Zehavi:
Algorithms for k-Internal Out-Branching and k-Tree in Bounded Degree Graphs. Algorithmica 78(1): 319-341 (2017) - [j16]Mohammed El-Kebir, Benjamin J. Raphael, Ron Shamir, Roded Sharan, Simone Zaccaria, Meirav Zehavi, Ron Zeira:
Complexity and algorithms for copy-number evolution problems. Algorithms Mol. Biol. 12(1): 13:1-13:11 (2017) - [j15]Ron Zeira, Meirav Zehavi, Ron Shamir:
A Linear-Time Algorithm for the Copy Number Transformation Problem. J. Comput. Biol. 24(12): 1179-1194 (2017) - [j14]Hadas Shachnai, Meirav Zehavi:
A multivariate framework for weighted FPT algorithms. J. Comput. Syst. Sci. 89: 157-189 (2017) - [j13]Hadas Shachnai, Meirav Zehavi:
Parameterized Algorithms for Graph Partitioning Problems. Theory Comput. Syst. 61(3): 721-738 (2017) - [j12]Andreas Björklund, Vikram Kamat, Lukasz Kowalik, Meirav Zehavi:
Spotting Trees with Few Leaves. SIAM J. Discret. Math. 31(2): 687-713 (2017) - [j11]Meirav Zehavi:
Maximum Minimal Vertex Cover Parameterized by Vertex Cover. SIAM J. Discret. Math. 31(4): 2440-2456 (2017) - [c29]Pradeesha Ashok, Fedor V. Fomin, Sudeshna Kolay, Saket Saurabh, Meirav Zehavi:
Exact Algorithms for Terrain Guarding. SoCG 2017: 11:1-11:15 - [c28]Christian Komusiewicz, Mateus de Oliveira Oliveira, Meirav Zehavi:
Revisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping. CPM 2017: 11:1-11:17 - [c27]Daniel Lokshtanov, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Balanced Judicious Bipartition is Fixed-Parameter Tractable. FSTTCS 2017: 40:40-40:15 - [c26]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. ICALP 2017: 65:1-65:15 - [c25]Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh, Meirav Zehavi:
Packing Cycles Faster Than Erdos-Posa. ICALP 2017: 71:1-71:15 - [c24]Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Parameterized Algorithms and Kernels for Rainbow Matching. MFCS 2017: 71:1-71:13 - [c23]Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Group Activity Selection on Graphs: Parameterized Analysis. SAGT 2017: 106-118 - [c22]Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. SODA 2017: 1383-1398 - [c21]Akanksha Agrawal, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Split Contraction: The Untold Story. STACS 2017: 5:1-5:14 - [c20]Fedor V. Fomin, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh, Meirav Zehavi:
Matrix Rigidity from the Viewpoint of Parameterized Complexity. STACS 2017: 32:1-32:14 - [i22]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Parameterized Complexity and Approximability of Directed Odd Cycle Transversal. CoRR abs/1704.04249 (2017) - [i21]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. CoRR abs/1704.07279 (2017) - [i20]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. CoRR abs/1705.01414 (2017) - [i19]Syed Mohammad Meesum, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Rank Vertex Cover as a Natural Problem for Algebraic Compression. CoRR abs/1705.02822 (2017) - [i18]Gregory Z. Gutin, Felix Reidl, Magnus Wahlström, Meirav Zehavi:
Kirchoff Matrices and Pfaffians to Design Deterministic Polynomial-Space Parameterized Algorithms. CoRR abs/1706.03698 (2017) - [i17]Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh, Meirav Zehavi:
Packing Cycles Faster Than Erdős-Pósa. CoRR abs/1707.01037 (2017) - [i16]Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Polylogarithmic Approximation Algorithms for Weighted-$\mathcal{F}$-Deletion Problems. CoRR abs/1707.04908 (2017) - [i15]Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. CoRR abs/1707.04917 (2017) - [i14]Sushmita Gupta, Saket Saurabh, Meirav Zehavi:
On Treewidth and Stable Marriage. CoRR abs/1707.05404 (2017) - [i13]Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Balanced Stable Marriage: How Close is Close Enough? CoRR abs/1707.09545 (2017) - [i12]Daniel Lokshtanov, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Balanced Judicious Partition is Fixed-Parameter Tractable. CoRR abs/1710.05491 (2017) - 2016
- [j10]Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi:
Deterministic parameterized algorithms for the Graph Motif problem. Discret. Appl. Math. 213: 162-178 (2016) - [j9]Meirav Zehavi:
Parameterized algorithms for the Module Motif problem. Inf. Comput. 251: 179-193 (2016) - [j8]Meirav Zehavi:
A randomized algorithm for long directed cycle. Inf. Process. Lett. 116(6): 419-422 (2016) - [j7]Hadas Shachnai, Meirav Zehavi:
Representative families: A unified tradeoff-based approach. J. Comput. Syst. Sci. 82(3): 488-502 (2016) - [j6]Ran Ben-Basat, Ariel Gabizon, Meirav Zehavi:
The k-distinct language: Parameterized automata constructions. Theor. Comput. Sci. 622: 1-15 (2016) - [j5]Meirav Zehavi:
Parameterized approximation algorithms for packing problems. Theor. Comput. Sci. 648: 40-55 (2016) - [c19]Ron Shamir, Meirav Zehavi, Ron Zeira:
A Linear-Time Algorithm for the Copy Number Transformation Problem. CPM 2016: 16:1-16:13 - [c18]Fahad Panolan, Meirav Zehavi:
Parameterized Algorithms for List K-Cycle. FSTTCS 2016: 22:1-22:15 - [c17]Akanksha Agrawal, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Simultaneous Feedback Edge Set: A Parameterized Perspective. ISAAC 2016: 5:1-5:13 - [c16]Akanksha Agrawal, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Kernels for Deletion to Classes of Acyclic Digraphs. ISAAC 2016: 6:1-6:12 - [c15]Saket Saurabh, Meirav Zehavi:
(k, n-k)-Max-Cut: An 𝒪∗(2p)-Time Algorithm and a Polynomial Kernel. LATIN 2016: 686-699 - [c14]Mohammed El-Kebir, Benjamin J. Raphael, Ron Shamir, Roded Sharan, Simone Zaccaria, Meirav Zehavi, Ron Zeira:
Copy-Number Evolution Problems: Complexity and Algorithms. WABI 2016: 137-149 - [i11]Akanksha Agrawal, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Simultaneous Feedback Edge Set: A Parameterized Perspective. CoRR abs/1611.07701 (2016) - 2015
- [j4]Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi:
Partial Information Network Queries. J. Discrete Algorithms 31: 129-145 (2015) - [j3]Prachi Goyal, Neeldhara Misra, Fahad Panolan, Meirav Zehavi:
Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets. SIAM J. Discret. Math. 29(4): 1815-1836 (2015) - [c13]Hadas Shachnai, Meirav Zehavi:
A Multivariate Approach for Weighted FPT Algorithms. ESA 2015: 965-976 - [c12]Meirav Zehavi:
Mixing Color Coding-Related Techniques. ESA 2015: 1037-1049 - [c11]Andreas Björklund, Vikram Kamat, Lukasz Kowalik, Meirav Zehavi:
Spotting Trees with Few Leaves. ICALP (1) 2015: 243-255 - [c10]Meirav Zehavi:
The k-Leaf Spanning Tree Problem Admits a Klam Value of 39. IWOCA 2015: 346-357 - [c9]Meirav Zehavi:
Maximum Minimal Vertex Cover Parameterized by Vertex Cover. MFCS (2) 2015: 589-600 - [i10]Andreas Björklund, Vikram Kamat, Lukasz Kowalik, Meirav Zehavi:
Spotting Trees with Few Leaves. CoRR abs/1501.00563 (2015) - [i9]Meirav Zehavi:
The k-Leaf Spanning Tree Problem Admits a Klam Value of 39. CoRR abs/1502.07725 (2015) - [i8]Meirav Zehavi:
Maximization Problems Parameterized Using Their Minimization Versions: The Case of Vertex Cover. CoRR abs/1503.06438 (2015) - [i7]Meirav Zehavi:
Parameterized Approximation Algorithms for Packing Problems. CoRR abs/1505.00709 (2015) - [i6]Meirav Zehavi:
A Randomized Algorithm for Long Directed Cycle. CoRR abs/1510.08892 (2015) - 2014
- [j2]Meirav Zehavi:
An Improved k-Exclusion Algorithm. J. Comput. 9(3): 529-536 (2014) - [j1]Ron Y. Pinter, Meirav Zehavi:
Algorithms for topology-free and alignment network queries. J. Discrete Algorithms 27: 29-53 (2014) - [c8]Hadas Shachnai, Meirav Zehavi:
Representative Families: A Unified Tradeoff-Based Approach. ESA 2014: 786-797 - [c7]Ran Ben-Basat, Ariel Gabizon, Meirav Zehavi:
The k -Distinct Language: Parameterized Automata Constructions. IPEC 2014: 85-96 - [c6]Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi:
Improved Parameterized Algorithms for Network Query Problems. IPEC 2014: 294-306 - [c5]Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi:
Deterministic Parameterized Algorithms for the Graph Motif Problem. MFCS (2) 2014: 589-600 - [c4]Hadas Shachnai, Meirav Zehavi:
Parameterized Algorithms for Graph Partitioning Problems. WG 2014: 384-395 - [i5]Hadas Shachnai, Meirav Zehavi:
Faster Computation of Representative Families for Uniform Matroids with Applications. CoRR abs/1402.3547 (2014) - [i4]Hadas Shachnai, Meirav Zehavi:
Parameterized Algorithms for Graph Partitioning Problems. CoRR abs/1403.0099 (2014) - [i3]Hadas Shachnai, Meirav Zehavi:
FPT Algorithms for Weighted Graphs Can be (Almost) as Efficient as for Unweighted. CoRR abs/1407.2033 (2014) - [i2]Meirav Zehavi:
Solving Parameterized Problems by Mixing Color Coding-Related Techniques. CoRR abs/1410.5062 (2014) - 2013
- [c3]Ron Y. Pinter, Meirav Zehavi:
Partial Information Network Queries. IWOCA 2013: 362-375 - [c2]Meirav Zehavi:
Algorithms for k-Internal Out-Branching. IPEC 2013: 361-373 - [c1]Meirav Zehavi:
Parameterized Algorithms for Module Motif. MFCS 2013: 825-836 - [i1]Meirav Zehavi:
Deterministic Parameterized Algorithms for Matching and Packing Problems. CoRR abs/1311.0484 (2013)
Coauthor Index
[j80] [c116] [c115] [c113] [c112] [i77] [i76] [j72] [j71] [c109] [c98] [c96] [i71] [i66] [i65] [i64] [c90] [c89] [i51] [j59] [j57] [j54] [j53] [c82] [c81] [c80] [i48] [j45] [j44] [j43] [c79] [c78] [c77] [c74] [c73] [c72] [c70] [c69] [c68] [c67] [p1] [i43] [i42] [i39] [i36] [j35] [j34] [j32] [j31] [j30] [j29] [j27] [c61] [c60] [c59] [c58] [c47] [i34] [i33] [i32] [i30] [i29] [j24] [j20] [c45] [c41] [c40] [c37] [c34] [c33] [c32] [c30] [i26] [c27] [c26] [c25] [c22] [c21] [c20] [i22] [i21] [i20] [i17] [i16] [i15] [i12]
M. S. Ramanujan 0001
aka: Ramanujan Sridharan
aka: Ramanujan Sridharan
[j80] [j78] [c117] [c116] [c115] [c113] [c112] [i78] [i77] [i76] [j76] [j74] [j72] [j71] [c110] [c109] [c98] [c96] [i71] [i66] [i65] [i64] [i62] [j65] [j64] [c92] [c91] [c90] [c89] [i53] [i51] [i50] [j63] [j62] [j59] [j57] [j56] [j55] [j54] [j53] [c82] [c81] [c80] [i48] [j52] [j51] [j49] [j46] [j45] [j44] [j43] [c79] [c78] [c77] [c75] [c74] [c73] [c72] [c71] [c70] [c69] [c68] [c67] [p1] [i43] [i42] [i39] [i38] [i36] [j40] [j39] [j38] [j36] [j35] [j34] [j33] [j32] [j31] [j30] [j29] [j28] [j27] [c63] [c62] [c61] [c60] [c59] [c58] [c57] [c55] [c53] [c52] [c50] [c48] [c47] [c46] [i34] [i33] [i32] [i30] [i29] [i27] [j26] [j24] [j23] [j21] [j20] [j19] [j18] [c45] [c44] [c43] [c42] [c41] [c40] [c39] [c38] [c37] [c36] [c35] [c34] [c33] [c32] [c31] [c30] [i26] [i25] [i24] [c29] [c27] [c26] [c25] [c24] [c23] [c22] [c21] [c20] [i22] [i21] [i20] [i19] [i17] [i16] [i15] [i14] [i13] [i12] [c17] [c16] [c15] [i11]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-28 20:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
