1. A quasi-ptas for unsplittable flow on line graphs;Bansal,2006
2. Scheduling unit tasks to minimize the number of idle periods: a polynomial time algorithm for offline dynamic power management;Baptiste,2006
3. Latency constrained aggregation in sensor networks;Becchetti,2006
4. Restrictions of graph partition problems. Part I;Bodlaender;Theoret. Comput. Sci.,1995
5. Dynamic scheduling on a single batch processing machine with split compatibility graphs;Boudhar;J. Math. Model. Algorithms,2003