Rajesh Chitnis

Available identifiers

zbMath Open chitnis.rajesh-hemantDBLP00/9923WikidataQ61050510 ScholiaQ61050510MaRDI QIDQ259034

List of research outcomes

Publication	Date of Publication	Type
Tight lower bounds for approximate \& exact \(k\)-center in \(\mathbb{R}^d\)	2024-05-14	Paper
Sublinear-space streaming algorithms for estimating graph parameters on sparse graphs	2024-01-16	Paper
A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs	2023-05-31	Paper
A tight lower bound for edge-disjoint paths on planar DAGs	2023-03-22	Paper
Towards a theory of parameterized streaming algorithms	2023-02-03	Paper
FPT Inapproximability of Directed Cut and Connectivity Problems	2023-02-03	Paper
Parameterized Approximation Algorithms for Bidirected Steiner Network Problems	2022-02-16	Paper
Parameterized approximation algorithms for bidirected Steiner network problems	2021-08-04	Paper
Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions)	2020-03-27	Paper
Algorithms and hardness results for nearest neighbor problems in bicolored point sets	2020-02-12	Paper
A tight lower bound for planar Steiner orientation	2019-06-27	Paper
Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions)	2019-06-20	Paper
Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset	2019-05-10	Paper
Can we create large \(k\)-cores by adding few edges?	2018-11-28	Paper
A tight lower bound for Steiner orientation	2018-11-28	Paper
Directed subset feedback vertex set is fixed-parameter tractable	2018-10-30	Paper
Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams	2018-07-16	Paper
Parameterized Streaming: Maximal Matching and Vertex Cover	2017-10-05	Paper
Faster exact algorithms for some terminal set problems	2017-06-30	Paper
List H-coloring a graph by removing few vertices	2017-05-11	Paper
A tight algorithm for strongly connected Steiner subgraph on two terminals with demands	2017-05-02	Paper
Parameterized complexity of the anchored \(k\)-core problem for directed graphs	2017-02-21	Paper
Tight Bounds for Gomory-Hu-like Cut Counting	2016-12-22	Paper
Designing FPT algorithms for cut problems using randomized contractions	2016-08-16	Paper
Parameterized complexity of the anchored \(k\)-core problem for directed graphs	2016-03-10	Paper
A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract)	2015-09-15	Paper
Fixed-Parameter and Approximation Algorithms: A New Look	2013-12-10	Paper
Faster exact algorithms for some terminal set problems	2013-12-10	Paper
Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset	2013-11-14	Paper
List H-coloring a graph by removing few vertices	2013-09-17	Paper
Directed Subset Feedback Vertex Set is fixed-parameter tractable	2013-08-12	Paper
On the \(SIG\)-dimension of trees under the \(L_\infty\)-metric	2013-07-19	Paper
Parameterized algorithms for boxicity	2010-12-09	Paper

Research outcomes over time

This page was built for person: Rajesh Chitnis