| Complexity framework for forbidden subgraphs I: The framework M Johnson, B Martin, JJ Oostveen, S Pandey, D Paulusma, S Smith, ... arXiv preprint arXiv:2211.12887, 2022 | 9 | 2022 |
| Complexity framework for forbidden subgraphs IV: The Steiner Forest problem HL Bodlaender, M Johnson, B Martin, JJ Oostveen, S Pandey, ... arXiv preprint arXiv:2305.01613, 2023 | 5 | 2023 |
| Complexity framework for forbidden subgraphs II: When hardness is not preserved under edge subdivision B Martin, S Pandey, D Paulusma, M Siggers, S Smith, EJ van Leeuwen arXiv preprint arXiv:2211.14214, 2022 | 4 | 2022 |
| Treewidth is NP-complete on cubic graphs (and related results) HL Bodlaender, É Bonnet, L Jaffke, D Knop, PT Lima, M Milanič, ... arXiv preprint arXiv:2301.10031, 2023 | 3 | 2023 |
| Role coloring bipartite graphs S Pandey, V Sahlot Discrete Applied Mathematics 322, 276-285, 2022 | 3 | 2022 |
| The Parameterised Complexity of Integer Multicommodity Flow HL Bodlaender, I Mannens, JJ Oostveen, S Pandey, EJ van Leeuwen arXiv preprint arXiv:2310.05784, 2023 | 2 | 2023 |
| Complexity framework for forbidden subgraphs III: When problems are tractable on subcubic graphs M Johnson, B Martin, S Pandey, D Paulusma, S Smith, EJ Van Leeuwen arXiv preprint arXiv:2305.01104, 2023 | 2 | 2023 |
| Planar Multiway Cut with terminals on few faces S Pandey, EJ van Leeuwen Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022 | 2 | 2022 |
| Parameterizing role coloring on forests S Pandey, V Raman, V Sahlot SOFSEM 2021: Theory and Practice of Computer Science: 47th International …, 2021 | 2 | 2021 |
| Role colouring hereditary classes of graphs S Pandey | 1 | 2019 |
| The Parameterised Complexity Of Integer Multicommodity Flow I Mannens, J Oostveen, EJ van Leeuwen, S Pandey, HL Bodlaender 18th International Symposium on Parameterized and Exact Computation (IPEC …, 2023 | | 2023 |
| Computing Subset Vertex Covers in H-Free Graphs N Brettell, JJ Oostveen, S Pandey, D Paulusma, EJ van Leeuwen International Symposium on Fundamentals of Computation Theory, 88-102, 2023 | | 2023 |
| Treewidth is NP-Complete on Cubic Graphs S Ordyniak, H Bodlaender, É Bonnet, D Knop, M Milanic, P Lima, O Suchy, ... Dagstuhl Reports, 2023 | | 2023 |
| Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs M Johnson, B Martin, S Smith, S Pandey, D Paulusma, EJ van Leeuwen arXiv preprint arXiv:2211.12203, 2022 | | 2022 |
