Sciweavers

CORR
2012
Springer
174views Education» more  CORR 2012»
12 years 8 months ago
Partial Searchlight Scheduling is Strongly PSPACE-complete
The problem of searching a polygonal region for an unpredictably moving intruder by a set of stationary guards, each carrying an orientable laser, is known as the Searchlight Sche...
Giovanni Viglietta
STACS
2004
Springer
14 years 5 months ago
On Minimum Circular Arrangement
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
Murali K. Ganapathy, Sachin Lodha
STACS
2009
Springer
14 years 7 months ago
Enumerating Homomorphisms
The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision ve...
Andrei A. Bulatov, Víctor Dalmau, Martin Gr...