Jayakrishnan Madathil

Orcid: 0000-0001-6337-6759

According to our database1, Jayakrishnan Madathil authored at least 20 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
The Cost and Complexity of Minimizing Envy in House Allocation.
CoRR, 2024

Parameterized Algorithms for Balanced Cluster Edge Modification Problems.
CoRR, 2024

Opinion Diffusion on Society Graphs Based on Approval Ballots.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023
Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems.
SIAM J. Discret. Math., December, 2023

Fair Division of a Graph into Compact Bundles.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

The Complexity of Minimizing Envy in House Allocation.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022
On the complexity of singly connected vertex deletion.
Theor. Comput. Sci., 2022

A Polynomial Kernel for Bipartite Permutation Vertex Deletion.
Algorithmica, 2022

Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems.
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.
Algorithmica, 2021

Odd Cycle Transversal in Mixed Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

A Polynomial Kernel for Bipartite Permutation Vertex Deletion.
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.
Theory Comput. Syst., 2020

2019
Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

On the Complexity of Mixed Dominating Set.
Proceedings of the Computer Science - Theory and Applications, 2019

Connecting the Dots (with Minimum Crossings).
Proceedings of the 35th International Symposium on Computational Geometry, 2019

An Erdős-Pósa Theorem on Neighborhoods and Domination Number.
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.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018

Max-Cut Above Spanning Tree is Fixed-Parameter Tractable.
Proceedings of the Computer Science - Theory and Applications, 2018

2017
Mixed Dominating Set: A Parameterized Perspective.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017


  Loading...