Pages that link to "Item:Q4828563"
From MaRDI portal
The following pages link to Parameterized complexity: exponential speed-up for planar graph problems (Q4828563):
Displayed 24 items.
- A strengthened analysis of an algorithm for dominating set in planar graphs (Q415281) (← links)
- Catalan structures and dynamic programming in \(H\)-minor-free graphs (Q440008) (← links)
- Subexponential parameterized algorithms (Q458457) (← links)
- Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs (Q764332) (← links)
- Linearity of grid minors in treewidth with applications through bidimensionality (Q949776) (← links)
- Parameterized algorithmics for linear arrangement problems (Q1003461) (← links)
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348) (← links)
- A graph-based algorithm for the multi-objective optimization of gene regulatory networks (Q1651738) (← links)
- Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs (Q1764807) (← links)
- Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions (Q1957653) (← links)
- On the parameterized complexity of the expected coverage problem (Q2135628) (← links)
- Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms (Q2238592) (← links)
- Co-Roman domination in graphs (Q2344075) (← links)
- Fixed-parameter approximation: conceptual framework and approximability results (Q2379929) (← links)
- Linear kernels for \(k\)-tuple and liar's domination in bounded genus graphs (Q2403794) (← links)
- On the vertex cover \(P_3\) problem parameterized by treewidth (Q2410093) (← links)
- A refined search tree technique for dominating set on planar graphs (Q2575830) (← links)
- Genus characterizes the complexity of certain graph problems: Some tight results (Q2641866) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- Ranking and Drawing in Subexponential Time (Q3000521) (← links)
- Bidimensionality and Kernels (Q3387764) (← links)
- (Q5005145) (← links)
- On the Parameterized Complexity of the Expected Coverage Problem (Q5042243) (← links)
- Decomposition of Map Graphs with Applications. (Q5091217) (← links)