( en | de | ru )

 

Disambiguation of "Zehavi, Meirav"

Author of the publication

copydeleteadd this publication to your clipboard
Kernels for Deletion to Classes of Acyclic Digraphs.

, , , and . ISAAC, volume 64 of LIPIcs, page 6:1-6:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

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

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)Max-Cut Above Spanning Tree is Fixed-Parameter Tractable., , and . CSR, volume 10846 of Lecture Notes in Computer Science, page 244-256. Springer, (2018)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)Matrix Rigidity from the Viewpoint of Parameterized Complexity., , , , and . STACS, volume 66 of LIPIcs, page 32:1-32:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Quadratic Vertex Kernel for Rainbow Matching., , , and . Algorithmica, 82 (4): 881-897 (2020)A Linear-Time Algorithm for the Copy Number Transformation Problem., , and . J. Comput. Biol., 24 (12): 1179-1194 (2017)A Randomized Algorithm for Long Directed Cycle.. CoRR, (2015)Balanced Judicious Partition is Fixed-Parameter Tractable., , , and . CoRR, (2017)Popular Matching in Roommates Setting is NP-hard., , , and . CoRR, (2018)Balanced Stable Marriage: How Close is Close Enough?, , , and . CoRR, (2017)