Parameterizing Role Coloring on Forests. - Sukanya Pandey; Venkatesh Raman 001; Vibha Sahlot (SOFSEM, 2021)

Planar Multiway Cut with Terminals on Few Faces. - Sukanya Pandey; Erik Jan van Leeuwen (SODA, 2022)

Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs. - Matthew Johnson 002; Barnaby Martin; Siani Smith; Sukanya Pandey; Daniël Paulusma; Erik Jan van Leeuwen (CoRR, 2022)

Complexity Framework For Forbidden Subgraphs. - Matthew Johnson 002; Barnaby Martin; Jelle J. Oostveen; Sukanya Pandey; Daniël Paulusma; Siani Smith; Erik Jan van Leeuwen (CoRR, 2022)

Complexity Framework for Forbidden Subgraphs: When Hardness Is Not Preserved under Edge Subdivision. - Barnaby Martin; Sukanya Pandey; Daniël Paulusma; Siani Smith; Erik Jan van Leeuwen (CoRR, 2022)

Role coloring bipartite graphs. - Sukanya Pandey; Vibha Sahlot (Discret. Appl. Math., 2022)

Computing Subset Vertex Covers in H-Free Graphs. - Nick Brettell; Jelle J. Oostveen; Sukanya Pandey; Daniël Paulusma; Erik Jan van Leeuwen (FCT, 2023)

Treewidth Is NP-Complete on Cubic Graphs. - Hans L. Bodlaender; Édouard Bonnet; Lars Jaffke; Dusan Knop; Paloma T. Lima; Martin Milanic; Sebastian Ordyniak; Sukanya Pandey; Ondrej Suchý 001 (IPEC, 2023)

The Parameterised Complexity Of Integer Multicommodity Flow. - Hans L. Bodlaender; Isja Mannens; Jelle J. Oostveen; Sukanya Pandey; Erik Jan van Leeuwen (IPEC, 2023)

Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs. - Matthew Johnson 002; Barnaby Martin; Sukanya Pandey; Daniël Paulusma; Siani Smith; Erik Jan van Leeuwen (MFCS, 2023)

Treewidth is NP-Complete on Cubic Graphs (and related results). - Hans L. Bodlaender; Édouard Bonnet; Lars Jaffke; Dusan Knop; Paloma T. Lima; Martin Milanic; Sebastian Ordyniak; Sukanya Pandey; Ondrej Suchý 001 (CoRR, 2023)

Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-Graphs. - Vadim V. Lozin; Barnaby Martin; Sukanya Pandey; Daniël Paulusma; Mark H. Siggers; Siani Smith; Erik Jan van Leeuwen (ISAAC, 2024)

Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs. - Matthew Johnson 002; Barnaby Martin; Sukanya Pandey; Daniël Paulusma; Siani Smith; Erik Jan van Leeuwen (SWAT, 2024)

Cutting-Edge Algorithms for Monotone Graph Classes. - Sukanya Pandey (2024)

Complexity framework for forbidden subgraphs IV: The Steiner Forest problem. - Hans L. Bodlaender; Matthew Johnson 002; Barnaby Martin; Jelle J. Oostveen; Sukanya Pandey; Daniël Paulusma; Siani Smith; Erik Jan van Leeuwen (J. Comput. Syst. Sci., 2025)

Computing subset vertex covers in H-free graphs. - Nick Brettell; Jelle J. Oostveen; Sukanya Pandey; Daniël Paulusma; Johannes Rauch; Erik Jan van Leeuwen (Theor. Comput. Sci., 2025)

Complexity Framework for Forbidden Subgraphs I: The Framework. - Matthew Johnson 002; Barnaby Martin; Jelle J. Oostveen; Sukanya Pandey; Daniël Paulusma; Siani Smith; Erik Jan van Leeuwen (Algorithmica, 2025)