Structural parameterization for minimum conflict-free colouring | 0 | 0.34 | 2022 |
Local search strikes again: PTAS for variants of geometric covering and packing | 2 | 0.39 | 2020 |
Minimum Conflict Free Colouring Parameterized by Treewidth. | 0 | 0.34 | 2020 |
Efficient Guarding of Polygons and Terrains. | 0 | 0.34 | 2019 |
FPT Algorithms for Conflict-free Coloring of Graphs and Chromatic Terrain Guarding. | 0 | 0.34 | 2019 |
Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs. | 0 | 0.34 | 2018 |
Exact Algorithms for Terrain Guarding. | 0 | 0.34 | 2018 |
Multivariate Complexity Analysis of Geometric Red Blue Set Cover. | 0 | 0.34 | 2017 |
Parameterized complexity of Strip Packing and Minimum Volume Packing. | 0 | 0.34 | 2017 |
Parameterized Complexity of Red Blue Set Cover for Lines. | 0 | 0.34 | 2016 |
Exact and FPT Algorithms for Max-Conflict Free Coloring in Hypergraphs. | 1 | 0.38 | 2015 |
Multivariate Complexity Analysis of Geometric {\sc Red Blue Set Cover} | 1 | 0.37 | 2015 |
Selection Lemmas for various geometric objects. | 0 | 0.34 | 2014 |
On strong centerpoints. | 0 | 0.34 | 2013 |
Hitting and Piercing Rectangles Induced by a Point Set. | 1 | 0.36 | 2013 |
On Piercing (Pseudo)Lines and Boxes. | 1 | 0.43 | 2012 |
Small strong epsilon nets | 5 | 0.46 | 2010 |