The following pages link to (Q4845370):
Displaying 18 items.
- Linear-time algorithms for problems on planar graphs with fixed disk dimension (Q845887) (← 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)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- The complexity of the vertex-minor problem (Q2059901) (← links)
- New limits of treewidth-based tractability in optimization (Q2118087) (← links)
- Improved kernels for tracking paths (Q2681404) (← links)
- A shorter proof of the graph minor algorithm: the unique linkage theorem (Q2875195) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- Finding disjoint paths with different path-costs: Complexity and algorithms (Q4022731) (← links)
- LP Formulations for Polynomial Optimization Problems (Q4637509) (← links)
- Definability in First Order Theories of Graph Orderings (Q5283438) (← links)
- (Q5391139) (← links)
- A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph (Q5408591) (← links)
- A Simple Algorithm for the Graph Minor Decomposition − Logic meets Structural Graph Theory– (Q5741738) (← links)
- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions (Q6038588) (← links)
- Tangle bases: Revisited (Q6087071) (← links)
