Susobhan Bandopadhyay

Orcid: 0000-0003-1073-2718

According to our database1, Susobhan Bandopadhyay authored at least 10 papers between 2021 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A step towards finding the analog of the Four-Color Theorem for (n,m)-graphs.
CoRR, 2024

Conflict and Fairness in Resource Allocation.
CoRR, 2024

Tractability of Packing Vertex-Disjoint A-Paths Under Length Constraints.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

2023
Structural parameterizations of budgeted graph coloring.
Theor. Comput. Sci., 2023

Parameterized algorithms for finding highly connected solution.
Theor. Comput. Sci., 2023

Shortest Path with Positive Disjunctive Constraints - a Parameterized Perspective.
CoRR, 2023

2022
Parameterized Complexity of Graph Partitioning into Connected Clusters.
CoRR, 2022

Improved Bounds on the Span of L(1, 2)-edge Labeling of Some Infinite Regular Grids.
CoRR, 2022

Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

2021
L(2, 1)-Edge Labeling of Infinite Triangular Grid.
Proceedings of the 22nd Italian Conference on Theoretical Computer Science, 2021


  Loading...