13 citations · 40 across the 13 of their papers we have counts for
Showing 2019 · cs.DSShow all
3 papers · 2 filters
cs.DS2019
Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)
Rajesh Chitnis, Andreas Emil Feldmann, MohammadTaghi Hajiaghayi +1
(see paper for full abstract) Given a vertex-weighted directed graph and a set of terminals, the objective of the SCSS problem is to find…
cs.DS2019
Towards a Theory of Parameterized Streaming Algorithms
Rajesh Chitnis, Graham Cormode
Parameterized complexity attempts to give a more fine-grained analysis of the complexity of problems: instead of measuring the running time as a function of only the input size, we…
cs.DS2019
FPT Inapproximability of Directed Cut and Connectivity Problems
Rajesh Chitnis, Andreas Emil Feldmann
(see paper for full abstract) Cut problems and connectivity problems on digraphs are two well-studied classes of problems from the viewpoint of parameterized complexity. After a se…