11 citations · 35 across the 50 of their papers we have counts for
5 papers · 1 filter
A Randomized Algorithm for Long Directed Cycle
Meirav Zehavi
Given a directed graph and a parameter , the {\sc Long Directed Cycle (LDC)} problem asks whether contains a simple cycle on at least vertices, while the {\sc -Pa…
Parameterized Approximation Algorithms for Packing Problems
Meirav Zehavi
In the past decade, many parameterized algorithms were developed for packing problems. Our goal is to obtain tradeoffs that improve the running times of these algorithms at the cos…
Maximization Problems Parameterized Using Their Minimization Versions: The Case of Vertex Cover
Meirav Zehavi
The parameterized complexity of problems is often studied with respect to the size of their optimal solutions. However, for a maximization problem, the size of the optimal solution…
Spotting Trees with Few Leaves
Andreas Björklund, Vikram Kamat, Łukasz Kowalik +1
We show two results related to the Hamiltonicity and -Path algorithms in undirected graphs by Björklund [FOCS'10], and Björklund et al., [arXiv'10]. First, we demonstrate that t…
The -Leaf Spanning Tree Problem Admits a Klam Value of 39
Meirav Zehavi
Given an undirected graph and a parameter , the -Leaf Spanning Tree (-LST) problem asks if contains a spanning tree with at least leaves. This problem has been…