The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
Hans L. Bodlaender, Michael R. Fellows, Pinar Hegg...
We examine the itinerary of 0 ∈ S1 = R/Z under the rotation by α ∈ R\Q. The motivating question is: if we are given only the itinerary of 0 relative to I ⊂ S1 , a finite un...
The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as sp...