1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2023
Expansion Lemma -- Variations and Applications to Polynomial-Time Preprocessing
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
In parameterized complexity, it is well-known that a parameterized problem is fixed-parameter tractable if and only if it has a kernel - an instance equivalent to the input instanc…
cs.DS2023★ 1 cited
Long Directed Detours: Reduction to -Disjoint Paths
Ashwin Jacob, Michał Włodarczyk, Meirav Zehavi
We study an "above guarantee" version of the {\sc Longest Path} problem in directed graphs: We are given a graph , two vertices and of , and a non-negative integer $k…