16 citations · 25 across the 21 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2025
Polynomial-Size Enumeration Kernelizations for Long Path Enumeration
Christian Komusiewicz, Diptapriyo Majumdar, Frank Sommer
Enumeration kernelization for parameterized enumeration problems was defined by Creignou et al. [Theory Comput. Syst. 2017] and was later refined by Golovach et al. [J. Comput. Sys…
cs.DM2023
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…