Pages that link to "Item:Q1342869"
From MaRDI portal
The following pages link to On search, decision, and the efficiency of polynomial-time algorithms (Q1342869):
Displaying 25 items.
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem (Q337212) (← links)
- Variable neighborhood search for the vertex separation problem (Q339678) (← links)
- On minimum cost edge searching (Q391138) (← links)
- Effective computation of immersion obstructions for unions of graph classes (Q395009) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Complete graph immersions in dense graphs (Q512586) (← 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)
- On interval routing schemes and treewidth (Q1383155) (← links)
- Algorithms and obstructions for linear-width and related search parameters (Q1582084) (← links)
- Explicit linear kernels for packing problems (Q1739112) (← links)
- A brief history of Edward K. Blum and the Journal of Computer and System Sciences (Q1745715) (← links)
- Fast minor testing in planar graphs (Q1759679) (← links)
- A tight lower bound for vertex planarization on graphs of bounded treewidth (Q2403808) (← links)
- Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs (Q2419108) (← links)
- Obtaining a planar graph by vertex deletion (Q2429328) (← links)
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover (Q2576350) (← links)
- Myhill-Nerode Methods for Hypergraphs (Q2872101) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- Low Polynomial Exclusion of Planar Graph Patterns (Q2958196) (← links)
- (Q5009489) (← links)
- (Q5028434) (← links)
- Bounding the search number of graph products (Q5215862) (← links)
- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions (Q6038588) (← links)
- Forbidden induced subgraphs and the Łoś-Tarski theorem (Q6545087) (← links)
