In this paper, we study two generalizations of Vertex Cover and Edge Cov...
In this paper, we study two popular variants of Graph Coloring – Dominat...
Given an undirected graph G and q integers n_1,n_2,n_3, ⋯, n_q,
balanced...
We introduce a variant of the graph coloring problem, which we denote as...
Let P be a set of points in ℝ^d, B a bicoloring of P and
a family of ge...
We consider the parameterized complexity of the problem of tracking shor...
We study four classical graph problems – Hamiltonian path, Traveling
sal...
Given n pairs of points, S = {{p_1, q_1}, {p_2, q_2},
..., {p_n, q_n}}, ...