Author of the publication

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

Reducing CMSO Model Checking to Highly Connected Graphs., , , and . ICALP, volume 107 of LIPIcs, page 135:1-135:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Simultaneous Feedback Edge Set: A Parameterized Perspective., , , and . Algorithmica, 83 (2): 753-774 (2021)The k-Leaf Spanning Tree Problem Admits a Klam Value of 39.. IWOCA, volume 9538 of Lecture Notes in Computer Science, page 346-357. Springer, (2015)Simultaneous Feedback Edge Set: A Parameterized Perspective., , , and . ISAAC, volume 64 of LIPIcs, page 5:1-5:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)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)A Framework for Approximation Schemes on Disk Graphs., , , , and . SODA, page 2228-2241. SIAM, (2023)Parameterized Algorithms for Survivable Network Design with Uniform Demands., , , , , , and . SODA, page 2838-2850. SIAM, (2018)FPT-approximation for FPT Problems., , , , and . SODA, page 199-218. SIAM, (2021)Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting (Extended Version)., , and . SODA, page 179-198. SIAM, (2021)Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract)., , , , and . SODA, page 2005-2031. SIAM, (2022)