( en | de | ru )

 

Disambiguation of "Pandit, Supantha"

Author of the publication

copydeleteadd this publication to your clipboard
Collaborative Dispersion by Silent Robots.

, , , and . SSS, volume 13751 of Lecture Notes in Computer Science, page 254-269. Springer, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Madhukar Pandit

Madhukar Pandit

Madhukar Pandit

Krishna Pandit

Madhukar Pandit

 

Other publications of authors with the same name

Faster Approximation for Maximum Independent Set on Unit Disk Graph., , and . CoRR, (2016)Hardness Results and Approximation Schemes for Discrete Packing and Domination Problems., , and . COCOA, volume 11346 of Lecture Notes in Computer Science, page 421-435. Springer, (2018)The balanced connected subgraph problem for geometric intersection graphs., , , and . Theor. Comput. Sci., (2022)Covering and packing of triangles intersecting a straight line.. Discret. Appl. Math., (2022)Variations of largest rectangle recognition amidst a bichromatic point set., , , and . Discret. Appl. Math., (2020)Distributed Connected Dominating Sets in Unit Square and Disk Graphs., , and . TAMC, volume 13571 of Lecture Notes in Computer Science, page 346-358. Springer, (2022)Minimum Membership Covering and Hitting., and . WALCOM, volume 11355 of Lecture Notes in Computer Science, page 394-406. Springer, (2019)Exact Algorithms and Hardness Results for Geometric Red-Blue Hitting Set Problem., , and . FAW, volume 13461 of Lecture Notes in Computer Science, page 176-191. Springer, (2022)On the Hardness of Some Geometric Optimization Problems with Rectangles.. COCOA, volume 11949 of Lecture Notes in Computer Science, page 425-436. Springer, (2019)Covering segments with axis-parallel unit squares., , , and . CoRR, (2016)