Ashwin Jacob

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. : 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, Włodarczyk M, Zehavi M.  2023.  Finding Long Directed Cycles Is Hard Even When DFVS Is Small or Girth Is Large. arXiv preprint arXiv:2308.06145. Abstract

Jacob, A, Włodarczyk M, Zehavi M.  2023.  Long Directed Detours: Reduction to $2 $-Disjoint Paths. arXiv preprint arXiv:2301.06105. Abstract

Jacob, A.  2022.  New Directions in Parameterized deletion problems [HBNI Th216]. : The Institute of Mathematical Sciences Abstract

Jacob, A, Panolan F, Raman V, Sahlot V.  2022.  Structural parameterizations with modulator oblivion. Algorithmica. 84:2335–2357., Number 8: Springer US New York 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

Banik, A, Jacob A, Paliwal VK, Raman V.  2020.  Fixed-parameter tractability of (n- k) list coloring. Theory of Computing Systems. 64:1307–1316., Number 7: 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

Jacob, A, Raman V, Sahlot V.  2019.  Deconstructing parameterized hardness of fair vertex deletion problems. International Computing and Combinatorics Conference. :325–337.: Springer International Publishing Cham 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