On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design
DOI10.1137/0405010zbMATH Open0739.68042OpenAlexW2036263637MaRDI QIDQ3989017FDOQ3989017
Authors: Michael R. Fellows, Michael A. Langston 
Publication date: 28 June 1992
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0405010
Recommendations
Computing methodologies and applications (68U99) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cited In (30)
- On algorithmic applications of the immersion order: An overview of ongoing work presented at the Third Slovenian International Conference on Graph Theory
- A new algorithm for finding trees with many leaves
- Complete graph immersions in dense graphs
- Title not available (Why is that?)
- On problems without polynomial kernels
- Title not available (Why is that?)
- Approximating the pathwidth of outerplanar graphs
- Splitter theorems for 4-regular graphs
- Title not available (Why is that?)
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem
- Myhill-Nerode Methods for Hypergraphs
- A Simple 2-Approximation for Maximum-Leaf Spanning Tree
- Order Reconfiguration under Width Constraints
- Obstruction set isolation for the gate matrix layout problem
- The structure of graphs not admitting a fixed immersion
- Parameterized complexity of graph burning
- Well-quasi-orders in subclasses of bounded treewidth graphs
- Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications
- Improved self-reduction algorithms for graphs with bounded treewidth
- Experimental evaluation of a branch-and-bound algorithm for computing pathwidth and directed pathwidth
- Derivation of algorithms for cutwidth and related graph layout parameters
- On search, decision, and the efficiency of polynomial-time algorithms
- Fixed-parameter tractability, a prehistory
- Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs
- Kernelization for finding lineal topologies (depth-first spanning trees) with many or few leaves
- A mathematical commitment without computational strength
- Fixed-parameter tractability of treewidth and pathwidth
- Constructivity issues in graph algorithms
- A simple linear-time algorithm for finding path-decompositions of small width
- Minimal antichains in well-founded quasi-orders with an application to tournaments
This page was built for publication: On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3989017)
