| 2026 | AAAI | The Cost and Complexity of Minimizing Envy in House Allocations (Abstract Reprint). | Jayakrishnan Madathil, Neeldhara Misra, Aditi Sethia |
| 2025 | AAAI | Temporal Triadic Closure: Finding Dense Substructures in Social Networks That Evolve over Time. | Tom Davot, Jessica A. Enright, Jayakrishnan Madathil, Kitty Meeks |
| 2023 | IJCAI | Fair Division of a Graph into Compact Bundles. | Jayakrishnan Madathil |
| 2022 | STACS | Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems. | Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy, Abhishek Sahu, Saket Saurabh |
| 2021 | WG | Odd Cycle Transversal in Mixed Graphs. | Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh |
| 2020 | IWOCA | On the Complexity of Singly Connected Vertex Deletion. | Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh |
| 2019 | COCOON | An Erdős-Psa Theorem on Neighborhoods and Domination Number. | Jayakrishnan Madathil, Pranabendu Misra, Saket Saurabh |
| 2019 | CSR | On the Complexity of Mixed Dominating Set. | Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu, Saket Saurabh |
| 2019 | ISAAC | Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices. | Akanksha Agrawal, Sudeshna Kolay, Jayakrishnan Madathil, Saket Saurabh |
| 2019 | MFCS | A Sub-Exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs. | Jayakrishnan Madathil, Roohani Sharma, Meirav Zehavi |
| 2018 | CSR | Max-Cut Above Spanning Tree is Fixed-Parameter Tractable. | Jayakrishnan Madathil, Saket Saurabh, Meirav Zehavi |
| 2018 | GECCO | A parameterized runtime analysis of randomized local search and evolutionary algorithm for max | Pallavi Jain, Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh |
| 2017 | WG | Mixed Dominating Set: A Parameterized Perspective. | Pallavi Jain, Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu |