6 citations · 14 across the 31 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2024
Parameterized Saga of First-Fit and Last-Fit Coloring
Akanksha Agrawal, Daniel Lokshtanov, Fahad Panolan +2
The classic greedy coloring (first-fit) algorithm considers the vertices of an input graph in a given order and assigns the first available color to each vertex in . In…
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…
cs.DM2018
Complexity of the Steiner Network Problem with Respect to the Number of Terminals
Eduard Eiben, Dušan Knop, Fahad Panolan +1
In the Directed Steiner Network problem we are given an arc-weighted digraph , a set of terminals , and an (unweighted) directed request graph with $V(R)=T…