We discuss various questions around partitioning a split graph into connected parts. Our main result is a polynomial time algorithm that decides whether a given split graph is full...
Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginge...
We present an efficient algorithm to find an optimal integer solution of a given system of 2-variable equalities and 1-variable inequalities with respect to a given linear objectiv...
—Disk drives are a common performance bottleneck in modern storage systems. To alleviate this, disk manufacturers employ a variety of I/O request scheduling strategies which aim ...
Abigail S. Lebrecht, Nicholas J. Dingle, William J...
This paper discusses and evaluates two novel multisensory user authentication mechanisms aimed at preventing observation attacks. These mechanisms improve the usability of our pre...
This paper proposes to transform data scanned randomly in a well-defined space (e.g, Euclidean) along a hierarchical irregular pyramidal structure in an attempt reduce search time...