Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
The Windy Postman Problem consists of finding a minimum cost traversal of all the edges of an undirected graph with two costs associated with each edge, representing the costs of ...
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, whi...
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
Noga Alon, Konstantin Makarychev, Yury Makarychev,...
The ALLDIFFERENT constraint was one of the first global constraints [17] and it enforces the conjunction of one binary constraint, the not-equal constraint, for every pair of varia...
Christopher Jefferson, Karen E. Petrie, Meinolf Se...