default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJayakrishnan Madathil
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c15]Jayakrishnan Madathil, Neeldhara Misra, Yash More:
Opinion Diffusion on Society Graphs Based on Approval Ballots. AAMAS 2024: 2372-2374- [i3]Jayakrishnan Madathil, Kitty Meeks:
Parameterized Algorithms for Balanced Cluster Edge Modification Problems. CoRR abs/2403.03830 (2024) - [i2]Jayakrishnan Madathil, Neeldhara Misra, Aditi Sethia:
The Cost and Complexity of Minimizing Envy in House Allocation. CoRR abs/2406.09744 (2024) - 2023
- [j5]Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy
, Abhishek Sahu, Saket Saurabh:
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems. SIAM J. Discret. Math. 37(4): 2626-2669 (2023) - [c14]Jayakrishnan Madathil, Neeldhara Misra, Aditi Sethia:
The Complexity of Minimizing Envy in House Allocation. AAMAS 2023: 2673-2675 - [c13]Jayakrishnan Madathil:
Fair Division of a Graph into Compact Bundles. IJCAI 2023: 2835-2843 - [i1]Jayakrishnan Madathil:
Fair Division of a Graph into Compact Bundles. CoRR abs/2305.06864 (2023) - 2022
- [j4]Jan Derbisz, Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu, Saket Saurabh, Shaily Verma:
A Polynomial Kernel for Bipartite Permutation Vertex Deletion. Algorithmica 84(11): 3246-3275 (2022) - [j3]Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh:
On the complexity of singly connected vertex deletion. Theor. Comput. Sci. 934: 47-64 (2022) - [c12]Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy, Abhishek Sahu, Saket Saurabh:
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems. STACS 2022: 39:1-39:20 - 2021
- [j2]Jayakrishnan Madathil, Roohani Sharma, Meirav Zehavi:
A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs. Algorithmica 83(6): 1861-1884 (2021) - [c11]Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu, Saket Saurabh, Shaily Verma:
A Polynomial Kernel for Bipartite Permutation Vertex Deletion. IPEC 2021: 23:1-23:18 - [c10]Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh:
Odd Cycle Transversal in Mixed Graphs. WG 2021: 130-142 - 2020
- [j1]Jayakrishnan Madathil, Saket Saurabh, Meirav Zehavi:
Fixed-Parameter Tractable Algorithm and Polynomial Kernel for Max-Cut Above Spanning Tree. Theory Comput. Syst. 64(1): 62-100 (2020) - [c9]Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh:
On the Complexity of Singly Connected Vertex Deletion. IWOCA 2020: 237-250
2010 – 2019
- 2019
- [c8]Jayakrishnan Madathil, Pranabendu Misra, Saket Saurabh:
An Erdős-Pósa Theorem on Neighborhoods and Domination Number. COCOON 2019: 437-444 - [c7]Akanksha Agrawal, Grzegorz Guspiel, Jayakrishnan Madathil, Saket Saurabh, Meirav Zehavi:
Connecting the Dots (with Minimum Crossings). SoCG 2019: 7:1-7:17 - [c6]Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu, Saket Saurabh:
On the Complexity of Mixed Dominating Set. CSR 2019: 262-274 - [c5]Akanksha Agrawal, Sudeshna Kolay, Jayakrishnan Madathil, Saket Saurabh:
Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices. ISAAC 2019: 41:1-41:14 - [c4]Jayakrishnan Madathil, Roohani Sharma, Meirav Zehavi:
A Sub-Exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs. MFCS 2019: 28:1-28:14 - 2018
- [c3]Jayakrishnan Madathil, Saket Saurabh, Meirav Zehavi:
Max-Cut Above Spanning Tree is Fixed-Parameter Tractable. CSR 2018: 244-256 - [c2]Pallavi Jain, Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh:
A parameterized runtime analysis of randomized local search and evolutionary algorithm for max l-uncut. GECCO (Companion) 2018: 326-327 - 2017
- [c1]Pallavi Jain, Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu:
Mixed Dominating Set: A Parameterized Perspective. WG 2017: 330-343
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
