Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Ashwin Jacob
Observed name:
Jacob, Ashwin
Institution:
National Institute of Technology Calicut
Observed institutions:
National Institute of Technology Calicut,
Ben-Gurion University of the Negev,
Institute of Mathematical Sciences
ORCID:
0000-0003-4864-043X
Observed ORCID:
0000-0003-4864-043X
OpenAlex ID:
A5060096439
Deletion to scattered graph classes I - Case of finite number of graph classes
2023
·
Ashwin Jacob
, Jari J.H. de Kroon
, et al.
·
Journal of Computer and System Sciences
·
11
PDF
Deletion to scattered graph classes II - improved FPT algorithms for deletion to pairs of graph classes
2023
·
Ashwin Jacob
, Diptapriyo Majumdar
, et al.
·
Journal of Computer and System Sciences
·
8
PDF
Expansion Lemma—Variations and Applications to Polynomial-Time Preprocessing
2023
·
Ashwin Jacob
, Diptapriyo Majumdar
, et al.
·
Algorithms
·
8
PDF
Structural Parameterizations with Modulator Oblivion
2022
·
Ashwin Jacob
, Fahad Panolan
, et al.
·
Algorithmica
·
8
PDF
Parameterized Complexity of Conflict-Free Set Cover
2021
·
Ashwin Jacob
, Diptapriyo Majumdar
, et al.
·
Theory of Computing Systems
·
8
Parameterized Complexity of Deletion to Scattered Graph Classes
2020
·
Jacob, Ashwin
, Majumdar, Diptapriyo
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
8
PDF
Structural Parameterizations of Dominating Set Variants
2018
·
Dishant Goyal
, Ashwin Jacob
, et al.
·
Lecture notes in computer science
·
8
Long directed detours: Reduction to 2-Disjoint Paths
2024
·
Ashwin Jacob
, Michał Włodarczyk
, et al.
·
Information Processing Letters
·
7
PDF
Parameterized Complexity of Conflict-Free Set Cover
2019
·
Ashwin Jacob
, Diptapriyo Majumdar
, et al.
·
Lecture notes in computer science
·
7
Parameterized complexity of dominating set variants in almost cluster and split graphs
2025
·
Dishant Goyal
, Ashwin Jacob
, et al.
·
Journal of Computer and System Sciences
·
6
PDF
Deconstructing Parameterized Hardness of Fair Vertex Deletion Problems
2019
·
Ashwin Jacob
, Venkatesh Raman
, et al.
·
Lecture notes in computer science
·
6
Fixed-Parameter Tractability of $$(n-k)$$ List Coloring
2019
·
Aritra Banik
, Ashwin Jacob
, et al.
·
Lecture notes in computer science
·
5
Finding Long Directed Cycles Is Hard Even When DFVS Is Small Or Girth Is Large
2023
·
Jacob, Ashwin
, Włodarczyk, Michał
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
4
PDF
Faster FPT Algorithms for Deletion to Pairs of Graph Classes
2021
·
Ashwin Jacob
, Diptapriyo Majumdar
, et al.
·
Lecture notes in computer science
·
4
Fixed-Parameter Tractability of (n − k) List Coloring
2020
·
Aritra Banik
, Ashwin Jacob
, et al.
·
Theory of Computing Systems
·
4
On the Parameterized Complexity of Conflict-Free Edge Cut in Undirected Graphs
2026
·
Das, Sourav
, Jacob, Ashwin
, et al.
·
arXiv (Cornell University)
·
1
PDF
Eccentricity Shortest Path: the structural parameter landscape
2026
·
Babu, Anand
, Jacob, Ashwin
, et al.
·
arXiv (Cornell University)
PDF
Perfect Italian Domination on and Near Split Graphs: Algorithms, Hardness, and Approximation
2026
·
B, Anand Babu N
, Jacob, Ashwin
, et al.
·
arXiv (Cornell University)
PDF
Steiner Geodesic Distance in Fuzzy Graphs with Applications in Telecommunication Networks
2026
·
Kripa Shaji
, M. S. Sunitha
, et al.
·
New Mathematics and Natural Computation
Show more works
View as search
Works count:
19
Citation count:
103
H-index:
7
I10-index:
1
Year
Topic
Type