I/O-efficient approximation of graph diameters by parallel cluster growing - a first experimental study. - Deepak Ajwani; Andreas Beckmann; Ulrich Meyer 001; David Veith (ARCS Workshops, 2012)

I/O-efficient Hierarchical Diameter Approximation. - Deepak Ajwani; Ulrich Meyer 001; David Veith (ESA, 2012)

An Implementation of I/O-Efficient Dynamic Breadth-First Search Using Level-Aligned Hierarchical Clustering. - Andreas Beckmann; Ulrich Meyer 001; David Veith (ESA, 2013)

An I/O-efficient Distance Oracle for Evolving Real-World Graphs. - Deepak Ajwani; Ulrich Meyer 001; David Veith (ALENEX, 2015)

Graph algorithms for approximate and dynamic settings in the external-memory model. - David Veith (2020)