Supantha Pandit

Sanjib Sadhu

CoRR, 2024

2023

Burning and w-burning of geometric graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., September, 2023

Red-Blue Rectangular Annulus Cover Problem.

[BibT_eX]

[DOI]

Sukanya Maji

Sanjib Sadhu

Proceedings of the Frontiers of Algorithmics - 17th International Joint Conference, 2023

2022

Pebble guided optimal treasure hunt in anonymous graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

The balanced connected subgraph problem for geometric intersection graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Covering and packing of triangles intersecting a straight line.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

The balanced connected subgraph problem.

[BibT_eX]

[DOI]

Sujoy Bhore

Sourav Chakraborty

Satyabrata Jana

Discret. Appl. Math., 2022

Distributed Connected Dominating Sets in Unit Square and Disk Graphs.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2022

Collaborative Dispersion by Silent Robots.

[BibT_eX]

[DOI]

Partha Sarathi Mandal

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2022

Exact Algorithms and Hardness Results for Geometric Red-Blue Hitting Set Problem.

[BibT_eX]

[DOI]

Proceedings of the Frontiers of Algorithmic Wisdom, 2022

Distributed Dominating Sets in Interval Graphs.

[BibT_eX]

[DOI]

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

2021

Minimum Membership Covering and Hitting.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Dominating set of rectangles intersecting a straight line.

[BibT_eX]

[DOI]

J. Comb. Optim., 2021

On the Geometric Red-Blue Set Cover Problem.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2021

Distributed Independent Sets in Interval and Segment Intersection Graphs.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2021

Constrained Hitting Set Problem with Intervals.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

Balanced Connected Graph Partition.

[BibT_eX]

[DOI]

Satyabrata Jana

Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020

Covering and packing of rectilinear subdivision.

[BibT_eX]

[DOI]

Satyabrata Jana

Theor. Comput. Sci., 2020

Maximum independent and disjoint coverage.

[BibT_eX]

[DOI]

Amit Kumar Dhar

Jagpreet Singh

J. Comb. Optim., 2020

Variations of largest rectangle recognition amidst a bichromatic point set.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Packing and Covering with Segments.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

2019

Optimal deterministic distributed algorithms for maximal independent set in geometric graphs.

[BibT_eX]

[DOI]

Anisur Rahaman Molla

J. Parallel Distributed Comput., 2019

Covering segments with unit squares.

[BibT_eX]

[DOI]

Comput. Geom., 2019

On the Hardness of Some Geometric Optimization Problems with Rectangles.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2019

New Results on a Family of Geometric Hitting Set Problems in the Plane.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2019

2018

Hardness Results and Approximation Schemes for Discrete Packing and Domination Problems.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2018

2017

Faster approximation for maximum independent set on unit disk graph.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2017

Covering Points: Minimizing the Maximum Depth.

[BibT_eX]

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

2016

Geometric hitting set, set cover and generalized class cover problems with half-strips in opposite directions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Covering segments with axis-parallel unit squares.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Covering, Hitting, Piercing and Packing Rectangles Intersecting an Inclined Line.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2015

2014

Generalized Class Cover Problem with Axis-Parallel Strips.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

Geometric Hitting Set and Set Cover Problem with Half-Strips.

[BibT_eX]

[DOI]