Modular decomposition is a technique that applies to (but is not restricted to) graphs. The
notion of a module naturally appears in the proofs of many graph theoretical theorems …

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 …

Although there are many advanced and specialized texts and handbooks on algorithms,
until now there was no book that focused exclusively on the wide variety of data structures …

Abstract Lexicographic Breadth First Search, introduced by Rose, Tarjan and Lueker for the
recognition of chordal graphs is currently the most popular graph algorithmic search …

Social choice becomes easier on restricted preference domains such as single-peaked,
single-crossing, and Euclidean preferences. Many impossibility theorems disappear, the …

In this paper, we describe an evolution of the mobile Evolved Packet Core (EPC) utilizing
Software Defined Networking (SDN) that allows the EPC control plane to be moved into a …

A graph G is a circular-arc graph if it is the intersection graph of a set of arcs on a circle. That
is, there is one arc for each vertex of G, and two vertices are adjacent in G if and only if the …

A graph is an interval graph if it is the intersection graph of intervals on a line. Interval graphs
are known to be the intersection of chordal graphs and asteroidal triple–free graphs, two …

We introduce a logic called distance neighborhood logic with acyclicity and connectivity
constraints (A&C DN for short) which extends existential MSO1 with predicates for querying …

A certifying algorithm for a problem is an algorithm that provides a certificate with each
answer that it produces. The certificate is a piece of evidence that proves that the answer …