Dr. David Veith

Institut für Informatik

 

Mail

dveith@ae.cs.uni-frankfurt.de

Publications

1

Deepak Ajwani, Ulrich Meyer, and David Veith. An I/O-efficient distance oracle for evolving real-world graphs. In Ulrik Brandes and David Eppstein, editors, Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, ALENEX 2015, San Diego, CA, USA, January 5, 2015, 159–172. SIAM, 2015. View Online doi:10.1137/1.9781611973754.14 @inproceedings{DBLP:conf/alenex/AjwaniMV15, author = "Ajwani, Deepak and Meyer, Ulrich and Veith, David", editor = "Brandes, Ulrik and Eppstein, David", biburl = "https://dblp.org/rec/conf/alenex/AjwaniMV15.bib", booktitle = "Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, {ALENEX} 2015, San Diego, CA, USA, January 5, 2015", doi = "10.1137/1.9781611973754.14", pages = "159--172", publisher = "{SIAM}", title = "An {I/O}-efficient Distance Oracle for Evolving Real-World Graphs", url = "https://doi.org/10.1137/1.9781611973754.14", year = "2015" }

2

Andreas Beckmann, Ulrich Meyer, and David Veith. An implementation of I/O-efficient dynamic breadth-first search using level-aligned hierarchical clustering. In Hans L. Bodlaender and Giuseppe F. Italiano, editors, Algorithms - ESA 2013 - 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings, volume 8125 of Lecture Notes in Computer Science, 121–132. Springer, 2013. View Online doi:10.1007/978-3-642-40450-4_11 @inproceedings{DBLP:conf/esa/BeckmannMV13, author = "Beckmann, Andreas and Meyer, Ulrich and Veith, David", editor = "Bodlaender, Hans L. and Italiano, Giuseppe F.", biburl = "https://dblp.org/rec/conf/esa/BeckmannMV13.bib", booktitle = "Algorithms - {ESA} 2013 - 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings", doi = "10.1007/978-3-642-40450-4\_11", pages = "121--132", publisher = "Springer", series = "Lecture Notes in Computer Science", title = "An Implementation of {I/O}-Efficient Dynamic Breadth-First Search Using Level-Aligned Hierarchical Clustering", url = "https://doi.org/10.1007/978-3-642-40450-4\_11", volume = "8125", year = "2013" }

3

Deepak Ajwani, Ulrich Meyer, and David Veith. I/O-efficient hierarchical diameter approximation. In Leah Epstein and Paolo Ferragina, editors, Algorithms - ESA 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings, volume 7501 of Lecture Notes in Computer Science, 72–83. Springer, 2012. View Online doi:10.1007/978-3-642-33090-2_8 @inproceedings{DBLP:conf/esa/AjwaniMV12, author = "Ajwani, Deepak and Meyer, Ulrich and Veith, David", editor = "Epstein, Leah and Ferragina, Paolo", biburl = "https://dblp.org/rec/conf/esa/AjwaniMV12.bib", booktitle = "Algorithms - {ESA} 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings", doi = "10.1007/978-3-642-33090-2\_8", pages = "72--83", publisher = "Springer", series = "Lecture Notes in Computer Science", title = "{I/O}-efficient Hierarchical Diameter Approximation", url = "https://doi.org/10.1007/978-3-642-33090-2\_8", volume = "7501", year = "2012" }

4

Deepak Ajwani, Andreas Beckmann, Ulrich Meyer, and David Veith. I/O-efficient approximation of graph diameters by parallel cluster growing - a first experimental study. In Gero Mühl, Jan Richling, and Andreas Herkersdorf, editors, ARCS 2012 Workshops, 28. Februar - 2. März 2012, München, Germany, volume P-200 of LNI, 493–504. GI, 2012. View Online @inproceedings{DBLP:conf/arcs/AjwaniBMV11, author = "Ajwani, Deepak and Beckmann, Andreas and Meyer, Ulrich and Veith, David", editor = {M{\"{u}}hl, Gero and Richling, Jan and Herkersdorf, Andreas}, biburl = "https://dblp.org/rec/conf/arcs/AjwaniBMV11.bib", booktitle = {{ARCS} 2012 Workshops, 28. Februar - 2. M{\"{a}}rz 2012, M{\"{u}}nchen, Germany}, pages = "493--504", publisher = "{GI}", series = "{LNI}", title = "{I/O}-efficient approximation of graph diameters by parallel cluster growing - a first experimental study", url = "http://ieeexplore.ieee.org/document/6222204/", volume = "{P-200}", year = "2012" }