2 papers
cs.DS2025
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.GT2025
Tractable Graph Structures in EFX Orientation
Václav Blažej, Sushmita Gupta, M. S. Ramanujan +1
Since its introduction, envy-freeness up to any good (EFX) has become a fundamental solution concept in fair division of indivisible goods. Its existence remains elusive -- even fo…