Jayakrishnan Madathil

Available identifiers

Publication	Date of Publication	Type
Further exploiting \(c\)-closure for FPT algorithms and kernels for domination problems	2024-04-23	Paper
A polynomial kernel for bipartite permutation vertex deletion	2024-02-12	Paper
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems	2023-11-29	Paper
Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices	2023-02-03	Paper
A polynomial kernel for bipartite permutation vertex deletion	2022-10-27	Paper
On the Complexity of Singly Connected Vertex Deletion	2022-10-13	Paper
On the complexity of singly connected vertex deletion	2022-10-06	Paper
A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs	2022-07-21	Paper
Connecting the dots (with minimum crossings)	2022-07-18	Paper
Odd cycle transversal in mixed graphs	2022-06-08	Paper
A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs	2021-06-11	Paper
Fixed-parameter tractable algorithm and polynomial kernel for \textsc{Max-Cut Above Spanning Tree}	2020-02-27	Paper
An Erdős-Pósa theorem on neighborhoods and domination number	2020-02-24	Paper
On the complexity of Mixed Dominating Set	2019-10-22	Paper
\textsc{Max-Cut Above Spanning Tree} is fixed-parameter tractable	2018-11-28	Paper

This page was built for person: Jayakrishnan Madathil