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):
Displaying 37 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)
- Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane (Q1651693) (← links)
- Fast minor testing in planar graphs (Q1759679) (← links)
- Exact algorithms for finding longest cycles in claw-free graphs (Q1939671) (← links)
- A \(2^{O(k)}n\) algorithm for \(k\)-cycle in minor-closed graph families (Q2006778) (← links)
- Hitting forbidden induced subgraphs on bounded treewidth graphs (Q2051840) (← links)
- Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs (Q2282284) (← links)
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? (Q2324243) (← links)
- Finding, hitting and packing cycles in subexponential time on unit disk graphs (Q2334507) (← 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)
- Parameterized complexity of graph planarity with restricted cyclic orders (Q2698291) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- (Q5009489) (← links)
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
- Surprising Applications of Treewidth Bounds for Planar Graphs (Q5042457) (← links)
- A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs (Q5071089) (← links)
- Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs (Q5089257) (← links)
- Decomposition of Map Graphs with Applications. (Q5091217) (← links)
- Subexponential parameterized algorithms for graphs of polynomial growth (Q5111748) (← links)
- Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds (Q5130572) (← links)
- Dynamic programming for graphs on surfaces (Q5501962) (← links)
- (Q5743390) (← links)
- Slightly Superexponential Parameterized Problems (Q5745079) (← links)
- Correlation clustering and two-edge-connected augmentation for planar graphs (Q6046943) (← links)
- Upward book embeddability of \(st\)-graphs: complexity and algorithms (Q6066758) (← links)
- An ETH-Tight Exact Algorithm for Euclidean TSP (Q6156029) (← links)
- Counting cycles on planar graphs in subexponential time (Q6182684) (← links)
