Pages that link to "Item:Q2494820"

The following pages link to Exact algorithms for the Hamiltonian cycle problem in planar graphs (Q2494820):

Displaying 10 items.

• Catalan structures and dynamic programming in \(H\)-minor-free graphs (Q440008) (← links)
• Subexponential parameterized algorithms (Q458457) (← links)
• Sublinear separators, fragility and subexponential expansion (Q896068) (← links)
• Exploiting planarity in separation routines for the symmetric traveling salesman problem (Q951094) (← links)
• Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions (Q1957653) (← links)
• Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs (Q2282284) (← links)
• Good triangulations yield good tours (Q2384914) (← links)
• The homogeneous broadcast problem in narrow and wide strips. I: Algorithms (Q2415369) (← links)
• On the Exact Complexity of Hamiltonian Cycle and q-Colouring in Disk Graphs (Q5283382) (← links)
• An ETH-Tight Exact Algorithm for Euclidean TSP (Q6156029) (← links)