| Publication | Date of Publication | Type |
|---|
| On the parameterized complexity of cosecure domination | 2026-02-26 | Paper |
| (Independent) Roman domination parameterized by distance to cluster | 2025-11-14 | Paper |
| Burning path-like and clique-like graphs | 2025-11-11 | Paper |
Burn and win
Theoretical Computer Science | 2025-07-21 | Paper |
| Parameterized complexity of coupon coloring of graphs | 2025-06-20 | Paper |
Red blue set cover problem on axis-parallel hyperplanes and other objects
Information Processing Letters | 2024-06-07 | Paper |
Burn and win
Lecture Notes in Computer Science | 2023-12-22 | Paper |
Colouring a dominating set without conflicts: \(q\)-subset square colouring
Theoretical Computer Science | 2023-10-17 | Paper |
| Coloring a dominating set without conflicts: \(q\)-subset square coloring | 2022-11-11 | Paper |
Structural parameterization for minimum conflict-free colouring
Discrete Applied Mathematics | 2022-08-04 | Paper |
Geometric separability using orthogonal objects
Information Processing Letters | 2022-04-07 | Paper |
Exact multi-covering problems with geometric sets
Theory of Computing Systems | 2022-02-14 | Paper |
| Minimum conflict free colouring parameterized by treewidth | 2020-07-21 | Paper |
Local search strikes again: PTAS for variants of geometric covering and packing
Journal of Combinatorial Optimization | 2020-02-03 | Paper |
| Efficient guarding of polygons and terrains | 2019-10-11 | Paper |
Exact algorithms for terrain guarding
ACM Transactions on Algorithms | 2018-11-13 | Paper |
| Exact algorithms for terrain guarding | 2018-08-13 | Paper |
Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs
SIAM Journal on Discrete Mathematics | 2018-06-05 | Paper |
Multivariate complexity analysis of geometric \textsc{Red Blue Set Cover}
Algorithmica | 2017-11-09 | Paper |
Local search strikes again: PTAS for variants of geometric covering and packing
Lecture Notes in Computer Science | 2017-10-23 | Paper |
Parameterized complexity of strip packing and minimum volume packing
Theoretical Computer Science | 2017-01-09 | Paper |
Selection lemmas for various geometric objects
International Journal of Computational Geometry & Applications | 2016-10-26 | Paper |
Parameterized complexity of \textsc{Red Blue Set Cover} for lines
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Exact and FPT algorithms for MAX-conflict free coloring in hypergraphs
Algorithms and Computation | 2016-01-11 | Paper |
Unique covering problems with geometric sets
Lecture Notes in Computer Science | 2015-10-29 | Paper |
On strong centerpoints
Information Processing Letters | 2014-12-15 | Paper |
Small strong epsilon nets
Computational Geometry | 2014-08-13 | Paper |
Hitting and Piercing Rectangles Induced by a Point Set
Lecture Notes in Computer Science | 2013-06-11 | Paper |
