The following pages link to (Q3822197):
Displaying 37 items.
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Monadic second-order evaluations on tree-decomposable graphs (Q685464) (← links)
- Efficient sets in graphs (Q686251) (← links)
- The efficiency of AC graphs (Q686253) (← links)
- Locating facilities which interact: Some solvable cases (Q689235) (← links)
- On the computational complexity of upper fractional domination (Q753848) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Hardness results and approximation algorithms for (weighted) paired-domination in graphs (Q1034626) (← links)
- Dominating cycles in Halin graphs (Q1174137) (← links)
- On minimum dominating sets with minimum intersection (Q1174139) (← links)
- Algorithms for recognition of regular properties and decomposition of recursive graph families (Q1179734) (← links)
- Complexity of path-forming games (Q1210546) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- Restrained domination in graphs (Q1301655) (← links)
- A recurrence template for several parameters in series-parallel graphs (Q1336624) (← links)
- Regularity and locality in \(k\)-terminal graphs (Q1336630) (← links)
- On Halin subgraphs and supergraphs (Q1343152) (← links)
- The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs (Q1575712) (← links)
- Efficiently parallelizable problems on a class of decomposable graphs (Q1765226) (← links)
- Nearly perfect sets in graphs (Q1842165) (← links)
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs (Q1899445) (← links)
- Cross-series-parallel digraphs (Q1983112) (← links)
- Roman \(\{2\}\)-domination problem in graphs (Q2118251) (← links)
- The \(k\)-power domination problem in weighted trees (Q2290632) (← links)
- Scheduling of pipelined operator graphs (Q2434287) (← links)
- Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
- (Q2741323) (← links)
- Myhill-Nerode Methods for Hypergraphs (Q2872101) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Irredundance (Q3384112) (← links)
- MAXIMUM INDEPENDENT, MINIMALLY REDUNDANT SETS IN SERIES-PARALLEL GRAPHS (Q4288050) (← links)
- Parametric problems on graphs of bounded tree-width (Q5056150) (← links)
- Optimal parametric search on graphs of bounded tree-width (Q5056174) (← links)
- Two strikes against perfect phylogeny (Q5204323) (← links)
- The strong domination problem in block graphs and proper interval graphs (Q5207497) (← links)
- The pagenumber of \(k\)-trees is \(O(k)\) (Q5931789) (← links)
- \(k\)-power domination in block graphs (Q5963656) (← links)
