Rajesh Chitnis

36 papers A* 2A 2B 8C 1Misc 2Journal 19

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Lower bounds for approximate (& exact) k-Disjoint-Shortest-Paths. Theor. Comput. Sci. Rajesh Chitnis, Samuel Thomas, Anthony Wirth
2025	B	`conf`	On the Exact & Approximate Complexity of the Strongly Connected Steiner Subgraph Problem on Two Terminals with Demands. FCT Kevin Kurien Alex, Rajesh Chitnis, Alex Tempest
2024	B	`conf`	Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths. WAOA Rajesh Chitnis, Samuel Thomas, Anthony Wirth
2024	J	`jnl`	Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths. CoRR Rajesh Chitnis, Samuel Thomas, Anthony Wirth
2023	J	`jnl`	A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs. SIAM J. Discret. Math. Rajesh Chitnis
2023	A	`conf`	How Does Fairness Affect the Complexity of Gerrymandering? AAMAS Sandip Banerjee, Rajesh Chitnis, Abhiruk Lahiri
2023	B	`conf`	Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs. WADS Xiuge Chen, Rajesh Chitnis, Patrick Eades, Anthony Wirth
2023	J	`jnl`	Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs. CoRR Xiuge Chen, Rajesh Chitnis, Patrick Eades, Anthony Wirth
2022	B	`conf`	Refined Lower Bounds for Nearest Neighbor Condensation. ALT Rajesh Chitnis
2022	J	`jnl`	Tight Lower Bounds for Approximate & Exact k-Center in R CoRR Rajesh Chitnis, Nitin Saurabh
2022	A*	`conf`	Tight Lower Bounds for Approximate & Exact k-Center in ℝ SoCG Rajesh Chitnis, Nitin Saurabh
2021	C	`conf`	A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs. CIAC Rajesh Chitnis
2021	J	`jnl`	A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs. CoRR Rajesh Chitnis
2021	J	`jnl`	Parameterized Approximation Algorithms for Bidirected Steiner Network Problems. ACM Trans. Algorithms Rajesh Chitnis, Andreas Emil Feldmann, Pasin Manurangsi
2019	J	`jnl`	A Tight Lower Bound for Planar Steiner Orientation. Algorithmica Rajesh Chitnis, Andreas Emil Feldmann, Ondrej Suchý
2019	B	`conf`	FPT Inapproximability of Directed Cut and Connectivity Problems. IPEC Rajesh Chitnis, Andreas Emil Feldmann
2019	J	`jnl`	FPT Inapproximability of Directed Cut and Connectivity Problems. CoRR Rajesh Chitnis, Andreas Emil Feldmann
2019	J	`jnl`	Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions). CoRR Rajesh Chitnis, Andreas Emil Feldmann, MohammadTaghi Hajiaghayi, Dániel Marx
2019	B	`conf`	Towards a Theory of Parameterized Streaming Algorithms. IPEC Rajesh Chitnis, Graham Cormode
2019	J	`jnl`	Towards a Theory of Parameterized Streaming Algorithms. CoRR Rajesh Chitnis, Graham Cormode
2018	Misc	`conf`	A Tight Lower Bound for Steiner Orientation. CSR Rajesh Chitnis, Andreas Emil Feldmann
2018	B	`conf`	Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets. LATIN Sandip Banerjee, Sujoy Bhore, Rajesh Chitnis
2018	Misc	`conf`	Can We Create Large k-Cores by Adding Few Edges? CSR Rajesh Chitnis, Nimrod Talmon
2018	A	`conf`	Parameterized Approximation Algorithms for Bidirected Steiner Network Problems. ESA Rajesh Chitnis, Andreas Emil Feldmann, Pasin Manurangsi
2017	J	`jnl`	A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands. Algorithmica Rajesh Chitnis, Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Saeed Seddighin
2017	J	`jnl`	Faster exact algorithms for some terminal set problems. J. Comput. Syst. Sci. Rajesh Chitnis, Fedor V. Fomin, Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
2017	J	`jnl`	List H-Coloring a Graph by Removing Few Vertices. Algorithmica Rajesh Chitnis, László Egri, Dániel Marx
2017	J	`jnl`	Parameterized Approximation Algorithms for Directed Steiner Network Problems. CoRR Rajesh Chitnis, Andreas Emil Feldmann, Pasin Manurangsi
2016	J	`jnl`	Designing FPT Algorithms for Cut Problems Using Randomized Contractions. SIAM J. Comput. Rajesh Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk, Michal Pilipczuk
2016	A*	`conf`	Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams. SODA Rajesh Chitnis, Graham Cormode, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Andrew McGregor, Morteza Monemizadeh, Sofya Vorotnikova
2016	J	`jnl`	Parameterized complexity of the anchored k-core problem for directed graphs. Inf. Comput. Rajesh Chitnis, Fedor V. Fomin, Petr A. Golovach
2016	—	`ch.`	Shadowless Solutions for Fixed-Parameter Tractability of Directed Graphs. Encyclopedia of Algorithms Rajesh Chitnis, Mohammad Taghi Hajiaghayi
2016	B	`conf`	Tight Bounds for Gomory-Hu-like Cut Counting. WG Rajesh Chitnis, Lior Kamma, Robert Krauthgamer
2015	J	`jnl`	Tight Bounds for Gomory-Hu-like Cut Counting. CoRR Rajesh Chitnis, Lior Kamma, Robert Krauthgamer
2014	—	`—`	Directed Graphs: Fixed-Parameter Tractability & Beyond. Rajesh Chitnis
2009	J	`jnl`	On the SIG dimension of trees under $L_{\infty}$ metric. CoRR L. Sunil Chandran, Rajesh Chitnis, Ramanjit Kumar