We show that there is a constant > 0 such that, for any set P of n 5 points in general position in the plane, a crossing-free geometric graph on P that is chosen uniformly at...
In large peer-to-peer (P2P) overlay networks, nodes usually share resources to support all kinds of applications. In such networks, a subset of the nodes may assume the role of br...
Pawel Garbacki, Dick H. J. Epema, Maarten van Stee...
Today's networks are becoming increasingly complex and the ability to effectively and efficiently operate and manage them is ever more challenging. Ways to provide end-to-end...
A circle C is occluded by a set of circles C1, . . . , Cn if every line that intersects C also intersects at least one of the Ci, i = 1, . . . , n. In this paper, we focus on dete...
Natasa Jovanovic, Jan H. M. Korst, Augustus J. E. ...
The cornerstone of any algorithm computing all repetitions in strings of length n in O(n) time is the fact that the number of maximal repetitions (runs) is linear. Therefore, the ...