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

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/..
 
?
2

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/..
 
?
3

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/..
 
?
4

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/..
 
?
5

Improved Bounds on the Span of L(1, 2)-edge Labeling of Som..:

, In: AIRO Springer Series; Graphs and Combinatorial Optimization: from Theory to Applications,
Bandopadhyay, Susobhan ; Ghosh, Sasthi C. ; Koley, Subhasis - p. 53-65 , 2020
Link: https://doi.org/10.1007/..
 
?
6

Shortest Path with Positive Disjunctive Constraints -- a Pa..:

Bandopadhyay, Susobhan ; Banerjee, Suman ; Majumdar, Diptapriyo.
http://arxiv.org/abs/2309.04346.  , 2023
Link: http://arxiv.org/abs/230..
 
?
7

Improved Bounds on the Span of $L(1,2)$-edge Labeling of So..:

Bandopadhyay, Susobhan ; Ghosh, Sasthi C ; Koley, Subhasis
http://arxiv.org/abs/2201.06801.  , 2022
Link: http://arxiv.org/abs/220..
 
?
8

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..
 
?
9

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/..
 
?
10

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-10