Mixed Dominating Set: A Parameterized Perspective. - Pallavi Jain 001; Jayakrishnan Madathil; Fahad Panolan; Abhishek Sahu (WG, 2017)

Max-Cut Above Spanning Tree is Fixed-Parameter Tractable. - Jayakrishnan Madathil; Saket Saurabh 001; Meirav Zehavi (CSR, 2018)

A parameterized runtime analysis of randomized local search and evolutionary algorithm for max l-uncut. - Pallavi Jain 001; Lawqueen Kanesh; Jayakrishnan Madathil; Saket Saurabh 001 (GECCO (Companion), 2018)

An Erdős-Pósa Theorem on Neighborhoods and Domination Number. - Jayakrishnan Madathil; Pranabendu Misra; Saket Saurabh 001 (COCOON, 2019)

Connecting the Dots (with Minimum Crossings). - Akanksha Agrawal 001; Grzegorz Guspiel; Jayakrishnan Madathil; Saket Saurabh 001; Meirav Zehavi (SoCG, 2019)

On the Complexity of Mixed Dominating Set. - Jayakrishnan Madathil; Fahad Panolan; Abhishek Sahu; Saket Saurabh 001 (CSR, 2019)

Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices. - Akanksha Agrawal 001; Sudeshna Kolay; Jayakrishnan Madathil; Saket Saurabh 001 (ISAAC, 2019)

Fixed-Parameter Tractable Algorithm and Polynomial Kernel for Max-Cut Above Spanning Tree. - Jayakrishnan Madathil; Saket Saurabh 001; Meirav Zehavi (Theory Comput. Syst., 2020)

A Polynomial Kernel for Bipartite Permutation Vertex Deletion. - Lawqueen Kanesh; Jayakrishnan Madathil; Abhishek Sahu; Saket Saurabh 001; Shaily Verma (IPEC, 2021)

Odd Cycle Transversal in Mixed Graphs. - Avinandan Das; Lawqueen Kanesh; Jayakrishnan Madathil; Saket Saurabh 001 (WG, 2021)

A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs. - Jayakrishnan Madathil; Roohani Sharma; Meirav Zehavi (Algorithmica, 2021)

Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems. - Lawqueen Kanesh; Jayakrishnan Madathil; Sanjukta Roy 001; Abhishek Sahu; Saket Saurabh 001 (STACS, 2022)

A Polynomial Kernel for Bipartite Permutation Vertex Deletion. - Jan Derbisz; Lawqueen Kanesh; Jayakrishnan Madathil; Abhishek Sahu; Saket Saurabh 001; Shaily Verma (Algorithmica, 2022)

On the complexity of singly connected vertex deletion. - Avinandan Das; Lawqueen Kanesh; Jayakrishnan Madathil; Komal Muluk; Nidhi Purohit; Saket Saurabh 001 (Theor. Comput. Sci., 2022)

The Complexity of Minimizing Envy in House Allocation. - Jayakrishnan Madathil; Neeldhara Misra; Aditi Sethia (AAMAS, 2023)

Fair Division of a Graph into Compact Bundles. - Jayakrishnan Madathil (IJCAI, 2023)

Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems. - Lawqueen Kanesh; Jayakrishnan Madathil; Sanjukta Roy 001; Abhishek Sahu; Saket Saurabh 001 (SIAM J. Discret. Math., 2023)

Opinion Diffusion on Society Graphs Based on Approval Ballots. - Jayakrishnan Madathil; Neeldhara Misra; Yash More (AAMAS, 2024)

Parameterized Algorithms for Balanced Cluster Edge Modification Problems. - Jayakrishnan Madathil; Kitty Meeks (CoRR, 2024)

Temporal Triadic Closure: Finding Dense Structures in Social Networks That Evolve. - Tom Davot; Jessica A. Enright; Jayakrishnan Madathil; Kitty Meeks (CoRR, 2024)

Temporal Triadic Closure: Finding Dense Substructures in Social Networks That Evolve over Time. - Tom Davot; Jessica A. Enright; Jayakrishnan Madathil; Kitty Meeks (AAAI, 2025)

Addressing Bias in Algorithmic Solutions: Exploring Vertex Cover and Feedback Vertex Set. - Sheikh Shakil Akhtar; Jayakrishnan Madathil; Pranabendu Misra; Geevarghese Philip (CALDAM, 2025)

The Cost and Complexity of Minimizing Envy in House Allocation. - Jayakrishnan Madathil; Neeldhara Misra; Aditi Sethia (Auton. Agents Multi Agent Syst., 2025)