1. A simple algorithm for edge-coloring bipartite multigraphs;Alon;Inform. Process. Lett.,2003
2. Depth-first search using O(n) bits;Asano,2014
3. Improved space efficient algorithms for BFS, DFS and applications;Banerjee,2016
4. Rank-select indices without tears;Baumann,2017
5. Biconnectivity, chain decomposition and st-numbering using O(n) bits;Chakraborty,2016