Jayakrishnan Madathil

29 papers A* 4A 3B 5C 1Misc 3Journal 11Unranked 2
YearRankTypeTitle / Venue / Authors
2026 A* conf
The Cost and Complexity of Minimizing Envy in House Allocations (Abstract Reprint).
AAAI
Jayakrishnan Madathil, Neeldhara Misra, Aditi Sethia
2025 — conf
Addressing Bias in Algorithmic Solutions: Exploring Vertex Cover and Feedback Vertex Set.
CALDAM
Sheikh Shakil Akhtar, Jayakrishnan Madathil, Pranabendu Misra, Geevarghese Philip
2025 J jnl
Addressing Bias in Algorithmic Solutions: Exploring Vertex Cover and Feedback Vertex Set.
CoRR
Sheikh Shakil Akhtar, Jayakrishnan Madathil, Pranabendu Misra, Geevarghese Philip
2025 A* conf
Temporal Triadic Closure: Finding Dense Substructures in Social Networks That Evolve over Time.
AAAI
Tom Davot, Jessica A. Enright, Jayakrishnan Madathil, Kitty Meeks
2025 J jnl
The Cost and Complexity of Minimizing Envy in House Allocation.
Auton. Agents Multi Agent Syst.
Jayakrishnan Madathil, Neeldhara Misra, Aditi Sethia
2024 A conf
Opinion Diffusion on Society Graphs Based on Approval Ballots.
AAMAS
Jayakrishnan Madathil, Neeldhara Misra, Yash More
2024 J jnl
Parameterized Algorithms for Balanced Cluster Edge Modification Problems.
CoRR
Jayakrishnan Madathil, Kitty Meeks
2024 J jnl
Temporal Triadic Closure: Finding Dense Structures in Social Networks That Evolve.
CoRR
Tom Davot, Jessica A. Enright, Jayakrishnan Madathil, Kitty Meeks
2024 J jnl
The Cost and Complexity of Minimizing Envy in House Allocation.
CoRR
Jayakrishnan Madathil, Neeldhara Misra, Aditi Sethia
2023 A* conf
Fair Division of a Graph into Compact Bundles.
IJCAI
Jayakrishnan Madathil
2023 J jnl
Fair Division of a Graph into Compact Bundles.
CoRR
Jayakrishnan Madathil
2023 J jnl
Further Exploiting
SIAM J. Discret. Math.
Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy, Abhishek Sahu, Saket Saurabh
2023 A conf
The Complexity of Minimizing Envy in House Allocation.
AAMAS
Jayakrishnan Madathil, Neeldhara Misra, Aditi Sethia
2022 J jnl
A Polynomial Kernel for Bipartite Permutation Vertex Deletion.
Algorithmica
Jan Derbisz, Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu, Saket Saurabh, Shaily Verma
2022 A conf
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems.
STACS
Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy, Abhishek Sahu, Saket Saurabh
2022 J jnl
On the complexity of singly connected vertex deletion.
Theor. Comput. Sci.
Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh
2021 B conf
A Polynomial Kernel for Bipartite Permutation Vertex Deletion.
IPEC
Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu, Saket Saurabh, Shaily Verma
2021 J jnl
A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs.
Algorithmica
Jayakrishnan Madathil, Roohani Sharma, Meirav Zehavi
2021 B conf
Odd Cycle Transversal in Mixed Graphs.
WG
Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh
2020 J jnl
Fixed-Parameter Tractable Algorithm and Polynomial Kernel for Max-Cut Above Spanning Tree.
Theory Comput. Syst.
Jayakrishnan Madathil, Saket Saurabh, Meirav Zehavi
2020 C conf
On the Complexity of Singly Connected Vertex Deletion.
IWOCA
Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh
2019 B conf
A Sub-Exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs.
MFCS
Jayakrishnan Madathil, Roohani Sharma, Meirav Zehavi
2019 Misc conf
An Erdős-Pósa Theorem on Neighborhoods and Domination Number.
COCOON
Jayakrishnan Madathil, Pranabendu Misra, Saket Saurabh
2019 A* conf
Connecting the Dots (with Minimum Crossings).
SoCG
Akanksha Agrawal, Grzegorz Guspiel, Jayakrishnan Madathil, Saket Saurabh, Meirav Zehavi
2019 Misc conf
On the Complexity of Mixed Dominating Set.
CSR
Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu, Saket Saurabh
2019 B conf
Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices.
ISAAC
Akanksha Agrawal, Sudeshna Kolay, Jayakrishnan Madathil, Saket Saurabh
2018 — conf
A parameterized runtime analysis of randomized local search and evolutionary algorithm for max
GECCO (Companion)
Pallavi Jain, Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh
2018 Misc conf
Max-Cut Above Spanning Tree is Fixed-Parameter Tractable.
CSR
Jayakrishnan Madathil, Saket Saurabh, Meirav Zehavi
2017 B conf
Mixed Dominating Set: A Parameterized Perspective.
WG
Pallavi Jain, Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu