Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Rai, Ashutosh"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the kernelization complexity of string problems
Manu Basavaraju
,
Fahad Panolan
,
Ashutosh Rai
,
M.S. Ramanujan
,
Saket Saurabh
Lecture Notes in Computer Science
8591
, 2014, pp. 141-153
Polynomial kernels for
\lambda
-extendible properties parameterized above the Poljak-TurzĂik bound
Robert Crowston
,
Mark Jones
,
Gabriele Muciaccia
,
Geevarghese Philip
,
Ashutosh Rai
,
Saket Saurabh
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 43-54
Parameterized algorithms for
Max Colorable Induced Subgraph
problem on perfect graphs
Neeldhara Misra
,
Fahad Panolan
,
Ashutosh Rai
,
Venkatesh Raman
,
Saket Saurabh
Lecture Notes in Computer Science
8165
, 2013, pp. 370-381
Faster parameterized algorithms for deletion to split graphs
Esha Ghosh
,
Sudeshna Kolay
,
Mrinal Kumar
,
Pranabendu Misra
,
Fahad Panolan
,
Ashutosh Rai
,
M.S. Ramanujan
Lecture Notes in Computer Science
7357
, 2012, pp. 107-118
Kernel lower bounds using co-nondeterminism: Finding induced hereditary subgraphs
Stefan Kratsch
,
Marcin Pilipczuk
,
Ashutosh Rai
,
Venkatesh Raman
Lecture Notes in Computer Science
7357
, 2012, pp. 364-375
On the kernelization complexity of problems on graphs without long odd cycles
Fahad Panolan
,
Ashutosh Rai
Lecture Notes in Computer Science
7434
, 2012, pp. 445-457