Verification of reachability properties for probabilistic systems is usually based on variants of Markov processes. Current methods assume an exact model of the dynamic behavior a...
We consider a novel class of art gallery problems inspired by wireless localization. Given a simple polygon P, place and orient guards each of which broadcasts a unique key within ...
Tobias Christ, Michael Hoffmann, Yoshio Okamoto, T...
Given a set F of faulty edges or faulty vertices in the hypercube Qn and a pair of vertices u, v, is there a hamiltonian cycle or a hamiltonian path between u and v in Qn −F? We...
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....