Author:
Fellows Michael R.,Hallett Michael T.,Wareham H. Todd
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. K. Abrahamson and M. Fellows. Finite automata, bounded treewidth and well-quasiordering. Proceedings of the AMS Summer Workshop on Graph Minors (Seattle, 1991), A.M.S. Contemporary Mathematics Series, to appear.
2. S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. J. Algorithms, 12 (1991), 308–340.
3. H. L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. Proceedings of the 25th Annual ACM Symposium on Theory of Computing (1993), 226–234.
4. H. L. Bodlaender, M. R. Fellows and T. Warnow. Two Strikes Against Perfect Phylogeny. In: W. Kuich (editor), Proceedings of the 19th International Colloquium on Automata, Languages and Programming (ICALP'92). Springer-Verlag, Berlin, Lecture Notes in Computer Science, volume 623, pp. 273–283.
5. L. Cai, J. Chen, R. Downey and M. Fellows. The Parameterized Complexity of Short Computation and Factorization. Technical Report, Department of Computer Science, University of Victoria, June 1993.
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Balanced Connected Subgraph Problem in Geometric Intersection Graphs;Combinatorial Optimization and Applications;2019
2. A Survey on the Complexity of Flood-Filling Games;Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications;2018
3. Exact Algorithms for Intervalizing Coloured Graphs;Theory of Computing Systems;2015-03-15
4. Completing Colored Graphs to Meet a Target Property;Graph-Theoretic Concepts in Computer Science;2013
5. Parameterized Complexity of Flood-Filling Games on Trees;Lecture Notes in Computer Science;2013