Folgen
Ashutosh Rai
Ashutosh Rai
Department of Mathematics, IIT Delhi
Bestätigte E-Mail-Adresse bei maths.iitd.ac.in - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Faster parameterized algorithms for deletion to split graphs
E Ghosh, S Kolay, M Kumar, P Misra, F Panolan, A Rai, MS Ramanujan
Algorithmica 71 (4), 989-1006, 2015
472015
Lossy kernels for graph contraction problems
R Krithika, P Misra, A Rai, P Tale
36th IARCS Annual Conference on Foundations of Software Technology and …, 2016
222016
Generalized pseudoforest deletion: Algorithms and uniform kernel
G Philip, A Rai, S Saurabh
SIAM Journal on Discrete Mathematics 32 (2), 882-901, 2018
192018
Faster parameterized algorithms for deletion to split graphs
E Ghosh, S Kolay, M Kumar, P Misra, F Panolan, A Rai, MS Ramanujan
Scandinavian Workshop on Algorithm Theory, 107-118, 2012
192012
Polynomial Kernels for {\lambda}-extendible Properties Parameterized Above the Poljak-Turz\'ik Bound
R Crowston, M Jones, G Muciaccia, G Philip, A Rai, S Saurabh
arXiv preprint arXiv:1310.2928, 2013
182013
Kernel lower bounds using co-nondeterminism: Finding induced hereditary subgraphs
S Kratsch, M Pilipczuk, A Rai, V Raman
Algorithm Theory–SWAT 2012: 13th Scandinavian Symposium and Workshops …, 2012
152012
Parameterized and exact algorithms for class domination coloring
R Krithika, A Rai, S Saurabh, P Tale
Discrete Applied Mathematics 291, 286-299, 2021
142021
On the kernelization complexity of string problems
M Basavaraju, F Panolan, A Rai, MS Ramanujan, S Saurabh
Theoretical Computer Science 730, 21-31, 2018
122018
A polynomial kernel for diamond-free editing
Y Cao, A Rai, RB Sandeep, J Ye
Algorithmica, 1-19, 2018
102018
Kernel lower bounds using co-nondeterminism: Finding induced hereditary subgraphs
S Kratsch, M Pilipczuk, A Rai, V Raman
ACM Transactions on Computation Theory (TOCT) 7 (1), 1-18, 2015
102015
Bivariate complexity analysis of almost forest deletion
A Rai, S Saurabh
Theoretical Computer Science 708, 18-33, 2018
92018
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs
N Misra, F Panolan, A Rai, V Raman, S Saurabh
Graph-Theoretic Concepts in Computer Science: 39th International Workshop …, 2013
92013
Parameterized inapproximability of independent set in H-free graphs
P Dvořák, AE Feldmann, A Rai, P Rzążewski
Algorithmica 85 (4), 902-928, 2023
82023
A Parameterized Algorithm for Mixed-Cut
A Rai, MS Ramanujan, S Saurabh
LATIN 2016: Theoretical Informatics, 672-685, 2016
72016
Fixed-parameter tractability of the weighted edge clique partition problem
AE Feldmann, D Issac, A Rai
arXiv preprint arXiv:2002.07761, 2020
62020
Strong parameterized deletion: Bipartite graphs
A Rai, MS Ramanujan
36th IARCS Annual Conference on Foundations of Software Technology and …, 2016
52016
Bivariate Complexity Analysis of Almost Forest Deletion
A Rai, S Saurabh
Computing and Combinatorics: 21st International Conference, COCOON 2015 …, 2015
42015
On the kernelization complexity of string problems
M Basavaraju, F Panolan, A Rai, MS Ramanujan, S Saurabh
Computing and Combinatorics: 20th International Conference, COCOON 2014 …, 2014
42014
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs
N Misra, F Panolan, A Rai, V Raman, S Saurabh
Algorithmica 81, 26-46, 2019
32019
On the kernelization complexity of problems on graphs without long odd cycles
F Panolan, A Rai
International Computing and Combinatorics Conference, 445-457, 2012
32012
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20