Abstract. The disjoint-set data structure is used to maintain a collection of non-overlapping sets of elements from a finite universe. Algorithms that operate on this data structu...
Md. Mostofa Ali Patwary, Jean R. S. Blair, Fredrik...
We improve on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their sizes...
Building realistic Internet topologies is an important step towards predicting the behavior of new distributed applications and protocols. We are creating topologies that predict ...
Three training modules were designed to decrease ingroup dynamics in Partially Distributed Teams, which have two or more geographically separated subteams. The action research ori...
Rosalie J. Ocker, Dana Kracaw, Starr Roxanne Hiltz...