In this survey we overview the definitions and methods for graph clustering, that is, finding
sets of “related” vertices in graphs. We review the many definitions for what is a cluster in a …

Due to significant industrial demands toward software systems with increasing complexity
and challenging quality requirements, software architecture design has become an …

We give a number of improved inapproximability results, including the best up to date
explicit approximation thresholds for bounded occurence satisfiability problems like MAX …

We present NC-approximation schemes for a number of graph problems when restricted to
geometric graphs including unit disk graphs and graphs drawn in a civilized manner. Our …

The aim of Cooperative Games on Combinatorial Structures is to analyze conflict situations
in which two or more players can make coalitions and obtain prizes and penalties. This …

We show that a number of graph-theoretic counting problems remain \calNP-hard, indeed
#\calP-complete, in very restricted classes of graphs. In particular, we prove that the …

The domatic number problem is that of partitioning the vertices of a graph into the maximum
number of disjoint dominating sets. Let n denote the number of vertices in a graph, 6 the …

We discuss what we consider to be the 10 most vexing open questions in the area of
polynomial time approximation algorithms for NP‐hard deterministic machine scheduling …

The computational complexity of combinatorial multiple objective programming problems is
investigated. NP‐completeness and# P‐completeness results are presented. Using two …

The problem instance of Vertex Cover consists of an undirected graph G=(V, E) and a
positive integer k, the question is whether there exists a subset C⊂-V of vertices such that …