Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Pandit, Supantha
46  Ergebnisse:
Personensuche X
?
1

Generalized class cover problem with axis-parallel strips:

Mudgal, Apurva ; Pandit, Supantha
Computational Geometry.  119 (2024)  - p. 102065 , 2024
Link: https://doi.org/10.1016/..
 
?
2

Constrained hitting set problem with intervals: Hardness, F..:

Acharyya, Ankush ; Keikha, Vahideh ; Majumdar, Diptapriyo.
Theoretical Computer Science.  990 (2024)  - p. 114402 , 2024
Link: https://doi.org/10.1016/..
 
?
3

Collaborative dispersion by silent robots:

Gorain, Barun ; Mandal, Partha Sarathi ; Mondal, Kaushik.
Journal of Parallel and Distributed Computing.  188 (2024)  - p. 104852 , 2024
Link: https://doi.org/10.1016/..
 
?
4

Red-Blue Rectangular Annulus Cover Problem:

, In: Frontiers of Algorithmics; Lecture Notes in Computer Science,
Maji, Sukanya ; Pandit, Supantha ; Sadhu, Sanjib - p. 195-211 , 2023
Link: https://doi.org/10.1007/..
 
?
5

Burning and w-burning of geometric graphs:

Gorain, Barun ; Gupta, Arya T. ; Lokhande, Swapnil A...
Discrete Applied Mathematics.  336 (2023)  - p. 83-98 , 2023
Link: https://doi.org/10.1016/..
 
?
6

Collaborative Dispersion by Silent Robots:

, In: Lecture Notes in Computer Science; Stabilization, Safety, and Security of Distributed Systems,
Gorain, Barun ; Mandal, Partha Sarathi ; Mondal, Kaushik. - p. 254-269 , 2022
Link: https://doi.org/10.1007/..
 
?
7

Exact Algorithms and Hardness Results for Geometric Red-Blu..:

, In: Frontiers of Algorithmic Wisdom; Lecture Notes in Computer Science,
Madireddy, Raghunath Reddy ; Nandy, Subhas C. ; Pandit, Supantha - p. 176-191 , 2022
Link: https://doi.org/10.1007/..
 
?
8

Distributed Dominating Sets in Interval Graphs:

, In: Lecture Notes in Computer Science; Computing and Combinatorics,
Gorain, Barun ; Mondal, Kaushik ; Pandit, Supantha - p. 508-520 , 2022
Link: https://doi.org/10.1007/..
 
?
9

The balanced connected subgraph problem for geometric inter..:

Bhore, Sujoy ; Jana, Satyabrata ; Pandit, Supantha.
Theoretical Computer Science.  929 (2022)  - p. 69-80 , 2022
Link: https://doi.org/10.1016/..
 
?
10

The balanced connected subgraph problem:

Bhore, Sujoy ; Chakraborty, Sourav ; Jana, Satyabrata...
Discrete Applied Mathematics.  319 (2022)  - p. 111-120 , 2022
Link: https://doi.org/10.1016/..
 
?
11

Pebble guided optimal treasure hunt in anonymous graphs:

Gorain, Barun ; Mondal, Kaushik ; Nayak, Himadri.
Theoretical Computer Science.  922 (2022)  - p. 61-80 , 2022
Link: https://doi.org/10.1016/..
 
?
12

Distributed Connected Dominating Sets in Unit Square and Di..:

, In: Lecture Notes in Computer Science; Theory and Applications of Models of Computation,
Gorain, Barun ; Mondal, Kaushik ; Pandit, Supantha - p. 346-358 , 2022
Link: https://doi.org/10.1007/..
 
?
13

Covering and packing of triangles intersecting a straight l..:

Pandit, Supantha
Discrete Applied Mathematics.  319 (2022)  - p. 92-110 , 2022
Link: https://doi.org/10.1016/..
 
?
14

Minimum Membership Covering and Hitting:

Mitchell, Joseph S.B. ; Pandit, Supantha
Theoretical Computer Science.  876 (2021)  - p. 1-11 , 2021
Link: https://doi.org/10.1016/..
 
?
15

On the Geometric Red-Blue Set Cover Problem:

, In: WALCOM: Algorithms and Computation; Lecture Notes in Computer Science,
Madireddy, Raghunath Reddy ; Nandy, Subhas C. ; Pandit, Supantha - p. 129-141 , 2021
Link: https://doi.org/10.1007/..
 
1-15