Ashutosh Rai

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 26

Top Topics

Polynomial Kernels

Approximation Algorithms

Independent Set

Top Venues

Publications

Clément Legrand-Duchesne, Ashutosh Rai, Martin Tancer
Parameterized Complexity of Untangling Knots. SIAM J. Comput. 53 (2) (2024)
Soumen Mandal, Pranabendu Misra, Ashutosh Rai, Saket Saurabh
Parameterized Approximation Algorithms for Weighted Vertex Cover. LATIN (2) (2024)
Pavel Dvorák, Andreas Emil Feldmann, Ashutosh Rai, Pawel Rzazewski
Parameterized Inapproximability of Independent Set in H-Free Graphs. Algorithmica 85 (4) (2023)
Satyabrata Jana, Daniel Lokshtanov, Soumen Mandal, Ashutosh Rai, Saket Saurabh
Parameterized Approximation Scheme for Feedback Vertex Set. MFCS (2023)
Petr A. Golovach, Fahad Panolan, Ashutosh Rai, Saket Saurabh
Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs. CSR (2022)
Clément Legrand-Duchesne, Ashutosh Rai, Martin Tancer
Parameterized Complexity of Untangling Knots. ICALP (2022)
Yixin Cao, Ashutosh Rai, R. B. Sandeep, Junjie Ye
A Polynomial Kernel for Diamond-Free Editing. Algorithmica 84 (1) (2022)
R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale
Parameterized and Exact Algorithms for Class Domination Coloring. CoRR (2022)
R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale
Parameterized and exact algorithms for class domination coloring. Discret. Appl. Math. 291 (2021)
Clément Legrand-Duchesne, Ashutosh Rai, Martin Tancer
Parameterized complexity of untangling knots. CoRR (2021)
Andreas Emil Feldmann, Ashutosh Rai
On Extended Formulations For Parameterized Steiner Trees. IPEC (2021)
Andreas Emil Feldmann, Davis Issac, Ashutosh Rai
Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem. IPEC (2020)
Pavel Dvorák, Andreas Emil Feldmann, Ashutosh Rai, Pawel Rzazewski
Parameterized Inapproximability of Independent Set in H-Free Graphs. CoRR (2020)
Pranabendu Misra, Fahad Panolan, Ashutosh Rai, Saket Saurabh, Roohani Sharma
Quick Separation in Chordal and Split Graphs. MFCS (2020)
Pavel Dvorák, Andreas Emil Feldmann, Ashutosh Rai, Pawel Rzazewski
Parameterized Inapproximability of Independent Set in H-Free Graphs. WG (2020)
Andreas Emil Feldmann, Davis Issac, Ashutosh Rai
Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem. CoRR (2020)
Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. Algorithmica 81 (1) (2019)
Ashutosh Rai, Saket Saurabh
Bivariate complexity analysis of Almost Forest Deletion. Theor. Comput. Sci. 708 (2018)
Geevarghese Philip, Ashutosh Rai, Saket Saurabh
Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel. SIAM J. Discret. Math. 32 (2) (2018)
Yixin Cao, Ashutosh Rai, R. B. Sandeep, Junjie Ye
A Polynomial Kernel for Diamond-Free Editing. CoRR (2018)
Yixin Cao, Ashutosh Rai, R. B. Sandeep, Junjie Ye
A Polynomial Kernel for Diamond-Free Editing. ESA (2018)
Manu Basavaraju, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan, Saket Saurabh
On the kernelization complexity of string problems. Theor. Comput. Sci. 730 (2018)
R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale
Parameterized and Exact Algorithms for Class Domination Coloring. SOFSEM (2017)
Ashutosh Rai, M. S. Ramanujan, Saket Saurabh
A Parameterized Algorithm for Mixed-Cut. LATIN (2016)
R. Krithika, Pranabendu Misra, Ashutosh Rai, Prafullkumar Tale
Lossy Kernels for Graph Contraction Problems. FSTTCS (2016)
Ashutosh Rai, M. S. Ramanujan
Strong Parameterized Deletion: Bipartite Graphs. FSTTCS (2016)
Ashutosh Rai, Saket Saurabh
Bivariate Complexity Analysis of Almost Forest Deletion. COCOON (2015)
Geevarghese Philip, Ashutosh Rai, Saket Saurabh
Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel. MFCS (2) (2015)
Ashutosh Rai, M. S. Ramanujan, Saket Saurabh
A Parameterized Algorithm for Mixed Cut. CoRR (2015)
Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan
Faster Parameterized Algorithms for Deletion to Split Graphs. Algorithmica 71 (4) (2015)
Stefan Kratsch, Marcin Pilipczuk, Ashutosh Rai, Venkatesh Raman
Kernel Lower Bounds using Co-Nondeterminism: Finding Induced Hereditary Subgraphs. ACM Trans. Comput. Theory 7 (1) (2014)
Manu Basavaraju, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan, Saket Saurabh
On the Kernelization Complexity of String Problems. COCOON (2014)
Robert Crowston, Mark Jones, Gabriele Muciaccia, Geevarghese Philip, Ashutosh Rai, Saket Saurabh
Polynomial Kernels for λ-extendible Properties Parameterized Above the Poljak-Turzík Bound. CoRR (2013)
Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. WG (2013)
Robert Crowston, Mark Jones, Gabriele Muciaccia, Geevarghese Philip, Ashutosh Rai, Saket Saurabh
Polynomial Kernels for lambda-extendible Properties Parameterized Above the Poljak-Turzik Bound. FSTTCS (2013)
Stefan Kratsch, Marcin Pilipczuk, Ashutosh Rai, Venkatesh Raman
Kernel Lower Bounds Using Co-nondeterminism: Finding Induced Hereditary Subgraphs. SWAT (2012)
Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan
Faster Parameterized Algorithms for Deletion to Split Graphs. SWAT (2012)
Fahad Panolan, Ashutosh Rai
On the Kernelization Complexity of Problems on Graphs without Long Odd Cycles. COCOON (2012)