Parameterized Complexity of Independence and Domination on Geometric Graphs
From MaRDI portal
Recommendations
- The parameterized complexity of geometric graph isomorphism
- The parameterized complexity of geometric graph isomorphism
- Mathematical Foundations of Computer Science 2004
- Parameterized Complexity for Domination Problems on Degenerate Graphs
- The complexity of dominating set in geometric intersection graphs
- Independence and domination in polygon graphs
- scientific article; zbMATH DE number 7033848
- Parameterized complexity of independent set in H-free graphs
- Parameterized complexity of generalized domination problems
- Parameterized Complexity of Generalized Domination Problems
Cited in
(44)- On the parameterized complexity of multiple-interval graph problems
- Multivariate complexity analysis of geometric \textsc{Red Blue Set Cover}
- The complexity of dominating set in geometric intersection graphs
- Dominating set of rectangles intersecting a straight line
- Exact multi-covering problems with geometric sets
- A tight analysis of geometric local search
- Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes
- Parameterized computational geometry via decomposition theorems
- Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames
- The homogeneous broadcast problem in narrow and wide strips. I: Algorithms
- The homogeneous broadcast problem in narrow and wide strips. II: Lower bounds
- The parameterized complexity of stabbing rectangles
- Parameterized domination in circle graphs
- Efficient sub-5 approximations for minimum dominating sets in unit disk graphs
- Grundy Coloring and friends, half-graphs, bicliques
- Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs
- A Purely Democratic Characterization of W[1]
- Parameterized Complexity of Stabbing Rectangles and Squares in the Plane
- Geometric separation and exact solutions for the parameterized independent set problem on disk graphs
- Approximating dominating set on intersection graphs of rectangles and L-frames
- On Geometric Set Cover for Orthants
- Combinatorics of local search: an optimal 4-local Hall's theorem for planar graphs
- The dominating set problem in geometric intersection graphs
- Optimality of geometric local search
- Limits of local search: quality and efficiency
- Domination in Geometric Intersection Graphs
- Optimality program in segment and string graphs
- Geometric dominating-set and set-cover via local-search
- Maximum bipartite subgraphs of geometric intersection graphs
- ETH-tight algorithm for cycle packing on unit disk graphs
- Parameterized and approximation algorithms for coverings points with segments in the plane
- Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy
- Sidestepping barriers for dominating set in parameterized complexity
- Structure of polynomial-time approximation
- Color coding for the fragment-based docking, design and equilibrium statistics of protein-binding ssRNAs
- Parameterized approximation for maximum weight independent set of rectangles and segments
- Dimension-free parameterized approximation schemes for hybrid clustering
- Multicut problems in embedded graphs: the dependency of complexity on the demand pattern
- Approximation and parameterized algorithms for covering with disks of two types of radii
- Crossing and independent families among polygons
- Hardness of SetCover reoptimization
- Parameterized complexity of independent set in H-free graphs
- Parameterized dominating set problem in chordal graphs: Complexity and lower bound
- W-hierarchies defined by symmetric gates
This page was built for publication: Parameterized Complexity of Independence and Domination on Geometric Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3499733)
