We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only for restricted clas...
: We develop a general model of edge spaces in order to generalize, unify, and simplify previous work on cycle spaces of infinite graphs. We give simple topological criteria to sho...
Intriguing and tight sets of vertices of point-line geometries have recently been studied in the literature. In this paper, we indicate a more general framework for dealing with t...
We consider large scale interconnected systems where some of the interconnections are characterized by uncertain bounded delays. The delays may for instance be due to a communicati...
Requirements from new types of applications call for new database system solutions. Computational science applications performing distributed computations on Grid networks with req...