Sukanya Pandey

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Complexity framework for forbidden subgraphs. II: Edge subdivision and the ``H''-graphs	2026-06-08	Paper
Edge multiway cut and node multiway cut are hard for planar subcubic graphs	2025-12-02	Paper
Treewidth is NP-complete on cubic graphs The Electronic Journal of Combinatorics	2025-09-25	Paper
Treewidth is NP-complete on cubic graphs	2025-09-24	Paper
The parameterised complexity of integer multicommodity flow	2025-09-24	Paper
Complexity framework for forbidden subgraphs. IV: The Steiner forest problem Journal of Computer and System Sciences	2025-08-21	Paper
Complexity framework for forbidden subgraphs. IV: The Steiner forest problem	2025-02-28	Paper
Computing subset vertex covers in H-free graphs Theoretical Computer Science	2025-02-26	Paper
Complexity framework for forbidden subgraphs. I: The framework Algorithmica	2025-02-25	Paper
Complexity framework for forbidden subgraphs III: when problems are tractable on subcubic graphs	2024-12-03	Paper
Planar multiway cut with terminals on few faces	2024-07-19	Paper
Computing Subset Vertex Covers in H-Free Graphs	2023-07-11	Paper
Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem	2023-05-02	Paper
Complexity Framework for Forbidden Subgraphs III: When Problems are Tractable on Subcubic Graphs	2023-05-01	Paper
Treewidth is NP-Complete on Cubic Graphs (and related results)	2023-01-24	Paper
Complexity Framework for Forbidden Subgraphs II: When Hardness Is Not Preserved under Edge Subdivision	2022-11-25	Paper
Complexity Framework For Forbidden Subgraphs I: The Framework	2022-11-23	Paper
Role coloring bipartite graphs Discrete Applied Mathematics	2022-10-13	Paper
Parameterizing role coloring on forests	2022-03-24	Paper

Research outcomes over time

This page was built for person: Sukanya Pandey