Sukanya Pandey

Orcid: 0000-0001-5728-1120

According to our database1, Sukanya Pandey authored at least 12 papers between 2021 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem.
CoRR, 2023

Treewidth is NP-Complete on Cubic Graphs (and related results).
CoRR, 2023

Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

The Parameterised Complexity Of Integer Multicommodity Flow.
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Treewidth Is NP-Complete on Cubic Graphs.
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Computing Subset Vertex Covers in H-Free Graphs.
Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

2022
Role coloring bipartite graphs.
Discret. Appl. Math., 2022

Complexity Framework for Forbidden Subgraphs: When Hardness Is Not Preserved under Edge Subdivision.
CoRR, 2022

Complexity Framework For Forbidden Subgraphs.
CoRR, 2022

Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs.
CoRR, 2022

Planar Multiway Cut with Terminals on Few Faces.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021
Parameterizing Role Coloring on Forests.
Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021


  Loading...