( en | de | ru )

 

Disambiguation of "Zehavi, Meirav"

Author of the publication

copydeleteadd this publication to your clipboard
Interval Vertex Deletion Admits a Polynomial Kernel.

, , , and . SODA, page 1711-1730. SIAM, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Zehavi, Meirav
add a person with the name Zehavi, Meirav
 

Other publications of authors with the same name

r-Simple k-Path and Related Problems Parameterized by k/r., , and . ACM Trans. Algorithms, 17 (1): 10:1-10:64 (2021)Verification of multi-layered assignment problems., and . Auton. Agents Multi Agent Syst., 36 (1): 15 (2022)Maximum Minimal Vertex Cover Parameterized by Vertex Cover.. SIAM J. Discret. Math., 31 (4): 2440-2456 (2017)Balanced Judicious Bipartition is Fixed-Parameter Tractable., , , and . SIAM J. Discret. Math., 33 (4): 1878-1911 (2019)Max-Cut Above Spanning Tree is Fixed-Parameter Tractable., , and . CSR, volume 10846 of Lecture Notes in Computer Science, page 244-256. Springer, (2018)When Rigging a Tournament, Let Greediness Blind You., , , and . IJCAI, page 275-281. ijcai.org, (2018)Parameterized algorithms for stable matching with ties and incomplete lists., , , , and . Theor. Comput. Sci., (2018)On Succinct Encodings for the Tournament Fixing Problem., , , and . IJCAI, page 322-328. ijcai.org, (2019)Revisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping., , and . CPM, volume 78 of LIPIcs, page 11:1-11:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Parameterized Complexity of Multi-Node Hubs., and . IPEC, volume 115 of LIPIcs, page 8:1-8:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)