Jayakrishnan Madathil

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 22

Top Topics

Polynomial Kernels

Parameterized Complexity

Singly Connected

Top Venues

Publications

Jayakrishnan Madathil, Neeldhara Misra, Aditi Sethia
The Cost and Complexity of Minimizing Envy in House Allocation. CoRR (2024)
Jayakrishnan Madathil, Neeldhara Misra, Yash More
Opinion Diffusion on Society Graphs Based on Approval Ballots. AAMAS (2024)
Jayakrishnan Madathil, Kitty Meeks
Parameterized Algorithms for Balanced Cluster Edge Modification Problems. CoRR (2024)
Jayakrishnan Madathil
Fair Division of a Graph into Compact Bundles. IJCAI (2023)
Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy, Abhishek Sahu, Saket Saurabh
-Closure for FPT Algorithms and Kernels for Domination Problems. SIAM J. Discret. Math. 37 (4) (2023)
Jayakrishnan Madathil
Fair Division of a Graph into Compact Bundles. CoRR (2023)
Jayakrishnan Madathil, Neeldhara Misra, Aditi Sethia
The Complexity of Minimizing Envy in House Allocation. AAMAS (2023)
Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy, Abhishek Sahu, Saket Saurabh
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems. STACS (2022)
Jan Derbisz, Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu, Saket Saurabh, Shaily Verma
A Polynomial Kernel for Bipartite Permutation Vertex Deletion. Algorithmica 84 (11) (2022)
Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh
On the complexity of singly connected vertex deletion. Theor. Comput. Sci. 934 (2022)
Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu, Saket Saurabh, Shaily Verma
A Polynomial Kernel for Bipartite Permutation Vertex Deletion. IPEC (2021)
Jayakrishnan Madathil, Roohani Sharma, Meirav Zehavi
A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs. Algorithmica 83 (6) (2021)
Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh
Odd Cycle Transversal in Mixed Graphs. WG (2021)
Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh
On the Complexity of Singly Connected Vertex Deletion. IWOCA (2020)
Jayakrishnan Madathil, Saket Saurabh, Meirav Zehavi
Fixed-Parameter Tractable Algorithm and Polynomial Kernel for Max-Cut Above Spanning Tree. Theory Comput. Syst. 64 (1) (2020)
Jayakrishnan Madathil, Roohani Sharma, Meirav Zehavi
A Sub-Exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs. MFCS (2019)
Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu, Saket Saurabh
On the Complexity of Mixed Dominating Set. CSR (2019)
Jayakrishnan Madathil, Pranabendu Misra, Saket Saurabh
An Erdős-Pósa Theorem on Neighborhoods and Domination Number. COCOON (2019)
Akanksha Agrawal, Grzegorz Guspiel, Jayakrishnan Madathil, Saket Saurabh, Meirav Zehavi
Connecting the Dots (with Minimum Crossings). SoCG (2019)
Akanksha Agrawal, Sudeshna Kolay, Jayakrishnan Madathil, Saket Saurabh
Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices. ISAAC (2019)
Jayakrishnan Madathil, Saket Saurabh, Meirav Zehavi
Max-Cut Above Spanning Tree is Fixed-Parameter Tractable. CSR (2018)
Pallavi Jain, Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh
-uncut. GECCO (Companion) (2018)