1: Ranking Unit Squares with Few Visibilities
2: An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities
3: Optimal Acyclic Hamiltonian Path Completion for Outerplanar Triangulated st-Digraphs (with Application to Upward Topological Book Embeddings)
4: Hybrid Keyword Search Auctions
5: Algorithms for Scheduling Weighted Packets with Deadlines in a Bounded Queue
6: The rank convergence of HITS can be slow
7: Finding paths of length k in O(star)(2^k) time