Ashutosh Rai

Orcid: 0000-0003-2429-750X

Affiliations:
  • IIT Delhi, India
  • Charles University in Prague, Department of Applied Mathematics, Czech Republic
  • Hong Kong Polytechnic University, Department of Computing, Hong Kong (former)
  • Institute of Mathematical Sciences, Chennai, India (former)


According to our database1, Ashutosh Rai authored at least 22 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Parameterized Approximation Algorithms for Weighted Vertex Cover.
Proceedings of the LATIN 2024: Theoretical Informatics, 2024

2023
Parameterized Inapproximability of Independent Set in H-Free Graphs.
Algorithmica, April, 2023

Parameterized Approximation Scheme for Feedback Vertex Set.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

2022
A Polynomial Kernel for Diamond-Free Editing.
Algorithmica, 2022

Parameterized Complexity of Untangling Knots.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs.
Proceedings of the Computer Science - Theory and Applications, 2022

2021
Parameterized and exact algorithms for class domination coloring.
Discret. Appl. Math., 2021

On Extended Formulations For Parameterized Steiner Trees.
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

2020
Quick Separation in Chordal and Split Graphs.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem.
Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

2019
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs.
Algorithmica, 2019

2018
Bivariate complexity analysis of Almost Forest Deletion.
Theor. Comput. Sci., 2018

On the kernelization complexity of string problems.
Theor. Comput. Sci., 2018

Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel.
SIAM J. Discret. Math., 2018

2016
A Parameterized Algorithm for Mixed-Cut.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Lossy Kernels for Graph Contraction Problems.
Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

Strong Parameterized Deletion: Bipartite Graphs.
Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2015
Faster Parameterized Algorithms for Deletion to Split Graphs.
Algorithmica, 2015

2014
Kernel Lower Bounds using Co-Nondeterminism: Finding Induced Hereditary Subgraphs.
ACM Trans. Comput. Theory, 2014

2013
Polynomial Kernels for λ-extendible Properties Parameterized Above the Poljak-Turzík Bound.
CoRR, 2013

Polynomial Kernels for lambda-extendible Properties Parameterized Above the Poljak-Turzik Bound.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

2012
On the Kernelization Complexity of Problems on Graphs without Long Odd Cycles.
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012


  Loading...