Outputs (3)

Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty (2021)
Presentation / Conference Contribution
Bampis, E., Dürr, C., Erlebach, T., de Lima, M. S., Megow, N., & Schlöter, J. (2021, December). Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty. Presented at 29th Annual European Symposium on Algorithms (ESA 2021), Lisbon, Portugal (Virtual Conference)

Given a hypergraph with uncertain node weights following known probability distributions, we study the problem of querying as few nodes as possible until the identity of a node with minimum weight can be determined for each hyperedge. Querying a node... Read More about Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty.

Exploration of k-Edge-Deficient Temporal Graphs (2021)
Presentation / Conference Contribution
Erlebach, T., & Spooner, J. T. (2021, December). Exploration of k-Edge-Deficient Temporal Graphs. Presented at WADS 2021: Algorithms and Data Structures

Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries (2021)
Presentation / Conference Contribution
Erlebach, T., Hoffmann, M., & de Lima, M. S. (2021, December). Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries. Presented at 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021), Saarbrücken, Germany