Sukanya Pandey

27 papers A* 1A 1B 6C 1Journal 16Unranked 1
YearRankTypeTitle / Venue / Authors
2026 A conf
A Polynomial Kernel for Face Cover on Non-Embedded Planar Graphs.
STACS
Thekla Hamm, Sukanya Pandey, Krisztina Szilágyi
2026 J jnl
A Polynomial Kernel for Face Cover on Non-Embedded Planar Graphs.
CoRR
Thekla Hamm, Sukanya Pandey, Krisztina Szilágyi
2025 J jnl
Complexity Framework for Forbidden Subgraphs I: The Framework.
Algorithmica
Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2025 J jnl
Complexity framework for forbidden subgraphs IV: The Steiner Forest problem.
J. Comput. Syst. Sci.
Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2025 J jnl
Computing subset vertex covers in H-free graphs.
Theor. Comput. Sci.
Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Johannes Rauch, Erik Jan van Leeuwen
2025 J jnl
Planar Multiway Cut with Terminals on Few Faces.
CoRR
Sukanya Pandey, Erik Jan van Leeuwen
2025 J jnl
Treewidth is NP-Complete on Cubic Graphs.
Electron. J. Comb.
Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý
2024 B conf
Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-Graphs.
ISAAC
Vadim V. Lozin, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Mark H. Siggers, Siani Smith, Erik Jan van Leeuwen
2024 C conf
Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem.
IWOCA
Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2024 — —
Cutting-Edge Algorithms for Monotone Graph Classes.
Sukanya Pandey
2024 — conf
Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs.
SWAT
Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2023 B conf
Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs.
MFCS
Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2023 J jnl
Complexity Framework for Forbidden Subgraphs III: When Problems are Tractable on Subcubic Graphs.
CoRR
Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2023 J jnl
Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem.
CoRR
Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2023 B conf
Computing Subset Vertex Covers in H-Free Graphs.
FCT
Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen
2023 J jnl
Computing Subset Vertex Covers in H-Free Graphs.
CoRR
Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen
2023 B conf
The Parameterised Complexity Of Integer Multicommodity Flow.
IPEC
Hans L. Bodlaender, Isja Mannens, Jelle J. Oostveen, Sukanya Pandey, Erik Jan van Leeuwen
2023 J jnl
The Parameterised Complexity of Integer Multicommodity Flow.
CoRR
Hans L. Bodlaender, Isja Mannens, Jelle J. Oostveen, Sukanya Pandey, Erik Jan van Leeuwen
2023 B conf
Treewidth Is NP-Complete on Cubic Graphs.
IPEC
Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý
2023 J jnl
Treewidth is NP-Complete on Cubic Graphs (and related results).
CoRR
Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý
2022 J jnl
Complexity Framework For Forbidden Subgraphs.
CoRR
Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2022 J jnl
Complexity Framework for Forbidden Subgraphs: When Hardness Is Not Preserved under Edge Subdivision.
CoRR
Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2022 J jnl
Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs.
CoRR
Matthew Johnson, Barnaby Martin, Siani Smith, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen
2022 A* conf
Planar Multiway Cut with Terminals on Few Faces.
SODA
Sukanya Pandey, Erik Jan van Leeuwen
2022 J jnl
Role coloring bipartite graphs.
Discret. Appl. Math.
Sukanya Pandey, Vibha Sahlot
2021 B conf
Parameterizing Role Coloring on Forests.
SOFSEM
Sukanya Pandey, Venkatesh Raman, Vibha Sahlot
2021 J jnl
Role Coloring Bipartite Graphs.
CoRR
Sukanya Pandey, Vibha Sahlot