Growing sequencing and assembly efforts have been met by the advances in high throughput machines. However, the presence of massive amounts of repeats and transposons complicates ...
Nirmalya Bandyopadhyay, A. Mark Settles, Tamer Kah...
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
The dramatic proliferation of sophisticated networks has resulted in a growing need for supporting effective querying and mining methods over such large-scale graph-structured da...
Consider an acyclic directed network G with sources S1, S2, . . . , Sl and distinct sinks R1, R2, . . . , Rl. For i = 1, 2, . . . , l, let ci denote the min-cut between Si and Ri....
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...