Parameterized Complexity of Conflict-Free Set Cover
- 12 January 2021
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 65 (3) , 515-540
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- Paths, trees and matchings under disjunctive constraintsDiscrete Applied Mathematics, 2011
- Online variable-sized bin packing with conflictsDiscrete Optimization, 2011
- On nowhere dense graphsEuropean Journal of Combinatorics, 2011
- A parameterized view on matroid optimization problemsTheoretical Computer Science, 2009
- Scheduling with conflicts: online and offline algorithmsJournal of Scheduling, 2008
- Short Cycles Make W-hard Problems Hard: FPT Algorithms for W-hard Problems in Graphs with no Short CyclesAlgorithmica, 2008
- Not So Perfect Graphs2004
- Which Problems Have Strongly Exponential Complexity?Journal of Computer and System Sciences, 2001
- On diameters and radii of bridged graphsDiscrete Mathematics, 1989
- On generating all maximal independent setsInformation Processing Letters, 1988