1. Derandomized graph products;Alon;Comput. Complexity,1995
2. Complexity and Approximation in Reoptimization;Ausiello,2011
3. E. Bampis, B. Escoffier, M. Lampis, V.T. Paschos, Multistage matchings, in: 16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018, June, 2018, 18–20, Malmö, Sweden, 2018, pp. 7:1–7:13.
4. A unified approach to approximating resource allocation and scheduling;Bar-Noy;J. ACM,2000
5. Approximating the throughput of multiple machines in real-time scheduling;Bar-Noy;SIAM J. Comput.,2001