Články se zplnomocněním k veřejnému přístupu - Rajesh ChitnisDalší informace
Dostupné někde: 13
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
Zplnomocnění: US National Science Foundation
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
Zplnomocnění: US National Science Foundation, European Commission
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
Zplnomocnění: Hungarian Scientific Research Fund, European Commission
Parameterized approximation algorithms for bidirected steiner network problems
R Chitnis, AE Feldmann, P Manurangsi
ACM Transactions on Algorithms (TALG) 17 (2), 1-68, 2021
Zplnomocnění: European Commission
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
Zplnomocnění: US National Science Foundation, US Department of Defense, European Commission
List H-coloring a graph by removing few vertices
R Chitnis, L Egri, D Marx
Algorithmica 78 (1), 110-146, 2017
Zplnomocnění: US National Science Foundation, US Department of Defense, Natural Sciences …
Parameterized complexity of the anchored k-core problem for directed graphs
R Chitnis, FV Fomin, PA Golovach
Information and Computation 247, 11-22, 2016
Zplnomocnění: US National Science Foundation, European Commission
Can We Create Large k-Cores by Adding Few Edges?
R Chitnis, N Talmon
International Computer Science Symposium in Russia, 78-89, 2018
Zplnomocnění: European Commission
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
Zplnomocnění: European Commission
A tight algorithm for strongly connected Steiner subgraph on two terminals with demands
R Chitnis, H Esfandiari, MT Hajiaghayi, R Khandekar, G Kortsarz, ...
Algorithmica 77, 1216-1239, 2017
Zplnomocnění: US National Science Foundation, US Department of Defense
A tight lower bound for planar Steiner orientation
R Chitnis, AE Feldmann, O Suchý
Algorithmica 81, 3200-3216, 2019
Zplnomocnění: European Commission
A tight lower bound for Steiner orientation
R Chitnis, AE Feldmann
International Computer Science Symposium in Russia, 65-77, 2018
Zplnomocnění: European Commission
How Does Fairness Affect the Complexity of Gerrymandering?
S Banerjee, R Chitnis, A Lahiri
AAMAS, 2869-2871, 2023
Zplnomocnění: German Research Foundation, Narodowe Centrum Nauki
Informace o publikování a financování jsou automaticky vybírány počítačovým programem