I agree that this site is using cookies. You can find further informations here.
X
Bandopadhyay, Aritra
8  results:
Search for persons X
?
1

Forest Ecosystem Modeling for Policy Planning: A Review:

, In: Ecosystem and Species Habitat Modeling for Conservation and Restoration,
Jose, Karun ; Bandopadhyay, Aritra ; Arya, A.. - p. 439-457 , 2023
Link: https://doi.org/10.1007/..
 
?
2

Structural parameterizations of budgeted graph coloring:

Bandopadhyay, Susobhan ; Banerjee, Suman ; Banik, Aritra.
Theoretical Computer Science.  940 (2023)  - p. 209-221 , 2023
Link: https://doi.org/10.1016/..
 
?
3

Parameterized algorithms for finding highly connected solut..:

Abhinav, Ankit ; Bandopadhyay, Susobhan ; Banik, Aritra.
Theoretical Computer Science.  942 (2023)  - p. 47-56 , 2023
Link: https://doi.org/10.1016/..
 
?
4

Parameterized Algorithms for Finding Highly Connected Solut..:

, In: Computer Science – Theory and Applications; Lecture Notes in Computer Science,
Abhinav, Ankit ; Bandopadhyay, Susobhan ; Banik, Aritra. - p. 1-16 , 2022
Link: https://doi.org/10.1007/..
 
?
5

Structural Parameterizations of Budgeted Graph Coloring:

, In: WALCOM: Algorithms and Computation; Lecture Notes in Computer Science,
Bandopadhyay, Susobhan ; Banerjee, Suman ; Banik, Aritra. - p. 340-351 , 2022
Link: https://doi.org/10.1007/..
 
?
6

Parameterized Complexity of Non-Separating and Non-Disconne..:

Abhinav, Ankit ; Bandopadhyay, Susobhan ; Banik, Aritra...
doi:10.4230/LIPIcs.MFCS.2022.6.  , 2022
Link: https://doi.org/10.4230/..
 
?
7

Parameterized Complexity of Graph Partitioning into Connect..:

Abhinav, Ankit ; Bandopadhyay, Susobhan ; Banik, Aritra.
http://arxiv.org/abs/2202.12042.  , 2022
Link: http://arxiv.org/abs/220..
 
?
8

Structural Parameterizations of Budgeted Graph Coloring:

Bandopadhyay, Susobhan ; Banerjee, Suman ; Banik, Aritra.
http://arxiv.org/abs/2110.14498.  , 2021
Link: http://arxiv.org/abs/211..
 
1-8