Ashwin Jacob

About

I am an Assistant Professor in the Computer Science and Engineering department of National Institute of Technology Calicut.

Prior to joining NIT Calicut, I was a Post Doctoral Researcher at the Ben Gurion University of the Negev, Israel (2022-2023), working with Meirav Zehavi.

I completed my Ph.D. from IMSc Chennai (2016-2022) advised by Venkatesh Raman. Prior to that, I completed my masters degree from Dept. of CSE, IIT Kanpur (2013-2015). I did my undergraduate degree at the Dept. of CSE, NIT Calicut (2009-2013).

Research Interests

Parameterized Algorithms, Kernelization, Graph Algorithms, Approximation Algorithms.

▶ News

  • (June 2026) Awarded the Prime Minister Early Career Research Grant (PMECRG) from the Anusandhan National Research Foundation (ANRF) for the project Algorithms and Kernels for Scattered Vertex Deletion, as Principal Investigator at NIT Calicut.
  • (September 2025) Invited Talk at IIIT Delhi: An Algorithm for Longest Path Above Shortest Path
  • (February 2025) Paper in Journal of Computer and System Sciences (JCSS): Parameterized complexity of dominating set variants in almost cluster and split graphs, Co-authors: Dishant Goyal, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman.
  • (November 2024) Coordinated a 2-day workshop "Advances in Graph Algorithms: Theory and Applications (AGATHA) 2024" at CSE, NITC.
  • (October 2024) Paper accepted to ISAAC 2024: A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees, Co-authors: Diptapriyo Majumdar, and Meirav Zehavi.
  • (August 2024) Paper in Information Processing Letters (IPL): Long directed detours: Reduction to 2-Disjoint Paths, Co-authors: Michal Wlodarczyk, and Meirav Zehavi.

▶ Publications

2026
A polynomial kernel for deletion to the scattered class of cliques and treesJournal
Ashwin Jacob, Diptapriyo Majumdar, Meirav Zehavi
Journal of Computer and System Sciences 161: 103815 (2026)
Preliminary conference version: ISAAC 2024, 41:1–41:17.
2025
Parameterized complexity of dominating set variants in almost cluster and split graphsJournal
Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman
Journal of Computer and System Sciences 150: 103631 (2025)
2024
Long directed detours: Reduction to 2-Disjoint PathsJournal
Ashwin Jacob, Michal Wlodarczyk, Meirav Zehavi
Information Processing Letters 186: 106491 (2024)
A Polynomial Kernel for Deletion to the Scattered Class of Cliques and TreesConference
Ashwin Jacob, Diptapriyo Majumdar, Meirav Zehavi
ISAAC 2024: 41:1-41:17
2023
Expansion Lemma - Variations and Applications to Polynomial-Time PreprocessingJournal
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
Algorithms 16(3): 144 (2023)
Deletion to scattered graph classes II - improved FPT algorithms for deletion to pairs of graph classesJournal
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
Journal of Computer and System Sciences 136: 280-301 (2023)
Deletion to scattered graph classes I - Case of finite number of graph classesJournal
Ashwin Jacob, Jari J. H. de Kroon, Diptapriyo Majumdar, Venkatesh Raman
Journal of Computer and System Sciences 138: 103460 (2023)
Finding Long Directed Cycles Is Hard Even When DFVS Is Small or Girth Is LargeConference
Ashwin Jacob, Michal Wlodarczyk, Meirav Zehavi
ESA 2023: 65:1-65:17
2022
Structural Parameterizations with Modulator OblivionJournal
Ashwin Jacob, Fahad Panolan, Venkatesh Raman, Vibha Sahlot
Algorithmica 84(8): 2335-2357 (2022)
2021
Parameterized Complexity of Conflict-Free Set CoverJournal
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
Theory of Computing Systems 65(3): 515-540 (2021)
Faster FPT Algorithms for Deletion to Pairs of Graph ClassesConference
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
FCT 2021: 314-326
2020
Fixed-Parameter Tractability of (n - k) List ColoringJournal
Aritra Banik, Ashwin Jacob, Vijay Kumar Paliwal, Venkatesh Raman
Theory of Computing Systems 64(7): 1307-1316 (2020)
Parameterized Complexity of Deletion to Scattered Graph ClassesConference
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
IPEC 2020: 18:1-18:17
Structural Parameterizations with Modulator OblivionConference
Ashwin Jacob, Fahad Panolan, Venkatesh Raman, Vibha Sahlot
IPEC 2020: 19:1-19:18
2019
Deconstructing Parameterized Hardness of Fair Vertex Deletion ProblemsConference
Ashwin Jacob, Venkatesh Raman, Vibha Sahlot
COCOON 2019: 325-337
Parameterized Complexity of Conflict-Free Set CoverConference
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
CSR 2019: 191-202
Fixed-Parameter Tractability of (n-k) List ColoringConference
Aritra Banik, Ashwin Jacob, Vijay Kumar Paliwal, Venkatesh Raman
IWOCA 2019: 61-69
2018
Structural Parameterizations of Dominating Set VariantsConference
Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman
CSR 2018: 157-168

Full list: DBLP | Google Scholar

▶ Teaching

  • (July 2026 - Nov 2026) CS3003E Design and Analysis of Algorithms
  • (July 2026 - Nov 2026) CS4037E Algorithmic Graph Theory
  • (Dec 2025 - May 2026) CS4042E Randomized Algorithms
  • (July 2025 - Nov 2025) CS3003E Design and Analysis of Algorithms
  • (July 2025 - Nov 2025) CS2001E Data Structures and Algorithms
  • (July 2025 - Nov 2025) CS1092E Program Design Laboratory
  • (Dec 2024- May 2025) CS1011E Program Design
  • (Dec-2024 - May 2025) CS1092E Program Design Laboratory
  • (Aug-Dec 2024) CS6101E Mathematical Foundations of Computer Science
  • (Jan-May 2024) CS1011E Program Design
  • (Jan-May 2024) CS1092E Program Design Laboratory
  • (Dec 2015 - May 2016) CS2006 Discrete Structures (as Adhoc Lecturer)

Contact

Email:

If you are interested in working with me as a PhD student, contact me via email.

Photo of Ashwin