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
762016
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
642013
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
612014
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
582015
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
432016
Fixed-parameter and approximation algorithms: A new look
R Chitnis, MT Hajiaghayi, G Kortsarz
International Symposium on Parameterized and Exact Computation, 110-122, 2013
422013
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
382012
Preventing unraveling in social networks gets harder
R Chitnis, F Fomin, P Golovach
Proceedings of the AAAI Conference on Artificial Intelligence 27 (1), 2013
262013
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
242020
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
232015
Parameterized approximation algorithms for bidirected steiner network problems
R Chitnis, AE Feldmann, P Manurangsi
arXiv preprint arXiv:1707.06499, 2017
182017
Parameterized complexity of the anchored k-core problem for directed graphs
R Chitnis, FV Fomin, PA Golovach
Information and Computation 247, 11-22, 2016
152016
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
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
122015
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
112014
Parameterized complexity of problems in coalitional resource games
R Chitnis, MT Hajiaghayi, V Liaghat
Proceedings of the AAAI Conference on Artificial Intelligence 25 (1), 2011
102011
List H-coloring a graph by removing few vertices
R Chitnis, L Egri, D Marx
Algorithmica 78 (1), 110-146, 2017
82017
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
Can We Create Large k-Cores by Adding Few Edges?
R Chitnis, N Talmon
International Computer Science Symposium in Russia, 78-89, 2018
62018
The system can't perform the operation now. Try again later.
Articles 1–20