The following pages link to (Q2921717):
Displaying 50 items.
- Complexity of metric dimension on planar graphs (Q314819) (← links)
- New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
- Catalan structures and dynamic programming in \(H\)-minor-free graphs (Q440008) (← links)
- Subexponential parameterized algorithms (Q458457) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs (Q476424) (← links)
- A linear kernel for a planar connected dominating set (Q534569) (← links)
- The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← links)
- Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs (Q764332) (← links)
- Contraction bidimensionality of geometric intersection graphs (Q832527) (← links)
- How to catch marathon cheaters: new approximation algorithms for tracking paths (Q832889) (← links)
- Quickly deciding minor-closed parameters in general graphs (Q854832) (← links)
- Experiments on data reduction for optimal domination in networks (Q863574) (← links)
- Linearity of grid minors in treewidth with applications through bidimensionality (Q949776) (← links)
- Improved algorithms and complexity results for power domination in graphs (Q958210) (← links)
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results (Q987496) (← links)
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348) (← links)
- The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
- On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability (Q1680511) (← links)
- An FPT 2-approximation for tree-cut decomposition (Q1702123) (← links)
- Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
- Subexponential fixed-parameter algorithms for partial vector domination (Q1751177) (← links)
- Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications (Q1759678) (← links)
- Fast minor testing in planar graphs (Q1759679) (← links)
- Subexponential algorithms for partial cover problems (Q1944141) (← links)
- Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions (Q1957653) (← links)
- On some tractable and hard instances for partial incentives and target set selection (Q2010927) (← links)
- Local search is a PTAS for feedback vertex set in minor-free graphs (Q2197532) (← links)
- Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (Q2266936) (← links)
- Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor (Q2284742) (← links)
- Finding, hitting and packing cycles in subexponential time on unit disk graphs (Q2334507) (← links)
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters (Q2453563) (← links)
- Tree decompositions of graphs: saving memory in dynamic programming (Q2465936) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- Improved Approximations for Hard Optimization Problems via Problem Instance Classification (Q3003467) (← links)
- Subexponential Fixed-Parameter Algorithms for Partial Vector Domination (Q3195339) (← links)
- Bidimensionality and Kernels (Q3387764) (← links)
- Towards the Graph Minor Theorems for Directed Graphs (Q3449461) (← links)
- A Linear Kernel for Planar Feedback Vertex Set (Q3503587) (← links)
- Complexity and Approximation Results for the Connected Vertex Cover Problem (Q3508568) (← links)
- (Q4972036) (← links)
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths (Q5042453) (← links)
- A Retrospective on (Meta) Kernelization (Q5042460) (← links)
- (Q5090497) (← links)
- Decomposition of Map Graphs with Applications. (Q5091217) (← links)
- Contraction-Bidimensionality of Geometric Intersection Graphs (Q5111864) (← links)
- Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems (Q5210996) (← links)
- (Q5743379) (← links)
- (Q5743499) (← links)
