Minati De

Abhiruk Lahiri

Comput. Geom., August, 2023

Online Dominating Set and Coloring for Geometric Intersection Graphs.

[BibT_eX]

[DOI]

Sambhav Khurana

CoRR, 2023

Online Class Cover Problem.

[BibT_eX]

[DOI]

Anil Maheshwari

Ratnadip Mandal

CoRR, 2023

Online Geometric Covering and Piercing.

[BibT_eX]

[DOI]

Saksham Jain

Sarat Varma Kallepalli

CoRR, 2023

Online Geometric Hitting Set and Set Cover Beyond Unit Balls in ℝ2.

[BibT_eX]

[DOI]

Ratnadip Mandal

CoRR, 2023

Online Hitting of Unit Balls and Hypercubes in ℝs using Points from ℤd.

[BibT_eX]

[DOI]

CoRR, 2023

Online Dominating Set and Coloring.

[BibT_eX]

[DOI]

Sambhav Khurana

Proceedings of the Combinatorial Optimization and Applications, 2023

2022

Online Piercing of Geometric Objects.

[BibT_eX]

[DOI]

Saksham Jain

Sarat Varma Kallepalli

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

Hitting Geometric Objects Online via Points in $\mathbb {Z}^d$.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

2021

Online Dominating Set and Independent Set.

[BibT_eX]

[DOI]

Sambhav Khurana

CoRR, 2021

Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons.

[BibT_eX]

[DOI]

Michael T. Goodrich

Algorithmica, 2021

2020

Range assignment of base-stations maximizing coverage area without interference.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Constant work-space algorithms for facility location problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Variations of largest rectangle recognition amidst a bichromatic point set.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

2019

A Lower Bound on the Growth Constant of Polyaboloes on the Tetrakis Lattice.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

2018

Brief Announcement: Approximation Schemes for Geometric Coverage Problems.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Guarding Polyhedral Terrain by k-Watchtowers.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

Approximation Schemes for Geometric Coverage Problems.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Computing Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons.

[BibT_eX]

[DOI]

Michael T. Goodrich

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017

Circular Separation Dimension of a Subclass of Planar Graphs.

[BibT_eX]

[DOI]

Arpitha P. Bharathi

Abhiruk Lahiri

Discret. Math. Theor. Comput. Sci., 2017

Rectilinear path problems in restricted memory setup.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Range Assignment of Base-Stations Maximizing Coverage Area without Interference.

[BibT_eX]

Ankush Acharyya

Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

Demand Hitting and Covering of Intervals.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2015

Prune-and-search with limited workspace.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2015

Approximation algorithms for maximum independent set of a unit disk graph.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

2014

In-place algorithms for computing a largest clique in geometric intersection graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Facility location problems in the constant work-space read-only memory model.

[BibT_eX]

[DOI]

CoRR, 2014

Back-Up 2-Center on a Path/Tree/Cycle/Unicycle.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models.

[BibT_eX]

[DOI]

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013

Approximation Algorithms for a Variant of discrete Piercing Set Problem for Unit Disks.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2013

An in-place min-max priority search tree.

[BibT_eX]

[DOI]

Comput. Geom., 2013

2012

Convex Hull and Linear Programming in Read-only Setup with Limited Work-space

[BibT_eX]

[DOI]

CoRR, 2012

Space-efficient Algorithms for Visibility Problems in Simple Polygon

[BibT_eX]

[DOI]

Anil Maheshwari

CoRR, 2012

Minimum Enclosing Circle with Few Extra Variables.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2011

Inplace Algorithm for Priority Search Tree and its use in Computing Largest Empty Axis-Parallel Rectangle

[BibT_eX]

[DOI]

CoRR, 2011

Space-efficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D.

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

An In-Place Priority Search Tree.

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks.

[BibT_eX]

[DOI]

Gautam K. Das