Pages that link to "Item:Q5462384"
From MaRDI portal
The following pages link to Cutwidth II: Algorithms for partial w-trees of bounded degree (Q5462384):
Displayed 13 items.
- Confronting intractability via parameters (Q465686) (← links)
- The structure of graphs not admitting a fixed immersion (Q473098) (← links)
- On cutwidth parameterized by vertex cover (Q476444) (← links)
- Fixed-parameter algorithms for protein similarity search under mRNA structure constraints (Q1002106) (← links)
- Derivation of algorithms for cutwidth and related graph layout parameters (Q1015810) (← links)
- A branch-and-bound algorithm for the minimum cut linear arrangement problem (Q1928510) (← links)
- Imbalance is fixed parameter tractable (Q2445234) (← links)
- A Variable Neighbourhood Search approach to the Cutwidth Minimization Problem (Q2840754) (← links)
- THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS (Q2875647) (← links)
- On Cutwidth Parameterized by Vertex Cover (Q2891354) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time (Q3057614) (← links)
- Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs (Q5302057) (← links)