54 citations · 54 across the 2 of their papers we have counts for
3 papers
Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries
Thomas Erlebach, Michael Hoffmann, Murilo S. de Lima
The area of computing with uncertainty considers problems where some information about the input elements is uncertain, but can be obtained using queries. For example, instead of t…
On Temporal Graph Exploration
Thomas Erlebach, Michael Hoffmann, Frank Kammer
A temporal graph is a graph in which the edge set can change from one time step to the next. The temporal graph exploration problem TEXP is the problem of computing a foremost expl…
Computing Minimum Spanning Trees with Uncertainty
Thomas Erlebach, Michael Hoffmann, Danny Krizanc +2
We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge of the graph only…