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
Algorithms–ESA 2012: 20th Annual European Symposium, Ljubljana, Slovenia …, 2012
92012
I/O-efficient approximation of graph diameters by parallel cluster growing—a first experimental study
D Ajwani, A Beckmann, U Meyer, D Veith
PARS: Parallel-Algorithmen,-Rechnerstrukturen und-Systemsoftware 29 (1), 75-86, 2012
82012
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
Algorithms–ESA 2013: 21st Annual European Symposium, Sophia Antipolis …, 2013
32013
Graph algorithms for approximate and dynamic settings in the external-memory model
D Veith
Universitätsbibliothek Johann Christian Senckenberg, 2019
2019
Implementation of an external-memory diameter approximation
D Veith
Universitätsbibliothek Johann Christian Senckenberg, 2012
2012
TeamVision: visualisiertes Team-und Projektmanagement
D Veith
Universitätsbibliothek Johann Christian Senckenberg, 2009
2009
TeamVision-visualisiertes Team-und Projektmanagement
ID Krömker, D Veith
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–11