Funder
Ministerul Educaţiei şi Cercetă rii Ştiinţifice
Universitatea din Bucureşti
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference81 articles.
1. Abboud, A., Vassilevska Williams, V., Wang, J.R.: Approximation and fixed parameter subquadratic algorithms for radius and diameter in sparse graphs. In: Proceedings of the twenty-seventh annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016), pages 377–391. SIAM, (2016)
2. Alman, J., Vassilevska Williams, V.: A refined laser method and faster matrix multiplication. In :Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 522–539. SIAM, (2021)
3. Anari, N., Vazirani, V.: Matching Is as Easy as the Decision Problem, in the NC Model. In: 11th Innovations in Theoretical Computer Science Conference (ITCS 2020), volume 151 of Leibniz International Proceedings in Informatics (LIPIcs), pages 54:1–54:25. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, (2020)
4. Anstee, R.: A polynomial algorithm for b-matchings: an alternative approach. Inf. Process. Lett. 24(3), 153–157 (1987)
5. Bentert, M., Fluschnik, T., Nichterlein, A., Niedermeier, R.: Parameterized aspects of triangle enumeration. J. Comput. Syst. Sci. 103, 61–77 (2019)