| SIGACT News Online Algorithms Column 31. | 0 | 0.34 | 2017 |
| Optimal lower bounds for projective list update algorithms | 2 | 0.36 | 2013 |
| On the Approximability of Single-Machine Scheduling with Precedence Constraints | 10 | 0.58 | 2011 |
| Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut | 35 | 1.27 | 2011 |
| Tree exploration with logarithmic memory | 11 | 0.56 | 2011 |
| Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem | 20 | 1.12 | 2009 |
| Precedence Constraint Scheduling and Connections to Dimension Theory of Partial Orders. | 0 | 0.34 | 2008 |
| Light-weight control of non-responsive traffic with low buffer requirements | 1 | 0.41 | 2007 |
| Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling | 45 | 1.70 | 2007 |
| Scheduling with Precedence Constraints of Low Fractional Dimension | 8 | 0.53 | 2007 |
| Approximating precedence-constrained single machine scheduling by coloring | 7 | 0.51 | 2006 |
| Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs | 73 | 2.36 | 2006 |
| The Clique Problem in Intersection Graphs of Ellipses and Triangles | 9 | 0.56 | 2005 |
| An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks | 41 | 1.50 | 2005 |
| On the approximability of the range assignment problem on radio networks in presence of selfish agents | 8 | 0.57 | 2005 |
| On-line scheduling to minimize max flow time: an optimal preemptive algorithm | 9 | 0.57 | 2005 |
| The range assignment problem in non-homogeneous static ad-hoc networks | 10 | 0.48 | 2004 |
| Parallel Prefetching and Caching Is Hard | 2 | 0.38 | 2004 |
| Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks | 17 | 0.74 | 2004 |
| Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. | 9 | 0.60 | 2003 |
| On the Clique Problem in Intersection Graphs of Ellipses | 0 | 0.34 | 2002 |
| A new lower bound for the list update problem in the partial cost model | 7 | 0.51 | 2001 |
| Offline List Update is NP-Hard | 11 | 0.61 | 2000 |
| Computing Largest Common Point Sets under Approximate Congruence | 22 | 1.55 | 2000 |
