Rajesh Chitnis

Available identifiers

zbMath Open chitnis.rajesh-hemantWikidataQ61050510 ScholiaQ61050510MaRDI QIDQ259034

List of research outcomes

Publication	Date of Publication	Type
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
https://portal.mardi4nfdi.de/entity/Q5743512	2019-05-10	Paper
A tight lower bound for Steiner orientation	2018-11-28	Paper
Can we create large \(k\)-cores by adding few edges?	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

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Rajesh Chitnis