Pradeesha Ashok

Orcid: 0000-0003-2174-0051

According to our database1, Pradeesha Ashok authored at least 27 papers between 2010 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Colouring a dominating set without conflicts: <i>q</i>-Subset Square Colouring.
Theor. Comput. Sci., October, 2023

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

Burn and Win.
Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

2022
Exact Multi-Covering Problems with Geometric Sets.
Theory Comput. Syst., 2022

Geometric separability using orthogonal objects.
Inf. Process. Lett., 2022

Structural parameterization for minimum conflict-free colouring.
Discret. Appl. Math., 2022

Polynomial Kernels for Generalized Domination Problems.
CoRR, 2022

Red Blue Set Cover Problem on Axis-Parallel Hyperplanes and Other Objects.
CoRR, 2022

Coloring a Dominating Set Without Conflicts: q-Subset Square Coloring.
Proceedings of the Computer Science - Theory and Applications, 2022

2020
Local search strikes again: PTAS for variants of geometric covering and packing.
J. Comb. Optim., 2020

Minimum Conflict Free Colouring Parameterized by Treewidth.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

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

Efficient Guarding of Polygons and Terrains.
Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019

2018
Exact Algorithms for Terrain Guarding.
ACM Trans. Algorithms, 2018

Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs.
SIAM J. Discret. Math., 2018

2017
Parameterized complexity of Strip Packing and Minimum Volume Packing.
Theor. Comput. Sci., 2017

Multivariate Complexity Analysis of Geometric Red Blue Set Cover.
Algorithmica, 2017

2016
Selection Lemmas for Various Geometric Objects.
Int. J. Comput. Geom. Appl., 2016

Parameterized Complexity of Red Blue Set Cover for Lines.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015
On strong centerpoints.
Inf. Process. Lett., 2015

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

Exact and FPT Algorithms for Max-Conflict Free Coloring in Hypergraphs.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Unique Covering Problems with Geometric Sets.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014
Small strong epsilon nets.
Comput. Geom., 2014

2013
Hitting and Piercing Rectangles Induced by a Point Set.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012
On Piercing (Pseudo)Lines and Boxes.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2010
Small strong epsilon nets.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010


  Loading...