Rajesh Chitnis
TitoloCitata daAnno
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
622016
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
542013
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
462014
Directed subset feedback vertex set is fixed-parameter tractable
R Chitnis, M Cygan, M Hajiaghayi, D Marx
ACM Transactions on Algorithms (TALG) 11 (4), 28, 2015
412015
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
Fixed-parameter and approximation algorithms: A new look
R Chitnis, MT Hajiaghayi, G Kortsarz
International Symposium on Parameterized and Exact Computation, 110-122, 2013
352013
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
322016
Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions)
R Chitnis, MT Hajiaghayi, D Marx
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
222014
List H-coloring a graph by removing few vertices
R Chitnis, L Egri, D Marx
European Symposium on Algorithms, 313-324, 2013
17*2013
Preventing unraveling in social networks gets harder
RH Chitnis, FV Fomin, PA Golovach
Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013
172013
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
152015
Parameterized algorithms for boxicity
A Adiga, R Chitnis, S Saurabh
International Symposium on Algorithms and Computation, 366-377, 2010
132010
Parameterized complexity of the anchored k-core problem for directed graphs
R Chitnis, FV Fomin, PA Golovach
Information and Computation 247, 11-22, 2016
122016
Parameterized approximation algorithms for bidirected Steiner network problems
R Chitnis, AE Feldmann, P Manurangsi
arXiv preprint arXiv:1707.06499, 2017
102017
Parameterized complexity of problems in coalitional resource games
RH Chitnis, MT Hajiaghayi, V Liaghat
Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011
82011
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
72014
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
Brief Announcement: New Streaming Algorithms for Parameterized Maximal Matching & Beyond.
RH Chitnis, G Cormode, H Esfandiari, MT Hajiaghayi, M Monemizadeh
SPAA, 56-58, 2015
52015
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
42017
Brief announcement: a game-theoretic model motivated by the darpa network challenge
R Chitnis, MT Hajiaghayi, J Katz, K Mukherjee
Proceedings of the twenty-fifth annual ACM symposium on parallelism in …, 2013
42013
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20