Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Susobhan Bandopadhyay
Observed name:
Bandopadhyay, Susobhan
Institution:
Tata Institute of Fundamental Research
Observed institutions:
Tata Institute of Fundamental Research,
National Institute of Science Education and Research,
Homi Bhabha National Institute,
Indian Statistical Institute
ORCID:
0000-0003-1073-2718
Observed ORCID:
0000-0003-1073-2718
OpenAlex ID:
A5021429825
Structural parameterizations of budgeted graph coloring
2022
·
Susobhan Bandopadhyay
, Suman Banerjee
, et al.
·
Theoretical Computer Science
·
4
Parameterized algorithms for finding highly connected solution
2022
·
Ankit Abhinav
, Susobhan Bandopadhyay
, et al.
·
Theoretical Computer Science
·
3
Structural Parameterizations of Budgeted Graph Coloring
2022
·
Susobhan Bandopadhyay
, Suman Banerjee
, et al.
·
Lecture notes in computer science
·
3
Conflict and Fairness in Resource Allocation
2024
·
Bandopadhyay, Susobhan
, Banik, Aritra
, et al.
·
arXiv (Cornell University)
·
2
PDF
Improved Bounds on the Span of L(1, 2)-edge Labeling of Some Infinite Regular Grids
2020
·
Susobhan Bandopadhyay
, Sasthi C. Ghosh
, et al.
·
AIRO Springer series/AIRO Springer Series
·
2
PDF
On the polynomial kernelizations of finding a shortest path with positive disjunctive constraints
2026
·
Susobhan Bandopadhyay
, Suman Banerjee
, et al.
·
Information and Computation
·
1
PDF
Parameterized Complexity of Shortest Path with Positive Disjunctive Constraints
2025
·
Susobhan Bandopadhyay
, Suman Banerjee
, et al.
·
Lecture notes in computer science
·
1
Large planar $(n,m)$-cliques
2024
·
Bandopadhyay, Susobhan
, Sen, Sagnik
, et al.
·
arXiv (Cornell University)
·
1
PDF
Parameterized Complexity of Graph Partitioning into Connected Clusters
2022
·
Abhinav, Ankit
, Bandopadhyay, Susobhan
, et al.
·
arXiv (Cornell University)
·
1
PDF
Structural Parameterizations of Budgeted Graph Coloring
2022
·
Susobhan Bandopadhyay
, Suman Banerjee
, et al.
·
SSRN Electronic Journal
·
1
PDF
Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets
2022
·
Abhinav, Ankit
, Bandopadhyay, Susobhan
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
1
PDF
Fair, Efficient and Connected Allocations on Graphs
2026
·
Susobhan Bandopadhyay
, Anish Datta
, et al.
·
Lecture notes in computer science
PDF
Fair Allocation Under Conflict-Free and Budget Constraints: A Parameterized Perspective
2026
·
Susobhan Bandopadhyay
, Aritra Banik
, et al.
·
Lecture notes in computer science
On the parameterized tractability of packing vertex-disjoint A-paths with length constraints
2026
·
Susobhan Bandopadhyay
, Aritra Banik
, et al.
·
Journal of Computer and System Sciences
PDF
On the Parameterized Tractability of Packing Vertex-Disjoint A-Paths with Length Constraints
2026
·
Susobhan Bandopadhyay
, Aritra Banik
, et al.
·
SSRN Electronic Journal
Shift Bribery over Social Networks
2025
·
Hota, Ashlesha
, Bandopadhyay, Susobhan
, et al.
·
arXiv (Cornell University)
PDF
Parameterized Algorithms for Finding Highly Connected Solution
2022
·
Ankit Abhinav
, Susobhan Bandopadhyay
, et al.
·
Lecture notes in computer science
Structural Parameterizations of Budgeted Graph Coloring
2021
·
Bandopadhyay, Susobhan
, Banerjee, Suman
, et al.
·
arXiv (Cornell University)
PDF
Show more works
View as search
Works count:
19
Citation count:
22
H-index:
3
I10-index:
Year
Topic
Type