Edit Profile (opens in new tab) Madathil, Jayakrishnan Co-Author Distance Author ID: madathil.jayakrishnan Published as: Madathil, Jayakrishnan Documents Indexed: 14 Publications since 2018 Co-Authors: 16 Co-Authors with 14 Joint Publications 275 Co-Co-Authors all top 5 Co-Authors 0 single-authored 12 Saurabh, Saket 6 Kanesh, Lawqueen 5 Zehavi, Meirav 4 Sahu, Abhishek 3 Das, Avinandan 2 Agrawal, Akanksha 2 Muluk, Komal 2 Purohit, Nidhi 2 Sharma, Roohani 2 Verma, Shaily 1 Derbisz, Jan 1 Guśpiel, Grzegorz 1 Kolay, Sudeshna 1 Misra, Pranabendu 1 Panolan, Fahad 1 Roy, Sanjukta Serials 2 Algorithmica 1 Theoretical Computer Science 1 SIAM Journal on Discrete Mathematics 1 Theory of Computing Systems Fields 14 Computer science (68-XX) 5 Combinatorics (05-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH Open 6 Publications have been cited 7 times in 7 Documents Cited by ▼ Year ▼ Connecting the dots (with Minimum Crossings). Zbl 07559207 Agrawal, Akanksha; Guśpiel, Grzegorz; Madathil, Jayakrishnan; Saurabh, Saket; Zehavi, Meirav 2 2019 On the complexity of Mixed Dominating Set. Zbl 07121073 Madathil, Jayakrishnan; Panolan, Fahad; Sahu, Abhishek; Saurabh, Saket 1 2019 On the complexity of singly connected vertex deletion. Zbl 07597110 Das, Avinandan; Kanesh, Lawqueen; Madathil, Jayakrishnan; Muluk, Komal; Purohit, Nidhi; Saurabh, Saket 1 2022 On the complexity of singly connected vertex deletion. Zbl 07601011 Das, Avinandan; Kanesh, Lawqueen; Madathil, Jayakrishnan; Muluk, Komal; Purohit, Nidhi; Saurabh, Saket 1 2020 Fixed-parameter tractable algorithm and polynomial kernel for Max-Cut Above Spanning Tree. Zbl 1434.68748 Madathil, Jayakrishnan; Saurabh, Saket; Zehavi, Meirav 1 2020 Max-Cut Above Spanning Tree is fixed-parameter tractable. Zbl 1434.68747 Madathil, Jayakrishnan; Saurabh, Saket; Zehavi, Meirav 1 2018 On the complexity of singly connected vertex deletion. Zbl 07597110 Das, Avinandan; Kanesh, Lawqueen; Madathil, Jayakrishnan; Muluk, Komal; Purohit, Nidhi; Saurabh, Saket 1 2022 On the complexity of singly connected vertex deletion. Zbl 07601011 Das, Avinandan; Kanesh, Lawqueen; Madathil, Jayakrishnan; Muluk, Komal; Purohit, Nidhi; Saurabh, Saket 1 2020 Fixed-parameter tractable algorithm and polynomial kernel for Max-Cut Above Spanning Tree. Zbl 1434.68748 Madathil, Jayakrishnan; Saurabh, Saket; Zehavi, Meirav 1 2020 Connecting the dots (with Minimum Crossings). Zbl 07559207 Agrawal, Akanksha; Guśpiel, Grzegorz; Madathil, Jayakrishnan; Saurabh, Saket; Zehavi, Meirav 2 2019 On the complexity of Mixed Dominating Set. Zbl 07121073 Madathil, Jayakrishnan; Panolan, Fahad; Sahu, Abhishek; Saurabh, Saket 1 2019 Max-Cut Above Spanning Tree is fixed-parameter tractable. Zbl 1434.68747 Madathil, Jayakrishnan; Saurabh, Saket; Zehavi, Meirav 1 2018 all cited Publications top 5 cited Publications all top 5 Cited by 19 Authors 2 Muluk, Komal 2 Zehavi, Meirav 1 Adhikary, Ranendu 1 Belova, Tatiana 1 Bliznets, Ivan A. 1 Bose, Kaustav 1 Das, Avinandan 1 Dublois, Louis 1 Gupta, Siddharth 1 Hartmann, Tim A. 1 Kanesh, Lawqueen 1 Lampis, Michael 1 Madathil, Jayakrishnan 1 Mukherjee, Satwik 1 Paschos, Vangelis Th. 1 Purohit, Nidhi 1 Roy, Bodhayan 1 Sa’ar, Guy 1 Saurabh, Saket Cited in 4 Serials 2 Theoretical Computer Science 1 Journal of Computer and System Sciences 1 Discrete & Computational Geometry 1 Computer Science Review Cited in 2 Fields 7 Computer science (68-XX) 1 Operations research, mathematical programming (90-XX) Citations by Year