Pages that link to "Item:Q1336625"
From MaRDI portal
The following pages link to Obstruction set isolation for the gate matrix layout problem (Q1336625):
Displaying 30 items.
- Contraction obstructions for connected graph searching (Q298950) (← links)
- Posets with cover graph of pathwidth two have bounded dimension (Q304175) (← links)
- Variable neighborhood search for the vertex separation problem (Q339678) (← links)
- Characterizing width two for variants of treewidth (Q344827) (← links)
- Forbidden directed minors and Kelly-width (Q501668) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- On computing graph minor obstruction sets (Q1575945) (← links)
- Algorithms and obstructions for linear-width and related search parameters (Q1582084) (← links)
- The structure of obstructions to treewidth and pathwidth (Q1613365) (← links)
- Independent-set reconfiguration thresholds of hereditary graph classes (Q1801058) (← links)
- Minor obstructions for apex-pseudoforests (Q2043398) (← links)
- Sparse obstructions for minor-covering parameters (Q2174553) (← links)
- Four-searchable biconnected outerplanar graphs (Q2243137) (← links)
- On the geometric Ramsey number of outerplanar graphs (Q2256584) (← links)
- Characterization of graphs and digraphs with small process numbers (Q2275910) (← links)
- Comparing linear width parameters for directed graphs (Q2322714) (← links)
- Characterizing graphs of maximum matching width at most 2 (Q2413972) (← links)
- Obstructions for linear rank-width at most 1 (Q2442201) (← links)
- On strict brambles (Q2689118) (← links)
- Fixed-Parameter Tractability, A Prehistory, (Q2908528) (← links)
- A Quartic Kernel for Pathwidth-One Vertex Deletion (Q3057625) (← links)
- A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths (Q4645295) (← links)
- Obstructions to within a few vertices or edges of acyclic (Q5057453) (← links)
- Tree-decompositions of small pathwidth (Q5916128) (← links)
- Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 (Q5920195) (← links)
- Characterising graphs with no subdivision of a wheel of bounded diameter (Q6038576) (← links)
- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions (Q6038588) (← links)
- Order Reconfiguration under Width Constraints (Q6075707) (← links)
- Connected search for a lazy robber (Q6080862) (← links)
- Dichotomies for tree minor containment with structural parameters (Q6658295) (← links)
