Showing cs.DSShow all
3 papers · 1 filter
cs.DS2024
On Controlling Knockout Tournaments Without Perfect Information
Václav Blažej, Sushmita Gupta, M. S. Ramanujan +1
Over the last decade, extensive research has been conducted on the algorithmic aspects of designing single-elimination (SE) tournaments. Addressing natural questions of algorithmic…
cs.DS2024
On the Parameterized Complexity of Eulerian Strong Component Arc Deletion
Václav Blažej, Satyabrata Jana, M. S. Ramanujan +1
In this paper, we study the Eulerian Strong Component Arc Deletion problem, where the input is a directed multigraph and the goal is to delete the minimum number of arcs to ensure…
cs.DS2024
An Exercise in Tournament Design: When Some Matches Must Be Scheduled
Sushmita Gupta, M. S. Ramanujan, Peter Strulo
Single-elimination (SE) tournaments are a popular format used in competitive environments and decision making. Algorithms for SE tournament manipulation have been an active topic o…