Pages that link to "Item:Q1957653"
From MaRDI portal
The following pages link to Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions (Q1957653):
Displayed 16 items.
- An improved exact algorithm for TSP in graphs of maximum degree 4 (Q255262) (← links)
- An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure (Q262259) (← links)
- New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
- The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
- Catalan structures and dynamic programming in \(H\)-minor-free graphs (Q440008) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Faster parameterized algorithms for minor containment (Q650942) (← links)
- Induced packing of odd cycles in planar graphs (Q764360) (← links)
- Fast minor testing in planar graphs (Q1759679) (← links)
- Exact algorithms for finding longest cycles in claw-free graphs (Q1939671) (← links)
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) (← links)
- The role of planarity in connectivity problems parameterized by treewidth (Q2514121) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- Dynamic programming for graphs on surfaces (Q5501962) (← links)