Graph theory is afundamental branch of mathematicsthat studiesnetworksconsisting of
nodes (vertices) and their connections (edges). Extensive research has been conducted on …

The maximum clique problem is a classical problem in combinatorial optimization which
finds important applications in different domains. In this paper we try to give a survey of …

Algorithms for VLSI Physical Design Automation, Second Edition is a core reference text for
graduate students and CAD professionals. Based on the very successful First Edition, it …

In this paper we present a survey of results concerning algorithms, complexity, and
applications of the maximum clique problem. We discuss enumerative and exact algorithms …

This is the sixteenth edition of a quarterly column that covers new developments in the
theory of NP-completeness. The presentation is modeled on that used by MR Garey and …

Interval graphs represent vertices as intervals on the real line, with edges denoting
overlapping intervals, while proper interval graphs prevent one interval from being fully …

Trains' movements on a railway network are regulated by official timetables. Deviations and
delays occur quite often in practice, demanding fast rescheduling and rerouting decisions in …

Traffic grooming refers to techniques used to combine low-speed traffic streams onto high-
speed wavelengths in order to minimize the networkwide cost in terms of line terminating …

Recent years have witnessed an increase in research activity for the detection of structural
variants (SVs) and their association to human disease. The advent of next-generation …

Comparability graphs are undirected graphs that represent the comparability relation of
partial orders. They constitute an important interface between graphs and partial orders both …