Pages that link to "Item:Q4598141"
From MaRDI portal
The following pages link to Subexponential Time Algorithms for Embedding H-Minor Free Graphs (Q4598141):
Displaying 11 items.
- Polynomial bounds for centered colorings on proper minor-closed graph classes (Q1984513) (← links)
- On the exact complexity of polyomino packing (Q2196557) (← links)
- On the Exact Complexity of Polyomino Packing (Q3305727) (← links)
- Games, Puzzles and Treewidth (Q5042461) (← links)
- A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs (Q5071089) (← links)
- Enumerating Grid Layouts of Graphs (Q5119387) (← links)
- Improved Lower Bounds for Graph Embedding Problems (Q5283358) (← links)
- Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering (Q5885586) (← links)
- On the number of labeled graphs of bounded treewidth (Q5915790) (← links)
- Subgraph isomorphism on graph classes that exclude a substructure (Q5919029) (← links)
- Algorithms and Turing kernels for detecting and counting small patterns in unit disk graphs (Q6655672) (← links)
