6 citations · 14 across the 31 of their papers we have counts for
3 papers · 1 filter
On the Polynomial Kernelizations of Finding a Shortest Path with Positive Disjunctive Constraints
Susobhan Bandopadhyay, Suman Banerjee, Diptapriyo Majumdar +1
We study the SHORTEST PATH problem with positive disjunctive constraints from the perspective of parameterized complexity. For positive disjunctive constraints, there are certain p…
Meta-theorems for Parameterized Streaming Algorithms
Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan +3
The streaming model was introduced to parameterized complexity independently by Fafianie and Kratsch [MFCS14] and by Chitnis, Cormode, Hajiaghayi and Monemizadeh [SODA15]. Subseque…
Efficient Approximation for Subgraph-Hitting Problems in Sparse Graphs and Geometric Intersection Graphs
Zdeněk Dvořák, Daniel Lokshtanov, Fahad Panolan +3
We investigate a fundamental vertex-deletion problem called (Induced) Subgraph Hitting: given a graph and a set of forbidden graphs, the goal is to compute a mini…