For any particular class of graphs, algorithms for computational problems restricted to the
class often rely on structural properties that depend on the specific problem at hand. This …

Given an undirected graph G=(V, E) with| V|= n and a vertex coloring, a vertex v is happy if v
and all its neighbors have the same color. An edge is happy if its end vertices have the same …

The Cut & Count technique and the rank-based approach have lead to single-exponential
FPT algorithms parameterized by treewidth, that is, running in time $2^{O (tw)} n^{O (1)} …

We design the first subexponential-time (parameterized) algorithms for several cut and cycle-
hitting problems on H-minor free graphs. In particular, we obtain the following results (where …

We study temporal analogues of the Unrestricted Vertex Separator problem from the static
world. An $(s, z) $-temporal separator is a set of vertices whose removal disconnects vertex …

We study the Multicut on Trees and the Generalized Multiway Cut on Trees problems. For
the Multicut on Trees problem, we present a parameterized algorithm that runs in time O⁎(ρ …

We study the multicut on trees and the generalized multiway cut on trees problems. For the
multicut on trees problem, we present a parameterized algorithm that runs in time O^*(ρ^ k) …

A graph that changes with time is called a temporal graph. In this work, we focus on temporal
graphs whose vertex sets are fixed while edge sets change in discrete time steps. We use n …

Graph theory has played an important role in solving many real world computational
problems. Mathematicians and computer scientists formulate many of these computational …