Ikuti
Jayakrishnan Madathil
Jayakrishnan Madathil
Research Associate, University of Glasgow
Email yang diverifikasi di glasgow.ac.uk - Beranda
Judul
Dikutip oleh
Dikutip oleh
Tahun
Mixed Dominating Set: A Parameterized Perspective
P Jain, M Jayakrishnan, F Panolan, A Sahu
Graph-Theoretic Concepts in Computer Science: 43rd International Workshop …, 2017
132017
Fixed-Parameter Tractable Algorithm and Polynomial Kernel for Max-Cut Above Spanning Tree
J Madathil, S Saurabh, M Zehavi
Theory of Computing Systems 64 (1), 62-100, 2020
11*2020
Connecting the dots (with minimum crossings)
A Agrawal, G Guspiel, J Madathil, S Saurabh, M Zehavi
35th International Symposium on Computational Geometry (SoCG 2019), 2019
112019
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems
L Kanesh, J Madathil, S Roy, A Sahu, S Saurabh
SIAM Journal on Discrete Mathematics 37 (4), 2626-2669, 2023
82023
The Complexity of Minimizing Envy in House Allocation
J Madathil, N Misra, A Sethia
Proceedings of the 2023 International Conference on Autonomous Agents and …, 2023
62023
A Polynomial Kernel for Bipartite Permutation Vertex Deletion
J Derbisz, L Kanesh, J Madathil, A Sahu, S Saurabh, S Verma
Algorithmica 84 (11), 3246-3275, 2022
5*2022
Fair Division of a Graph into Compact Bundles
J Madathil
arXiv preprint arXiv:2305.06864, 2023
32023
On the complexity of singly connected vertex deletion
A Das, L Kanesh, J Madathil, K Muluk, N Purohit, S Saurabh
Theoretical Computer Science 934, 47-64, 2022
22022
On the Complexity of Mixed Dominating Set
J Madathil, F Panolan, A Sahu, S Saurabh
Computer Science–Theory and Applications: 14th International Computer …, 2019
22019
Parameterized Algorithms for Balanced Cluster Edge Modification Problems
J Madathil, K Meeks
arXiv preprint arXiv:2403.03830, 2024
12024
A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs
J Madathil, R Sharma, M Zehavi
Algorithmica 83, 1861-1884, 2021
12021
Addressing Bias in Algorithmic Solutions: Exploring Vertex Cover and Feedback Vertex Set
SS Akhtar, J Madathil, P Misra, G Philip
Conference on Algorithms and Discrete Applied Mathematics, 1-12, 2025
2025
Temporal Triadic Closure: Finding Dense Structures in Social Networks That Evolve
T Davot, J Enright, J Madathil, K Meeks
arXiv preprint arXiv:2412.09567, 2024
2024
The Cost and Complexity of Minimizing Envy in House Allocation
J Madathil, N Misra, A Sethia
arXiv preprint arXiv:2406.09744, 2024
2024
Opinion Diffusion on Society Graphs Based on Approval Ballots
J Madathil, N Misra, Y More
Proceedings of the 23rd International Conference on Autonomous Agents and …, 2024
2024
Odd Cycle Transversal in Mixed Graphs
A Das, L Kanesh, J Madathil, S Saurabh
Graph-Theoretic Concepts in Computer Science: 47th International Workshop …, 2021
2021
Parameterized complexity classification of deletion to list matrix-partition for low-order matrices
A Agrawal, S Kolay, J Madathil, S Saurabh
30th International Symposium on Algorithms and Computation (ISAAC 2019), 2019
2019
An Erdős–Pósa Theorem on Neighborhoods and Domination Number
J Madathil, P Misra, S Saurabh
Computing and Combinatorics: 25th International Conference, COCOON 2019, Xi …, 2019
2019
Sistem tidak dapat melakukan operasi ini. Coba lagi nanti.
Artikel 1–18