Rajesh Chitnis
Title
Cited by
Cited by
Year
Kernelization via sampling with applications to finding matchings and related problems in dynamic graph streams
R Chitnis, G Cormode, H Esfandiari, MT Hajiaghayi, A McGregor, ...
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
672016
Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset
R Chitnis, MT Hajiaghayi, D Marx
SIAM Journal on Computing 42 (4), 1674-1696, 2013
612013
Directed subset feedback vertex set is fixed-parameter tractable
R Chitnis, M Cygan, M Hajiaghayi, D Marx
ACM Transactions on Algorithms (TALG) 11 (4), 1-28, 2015
542015
Parameterized streaming: Maximal matching and vertex cover
R Chitnis, G Cormode, MT Hajiaghayi, M Monemizadeh
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014
532014
Fixed-parameter and approximation algorithms: A new look
R Chitnis, MT Hajiaghayi, G Kortsarz
International Symposium on Parameterized and Exact Computation, 110-122, 2013
412013
Designing FPT algorithms for cut problems using randomized contractions
R Chitnis, M Cygan, MT Hajiaghayi, M Pilipczuk, M Pilipczuk
SIAM Journal on Computing 45 (4), 1171-1229, 2016
372016
Designing FPT algorithms for cut problems using randomized contractions
R Chitnis, M Cygan, MT Hajiaghayi, M Pilipczuk, M Pilipczuk
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 460-469, 2012
362012
Preventing unraveling in social networks gets harder
R Chitnis, FV Fomin, PA Golovach
arXiv preprint arXiv:1304.6420, 2013
232013
Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions)
RH Chitnis, AE Feldmann, MT Hajiaghayi, D Marx
SIAM Journal on Computing 49 (2), 318-364, 2020
222020
Kernelization via sampling with applications to dynamic graph streams
R Chitnis, G Cormode, H Esfandiari, MT Hajiaghayi, A McGregor, ...
arXiv preprint arXiv:1505.01731, 2015
212015
Parameterized approximation algorithms for bidirected Steiner network problems
R Chitnis, AE Feldmann, P Manurangsi
arXiv preprint arXiv:1707.06499, 2017
152017
Parameterized complexity of the anchored k-core problem for directed graphs
R Chitnis, FV Fomin, PA Golovach
Information and Computation 247, 11-22, 2016
142016
List H-coloring a graph by removing few vertices
R Chitnis, L Egri, D Marx
European Symposium on Algorithms, 313-324, 2013
132013
Parameterized algorithms for boxicity
A Adiga, R Chitnis, S Saurabh
International Symposium on Algorithms and Computation, 366-377, 2010
132010
A tight algorithm for strongly connected Steiner subgraph on two terminals with demands
RH Chitnis, H Esfandiari, MT Hajiaghayi, R Khandekar, G Kortsarz, ...
International Symposium on Parameterized and Exact Computation, 159-171, 2014
102014
Parameterized complexity of problems in coalitional resource games
R Chitnis, MT Hajiaghayi, V Liaghat
arXiv preprint arXiv:1105.0707, 2011
92011
List H-coloring a graph by removing few vertices
R Chitnis, L Egri, D Marx
Algorithmica 78 (1), 110-146, 2017
82017
Brief announcement: New streaming algorithms for parameterized maximal matching & beyond
R Chitnis, G Cormode, H Esfandiari, MT Hajiaghayi, M Monemizadeh
Proceedings of the 27th ACM symposium on Parallelism in Algorithms and …, 2015
82015
Faster exact algorithms for some terminal set problems
R Chitnis, FV Fomin, D Lokshtanov, P Misra, MS Ramanujan, S Saurabh
International Symposium on Parameterized and Exact Computation, 150-162, 2013
72013
Faster exact algorithms for some terminal set problems
R Chitnis, FV Fomin, D Lokshtanov, P Misra, MS Ramanujan, S Saurabh
Journal of Computer and System Sciences 88, 195-207, 2017
62017
The system can't perform the operation now. Try again later.
Articles 1–20