Jayakrishnan Madathil

According to our database, Jayakrishnan Madathil authored at least 18 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Parameterized Algorithms for Balanced Cluster Edge Modification Problems.

Jayakrishnan Madathil, Kitty Meeks

CoRR, 2024

2023

Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems.

Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy, Abhishek Sahu, Saket Saurabh

SIAM J. Discret. Math., December, 2023

Fair Division of a Graph into Compact Bundles.

Jayakrishnan Madathil

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

The Complexity of Minimizing Envy in House Allocation.

Jayakrishnan Madathil, Neeldhara Misra, Aditi Sethia

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022

On the complexity of singly connected vertex deletion.

Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh

Theor. Comput. Sci., 2022

A Polynomial Kernel for Bipartite Permutation Vertex Deletion.

Jan Derbisz, Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu, Saket Saurabh, Shaily Verma

Algorithmica, 2022

Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems.

Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy, Abhishek Sahu, Saket Saurabh

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

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

Odd Cycle Transversal in Mixed Graphs.

Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

A Polynomial Kernel for Bipartite Permutation Vertex Deletion.

Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu, Saket Saurabh, Shaily Verma

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

2020

Fixed-Parameter Tractable Algorithm and Polynomial Kernel for Max-Cut Above Spanning Tree.

Jayakrishnan Madathil, Saket Saurabh, Meirav Zehavi

Theory Comput. Syst., 2020

2019

Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices.

Akanksha Agrawal, Sudeshna Kolay, Jayakrishnan Madathil, Saket Saurabh

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

On the Complexity of Mixed Dominating Set.

Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu, Saket Saurabh

Proceedings of the Computer Science - Theory and Applications, 2019

Connecting the Dots (with Minimum Crossings).

Akanksha Agrawal, Grzegorz Guspiel, Jayakrishnan Madathil, Saket Saurabh, Meirav Zehavi

Proceedings of the 35th International Symposium on Computational Geometry, 2019

An Erdős-Pósa Theorem on Neighborhoods and Domination Number.

Jayakrishnan Madathil, Pranabendu Misra, Saket Saurabh

Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

2018

A parameterized runtime analysis of randomized local search and evolutionary algorithm for max <i>l</i>-uncut.

Pallavi Jain, Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018

Max-Cut Above Spanning Tree is Fixed-Parameter Tractable.

Jayakrishnan Madathil, Saket Saurabh, Meirav Zehavi

Proceedings of the Computer Science - Theory and Applications, 2018

2017

Mixed Dominating Set: A Parameterized Perspective.

Pallavi Jain, Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017