Meirav Zehavi - RankMe

323 papers A* 53A 23B 36C 9Misc 3Journal 186Unranked 12

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	FPT Approximations for Connected Maximum Coverage. ITCS Tanmay Inamdar, Satyabrata Jana, Madhumita Kundu, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2026	J	`jnl`	FPT Approximations for Connected Maximum Coverage. CoRR Tanmay Inamdar, Satyabrata Jana, Madhumita Kundu, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2026	J	`jnl`	Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs. J. Comput. Syst. Sci. Juhi Chaudhary, Harmender Gahlawat, Michal Wlodarczyk, Meirav Zehavi
2026	J	`jnl`	Min-Sum disjoint paths on subclasses of chordal graphs. Theor. Comput. Sci. Bar Menashe, Meirav Zehavi
2026	J	`jnl`	Parameterized analysis of the cops and robber problem. J. Comput. Syst. Sci. Harmender Gahlawat, Meirav Zehavi
2026	J	`jnl`	Parameterized approaches to orthogonal compaction. J. Comput. Syst. Sci. Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff, Meirav Zehavi
2026	J	`jnl`	Participatory budgeting with project groups. J. Comput. Syst. Sci. Pallavi Jain, Krzysztof Sornat, Nimrod Talmon, Meirav Zehavi
2026	A*	`conf`	Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization. SODA Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2026	J	`jnl`	When agents choose bundles autonomously: guarantees beyond discrepancy. CoRR Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman, Meirav Zehavi
2025	J	`jnl`	(Almost-)Optimal FPT Algorithm and Kernel for CoRR Harmender Gahlawat, Abhishek Rathod, Meirav Zehavi
2025	A*	`conf`	(Almost-)Optimal FPT Algorithm and Kernel for T-Cycle on Planar Graphs. ICALP Harmender Gahlawat, Abhishek Rathod, Meirav Zehavi
2025	C	`conf`	A Parameterized Perspective on Uniquely Restricted Matchings. LAGOS Juhi Chaudhary, Ignasi Sau, Meirav Zehavi
2025	J	`jnl`	A Parameterized Perspective on Uniquely Restricted Matchings. CoRR Juhi Chaudhary, Ignasi Sau, Meirav Zehavi
2025	B	`conf`	A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma. IPEC Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman, Meirav Zehavi
2025	J	`jnl`	A simple algorithm for Combinatorial n-fold ILPs using the Steinitz Lemma. CoRR Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman, Meirav Zehavi
2025	A*	`conf`	Adaptive Manipulation for Coalitions in Knockout Tournaments. AAAI Juhi Chaudhary, Hendrik Molter, Meirav Zehavi
2025	J	`jnl`	An Exponential Time Parameterized Algorithm for Planar Disjoint Paths. SIAM J. Comput. Daniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk, Saket Saurabh, Meirav Zehavi
2025	A*	`conf`	Crossing Number in Slightly Superexponential Time (Extended Abstract). SODA Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Jie Xue, Meirav Zehavi
2025	A*	`conf`	Efficiently Finding and Counting Patterns with Distance Constraints in Sparse Graphs. STOC Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2025	J	`jnl`	Hybrid k-Clustering: Blending k-Median and k-Center. ACM Trans. Comput. Theory Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2025	J	`jnl`	Learning Small Decision Trees with Few Outliers: A Parameterized Perspective. CoRR Harmender Gahlawat, Meirav Zehavi
2025	B	`conf`	Min-Sum Disjoint Paths on Subclasses of Chordal Graphs. WALCOM Bar Menashe, Meirav Zehavi
2025	J	`jnl`	Near-Linear and Parameterized Approximations for Maximum Cliques in Disk Graphs. CoRR Jie Gao, Pawel Gawrychowski, Panos Giannopoulos, Wolfgang Mulzer, Satyam Singh, Frank Staals, Meirav Zehavi
2025	J	`jnl`	On Kernelization with Access to NP-Oracles. CoRR Hendrik Molter, Meirav Zehavi
2025	J	`jnl`	Parameterized Analysis of Bribery in Challenge the Champ Tournaments. J. Artif. Intell. Res. Juhi Chaudhary, Hendrik Molter, Meirav Zehavi
2025	A	`conf`	Parameterized Geometric Graph Modification with Disk Scaling. ITCS Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2025	J	`jnl`	Parameterized algorithms on geometric intersection graphs. Comput. Sci. Rev. Jie Xue, Meirav Zehavi
2025	J	`jnl`	Parameterized results on acyclic matchings with implications for related problems. J. Comput. Syst. Sci. Juhi Chaudhary, Meirav Zehavi
2025	B	`conf`	Quasipolynomial-Time Deterministic Kernelization and (Gammoid) Representation. MFCS Rohit Gurjar, Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2025	A*	`conf`	Subexponential Parameterized Algorithms for Hitting Subgraphs. STOC Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2025	J	`jnl`	Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization. CoRR Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2025	A*	`conf`	Tournament Robustness via Redundancy. EC Klim Efremenko, Hendrik Molter, Meirav Zehavi
2025	J	`jnl`	Tournament Robustness via Redundancy. CoRR Klim Efremenko, Hendrik Molter, Meirav Zehavi
2025	A*	`conf`	Treewidth Parameterized by Feedback Vertex Number. ICALP Hendrik Molter, Meirav Zehavi, Amit Zivan
2025	J	`jnl`	Treewidth Parameterized by Feedback Vertex Number. CoRR Hendrik Molter, Meirav Zehavi, Amit Zivan
2025	J	`jnl`	Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for Directed Feedback Vertex Set. ACM Trans. Comput. Theory Daniel Lokshtanov, Ramanujan Maadapuzhi Sridharan, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2025	A*	`conf`	What makes an Ensemble (Un) Interpretable? ICML Shahaf Bassan, Guy Amir, Meirav Zehavi, Guy Katz
2025	J	`jnl`	What makes an Ensemble (Un) Interpretable? CoRR Shahaf Bassan, Guy Amir, Meirav Zehavi, Guy Katz
2025	J	`jnl`	$\mathcal{P}$-Matchings Parameterized by Treewidth. SIAM J. Discret. Math. Juhi Chaudhary, Meirav Zehavi
2024	J	`jnl`	(Re)packing Equal Disks into Rectangle. Discret. Comput. Geom. Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2024	A*	`conf`	A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs. SoCG Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2024	B	`conf`	A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees. ISAAC Ashwin Jacob, Diptapriyo Majumdar, Meirav Zehavi
2024	J	`jnl`	A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees. CoRR Ashwin Jacob, Diptapriyo Majumdar, Meirav Zehavi
2024	J	`jnl`	Adaptive Manipulation for Coalitions in Knockout Tournaments. CoRR Juhi Chaudhary, Hendrik Molter, Meirav Zehavi
2024	A	`conf`	Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3. APPROX/RANDOM Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2024	J	`jnl`	Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3. CoRR Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2024	J	`jnl`	Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity. ACM Trans. Algorithms Fahad Panolan, Saket Saurabh, Meirav Zehavi
2024	B	`conf`	Exact Algorithms for Clustered Planarity with Linear Saturators. ISAAC Giordano Da Lozzo, Robert Ganian, Siddharth Gupta, Bojan Mohar, Sebastian Ordyniak, Meirav Zehavi
2024	J	`jnl`	Exact Algorithms for Clustered Planarity with Linear Saturators. CoRR Giordano Da Lozzo, Robert Ganian, Siddharth Gupta, Bojan Mohar, Sebastian Ordyniak, Meirav Zehavi
2024	A*	`conf`	How to Make Knockout Tournaments More Popular? AAAI Juhi Chaudhary, Hendrik Molter, Meirav Zehavi
2024	A	`conf`	Hybrid k-Clustering: Blending k-Median and k-Center. APPROX/RANDOM Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2024	J	`jnl`	Hybrid k-Clustering: Blending k-Median and k-Center. CoRR Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2024	A	`conf`	Kernelization of Counting Problems. ITCS Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2024	A*	`conf`	Learning Small Decision Trees with Few Outliers: A Parameterized Perspective. AAAI Harmender Gahlawat, Meirav Zehavi
2024	J	`jnl`	Long directed detours: Reduction to 2-Disjoint Paths. Inf. Process. Lett. Ashwin Jacob, Michal Wlodarczyk, Meirav Zehavi
2024	J	`jnl`	Maximum Partial List H-Coloring on P CoRR Daniel Lokshtanov, Pawel Rzazewski, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2024	A*	`conf`	Meta-theorems for Parameterized Streaming Algorithms‡. SODA Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2024	A*	`conf`	Parameterized Analysis of Bribery in Challenge the Champ Tournaments. IJCAI Juhi Chaudhary, Hendrik Molter, Meirav Zehavi
2024	J	`jnl`	Parameterized Analysis of Bribery in Challenge the Champ Tournaments. CoRR Juhi Chaudhary, Hendrik Molter, Meirav Zehavi
2024	J	`jnl`	Parameterized Geometric Graph Modification with Disk Scaling. CoRR Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2024	J	`jnl`	Subexponential Parameterized Algorithms for Hitting Subgraphs. CoRR Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2024	J	`jnl`	The Parameterized Complexity of Guarding Almost Convex Polygons. Discret. Comput. Geom. Akanksha Agrawal, Kristine V. K. Knudsen, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2023	A*	`conf`	A Framework for Approximation Schemes on Disk Graphs. SODA Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2023	B	`conf`	An ETH-Tight Algorithm for Bidirected Steiner Connectivity. WADS Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2023	B	`conf`	Collective Graph Exploration Parameterized by Vertex Cover. IPEC Siddharth Gupta, Guy Sa'ar, Meirav Zehavi
2023	J	`jnl`	Collective Graph Exploration Parameterized by Vertex Cover. CoRR Siddharth Gupta, Guy Sa'ar, Meirav Zehavi
2023	B	`conf`	Drawn Tree Decomposition: New Approach for Graph Drawing Problems. IPEC Siddharth Gupta, Guy Sa'ar, Meirav Zehavi
2023	J	`jnl`	Drawn Tree Decomposition: New Approach for Graph Drawing Problems. CoRR Siddharth Gupta, Guy Sa'ar, Meirav Zehavi
2023	J	`jnl`	Erdős-Pósa property of obstructions to interval graphs. J. Graph Theory Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2023	J	`jnl`	Finding Long Directed Cycles Is Hard Even When DFVS Is Small Or Girth Is Large. CoRR Ashwin Jacob, Michal Wlodarczyk, Meirav Zehavi
2023	A	`conf`	Finding Long Directed Cycles Is Hard Even When DFVS Is Small or Girth Is Large. ESA Ashwin Jacob, Michal Wlodarczyk, Meirav Zehavi
2023	J	`jnl`	Forgetfulness Can Make You Faster: An ACM Trans. Comput. Theory Meirav Zehavi
2023	J	`jnl`	Grid recognition: Classical and parameterized computational perspectives. J. Comput. Syst. Sci. Siddharth Gupta, Guy Sa'ar, Meirav Zehavi
2023	J	`jnl`	Hitting Subgraphs in Sparse Graphs and Geometric Intersection Graphs. CoRR Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2023	J	`jnl`	How to Make Knockout Tournaments More Popular? CoRR Juhi Chaudhary, Hendrik Molter, Meirav Zehavi
2023	A*	`conf`	In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks? IJCAI Pascal Kunz, Hendrik Molter, Meirav Zehavi
2023	J	`jnl`	In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks? CoRR Pascal Kunz, Hendrik Molter, Meirav Zehavi
2023	A	`conf`	Kernelization for Spreading Points. ESA Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2023	J	`jnl`	Kernelization for Spreading Points. CoRR Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2023	J	`jnl`	Kernelization of Counting Problems. CoRR Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2023	B	`conf`	Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs. IPEC Juhi Chaudhary, Harmender Gahlawat, Michal Wlodarczyk, Meirav Zehavi
2023	J	`jnl`	Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs. CoRR Juhi Chaudhary, Harmender Gahlawat, Michal Wlodarczyk, Meirav Zehavi
2023	J	`jnl`	Long Directed Detours: Reduction to 2-Disjoint Paths. CoRR Ashwin Jacob, Michal Wlodarczyk, Meirav Zehavi
2023	A	`conf`	Lossy Kernelization for (Implicit) Hitting Set Problems. ESA Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi
2023	J	`jnl`	Lossy Kernelization for (Implicit) Hitting Set Problems. CoRR Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi
2023	J	`jnl`	Meta-theorems for Parameterized Streaming Algorithms. CoRR Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2023	J	`jnl`	New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162). Dagstuhl Reports Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, Meirav Zehavi, Liana Khazaliya
2023	J	`jnl`	New algorithms for structure informed genome rearrangement. Algorithms Mol. Biol. Eden Ozeri, Meirav Zehavi, Michal Ziv-Ukelson
2023	A	`conf`	On Computing Homological Hitting Sets. ITCS Ulrich Bauer, Abhishek Rathod, Meirav Zehavi
2023	J	`jnl`	P-matchings Parameterized by Treewidth. CoRR Juhi Chaudhary, Meirav Zehavi
2023	B	`conf`	Parameterized Analysis of the Cops and Robber Game. MFCS Harmender Gahlawat, Meirav Zehavi
2023	J	`jnl`	Parameterized Analysis of the Cops and Robber Problem. CoRR Harmender Gahlawat, Meirav Zehavi
2023	B	`conf`	Parameterized Approaches to Orthogonal Compaction. SOFSEM Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff, Meirav Zehavi
2023	J	`jnl`	Parameterized Approximation: Algorithms and Hardness (Dagstuhl Seminar 23291). Dagstuhl Reports Karthik C. S., Parinya Chalermsook, Joachim Spoerhase, Meirav Zehavi, Martin G. Herold
2023	—	`conf`	Parameterized Complexity of Incomplete Connected Fair Division. FSTTCS Harmender Gahlawat, Meirav Zehavi
2023	J	`jnl`	Parameterized Complexity of Incomplete Connected Fair Division. CoRR Harmender Gahlawat, Meirav Zehavi
2023	B	`conf`	Parameterized Results on Acyclic Matchings with Implications for Related Problems. WG Juhi Chaudhary, Meirav Zehavi
2023	J	`jnl`	Parameterized Results on Acyclic Matchings with Implications for Related Problems. CoRR Juhi Chaudhary, Meirav Zehavi
2023	J	`jnl`	Parameterized Study of Steiner Tree on Unit Disk Graphs. Algorithmica Sujoy Bhore, Paz Carmi, Sudeshna Kolay, Meirav Zehavi
2023	J	`jnl`	Parameterized complexity of multi-node hubs. J. Comput. Syst. Sci. Saket Saurabh, Meirav Zehavi
2023	A*	`conf`	Planar Disjoint Paths, Treewidth, and Kernels. FOCS Michal Wlodarczyk, Meirav Zehavi
2023	J	`jnl`	Planar Disjoint Paths, Treewidth, and Kernels. CoRR Michal Wlodarczyk, Meirav Zehavi
2023	J	`jnl`	Polynomial Kernel for Interval Vertex Deletion. ACM Trans. Algorithms Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2023	B	`conf`	Sidestepping Barriers for Dominating Set in Parameterized Complexity. IPEC Ioannis Koutis, Michal Wlodarczyk, Meirav Zehavi
2023	J	`jnl`	Sidestepping Barriers for Dominating Set in Parameterized Complexity. CoRR Ioannis Koutis, Michal Wlodarczyk, Meirav Zehavi
2023	J	`jnl`	Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. Algorithmica Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2023	A*	`conf`	Tournament Fixing Parameterized by Feedback Vertex Set Number Is FPT. AAAI Meirav Zehavi
2022	A*	`conf`	(Re)packing Equal Disks into Rectangle. ICALP Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Meirav Zehavi
2022	J	`jnl`	(Re)packing Equal Disks into Rectangle. CoRR Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2022	B	`conf`	A Finite Algorithm for the Realizabilty of a Delaunay Triangulation. IPEC Akanksha Agrawal, Saket Saurabh, Meirav Zehavi
2022	J	`jnl`	A Finite Algorithm for the Realizabilty of a Delaunay Triangulation. CoRR Akanksha Agrawal, Saket Saurabh, Meirav Zehavi
2022	J	`jnl`	A Framework for Approximation Schemes on Disk Graphs. CoRR Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2022	A*	`conf`	Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent. SODA Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2022	C	`conf`	New Algorithms for Structure Informed Genome Rearrangement. WABI Eden Ozery, Meirav Zehavi, Michal Ziv-Ukelson
2022	J	`jnl`	On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization). SIAM J. Discret. Math. Sushmita Gupta, Saket Saurabh, Meirav Zehavi
2022	J	`jnl`	Parameter Analysis for Guarding Terrains. Algorithmica Akanksha Agrawal, Sudeshna Kolay, Meirav Zehavi
2022	Misc	`conf`	Parameterized Analysis for the Group Activity Selection Problem on Graphs. ISAIM Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2022	J	`jnl`	Parameterized Approaches to Orthogonal Compaction. CoRR Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff, Meirav Zehavi
2022	J	`jnl`	Parameterized analysis and crossing minimization problems. Comput. Sci. Rev. Meirav Zehavi
2022	J	`jnl`	Resolute control: Forbidding candidates from winning an election is hard. Theor. Comput. Sci. Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2022	J	`jnl`	Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation. Algorithmica Petr A. Golovach, Meirav Zehavi
2022	A*	`conf`	Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract). SODA Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2022	J	`jnl`	Verification of multi-layered assignment problems. Auton. Agents Multi Agent Syst. Barak Steindl, Meirav Zehavi
2021	B	`ed.`	16th International Symposium on Parameterized and Exact Computation, IPEC 2021, Lisbon, Portugal, September 8-10, 2021 IPEC Petr A. Golovach, Meirav Zehavi
2021	J	`jnl`	A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs. Algorithmica Jayakrishnan Madathil, Roohani Sharma, Meirav Zehavi
2021	J	`jnl`	An Exponential Time Parameterized Algorithm for Planar Disjoint Paths. CoRR Daniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk, Saket Saurabh, Meirav Zehavi
2021	J	`jnl`	Approximate Counting of ACM Trans. Algorithms Daniel Lokshtanov, Andreas Björklund, Saket Saurabh, Meirav Zehavi
2021	J	`jnl`	Approximate search for known gene clusters in new genomes using PQ-trees. Algorithms Mol. Biol. Galia R. Zimerman, Dina Svetlitsky, Meirav Zehavi, Michal Ziv-Ukelson
2021	J	`jnl`	Balanced stable marriage: How close is close enough? Theor. Comput. Sci. Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2021	J	`jnl`	Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. ACM Trans. Comput. Theory Fedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, Meirav Zehavi
2021	J	`jnl`	ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. J. Comput. Geom. Meirav Zehavi, Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2021	A*	`conf`	Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting (Extended Version). SODA Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2021	A	`conf`	Exploiting Dense Structures in Parameterized Complexity. STACS William Lochet, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2021	A*	`conf`	FPT-approximation for FPT Problems. SODA Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2021	B	`conf`	Grid Recognition: Classical and Parameterized Computational Perspectives. ISAAC Siddharth Gupta, Guy Sa'ar, Meirav Zehavi
2021	J	`jnl`	Grid Recognition: Classical and Parameterized Computational Perspectives. CoRR Siddharth Gupta, Guy Sa'ar, Meirav Zehavi
2021	J	`jnl`	Multiplicative Parameterization Above a Guarantee. ACM Trans. Comput. Theory Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2021	A	`conf`	Multivariate Analysis of Scheduling Fair Competitions. AAMAS Siddharth Gupta, Meirav Zehavi
2021	J	`jnl`	Multivariate Analysis of Scheduling Fair Competitions. CoRR Siddharth Gupta, Meirav Zehavi
2021	J	`jnl`	Packing Arc-Disjoint Cycles in Tournaments. Algorithmica Stéphane Bessy, Marin Bougeret, R. Krithika, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut, Meirav Zehavi
2021	C	`conf`	Parameterized Analysis of Assignment Under Multiple Preferences. EUMAS Barak Steindl, Meirav Zehavi
2021	J	`jnl`	Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293). Dagstuhl Reports Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, Meirav Zehavi
2021	A*	`conf`	Participatory Budgeting with Project Groups. IJCAI Pallavi Jain, Krzysztof Sornat, Nimrod Talmon, Meirav Zehavi
2021	J	`jnl`	Popular Matching in Roommates Setting Is NP-hard. ACM Trans. Comput. Theory Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2021	J	`jnl`	Simultaneous Feedback Edge Set: A Parameterized Perspective. Algorithmica Akanksha Agrawal, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2021	J	`jnl`	The complexity of high-dimensional cuts. CoRR Ulrich Bauer, Abhishek Rathod, Meirav Zehavi
2021	J	`jnl`	Verification of Multi-Layered Assignment Problems. CoRR Barak Steindl, Meirav Zehavi
2021	C	`conf`	Verification of Multi-layered Assignment Problems. EUMAS Barak Steindl, Meirav Zehavi
2020	J	`jnl`	A New Paradigm for Identifying Reconciliation-Scenario Altering Mutations Conferring Environmental Adaptation. J. Comput. Biol. Roni Zoller, Meirav Zehavi, Michal Ziv-Ukelson
2020	J	`jnl`	A Note on GRegNetSim: A Tool for the Discrete Simulation and Analysis of Genetic Regulatory Networks. IEEE ACM Trans. Comput. Biol. Bioinform. Dor Ganor, Ron Y. Pinter, Meirav Zehavi
2020	A*	`conf`	An exponential time parameterized algorithm for planar disjoint paths. STOC Daniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk, Saket Saurabh, Meirav Zehavi
2020	C	`conf`	Approximate Search for Known Gene Clusters in New Genomes Using PQ-Trees. WABI Galia R. Zimerman, Dina Svetlitsky, Meirav Zehavi, Michal Ziv-Ukelson
2020	J	`jnl`	Approximate Search for Known Gene Clusters in New Genomes Using PQ-Trees. CoRR Galia R. Zimerman, Dina Svetlitsky, Meirav Zehavi, Michal Ziv-Ukelson
2020	A*	`conf`	Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs. SODA Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2020	A*	`conf`	Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. ICALP Fedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. CoRR Fedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. ACM Trans. Algorithms Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2020	A*	`conf`	ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. SoCG Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. CoRR Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2020	—	`conf`	Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths. Treewidth, Kernels, and Algorithms Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths. CoRR Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2020	A	`conf`	Fault Tolerant Subgraphs with Applications in Kernelization. ITCS William Lochet, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2020	J	`jnl`	Fixed-Parameter Tractable Algorithm and Polynomial Kernel for Max-Cut Above Spanning Tree. Theory Comput. Syst. Jayakrishnan Madathil, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	Gehrlein stability in committee selection: parameterized hardness and algorithms. Auton. Agents Multi Agent Syst. Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	Going Far from Degeneracy. SIAM J. Discret. Math. Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2020	B	`conf`	Graph Hamiltonicity Parameterized by Proper Interval Deletion Set. LATIN Petr A. Golovach, R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi
2020	A*	`conf`	Hitting topological minors is FPT. STOC Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2020	—	`conf`	On the (Parameterized) Complexity of Almost Stable Marriage. FSTTCS Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	On the (Parameterized) Complexity of Almost Stable Marriage. CoRR Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2020	—	`conf`	Parameter Analysis for Guarding Terrains. SWAT Akanksha Agrawal, Sudeshna Kolay, Meirav Zehavi
2020	A	`conf`	Parameterization Above a Multiplicative Guarantee. ITCS Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2020	—	`ch.`	Parameterized Algorithms. Beyond the Worst-Case Analysis of Algorithms Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2020	Misc	`conf`	Parameterized Analysis of Art Gallery and Terrain Guarding. CSR Akanksha Agrawal, Meirav Zehavi
2020	J	`jnl`	Parameterized Analysis of Assignment Under Multiple Preferences. CoRR Barak Steindl, Meirav Zehavi
2020	A*	`conf`	Parameterized Complexity and Approximability of Directed Odd Cycle Transversal. SODA Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2020	—	`conf`	Parameterized Study of Steiner Tree on Unit Disk Graphs. SWAT Sujoy Bhore, Paz Carmi, Sudeshna Kolay, Meirav Zehavi
2020	J	`jnl`	Parameterized Study of Steiner Tree on Unit Disk Graphs. CoRR Sujoy Bhore, Paz Carmi, Sudeshna Kolay, Meirav Zehavi
2020	J	`jnl`	Participatory Budgeting with Project Groups. CoRR Pallavi Jain, Krzysztof Sornat, Nimrod Talmon, Meirav Zehavi
2020	J	`jnl`	Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems. ACM Trans. Algorithms Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	Popular Matching in Roommates Setting is NP-hard. Bull. EATCS Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	Quadratic Vertex Kernel for Rainbow Matching. Algorithmica Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	Revisiting the parameterized complexity of Maximum-Duo Preservation String Mapping. Theor. Comput. Sci. Christian Komusiewicz, Mateus de Oliveira Oliveira, Meirav Zehavi
2020	J	`jnl`	Special Issue "New Frontiers in Parameterized Complexity and Algorithms": Foreward by the Guest Editors. Algorithms Neeldhara Misra, Frances A. Rosamond, Meirav Zehavi
2020	A*	`conf`	The Parameterized Complexity of Guarding Almost Convex Polygons. SoCG Akanksha Agrawal, Kristine V. K. Knudsen, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	The Parameterized Complexity of Guarding Almost Convex Polygons. CoRR Akanksha Agrawal, Kristine V. K. Knudsen, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	The Parameterized Complexity of Motion Planning for Snake-Like Robots. J. Artif. Intell. Res. Siddharth Gupta, Guy Sa'ar, Meirav Zehavi
2019	J	`jnl`	A Brief Note on Single Source Fault Tolerant Reachability. CoRR Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2019	C	`conf`	A New Paradigm for Identifying Reconciliation-Scenario Altering Mutations Conferring Environmental Adaptation. WABI Roni Zoller, Meirav Zehavi, Michal Ziv-Ukelson
2019	J	`jnl`	A New Paradigm for Identifying Reconciliation-Scenario Altering Mutations Conferring Environmental Adaptation. CoRR Roni Zoller, Meirav Zehavi, Michal Ziv-Ukelson
2019	B	`conf`	A Sub-Exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs. MFCS Jayakrishnan Madathil, Roohani Sharma, Meirav Zehavi
2019	A*	`conf`	Approximate Counting of k-Paths: Deterministic and in Polynomial Space. ICALP Andreas Björklund, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Balanced Judicious Bipartition is Fixed-Parameter Tractable. SIAM J. Discret. Math. Daniel Lokshtanov, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2019	B	`conf`	Balanced Stable Marriage: How Close Is Close Enough? WADS Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring. ACM Trans. Algorithms Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2019	A*	`conf`	Connecting the Dots (with Minimum Crossings). SoCG Akanksha Agrawal, Grzegorz Guspiel, Jayakrishnan Madathil, Saket Saurabh, Meirav Zehavi
2019	A*	`conf`	Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity. SODA Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	A*	`conf`	Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals. ICALP Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals. CoRR Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2019	A*	`conf`	Decomposition of Map Graphs with Applications. ICALP Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Decomposition of Map Graphs with Applications. CoRR Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. ACM Trans. Algorithms Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. Discret. Comput. Geom. Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	A	`conf`	Gehrlein Stability in Committee Selection: Parameterized Hardness and Algorithms. AAMAS Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2019	A	`conf`	Going Far From Degeneracy. ESA Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Going Far From Degeneracy. CoRR Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Improved Parameterized Algorithms for Network Query Problems. Algorithmica Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi
2019	A*	`conf`	Interval Vertex Deletion Admits a Polynomial Kernel. SODA Akanksha Agrawal, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041). Dagstuhl Reports Fedor V. Fomin, Dániel Marx, Saket Saurabh, Meirav Zehavi
2019	A*	`conf`	On Succinct Encodings for the Tournament Fixing Problem. IJCAI Sushmita Gupta, Saket Saurabh, Ramanujan Sridharan, Meirav Zehavi
2019	A*	`conf`	On r-Simple k-Path and Related Problems Parameterized by k/r. SODA Gregory Z. Gutin, Magnus Wahlström, Meirav Zehavi
2019	B	`conf`	Packing Arc-Disjoint Cycles in Tournaments. MFCS Stéphane Bessy, Marin Bougeret, R. Krithika, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut, Meirav Zehavi
2019	J	`jnl`	Packing Cycles Faster Than Erdos-Posa. SIAM J. Discret. Math. Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Parameterized Algorithms and Kernels for Rainbow Matching. Algorithmica Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Parameterized Algorithms for List K-Cycle. Algorithmica Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	B	`conf`	Parameterized Computational Geometry via Decomposition Theorems. WALCOM Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	A*	`conf`	Popular Matching in Roommates Setting is NP-hard. SODA Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Rank Vertex Cover as a Natural Problem for Algebraic Compression. SIAM J. Discret. Math. Syed Mohammad Meesum, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Reducing Topological Minor Containment to the Unique Linkage Theorem. CoRR Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Split Contraction: The Untold Story. ACM Trans. Comput. Theory Akanksha Agrawal, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Stability in barter exchange markets. Auton. Agents Multi Agent Syst. Sushmita Gupta, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. ACM Trans. Algorithms Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi
2019	J	`jnl`	The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue. Algorithmica R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi
2019	A*	`conf`	The Parameterized Complexity of Motion Planning for Snake-Like Robots. IJCAI Siddharth Gupta, Guy Sa'ar, Meirav Zehavi
2019	J	`jnl`	The Parameterized Complexity of Motion Planning for Snake-Like Robots. CoRR Siddharth Gupta, Guy Sa'ar, Meirav Zehavi
2019	J	`jnl`	The parameterized complexity landscape of finding 2-partitions of digraphs. Theor. Comput. Sci. Jørgen Bang-Jensen, Kristine Vitting Klinkby, Saket Saurabh, Meirav Zehavi
2019	B	`conf`	Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS. WADS Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2018	J	`jnl`	$$(k, n-k)$$ ( k , n - k ) -Max-Cut: An $$\mathcal{O}^*(2^p)$$ O ∗ ( 2 p ) -Time Algorithm and a Polynomial Kernel. Algorithmica Saket Saurabh, Meirav Zehavi
2018	A*	`conf`	Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS. ICALP Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2018	A*	`conf`	Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth. SODA Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2018	A*	`conf`	Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. SODA Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2018	J	`jnl`	Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials. J. Comput. Syst. Sci. Gregory Z. Gutin, Felix Reidl, Magnus Wahlström, Meirav Zehavi
2018	A	`conf`	Erdös-Pósa Property of Obstructions to Interval Graphs. STACS Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2018	J	`jnl`	Exact Algorithms for Terrain Guarding. ACM Trans. Algorithms Pradeesha Ashok, Fedor V. Fomin, Sudeshna Kolay, Saket Saurabh, Meirav Zehavi
2018	J	`jnl`	Kernels for deletion to classes of acyclic digraphs. J. Comput. Syst. Sci. Akanksha Agrawal, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2018	J	`jnl`	Long directed ( Inf. Process. Lett. Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2018	J	`jnl`	Matrix Rigidity from the Viewpoint of Parameterized Complexity. SIAM J. Discret. Math. Fedor V. Fomin, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh, Meirav Zehavi
2018	Misc	`conf`	Max-Cut Above Spanning Tree is Fixed-Parameter Tractable. CSR Jayakrishnan Madathil, Saket Saurabh, Meirav Zehavi
2018	J	`jnl`	On r-Simple k-Path and Related Problems Parameterized by k/r. CoRR Gregory Z. Gutin, Magnus Wahlström, Meirav Zehavi
2018	J	`jnl`	Parameterised Algorithms for Deletion to Classes of DAGs. Theory Comput. Syst. Akanksha Agrawal, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2018	A*	`conf`	Parameterized Algorithms for Survivable Network Design with Uniform Demands. SODA Jørgen Bang-Jensen, Manu Basavaraju, Kristine Vitting Klinkby, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2018	B	`conf`	Parameterized Complexity of Multi-Node Hubs. IPEC Saket Saurabh, Meirav Zehavi
2018	J	`jnl`	Parameterized algorithms for stable matching with ties and incomplete lists. Theor. Comput. Sci. Deeksha Adil, Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2018	—	`conf`	Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems. APPROX-RANDOM Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2018	J	`jnl`	Popular Matching in Roommates Setting is NP-hard. CoRR Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2018	A	`conf`	Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity. ITCS Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2018	A*	`conf`	Reducing CMSO Model Checking to Highly Connected Graphs. ICALP Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2018	J	`jnl`	Reducing CMSO Model Checking to Highly Connected Graphs. CoRR Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2018	A	`conf`	Stability in Barter Exchange Markets. AAMAS Sushmita Gupta, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2018	—	`conf`	Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. FSTTCS Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2018	A*	`conf`	Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. SODA Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi
2018	B	`conf`	The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue. LATIN R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi
2018	J	`jnl`	The Parameterized Complexity of Packing Arc-Disjoint Cycles in Tournaments. CoRR R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi
2018	J	`jnl`	The k-leaf spanning tree problem admits a klam value of 39. Eur. J. Comb. Meirav Zehavi
2018	A*	`conf`	When Rigging a Tournament, Let Greediness Blind You. IJCAI Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2018	A*	`conf`	Winning a Tournament by Any Means Necessary. IJCAI Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	A Linear-Time Algorithm for the Copy Number Transformation Problem. J. Comput. Biol. Ron Zeira, Meirav Zehavi, Ron Shamir
2017	J	`jnl`	A multivariate framework for weighted FPT algorithms. J. Comput. Syst. Sci. Hadas Shachnai, Meirav Zehavi
2017	J	`jnl`	Algorithms for k-Internal Out-Branching and k-Tree in Bounded Degree Graphs. Algorithmica Meirav Zehavi
2017	—	`conf`	Balanced Judicious Bipartition is Fixed-Parameter Tractable. FSTTCS Daniel Lokshtanov, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2017	J	`jnl`	Balanced Judicious Partition is Fixed-Parameter Tractable. CoRR Daniel Lokshtanov, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2017	J	`jnl`	Balanced Stable Marriage: How Close is Close Enough? CoRR Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	Complexity and algorithms for copy-number evolution problems. Algorithms Mol. Biol. Mohammed El-Kebir, Benjamin J. Raphael, Ron Shamir, Roded Sharan, Simone Zaccaria, Meirav Zehavi, Ron Zeira
2017	J	`jnl`	Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. CoRR Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2017	A*	`conf`	Exact Algorithms for Terrain Guarding. SoCG Pradeesha Ashok, Fedor V. Fomin, Sudeshna Kolay, Saket Saurabh, Meirav Zehavi
2017	A*	`conf`	Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. SODA Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. CoRR Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2017	A*	`conf`	Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. ICALP Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. CoRR Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2017	B	`conf`	Group Activity Selection on Graphs: Parameterized Analysis. SAGT Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	Kirchoff Matrices and Pfaffians to Design Deterministic Polynomial-Space Parameterized Algorithms. CoRR Gregory Z. Gutin, Felix Reidl, Magnus Wahlström, Meirav Zehavi
2017	A	`conf`	Matrix Rigidity from the Viewpoint of Parameterized Complexity. STACS Fedor V. Fomin, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	Maximum Minimal Vertex Cover Parameterized by Vertex Cover. SIAM J. Discret. Math. Meirav Zehavi
2017	J	`jnl`	On Treewidth and Stable Marriage. CoRR Sushmita Gupta, Saket Saurabh, Meirav Zehavi
2017	A*	`conf`	Packing Cycles Faster Than Erdos-Posa. ICALP Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	Packing Cycles Faster Than Erdős-Pósa. CoRR Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh, Meirav Zehavi
2017	B	`conf`	Parameterized Algorithms and Kernels for Rainbow Matching. MFCS Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	Parameterized Algorithms for Graph Partitioning Problems. Theory Comput. Syst. Hadas Shachnai, Meirav Zehavi
2017	J	`jnl`	Parameterized Complexity and Approximability of Directed Odd Cycle Transversal. CoRR Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	Polylogarithmic Approximation Algorithms for Weighted-$\mathcal{F}$-Deletion Problems. CoRR Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	Rank Vertex Cover as a Natural Problem for Algebraic Compression. CoRR Syed Mohammad Meesum, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2017	B	`conf`	Revisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping. CPM Christian Komusiewicz, Mateus de Oliveira Oliveira, Meirav Zehavi
2017	A	`conf`	Split Contraction: The Untold Story. STACS Akanksha Agrawal, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	Spotting Trees with Few Leaves. SIAM J. Discret. Math. Andreas Björklund, Vikram Kamat, Lukasz Kowalik, Meirav Zehavi
2016	B	`conf`	(k, n-k)-Max-Cut: An 𝒪 LATIN Saket Saurabh, Meirav Zehavi
2016	B	`conf`	A Linear-Time Algorithm for the Copy Number Transformation Problem. CPM Ron Shamir, Meirav Zehavi, Ron Zeira
2016	J	`jnl`	A randomized algorithm for long directed cycle. Inf. Process. Lett. Meirav Zehavi
2016	C	`conf`	Copy-Number Evolution Problems: Complexity and Algorithms. WABI Mohammed El-Kebir, Benjamin J. Raphael, Ron Shamir, Roded Sharan, Simone Zaccaria, Meirav Zehavi, Ron Zeira
2016	J	`jnl`	Deterministic parameterized algorithms for the Graph Motif problem. Discret. Appl. Math. Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi
2016	B	`conf`	Kernels for Deletion to Classes of Acyclic Digraphs. ISAAC Akanksha Agrawal, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2016	—	`conf`	Parameterized Algorithms for List K-Cycle. FSTTCS Fahad Panolan, Meirav Zehavi
2016	J	`jnl`	Parameterized algorithms for the Module Motif problem. Inf. Comput. Meirav Zehavi
2016	J	`jnl`	Parameterized approximation algorithms for packing problems. Theor. Comput. Sci. Meirav Zehavi
2016	J	`jnl`	Representative families: A unified tradeoff-based approach. J. Comput. Syst. Sci. Hadas Shachnai, Meirav Zehavi
2016	B	`conf`	Simultaneous Feedback Edge Set: A Parameterized Perspective. ISAAC Akanksha Agrawal, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2016	J	`jnl`	Simultaneous Feedback Edge Set: A Parameterized Perspective. CoRR Akanksha Agrawal, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2016	J	`jnl`	The k-distinct language: Parameterized automata constructions. Theor. Comput. Sci. Ran Ben-Basat, Ariel Gabizon, Meirav Zehavi
2015	A	`conf`	A Multivariate Approach for Weighted FPT Algorithms. ESA Hadas Shachnai, Meirav Zehavi
2015	J	`jnl`	A Randomized Algorithm for Long Directed Cycle. CoRR Meirav Zehavi
2015	J	`jnl`	Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets. SIAM J. Discret. Math. Prachi Goyal, Neeldhara Misra, Fahad Panolan, Meirav Zehavi
2015	J	`jnl`	Maximization Problems Parameterized Using Their Minimization Versions: The Case of Vertex Cover. CoRR Meirav Zehavi
2015	—	`conf`	Maximum Minimal Vertex Cover Parameterized by Vertex Cover. MFCS (2) Meirav Zehavi
2015	A	`conf`	Mixing Color Coding-Related Techniques. ESA Meirav Zehavi
2015	J	`jnl`	Parameterized Approximation Algorithms for Packing Problems. CoRR Meirav Zehavi
2015	J	`jnl`	Partial Information Network Queries. J. Discrete Algorithms Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi
2015	—	`conf`	Spotting Trees with Few Leaves. ICALP (1) Andreas Björklund, Vikram Kamat, Lukasz Kowalik, Meirav Zehavi
2015	J	`jnl`	Spotting Trees with Few Leaves. CoRR Andreas Björklund, Vikram Kamat, Lukasz Kowalik, Meirav Zehavi
2015	C	`conf`	The k-Leaf Spanning Tree Problem Admits a Klam Value of 39. IWOCA Meirav Zehavi
2015	J	`jnl`	The k-Leaf Spanning Tree Problem Admits a Klam Value of 39. CoRR Meirav Zehavi
2014	J	`jnl`	Algorithms for topology-free and alignment network queries. J. Discrete Algorithms Ron Y. Pinter, Meirav Zehavi
2014	J	`jnl`	An Improved k-Exclusion Algorithm. J. Comput. Meirav Zehavi
2014	—	`conf`	Deterministic Parameterized Algorithms for the Graph Motif Problem. MFCS (2) Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi
2014	J	`jnl`	FPT Algorithms for Weighted Graphs Can be (Almost) as Efficient as for Unweighted. CoRR Hadas Shachnai, Meirav Zehavi
2014	J	`jnl`	Faster Computation of Representative Families for Uniform Matroids with Applications. CoRR Hadas Shachnai, Meirav Zehavi
2014	B	`conf`	Improved Parameterized Algorithms for Network Query Problems. IPEC Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi
2014	B	`conf`	Parameterized Algorithms for Graph Partitioning Problems. WG Hadas Shachnai, Meirav Zehavi
2014	J	`jnl`	Parameterized Algorithms for Graph Partitioning Problems. CoRR Hadas Shachnai, Meirav Zehavi
2014	A	`conf`	Representative Families: A Unified Tradeoff-Based Approach. ESA Hadas Shachnai, Meirav Zehavi
2014	J	`jnl`	Solving Parameterized Problems by Mixing Color Coding-Related Techniques. CoRR Meirav Zehavi
2014	B	`conf`	The k -Distinct Language: Parameterized Automata Constructions. IPEC Ran Ben-Basat, Ariel Gabizon, Meirav Zehavi
2013	B	`conf`	Algorithms for k-Internal Out-Branching. IPEC Meirav Zehavi
2013	J	`jnl`	Deterministic Parameterized Algorithms for Matching and Packing Problems. CoRR Meirav Zehavi
2013	B	`conf`	Parameterized Algorithms for Module Motif. MFCS Meirav Zehavi
2013	C	`conf`	Partial Information Network Queries. IWOCA Ron Y. Pinter, Meirav Zehavi