In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0;1]d and a degree constraint b 2. The aim is to nd a minimum weight spannin...
Since the advent of public data repositories for proteomics data, readily accessible results from high-throughput experiments have been accumulating steadily. Several large-scale p...
Sebastian Klie, Lennart Martens, Juan Antonio Vizc...
Biological systems have to react to environmental and/or developmental changes by adjusting their biochemical/cellular machinery on numerous levels. In many cases small molecules ...
Lothar Willmitzer, Camila Caldana, Alisdair R. Fer...
Coordinates-based distance prediction algorithms can improve the performance of many Internet applications, especially in the peer-to-peer architecture and overlay construction. B...
Lin Cong, Yang Chen, Xiaohui Shi, Ye Wang, Weiyu W...
Let G = (V, E) be a graph with n vertices and m ≥ 4n edges drawn in the plane. The celebrated Crossing Lemma states that G has at least Ω(m3 /n2 ) pairs of crossing edges; or ...