Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitr...
Abstract. This report presents a basic scheme for deriving systematically a filtering algorithm from the graph properties based representation of global constraints. This scheme i...
Nicolas Beldiceanu, Thierry Petit, Guillaume Rocha...
We establish new lower and upper bounds for the real number graph labelling problem. As an application, we completely determine the optimum spans of L(p, q)-labellings of the infin...
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....