default search action
Ashutosh Rai 0001
Person information
- affiliation: IIT Delhi, India
- affiliation: Charles University in Prague, Department of Applied Mathematics, Czech Republic
- affiliation (former): Hong Kong Polytechnic University, Department of Computing, Hong Kong
- affiliation (former): Institute of Mathematical Sciences, Chennai, India
Other persons with the same name
- Ashutosh Rai 0002
— University of Latvia, Riga
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Clément Legrand-Duchesne, Ashutosh Rai, Martin Tancer:
Parameterized Complexity of Untangling Knots. SIAM J. Comput. 53(2): 431-479 (2024) - [j10]Soumen Mandal, Pranabendu Misra, Ashutosh Rai, Saket Saurabh:
Parameterized approximation algorithms for weighted vertex cover. Theor. Comput. Sci. 1021: 114870 (2024) - [c22]Neeldhara Misra, Harshil Mittal, Ashutosh Rai:
On the Parameterized Complexity of Diverse SAT. ISAAC 2024: 50:1-50:18 - [c21]Soumen Mandal, Pranabendu Misra, Ashutosh Rai, Saket Saurabh:
Parameterized Approximation Algorithms for Weighted Vertex Cover. LATIN (2) 2024: 177-192 - 2023
- [j9]Pavel Dvorák
Parameterized Inapproximability of Independent Set in H-Free Graphs. Algorithmica 85(4): 902-928 (2023) - [c20]Satyabrata Jana
Parameterized Approximation Scheme for Feedback Vertex Set. MFCS 2023: 56:1-56:15 - 2022
- [j8]Yixin Cao
A Polynomial Kernel for Diamond-Free Editing. Algorithmica 84(1): 197-215 (2022) - [c19]Petr A. Golovach, Fahad Panolan
Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs. CSR 2022: 152-169 - [c18]Clément Legrand-Duchesne, Ashutosh Rai, Martin Tancer
Parameterized Complexity of Untangling Knots. ICALP 2022: 88:1-88:17 - [i7]R. Krithika
Parameterized and Exact Algorithms for Class Domination Coloring. CoRR abs/2203.09106 (2022) - 2021
- [j7]R. Krithika
Parameterized and exact algorithms for class domination coloring. Discret. Appl. Math. 291: 286-299 (2021) - [c17]Andreas Emil Feldmann
On Extended Formulations For Parameterized Steiner Trees. IPEC 2021: 18:1-18:16 - [i6]Clément Legrand-Duchesne, Ashutosh Rai, Martin Tancer:
Parameterized complexity of untangling knots. CoRR abs/2111.05001 (2021) - 2020
- [c16]Andreas Emil Feldmann
Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem. IPEC 2020: 17:1-17:16 - [c15]Pranabendu Misra, Fahad Panolan
Quick Separation in Chordal and Split Graphs. MFCS 2020: 70:1-70:14 - [c14]Pavel Dvorák
Parameterized Inapproximability of Independent Set in H-Free Graphs. WG 2020: 40-53 - [i5]Andreas Emil Feldmann
Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem. CoRR abs/2002.07761 (2020) - [i4]Pavel Dvorák, Andreas Emil Feldmann, Ashutosh Rai, Pawel Rzazewski:
Parameterized Inapproximability of Independent Set in H-Free Graphs. CoRR abs/2006.10444 (2020)
2010 – 2019
- 2019
- [j6]Neeldhara Misra, Fahad Panolan
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. Algorithmica 81(1): 26-46 (2019) - 2018
- [j5]Geevarghese Philip, Ashutosh Rai, Saket Saurabh:
Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel. SIAM J. Discret. Math. 32(2): 882-901 (2018) - [j4]Ashutosh Rai, Saket Saurabh:
Bivariate complexity analysis of Almost Forest Deletion. Theor. Comput. Sci. 708: 18-33 (2018) - [j3]Manu Basavaraju, Fahad Panolan
On the kernelization complexity of string problems. Theor. Comput. Sci. 730: 21-31 (2018) - [c13]Yixin Cao, Ashutosh Rai, R. B. Sandeep, Junjie Ye:
A Polynomial Kernel for Diamond-Free Editing. ESA 2018: 10:1-10:13 - [i3]Yixin Cao, Ashutosh Rai, R. B. Sandeep, Junjie Ye
A Polynomial Kernel for Diamond-Free Editing. CoRR abs/1803.03358 (2018) - 2017
- [c12]R. Krithika
Parameterized and Exact Algorithms for Class Domination Coloring. SOFSEM 2017: 336-349 - 2016
- [c11]Ashutosh Rai, M. S. Ramanujan:
Strong Parameterized Deletion: Bipartite Graphs. FSTTCS 2016: 21:1-21:14 - [c10]R. Krithika
Lossy Kernels for Graph Contraction Problems. FSTTCS 2016: 23:1-23:14 - [c9]Ashutosh Rai, M. S. Ramanujan, Saket Saurabh:
A Parameterized Algorithm for Mixed-Cut. LATIN 2016: 672-685 - 2015
- [j2]Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan
Faster Parameterized Algorithms for Deletion to Split Graphs. Algorithmica 71(4): 989-1006 (2015) - [c8]Ashutosh Rai, Saket Saurabh:
Bivariate Complexity Analysis of Almost Forest Deletion. COCOON 2015: 133-144 - [c7]Geevarghese Philip, Ashutosh Rai, Saket Saurabh:
Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel. MFCS (2) 2015: 517-528 - [i2]Ashutosh Rai, M. S. Ramanujan, Saket Saurabh:
A Parameterized Algorithm for Mixed Cut. CoRR abs/1509.05612 (2015) - 2014
- [j1]Stefan Kratsch, Marcin Pilipczuk
Kernel Lower Bounds using Co-Nondeterminism: Finding Induced Hereditary Subgraphs. ACM Trans. Comput. Theory 7(1): 4:1-4:18 (2014) - [c6]Manu Basavaraju, Fahad Panolan
On the Kernelization Complexity of String Problems. COCOON 2014: 141-153 - 2013
- [c5]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: 43-54 - [c4]Neeldhara Misra, Fahad Panolan
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. WG 2013: 370-381 - [i1]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 abs/1310.2928 (2013) - 2012
- [c3]Fahad Panolan
On the Kernelization Complexity of Problems on Graphs without Long Odd Cycles. COCOON 2012: 445-457 - [c2]Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan
Faster Parameterized Algorithms for Deletion to Split Graphs. SWAT 2012: 107-118 - [c1]Stefan Kratsch, Marcin Pilipczuk
Kernel Lower Bounds Using Co-nondeterminism: Finding Induced Hereditary Subgraphs. SWAT 2012: 364-375
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-05 20:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: