The directed L-distance minimal dominating set (MDS) problem has wide practical
applications in the fields of computer science and communication networks. Here, we study …

We consider the problem of computing edge covers that are tolerant to a certain number of
edge deletions. We call the problem of finding a minimum such cover r-Tolerant Edge Cover …

In this article, we study a variant of the minimum dominating set problem known as the
minimum liar's dominating set (MLDS) problem. We prove that the MLDS problem is NP …

The study of combinatorial problems is an important task as they are abstraction of many
problems that we face in our lifefor a very long time. In this thesis we study variants of …

We study two new versions of independent and dominating set problems on vertex-colored
interval graphs, namely f-Balanced Independent Set (f-BIS) and f-Balanced Dominating Set …

Label placement is a challenging task in map production, both manual and automatic, and is
crucial for the overall map quality. While practical label placement algorithms are typically …

Abstract Dominating Set and Independent Set are well-known NP-complete problems. Each
has been extensively studied in the classical RAM model, but studying them in the data …

The L-distance (especially the 2-distance) minimal dominating set (MDS) problem is widely
considered in various dominating set problems. Recently, we studied the regular dominating …

Given a graph G=(V, E), the dominating set problem asks for a minimum subset of vertices
DC V such that every vertex u EV\D is adjacent to at least one vertex v Є D. That is, the set D …