The following publications are possibly variants of this publication:
- I/O and Space-Efficient Path Traversal in Planar GraphsCraig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh. isaac 2009: 1175-1184 [doi]
- Succinct and I/O Efficient Data Structures for Traversal in TreesCraig Dillabaugh, Meng He, Anil Maheshwari. isaac 2008: 112-123 [doi]
- I/O-Efficient Path Traversal in Succinct Planar GraphsCraig Dillabaugh, Meng He 0001, Anil Maheshwari, Norbert Zeh. algorithmica, 77(3):714-755, 2017. [doi]