Pages that link to "Item:Q3499733"

The following pages link to Parameterized Complexity of Independence and Domination on Geometric Graphs (Q3499733):

Displaying 33 items.

• Limits of local search: quality and efficiency (Q527441) (← links)
• Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy (Q690460) (← links)
• Structure of polynomial-time approximation (Q692893) (← links)
• Parameterized complexity of independent set in H-free graphs (Q786045) (← links)
• Parameterized dominating set problem in chordal graphs: Complexity and lower bound (Q839675) (← links)
• W-hierarchies defined by symmetric gates (Q970108) (← links)
• On the parameterized complexity of multiple-interval graph problems (Q1001898) (← links)
• Multivariate complexity analysis of geometric \textsc{Red Blue Set Cover} (Q1679222) (← links)
• The complexity of dominating set in geometric intersection graphs (Q1737591) (← links)
• Dominating set of rectangles intersecting a straight line (Q2025079) (← links)
• Exact multi-covering problems with geometric sets (Q2075389) (← links)
• A tight analysis of geometric local search (Q2117344) (← links)
• Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes (Q2140500) (← links)
• Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames (Q2331213) (← links)
• The homogeneous broadcast problem in narrow and wide strips. I: Algorithms (Q2415369) (← links)
• The homogeneous broadcast problem in narrow and wide strips. II: Lower bounds (Q2415370) (← links)
• The parameterized complexity of stabbing rectangles (Q2428672) (← links)
• Parameterized domination in circle graphs (Q2441539) (← links)
• Efficient sub-5 approximations for minimum dominating sets in unit disk graphs (Q2453164) (← links)
• Grundy Coloring and friends, half-graphs, bicliques (Q2700380) (← links)
• Domination When the Stars Are Out (Q3012826) (← links)
• A Purely Democratic Characterization of W[1] (Q3503582) (← links)
• Parameterized Complexity of Stabbing Rectangles and Squares in the Plane (Q3605506) (← links)
• Geometric separation and exact solutions for the parameterized independent set problem on disk graphs (Q4815769) (← links)
• Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames (Q5005138) (← links)
• On Geometric Set Cover for Orthants (Q5075763) (← links)
• (Q5111691) (← links)
• The Dominating Set Problem in Geometric Intersection Graphs (Q5111873) (← links)
• (Q5115816) (← links)
• Domination in Geometric Intersection Graphs (Q5458576) (← links)
• Optimality program in segment and string graphs (Q5920196) (← links)
• Geometric dominating-set and set-cover via local-search (Q6114477) (← links)
• Maximum bipartite subgraphs of geometric intersection graphs (Q6552516) (← links)