Ashutosh Rai

According to our database, Ashutosh Rai authored at least 23 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Parameterized Approximation Algorithms for Weighted Vertex Cover.

Soumen Mandal, Pranabendu Misra, Ashutosh Rai, Saket Saurabh

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

On the Parameterized Complexity of Diverse SAT.

Neeldhara Misra, Harshil Mittal, Ashutosh Rai

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

2023

Parameterized Approximation Scheme for Feedback Vertex Set.

Satyabrata Jana, Daniel Lokshtanov, Soumen Mandal, Ashutosh Rai, Saket Saurabh

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

2022

Parameterized Complexity of Untangling Knots.

Clément Legrand-Duchesne, Ashutosh Rai, Martin Tancer

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs.

Petr A. Golovach, Fahad Panolan, Ashutosh Rai, Saket Saurabh

Proceedings of the Computer Science - Theory and Applications, 2022

2021

On Extended Formulations For Parameterized Steiner Trees.

Andreas Emil Feldmann, Ashutosh Rai

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

2020

Parameterized Inapproximability of Independent Set in H-Free Graphs.

Pavel Dvorák, Andreas Emil Feldmann, Ashutosh Rai, Pawel Rzazewski

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

Quick Separation in Chordal and Split Graphs.

Pranabendu Misra, Fahad Panolan, Ashutosh Rai, Saket Saurabh, Roohani Sharma

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem.

Andreas Emil Feldmann, Davis Issac, Ashutosh Rai

Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

2018

A Polynomial Kernel for Diamond-Free Editing.

Yixin Cao, Ashutosh Rai, R. B. Sandeep, Junjie Ye

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

Parameterized and Exact Algorithms for Class Domination Coloring.

R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale

Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

2016

A Parameterized Algorithm for Mixed-Cut.

Ashutosh Rai, M. S. Ramanujan, Saket Saurabh

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Lossy Kernels for Graph Contraction Problems.

R. Krithika, Pranabendu Misra, Ashutosh Rai, Prafullkumar Tale

Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

Strong Parameterized Deletion: Bipartite Graphs.

Ashutosh Rai, M. S. Ramanujan

Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2015

Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel.

Geevarghese Philip, Ashutosh Rai, Saket Saurabh

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Bivariate Complexity Analysis of Almost Forest Deletion.

Ashutosh Rai, Saket Saurabh

Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014

On the Kernelization Complexity of String Problems.

Manu Basavaraju, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan, Saket Saurabh

Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

2013

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

Robert Crowston, Mark Jones, Gabriele Muciaccia, Geevarghese Philip, Ashutosh Rai, Saket Saurabh

CoRR, 2013

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

Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

Polynomial Kernels for lambda-extendible Properties Parameterized Above the Poljak-Turzik Bound.

Robert Crowston, Mark Jones, Gabriele Muciaccia, Geevarghese Philip, Ashutosh Rai, Saket Saurabh

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

2012

Kernel Lower Bounds Using Co-nondeterminism: Finding Induced Hereditary Subgraphs.

Stefan Kratsch, Marcin Pilipczuk, Ashutosh Rai, Venkatesh Raman

Proceedings of the Algorithm Theory - SWAT 2012, 2012

Faster Parameterized Algorithms for Deletion to Split Graphs.

Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan

Proceedings of the Algorithm Theory - SWAT 2012, 2012

On the Kernelization Complexity of Problems on Graphs without Long Odd Cycles.

Fahad Panolan, Ashutosh Rai

Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012