29 citations · 98 across the 20 of their papers we have counts for
9 papers · 1 filter
: Truly Linear FPT
Benjamin Merlin Bumpus, Rod Downey, Tala Eagling-Vose +7
Parameterized complexity has always been concerned with practical computing: by confining combinatorial explosion to a secondary parameter , one can uncover why and how many NP-…
On Solution Discovery via Reconfiguration
Michael R. Fellows, Mario Grobler, Nicole Megow +5
The dynamics of real-world applications and systems require efficient methods for improving infeasible solutions or restoring corrupted ones by making modifications to the current…
Parameterized String Equations
Laurent Bulteau, Michael R. Fellows, Christian Komusiewicz +1
We study systems of String Equations where block variables need to be assigned strings so that their concatenation gives a specified target string. We investigate this problem unde…
FPT is Characterized by Useful Obstruction Sets
Michael R. Fellows, Bart M. P. Jansen
Many graph problems were first shown to be fixed-parameter tractable using the results of Robertson and Seymour on graph minors. We show that the combination of finite, computable,…
Control Complexity in Bucklin and Fallback Voting
Gábor Erdélyi, Michael Fellows, Jörg Rothe +1
Electoral control models ways of changing the outcome of an election via such actions as adding/deleting/partitioning either candidates or voters. To protect elections from such co…
Parameterized Control Complexity in Fallback Voting
Gábor Erdélyi, Michael Fellows
We study the parameterized control complexity of fallback voting, a voting system that combines preference-based with approval voting. Electoral control is one of many different wa…