Author of the publication

Kernelization of Counting Problems.

, , , and . ITCS, volume 287 of LIPIcs, page 77:1-77:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)

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

Rank Vertex Cover as a Natural Problem for Algebraic Compression., , , and . CoRR, (2017)A Brief Note on Single Source Fault Tolerant Reachability., , , and . CoRR, (2019)Parameterized Algorithms for Graph Partitioning Problems., and . WG, volume 8747 of Lecture Notes in Computer Science, page 384-395. Springer, (2014)Algorithms for k-Internal Out-Branching.. IPEC, volume 8246 of Lecture Notes in Computer Science, page 361-373. Springer, (2013)Copy-Number Evolution Problems: Complexity and Algorithms., , , , , , and . WABI, volume 9838 of Lecture Notes in Computer Science, page 137-149. Springer, (2016)Improved Parameterized Algorithms for Network Query Problems., , and . IPEC, volume 8894 of Lecture Notes in Computer Science, page 294-306. Springer, (2014)Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity., , , , and . ITCS, volume 94 of LIPIcs, page 32:1-32:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Winning a Tournament by Any Means Necessary., , , and . IJCAI, page 282-288. ijcai.org, (2018)Partial Information Network Queries., and . IWOCA, volume 8288 of Lecture Notes in Computer Science, page 362-375. Springer, (2013)Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion., , , , and . ACM Trans. Algorithms, 15 (1): 11:1-11:28 (2019)