Pradeesha Ashok

Inf. Process. Lett., 2024

2023

Colouring a dominating set without conflicts: <i>q</i>-Subset Square Colouring.

[BibT_eX]

[DOI]

Theor. Comput. Sci., October, 2023

Coloring a Dominating Set Without Conflicts: q-Subset Square Coloring.

[BibT_eX]

[DOI]

CoRR, 2023

Burn and Win.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

2022

Exact Multi-Covering Problems with Geometric Sets.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2022

Geometric separability using orthogonal objects.

[BibT_eX]

[DOI]

Abidha V. P

Inf. Process. Lett., 2022

Structural parameterization for minimum conflict-free colouring.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Polynomial Kernels for Generalized Domination Problems.

[BibT_eX]

[DOI]

Rajath Rao

Avi Tomar

CoRR, 2022

Coloring a Dominating Set Without Conflicts: q-Subset Square Coloring.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2022

2020

Local search strikes again: PTAS for variants of geometric covering and packing.

[BibT_eX]

[DOI]

Aniket Basu Roy

J. Comb. Optim., 2020

Minimum Conflict Free Colouring Parameterized by Treewidth.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019

FPT Algorithms for Conflict-free Coloring of Graphs and Chromatic Terrain Guarding.

[BibT_eX]

[DOI]

CoRR, 2019

Efficient Guarding of Polygons and Terrains.

[BibT_eX]

[DOI]

Meghana M. Reddy

Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019

2018

Exact Algorithms for Terrain Guarding.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2018

Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

2017

Parameterized complexity of Strip Packing and Minimum Volume Packing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Multivariate Complexity Analysis of Geometric Red Blue Set Cover.

[BibT_eX]

[DOI]

Saket Saurabh

Algorithmica, 2017

2016

Selection Lemmas for Various Geometric Objects.

[BibT_eX]

[DOI]

Ninad Rajgopal

Int. J. Comput. Geom. Appl., 2016

Parameterized Complexity of Red Blue Set Cover for Lines.

[BibT_eX]

[DOI]

Saket Saurabh

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015

On strong centerpoints.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

Multivariate Complexity Analysis of Geometric {\sc Red Blue Set Cover}.

[BibT_eX]

[DOI]

Saket Saurabh

CoRR, 2015

Exact and FPT Algorithms for Max-Conflict Free Coloring in Hypergraphs.

[BibT_eX]

[DOI]

Aditi Dudeja

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Unique Covering Problems with Geometric Sets.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014

Small strong epsilon nets.

[BibT_eX]

[DOI]

Umair Azmi

B. V. Subramanya Bharadwaj

Comput. Geom., 2014

2013

Hitting and Piercing Rectangles Induced by a Point Set.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012

On Piercing (Pseudo)Lines and Boxes.

[BibT_eX]

[DOI]

Chintan Rao

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2010

Small strong epsilon nets.

[BibT_eX]

[DOI]