Pages that link to "Item:Q5326561"
From MaRDI portal
The following pages link to Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth (Q5326561):
Displaying 11 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)
- (Q5009461) (← links)
- (Q5009490) (← links)
- (Q5111296) (← links)
- Contraction-Bidimensionality of Geometric Intersection Graphs (Q5111864) (← links)
