The problem of computing induced subgraphs that satisfy some specified restrictions arises
in various applications of graph algorithms and has been well studied. In this paper, we …

This work is devoted to the study of the Balanced Connected Subgraph Problem (BCS) from
a complexity, inapproximability and approximation point of view. The input is a graph G=(V …

Finding connected subgraphs of maximum weight subject to additional constraints on the
subgraphs is a common (sub) problem in many applications. In this paper, we study the …

An edge-colored graph is said to be balanced if it has an equal number of edges of each
color. Given a graph G whose edges are colored using two colors and a positive integer k …

Abstract The Balanced Connected Subgraph problem (BCS) was introduced by Bhore et al.
In the BCS problem we are given a vertex-colored graph G=(V, E) where each vertex is …

For a set of geometric objects, the associative geometric intersection graph is the graph with
a vertex for each object and an edge between two vertices if and only if the corresponding …