In parameterized complexity, it is well-known that a parameterized probl...
In this paper, we study two popular variants of Graph Coloring – Dominat...
Let Π be a hereditary graph class. The problem of deletion to Π,
takes a...
We introduce a variant of the graph coloring problem, which we denote as...
In the Max r-SAT problem, the input is a CNF formula with n variables
wh...
Graph-modification problems, where we add/delete a small number of
verti...
Given a graph G with source and destination vertices s,t∈ V(G)
respectiv...
We develop new approximation algorithms for classical graph and set prob...
A graph is k-clique-extendible if there is an ordering of the vertices s...
It is known that problems like Vertex Cover, Feedback Vertex Set and Odd...
We consider the parameterized complexity of the problem of tracking shor...
Given a graph G, terminal vertices s and t, and an integer k, the
Tracki...
A graph is said to be a Konig graph if the size of its maximum matching ...
Read-only memory model is a classical model of computation to study
time...
The CONNECTED VERTEX COVER problem asks for a vertex cover in a graph th...
Modern conflict-driven clause-learning (CDCL) Boolean SAT solvers provid...