Ashwin Jacob

26 papers A 1B 4C 1Misc 3Journal 17
YearRankTypeTitle / Venue / Authors
2025 J jnl
On the Structural Parameterizations of 2-Club with Triangle Constraints.
CoRR
Ashwin Jacob, Diptapriyo Majumdar, Raghav Sakhuja
2025 J jnl
Parameterized complexity of dominating set variants in almost cluster and split graphs.
J. Comput. Syst. Sci.
Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman
2024 B conf
A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees.
ISAAC
Ashwin Jacob, Diptapriyo Majumdar, Meirav Zehavi
2024 J jnl
A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees.
CoRR
Ashwin Jacob, Diptapriyo Majumdar, Meirav Zehavi
2024 J jnl
Long directed detours: Reduction to 2-Disjoint Paths.
Inf. Process. Lett.
Ashwin Jacob, Michal Wlodarczyk, Meirav Zehavi
2024 J jnl
Parameterized Complexity of Dominating Set Variants in Almost Cluster and Split Graphs.
CoRR
Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman
2023 J jnl
Deletion to scattered graph classes I - Case of finite number of graph classes.
J. Comput. Syst. Sci.
Ashwin Jacob, Jari J. H. de Kroon, Diptapriyo Majumdar, Venkatesh Raman
2023 J jnl
Deletion to scattered graph classes II - improved FPT algorithms for deletion to pairs of graph classes.
J. Comput. Syst. Sci.
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
2023 J jnl
Expansion Lemma - Variations and Applications to Polynomial-Time Preprocessing.
Algorithms
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
2023 J jnl
Expansion Lemma - Variations and Applications to Polynomial-Time Preprocessing.
CoRR
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
2023 J jnl
Finding Long Directed Cycles Is Hard Even When DFVS Is Small Or Girth Is Large.
CoRR
Ashwin Jacob, Michal Wlodarczyk, Meirav Zehavi
2023 A conf
Finding Long Directed Cycles Is Hard Even When DFVS Is Small or Girth Is Large.
ESA
Ashwin Jacob, Michal Wlodarczyk, Meirav Zehavi
2023 J jnl
Long Directed Detours: Reduction to 2-Disjoint Paths.
CoRR
Ashwin Jacob, Michal Wlodarczyk, Meirav Zehavi
2022 J jnl
Deletion to Scattered Graph Classes II - Improved FPT Algorithms for Deletion to Pairs of Graph Classes.
CoRR
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
2022 J jnl
Structural Parameterizations with Modulator Oblivion.
Algorithmica
Ashwin Jacob, Fahad Panolan, Venkatesh Raman, Vibha Sahlot
2021 J jnl
Deletion to Scattered Graph Classes I -- case of finite number of graph classes.
CoRR
Ashwin Jacob, Jari J. H. de Kroon, Diptapriyo Majumdar, Venkatesh Raman
2021 B conf
Faster FPT Algorithms for Deletion to Pairs of Graph Classes.
FCT
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
2021 J jnl
Parameterized Complexity of Conflict-Free Set Cover.
Theory Comput. Syst.
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
2020 J jnl
Fixed-Parameter Tractability of (n - k) List Coloring.
Theory Comput. Syst.
Aritra Banik, Ashwin Jacob, Vijay Kumar Paliwal, Venkatesh Raman
2020 B conf
Parameterized Complexity of Deletion to Scattered Graph Classes.
IPEC
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
2020 B conf
Structural Parameterizations with Modulator Oblivion.
IPEC
Ashwin Jacob, Fahad Panolan, Venkatesh Raman, Vibha Sahlot
2020 J jnl
Structural Parameterizations with Modulator Oblivion.
CoRR
Ashwin Jacob, Fahad Panolan, Venkatesh Raman, Vibha Sahlot
2019 Misc conf
Deconstructing Parameterized Hardness of Fair Vertex Deletion Problems.
COCOON
Ashwin Jacob, Venkatesh Raman, Vibha Sahlot
2019 C conf
Fixed-Parameter Tractability of (n-k) List Coloring.
IWOCA
Aritra Banik, Ashwin Jacob, Vijay Kumar Paliwal, Venkatesh Raman
2019 Misc conf
Parameterized Complexity of Conflict-Free Set Cover.
CSR
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
2018 Misc conf
Structural Parameterizations of Dominating Set Variants.
CSR
Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman