Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Minimum Temporal Spanners in Happy Graphs
Arnaud Casteigts, Hendrik Molter, Meirav Zehavi
Temporal graphs have edge sets that change over discrete time steps. Such graphs are temporally connected (TC) if all pairs of vertices can reach each other using paths that traver…
cs.DS2024
Adaptive Manipulation for Coalitions in Knockout Tournaments
Juhi Chaudhary, Hendrik Molter, Meirav Zehavi
Knockout tournaments, also known as single-elimination or cup tournaments, are a popular form of sports competitions. In the standard probabilistic setting, for each pairing of pla…