Author of the publication

Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets.

, , , , , , and . MFCS, volume 241 of LIPIcs, page 6:1-6:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Bandopadhyay, Susobhan
add a person with the name Bandopadhyay, Susobhan
 

Other publications of authors with the same name

Conflict and Fairness in Resource Allocation., , , , , , and . CoRR, (2024)Structural Parameterizations of Budgeted Graph Coloring., , , and . WALCOM, volume 13174 of Lecture Notes in Computer Science, page 340-351. Springer, (2022)Tractability of Packing Vertex-Disjoint A-Paths Under Length Constraints., , , and . MFCS, volume 306 of LIPIcs, page 16:1-16:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets., , , , , , and . MFCS, volume 241 of LIPIcs, page 6:1-6:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)L(2, 1)-Edge Labeling of Infinite Triangular Grid., , and . ICTCS, volume 3072 of CEUR Workshop Proceedings, page 179-192. CEUR-WS.org, (2021)A step towards finding the analog of the Four-Color Theorem for (n,m)-graphs., , and . CoRR, (2024)Parameterized Algorithms for Finding Highly Connected Solution., , , and . CSR, volume 13296 of Lecture Notes in Computer Science, page 1-16. Springer, (2022)Parameterized algorithms for finding highly connected solution., , , and . Theor. Comput. Sci., (2023)