N. Kinnersley and M. A. Langston. Obstruction set isolation for the gate matrix layout problem. Discrete Applied Mathematics, 54:169--213, 1994. Home/Search Document Details and Download
Context Related Articles Check |
This paper is cited by the following papers:
Algorithms and Obstructions for Linear-Width and Related Search.. - Thilikos (1997) (1 citation) (Correct)
Partial Tracks, Characterizations and Recognition of Graphs.. - Barat, Hajnal (Correct)
Operations Which Preserve Path-Width At Most Two - Barát, Hajnal (Correct)
Constructive Linear Time Algorithms for Branchwidth - Thilikos, Bodlaender (1997) (1 citation) (Correct)
The Structure And Number Of Obstructions To Treewidth - Siddharthan.. (Correct)
Obstructions to Within a Few Vertices or Edges of Acyclic - Cattell, Dinneen, Fellows (1995) (2 citations) (Correct)
Algorithms and Obstructions for Linear-Width and Related Search.. - Thilikos (2000) (1 citation) (Correct)
Forbidden Minors to Graphs with Small Feedback Sets - Dinneen, Cattell, Fellows (1996) (Correct)
VLSI Layouts and DNA Physical Mappings - Dinneen (1996) (3 citations) (Correct)
Finding Minor-Order Obstruction Sets: Feedback Vertex Set <=2 - Cattell, Dinneen, Fellows (Correct)
Synthesizing a Predatory Search Strategy for VLSI Layouts - Linhares (1998) (Correct)
A Partial K-Arboretum of Graphs With Bounded Treewidth - Bodlaender (1998) (2 citations) (Correct)
Achieving Optimality for Gate Matrix Layout and PLA Folding.. - Ferreira, Song (1992) (2 citations) (Correct)
Algorithms and Obstructions for Linear-Width and Related Search.. - Thilikos (1997) (1 citation) (Correct)
Too Many Minor Order Obstructions (For Parameterized Lower Ideals) - Dinneen (1997) (Correct)
A Note on the Computability of Graph Minor Obstruction.. - Courcelle, Downey.. (1997) (Correct)
Algorithms and Obstructions for Linear-Width and Related Search.. - Thilikos (1997) (1 citation) (Correct)
Constructive Linear Time Algorithms For - Branchwidth Dimitrios Thilikos (2000) (Correct)
Constructive Linear Time Algorithms for Branchwidth - Thilikos, Bodlaender (1997) (1 citation) (Correct)
The Structure of Obstructions to Treewidth and Pathwidth - Chlebikova (2002) (1 citation) (Correct)
Tree-Decompositions of Small Pathwidth - Telle (2000) (Correct)
A Practical Approach to Layout Optimization - Govindan, Langston.. (1992) (1 citation) Self-citation (Langston) (Correct)
On Computing Graph Minor Obstruction Sets - Cattell, Dinneen, Downey.. (1997) (2 citations) Self-citation (Langston) (Correct)
Constructive Algorithms Based on Graph Minors - Govindan, Langston.. (1997) Self-citation (Langston) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC