The following pages link to (Q3044360):
Displaying 22 items.
- Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
- Weighted maximum-clique transversal sets of graphs (Q410660) (← links)
- The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← links)
- Improved algorithms and complexity results for power domination in graphs (Q958210) (← links)
- Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm (Q967316) (← links)
- Dynamic programming and planarity: improved tree-decomposition based algorithms (Q972340) (← links)
- The parameterized complexity of the induced matching problem (Q1028465) (← links)
- Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs (Q1764807) (← links)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- Star partitions on graphs (Q2010910) (← links)
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center (Q2422740) (← links)
- On independent sets and bicliques in graphs (Q2428684) (← links)
- Tree decompositions of graphs: saving memory in dynamic programming (Q2465936) (← links)
- Counting Maximal Independent Sets in Subcubic Graphs (Q2891379) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- Dual parameterization and parameterized approximability of subset graph problems (Q2969972) (← links)
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms (Q3508575) (← links)
- Branch decompositions and minor containment (Q4446913) (← links)
- Graphs, branchwidth, and tangles! Oh my! (Q4667714) (← links)
- On the k-rainbow domination in graphs with bounded tree-width (Q5061680) (← links)
- (Q5136270) (← links)
- Tree-decompositions of small pathwidth (Q5916128) (← links)
