On computing graph minor obstruction sets

Authors:
Kevin Cattell;Michael J. Dinneen;Rodney G. Downey;Michael R. Fellows;Michael A. Langston
Affiliations:
Univ. of Victoria, Victoria, B.C. Canada;Univ. of Auckland, Auckland, New Zealand;Victoia Univ., Wellington, New Zealand;Univ. of Victoria, Victoria, B.C. Canada;Univ. of Tennessee, Knoxville
Venue:
Theoretical Computer Science
Year:
2000

Citing 0
Cited 8

A Characterization of Graphs with Vertex Cover Six

COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover

Discrete Applied Mathematics
Computing excluded minors

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover

Discrete Applied Mathematics
Fixed-Parameter tractability of treewidth and pathwidth

The Multivariate Algorithmic Revolution and Beyond
Graph minors and parameterized algorithm design

The Multivariate Algorithmic Revolution and Beyond
Effective computation of immersion obstructions for unions of graph classes

SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Effective computation of immersion obstructions for unions of graph classes

Journal of Computer and System Sciences

Quantified Score

Hi-index	5.23

Visualization

Abstract