Ashwin Jacob

Orcid: 0000-0003-4864-043X

According to our database1, Ashwin Jacob authored at least 14 papers between 2018 and 2025.

Collaborative distances:

Timeline

2018
2019
2020
2021
2022
2023
2024
2025
0
1
2
3
4
5
1
1
3
1
1
1
1
1
1
1
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Parameterized complexity of dominating set variants in almost cluster and split graphs.
J. Comput. Syst. Sci., 2025

2024
Long directed detours: Reduction to 2-Disjoint Paths.
Inf. Process. Lett., 2024

A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees.
Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

2023
Deletion to scattered graph classes I - Case of finite number of graph classes.
J. Comput. Syst. Sci., December, 2023

Expansion Lemma - Variations and Applications to Polynomial-Time Preprocessing.
Algorithms, March, 2023

Deletion to scattered graph classes II - improved FPT algorithms for deletion to pairs of graph classes.
J. Comput. Syst. Sci., 2023

Finding Long Directed Cycles Is Hard Even When DFVS Is Small or Girth Is Large.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022
Structural Parameterizations with Modulator Oblivion.
Algorithmica, 2022

2021
Parameterized Complexity of Conflict-Free Set Cover.
Theory Comput. Syst., 2021

Faster FPT Algorithms for Deletion to Pairs of Graph Classes.
Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

2020
Fixed-Parameter Tractability of (n - k) List Coloring.
Theory Comput. Syst., 2020

Parameterized Complexity of Deletion to Scattered Graph Classes.
Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

2019
Deconstructing Parameterized Hardness of Fair Vertex Deletion Problems.
Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

2018
Structural Parameterizations of Dominating Set Variants.
Proceedings of the Computer Science - Theory and Applications, 2018


  Loading...