Publisher
Springer Nature Switzerland
Reference23 articles.
1. Albers, S., Schraink, S.: Tight bounds for online coloring of basic graph classes. Algorithmica 83(1), 337–360 (2021)
2. Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press (1998)
3. Boyar, J., Eidenbenz, S.J., Favrholdt, L.M., Kotrbcík, M., Larsen, K.S.: Online dominating set. Algorithmica 81(5), 1938–1964 (2019)
4. Boyar, J., Favrholdt, L.M., Kotrbcík, M., Larsen, K.S.: Relaxing the irrevocability requirement for online graph algorithms. Algorithmica 84(7), 1916–1951 (2022)
5. Brass, P., Moser, W.O.J., Pach, J.: Research Problems in Discrete Geometry. Springer (2005). https://doi.org/10.1007/0-387-29929-7