Parameterized power domination complexity

Parameterized Complexity

Michael R. Fellows · Electronic Notes in Theoretical Computer Science · 2002 · 2.9K citations · Full text

Computing, Computer Science, Mathematics +12

Fixed-parameter tractability and completeness II: On completeness for W[1]

Rod Downey, Michael R. Fellows · Theoretical Computer Science · 1995 · 587 citations

Computing, Computer Science, Mathematics +7

Graph minors. I. Excluding a forest

Neil Robertson, Paul Seymour · Journal of Combinatorial Theory Series B · 1983 · 587 citations

Natural Sciences, Forestry, Graph Visualization +5

Domination in Graphs Applied to Electric Power Networks

Teresa W. Haynes, Sandra M. Hedetniemi, Stephen T. Hedetniemi et al. · SIAM Journal on Discrete Mathematics · 2002 · 355 citations

Computing, Computer Science, Electrical Engineering +10

Algorithms for Vertex Partitioning Problems on Partial k-Trees

Jan Arne Telle, Andrzej Proskurowski · SIAM Journal on Discrete Mathematics · 1997 · 306 citations

Computing, Computer Science, Mathematics +17