1 citations · 2 across the 9 of their papers we have counts for
4 papers · 1 filter
Parameterized and Exact Algorithms for Class Domination Coloring
R. Krithika, Ashutosh Rai, Saket Saurabh +1
A class domination coloring (also called cd-Coloring or dominated coloring) of a graph is a proper coloring in which every color class is contained in the neighbourhood of some ver…
Sparsification Lower Bound for Linear Spanners in Directed Graphs
Prafullkumar Tale
For , , and a graph , a spanning subgraph of is said to be an -spanner if $\dist(u, v, H) \le α\cdot \dist(u, v, G) + β$ holds for any pair of ve…
On the Parameterized Complexity Of Grid Contraction
Saket Saurabh, Uéverton dos Santos Souza, Prafullkumar Tale
For a family of graphs , the -\textsc{Contraction} problem takes as an input a graph and an integer , and the goal is to decide if there exists $F…
Parameterized Complexity of Maximum Edge Colorable Subgraph
Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu +2
A graph is {\em -edge colorable} if there is a coloring , such that for distinct , we have . The {\sc…