Optimization problems frequently appear in any scientific domain. Most of the times, the
corresponding decision problem turns out to be NP-hard, and in these cases genetic …

Given a graph G=(V, E) G=(V,E) and a subset of its vertices V′⊆ VV^′⊆V, the subgraph
induced by V′ V^′ in G is that with vertex set V′ V^′ and edge set E′ E^′ formed by …

We study approximation hardness of the Minimum Dominating Set problem and its variants
in undirected and directed graphs. Using a similar result obtained by Trevisan for Minimum …

We consider questions that arise from the intersection between the areas of approximation
algorithms, subexponential-time algorithms, and fixed-parameter tractable algorithms. The …

A wireless sensor network (WSN) is a simple low-cost approach that can be used in a
distributed environment. A WSN is a group of distributed devices that could be employed to …

We consider questions that arise from the intersection between the areas of polynomial-time
approximation algorithms, subexponential-time algorithms, and fixed-parameter tractable …

A subset of vertices in a graph is called a dissociation set if it induces a subgraph with a
vertex degree of at most 1. The maximum dissociation set problem, ie, the problem of finding …

Given a graph G and an integer k≥ 0, the NP-complete Induced Matching problem asks
whether there exists an edge subset M of size at least k such that M is a matching and no …

We consider instances of the Stable Roommates problem that arise from geometric
representation of participants' preferences: a participant is a point in a metric space, and his …

Graph product is a fundamental tool with rich applications in both graph theory and
theoretical computer science. It is usually studied in the form f (G* H) where G and H are …