Pages that link to "Item:Q5326561"

The following pages link to Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth (Q5326561):

Displaying 20 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)
• Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
• Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm (Q1699613) (← links)
• Algebraic methods in the congested clique (Q2010605) (← links)
• Faster deterministic \textsc{Feedback Vertex Set} (Q2015151) (← links)
• Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions (Q2343089) (← links)
• Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) (← links)
• Solving Hamiltonian cycle by an EPT algorithm for a non-sparse parameter (Q2357164) (← links)
• Hitting forbidden subgraphs in graphs of bounded treewidth (Q2407089) (← links)
• Linear kernels for outbranching problems in sparse digraphs (Q2408200) (← links)
• Solving SCS for bounded length strings in fewer than \(2^n\) steps (Q2448115) (← links)
• The role of planarity in connectivity problems parameterized by treewidth (Q2514121) (← links)
• A $c^k n$ 5-Approximation Algorithm for Treewidth (Q2799353) (← links)
• Deterministic Algorithms for the Independent Feedback Vertex Set Problem (Q2946071) (← links)
• (Q5009461) (← links)
• (Q5009490) (← links)
• (Q5111296) (← links)
• Contraction-Bidimensionality of Geometric Intersection Graphs (Q5111864) (← links)