Ashwin Jacob

Goyal, D, Jacob A, Kumar K, Majumdar D, Raman V.  2024.  Parameterized Complexity of Dominating Set Variants in Almost Cluster and Split Graphs. arXiv preprint arXiv:2405.10556. Abstract

Jacob, A, Majumdar D, Zehavi M.  2024.  A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees. arXiv preprint arXiv:2409.14209. Abstract

Jacob, A, de Kroon JJH, Majumdar D, Raman V.  2023.  Deletion to scattered graph classes I-Case of finite number of graph classes. Journal of Computer and System Sciences. 138:103460.: Academic Press Abstract

Jacob, A, Majumdar D, Raman V.  2023.  Deletion to scattered graph classes II-improved FPT algorithms for deletion to pairs of graph classes. Journal of Computer and System Sciences. 136:280–301.: Academic Press Abstract

Jacob, A, Majumdar D, Raman V.  2023.  Expansion Lemma—Variations and Applications to Polynomial-Time Preprocessing. Algorithms. 16:144., Number 3: MDPI Abstract

Jacob, A, Majumdar D, Raman V.  2021.  Faster FPT algorithms for deletion to pairs of graph classes. Fundamentals of Computation Theory: 23rd International Symposium, FCT 2021, Athens, Greece, September 12–15, 2021, Proceedings 23. :314–326.: Springer International Publishing Abstract

Jacob, A, Majumdar D, Raman V.  2021.  Parameterized complexity of conflict-free set cover. Theory of Computing Systems. 65:515–540.: Springer US Abstract

Jacob, A, Majumdar D, Raman V.  2020.  Parameterized complexity of deletion to scattered graph classes. 15th International Symposium on Parameterized and Exact Computation (IPEC 2020). : Schloss Dagstuhl-Leibniz-Zentrum für Informatik Abstract

Goyal, D, Jacob A, Kumar K, Majumdar D, Raman V.  2018.  Structural parameterizations of dominating set variants. International Computer Science Symposium in Russia. :157–168.: Springer International Publishing Cham Abstract