Ashutosh Rai

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