Pages that link to "Item:Q3989017"
From MaRDI portal
The following pages link to On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design (Q3989017):
Displaying 27 items.
- Approximating the pathwidth of outerplanar graphs (Q293398) (← links)
- The structure of graphs not admitting a fixed immersion (Q473098) (← links)
- Complete graph immersions in dense graphs (Q512586) (← links)
- A new algorithm for finding trees with many leaves (Q652536) (← links)
- A simple linear-time algorithm for finding path-decompositions of small width (Q672094) (← links)
- Derivation of algorithms for cutwidth and related graph layout parameters (Q1015810) (← links)
- On problems without polynomial kernels (Q1034099) (← links)
- Improved self-reduction algorithms for graphs with bounded treewidth (Q1336622) (← links)
- Obstruction set isolation for the gate matrix layout problem (Q1336625) (← links)
- On search, decision, and the efficiency of polynomial-time algorithms (Q1342869) (← links)
- On algorithmic applications of the immersion order: An overview of ongoing work presented at the Third Slovenian International Conference on Graph Theory (Q1379838) (← links)
- Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications (Q1759678) (← links)
- Minimal antichains in well-founded quasi-orders with an application to tournaments (Q1850501) (← links)
- Splitter theorems for 4-regular graphs (Q1959710) (← links)
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem (Q2029285) (← links)
- Parameterized complexity of graph burning (Q2161013) (← links)
- Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs (Q2419108) (← links)
- Myhill-Nerode Methods for Hypergraphs (Q2872101) (← links)
- Fixed-Parameter Tractability, A Prehistory, (Q2908528) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs (Q3656858) (← links)
- Constructivity issues in graph algorithms (Q4594259) (← links)
- A MATHEMATICAL COMMITMENT WITHOUT COMPUTATIONAL STRENGTH (Q5046601) (← links)
- Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth (Q5266611) (← links)
- A Simple 2-Approximation for Maximum-Leaf Spanning Tree (Q6066463) (← links)
- Order Reconfiguration under Width Constraints (Q6075707) (← links)
- Kernelization for finding lineal topologies (depth-first spanning trees) with many or few leaves (Q6546606) (← links)
