The following pages link to Pradeesha Ashok (Q396468):
Displaying 22 items.
- Small strong epsilon nets (Q396471) (← links)
- On strong centerpoints (Q483053) (← links)
- Parameterized complexity of strip packing and minimum volume packing (Q501656) (← links)
- Minimum conflict free colouring parameterized by treewidth (Q779250) (← links)
- Multivariate complexity analysis of geometric \textsc{Red Blue Set Cover} (Q1679222) (← links)
- Exact multi-covering problems with geometric sets (Q2075389) (← links)
- Coloring a dominating set without conflicts: \(q\)-subset square coloring (Q2097209) (← links)
- Geometric separability using orthogonal objects (Q2122791) (← links)
- Structural parameterization for minimum conflict-free colouring (Q2161251) (← links)
- Efficient guarding of polygons and terrains (Q2327084) (← links)
- Parameterized Complexity of Red Blue Set Cover for Lines (Q2802930) (← links)
- Selection Lemmas for Various Geometric Objects (Q2828788) (← links)
- Unique Covering Problems with Geometric Sets (Q3196414) (← links)
- Exact and FPT Algorithms for Max-Conflict Free Coloring in Hypergraphs (Q3459868) (← links)
- Exact Algorithms for Terrain Guarding (Q4554352) (← links)
- (Q4580083) (← links)
- Hitting and Piercing Rectangles Induced by a Point Set (Q4925240) (← links)
- Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs (Q5745127) (← links)
- Local search strikes again: PTAS for variants of geometric covering and packing (Q5919362) (← links)
- Local search strikes again: PTAS for variants of geometric covering and packing (Q5920143) (← links)
- Colouring a dominating set without conflicts: \(q\)-subset square colouring (Q6077071) (← links)
- Red blue set cover problem on axis-parallel hyperplanes and other objects (Q6551707) (← links)
