Blikstad, Joakim Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Blikstad, J., Svensson, O., Vintan, R., & Wajc, D. (2024). Simple and Asymptotically Optimal Online Bipartite Edge Coloring. In M. Parter, & S. Pettie (Eds.), Symposium on Simplicity in Algorithms (pp. 331-336). Philadelphia, PA: SIAM. doi:10.1137/1.9781611977936.30.