Follow
David Veith
David Veith
Verified email at stud.uni-frankfurt.de
Title
Cited by
Cited by
Year
I/O-efficient hierarchical diameter approximation
D Ajwani, U Meyer, D Veith
European Symposium on Algorithms, 72-83, 2012
72012
I/O-efficient approximation of graph diameters by parallel cluster growing—a first experimental study
D Ajwani, A Beckmann, U Meyer, D Veith
ARCS 2012, 1-7, 2012
72012
An I/O-efficient distance oracle for evolving real-world graphs
D Ajwani, U Meyer, D Veith
2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and†…, 2014
32014
An implementation of I/O-efficient dynamic breadth-first search using level-aligned hierarchical clustering
A Beckmann, U Meyer, D Veith
European Symposium on Algorithms, 121-132, 2013
32013
Graph algorithms for approximate and dynamic settings in the external-memory model
D Veith
Johann Wolfgang Goethe-Universitšt Frankfurt am Main, 2019
2019
TeamVision-visualisiertes Team-und Projektmanagement
D Veith
Bachelorarbeit, Frankfurt am Main, Johann Wolfgang Goethe-Universitšt, 2009, 2016
2016
Implementation of an external-memory diameter approximation
D Veith
Masterarbeit, Frankfurt am Main, Johann Wolfgang Goethe-Universitšt, 2012, 2016
2016
I/O-efficient Approximate Distance Oracle for Real-world Graphs
D Veith, U Meyer, D Ajwani
I/O-efficient Hierarchical Diameter Approximation
D Veith, U Meyer, D Ajwani
3.23 An I/O-efficient Distance Oracle for Evolving Real-World Graphs
D Veith
High-performance Graph Algorithms and Applications in Computational Science, 56, 0
The system can't perform the operation now. Try again later.
Articles 1–10