Thomas Erlebach

TL;DR: Invited Lectures.- Origami, Linkages, and Polyhedra: Folding with Algorithms, Reliable and Efficient Geometric Computing, Some Computational Challenges in Today's Bio-medicine, and more.

TL;DR: This work shows how to compute single-source shortest paths in undirected graphs with non-negative edge lengths in O(√nm/Blogn+MST(n,m)I/Os, where n is the number of vertices, m is theNumber of edges, B is the disk block size, and MST(m) is the I/O-cost of computing a minimum spanning tree.

TL;DR: In this paper, it was shown that enumerating all minimal spanning and connected subsets of a given matroid can be solved in incremental quasi-polynomial time, and that all minimal 2-vertex connected edge subsets can be generated in incremental polynomial time.