Supantha Pandit

Orcid: 0000-0002-4908-7165

According to our database1, Supantha Pandit authored at least 36 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Constrained hitting set problem with intervals: Hardness, FPT and approximation algorithms.
Theor. Comput. Sci., 2024

Collaborative dispersion by silent robots.
J. Parallel Distributed Comput., 2024

Optimal Dispersion of Silent Robots in a Ring.
CoRR, 2024

Generalized Red-Blue Circular Annulus Cover Problem.
CoRR, 2024

Generalized class cover problem with axis-parallel strips.
Comput. Geom., 2024

2023
Burning and w-burning of geometric graphs.
Discret. Appl. Math., September, 2023

Red-Blue Rectangular Annulus Cover Problem.
Proceedings of the Frontiers of Algorithmics - 17th International Joint Conference, 2023

2022
Pebble guided optimal treasure hunt in anonymous graphs.
Theor. Comput. Sci., 2022

The balanced connected subgraph problem for geometric intersection graphs.
Theor. Comput. Sci., 2022

Covering and packing of triangles intersecting a straight line.
Discret. Appl. Math., 2022

The balanced connected subgraph problem.
Discret. Appl. Math., 2022

Distributed Connected Dominating Sets in Unit Square and Disk Graphs.
Proceedings of the Theory and Applications of Models of Computation, 2022

Exact Algorithms and Hardness Results for Geometric Red-Blue Hitting Set Problem.
Proceedings of the Frontiers of Algorithmic Wisdom, 2022

Distributed Dominating Sets in Interval Graphs.
Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

2021
Minimum Membership Covering and Hitting.
Theor. Comput. Sci., 2021

Dominating set of rectangles intersecting a straight line.
J. Comb. Optim., 2021

On the Geometric Red-Blue Set Cover Problem.
Proceedings of the WALCOM: Algorithms and Computation, 2021

Distributed Independent Sets in Interval and Segment Intersection Graphs.
Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs.
Proceedings of the Structural Information and Communication Complexity, 2021

Constrained Hitting Set Problem with Intervals.
Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

Balanced Connected Graph Partition.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020
Covering and packing of rectilinear subdivision.
Theor. Comput. Sci., 2020

Maximum independent and disjoint coverage.
J. Comb. Optim., 2020

Variations of largest rectangle recognition amidst a bichromatic point set.
Discret. Appl. Math., 2020

Packing and Covering with Segments.
Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

2019
Optimal deterministic distributed algorithms for maximal independent set in geometric graphs.
J. Parallel Distributed Comput., 2019

Covering segments with unit squares.
Comput. Geom., 2019

On the Hardness of Some Geometric Optimization Problems with Rectangles.
Proceedings of the Combinatorial Optimization and Applications, 2019

New Results on a Family of Geometric Hitting Set Problems in the Plane.
Proceedings of the Combinatorial Optimization and Applications, 2019

2018
Hardness Results and Approximation Schemes for Discrete Packing and Domination Problems.
Proceedings of the Combinatorial Optimization and Applications, 2018

2017
Faster approximation for maximum independent set on unit disk graph.
Inf. Process. Lett., 2017

Covering Points: Minimizing the Maximum Depth.
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.
Discret. Appl. Math., 2016

Covering segments with axis-parallel unit squares.
CoRR, 2016

2015
Covering, Hitting, Piercing and Packing Rectangles Intersecting an Inclined Line.
Proceedings of the Combinatorial Optimization and Applications, 2015

2014
Geometric Hitting Set and Set Cover Problem with Half-Strips.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014


  Loading...