Graph layout problems are a particular class of combinatorial optimization problems whose
goal is to find a linear layout of an input graph in such way that a certain objective cost is …

This paper investigates ultrafilters in the context of connectivity systems, defined as pairs (X,
f) where X is a finite set and f is a symmetric submodular function. Ultrafilters, essential in …

Graph theory, a fundamental branch of mathematics, centers on the study of networks
composed of vertices (nodes) and edges, examining their paths, structures, and properties …

For many fixed-parameter problems that are trivially soluable in polynomial time, such as (k-)
DOMINATING SET, essentially no better algorithm is presently known than the one which …

Intersection graphs provide theory to underlie much of graph theory. They epitomize graph-
theoretic structure and have their own distinctive concepts and emphasis. They subsume …

In this paper we give a programmatic overview of parameterized computational complexity
in the broad context of the problem of coping with computational intractability. We give some …

Physical mapping is a central problem in molecular biology and the human genome project.
The problem is to reconstruct the relative position of fragments of DNA along the genome …

We describe new results in parametrized complexity theory. In particular, we prove a number
of concrete hardness results for W [P], the top level of the hardness hierarchy introduced by …

Many natural computational problems have input consisting of two or more parts, one of
which may be considered a parameter. For example, there are many problems for which the …

We study two related problems motivated by molecular biology.• Given a graph G and a
constant k, does there exist a supergraph G' of G that is a unit interval graph and has clique …