1: Polynomial-Time Algorithms for Multirate Anypath Routing in Wireless Multihop Networks
2: Approximating Subdense Instances of Covering Problems
3: An Active Learning Algorithm for Ranking from Pairwise Preferences with an Almost Optimal Query Complexity
4: Golden and Alternating, fast simple O(lg n) algorithms for Fibonacci