We study problems of reconfigurability of independent sets in graphs. We consider three different models (token jumping, token sliding, and token addition and removal) and analyze relationshipsâ€¦ (More)

Whether the clique-width of graphs in a certain class is bounded or not is an important question from an algorithmic point of view, since many problems that are NP-hard in general admitâ€¦ (More)

The class of fork-free graphs is an extension of claw-free graphs and their subclass of line graphs. The first polynomial-time solution to the maximum weight independent set problem in the class ofâ€¦ (More)

A graph H is a square root of a graph G if two vertices are adjacent in G if and only if they are at distance one or two in H . Computing a square root of a given graph is NP-hard, even when theâ€¦ (More)

We study the following problem on recon guring shortest paths in graphs: Given two shortest st paths, what is the minimum number of steps required to transform one into the other, where eachâ€¦ (More)

We consider two graph optimization problems called vector domination and total vector domination. In vector domination one seeks a small subset S of vertices of a graph such that any vertex outside Sâ€¦ (More)

We introduce the graph parameter readability and study it as a function of the number of vertices in a graph. Given a digraph D, an injective overlap labeling assigns a unique string to each vertexâ€¦ (More)