Andre Berger (A.)

Berger, A., Kozma, L., Mnich, M., & Vincze, R. (2019). A time- And space-optimal algorithm for the many-visits TSP. In Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1770-1782). SIAM. https://doi.org/10.1137/1.9781611975482.106

Berger, A., Grigoriev, A., & Winokurow, A. (2017). A PTAS for the Cluster Editing Problem on Planar Graphs. In Approximation and Online Algorithms (Lecture Notes in Computer Science ed., Vol. 10138, pp. 27-39). Springer. https://doi.org/10.1007/978-3-319-51741-4_3

Danielis, P., Dan, G., Gross, J., & Berger, A. (2017). Dynamic Flow Migration for Delay Constrained Traffic in Software-Defined Networks. In 2017 IEEE Global Communications Conference (GLOBECOM) IEEE. https://doi.org/10.1109/glocom.2017.8254753

Berger, A., Grigoriev, A., Panin, A., & Winokurow, A. (2016). Location, Pricing and the Problem of Apollonius. In Y. Kochetov, M. Khachay, V. Beresnev, E. A. Nurminski, & P. M. Pardalos (Eds.), Discrete Optimization and Operations Research (Vol. 9869, pp. 563-569). Springer. https://doi.org/10.1007/978-3-319-44914-2_44