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 …

When dealing with special graph classes and algorithmic problems on them, a main source
is the classical book of Golumbic, Algorithmic Graph Theory and Perfect Graphs [454]. The …

The study of algorithmic graph theory and structured families of graphs is an important
branch of discrete mathematics. It finds numerous applications, from data transmission …

Physical map** 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 …

In an edge modification problem one has to change the edge set of a given graph as little as
possible so as to satisfy a certain property. We prove the NP-hardness of a variety of edge …

Allen's interval algebra is one of the best established formalisms for temporal reasoning.
This article provides the final step in the classification of complexity for satisfiability problems …

The hereditary information that all living organisms pass on to their offspring is encoded in
DNA molecules packaged in structures called chromosomes within their cells. The genes …

Five strains isolated from root nodules of Lablab purpureus and Arachis hypogaea grown in
the Anhui and Sichuan provinces of China were classified as members of the genus …

The generalized hypertree width GHW (H) of a hypergraph H is a measure of its cyclicity.
Classes of conjunctive queries or constraint satisfaction problems whose associated …

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 …