1. Andelman, N., Mansour, Y., Zhu, A.: Competitive queueing policies in QoS switches. In: Proceedings of the 14th Symposium on Discrete Algorithms (SODA), pp. 761–770. ACM/SIAM, New York (2003)
2. Birnbaum, B., Mathieu, C.: On-line bipartite matching made simple. SIGACT News 39(1), 80–87 (2008)
3. Chin, F.Y.L., Chrobak, M., Fung, S.P.Y., Jawor, W., Sgall, J., Tichý, T.: Online competitive algorithms for maximizing weighted throughput of unit jobs. J. Discrete Algorithms 4, 255–276 (2006)
4. Chin, F.Y.L., Fung, S.P.Y.: Online scheduling for partial job values: Does timesharing or randomization help? Algorithmica 37, 149–164 (2003)
5. Englert, M., Westermann, M.: Considering suppressed packets improves buffer management in QoS switches. In: Proceedings of the 18th Symposium on Discrete Algorithms (SODA), pp. 209–218. ACM/SIAM, New York (2007)