1. SSD ranking: the fastest solid state drives. https://www.gamingpcbuilder.com/ssd-ranking-the-fastest-solid-state-drives/. Accessed 4 Aug 2021
2. Baswana, S., Chaudhury, S.R., Choudhary, K., Khan, S.: Dynamic DFS in undirected graphs: breaking the $$o(m)$$ barrier. In: Krauthgamer, R. (ed.) Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, 10–12 January 2016, pp. 730–739. SIAM (2016)
3. Bringmann, K.: Fine-grained complexity theory (tutorial). In: 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2019)
4. Cadoli, M., Donini, F.M., Liberatore, P., Schaerf, M.: Preprocessing of intractable problems. Inf. Comput. 176(2), 89–120 (2002)
5. Chen, L., Duan, R., Wang, R., Zhang, H., Zhang, T.: An improved algorithm for incremental DFS tree in undirected graphs. In: Eppstein, D. (ed.) 16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018. Volume 101 of LIPIcs, Malmö, Sweden, 18–20 June 2018, pp. 16:1–16:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)