Breadth First Search on Massive Graphs. - Deepak Ajwani; Ulrich Meyer 001; Vitaly Osipov (The Shortest Path Problem, 2006)

Improved External Memory BFS Implementation. - Deepak Ajwani; Ulrich Meyer 001; Vitaly Osipov (ALENEX, 2007)

Design and Implementation of a Practical I/O-efficient Shortest Paths Algorithm. - Ulrich Meyer 001; Vitaly Osipov (ALENEX, 2009)

The Filter-Kruskal Minimum Spanning Tree Algorithm. - Vitaly Osipov; Peter Sanders 001; Johannes Singler (ALENEX, 2009)

n-Level Graph Partitioning. - Vitaly Osipov; Peter Sanders 001 (ESA (1), 2010)

GPU sample sort. - Nikolaj Leischner; Vitaly Osipov; Peter Sanders 001 (IPDPS, 2010)

n-Level Graph Partitioning - Vitaly Osipov; Peter Sanders 001 (CoRR, 2010)

PEPPHER: Efficient and Productive Usage of Hybrid Computing Systems. - Siegfried Benkner; Sabri Pllana; Jesper Larsson Träff; Philippas Tsigas; Uwe Dolinsky; Cédric Augonnet; Beverly Bachmayer; Christoph W. Kessler; David Moloney; Vitaly Osipov (IEEE Micro, 2011)

Parallel Suffix Array Construction for Shared Memory Architectures. - Vitaly Osipov (SPIRE, 2012)

Engineering Graph Partitioning Algorithms. - Vitaly Osipov; Peter Sanders 001; Christian Schulz 003 (SEA, 2012)

Efficient Parallel and External Matching. - Marcel Birn; Vitaly Osipov; Peter Sanders 001; Christian Schulz 003; Nodari Sitchinava (Euro-Par, 2013)

Algorithm Engineering for fundamental Sorting and Graph Problems. - Vitaly Osipov (2014)

Inducing Suffix and LCP Arrays in External Memory. - Timo Bingmann; Johannes Fischer 001; Vitaly Osipov (ACM J. Exp. Algorithmics, 2016)