Rajesh Hemant Chitnis

According to our database, Rajesh Hemant Chitnis authored at least 39 papers between 2009 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs.

Rajesh Chitnis

SIAM J. Discret. Math., June, 2023

Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs.

Xiuge Chen, Rajesh Chitnis, Patrick Eades, Anthony Wirth

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

How Does Fairness Affect the Complexity of Gerrymandering?

Sandip Banerjee, Rajesh Chitnis, Abhiruk Lahiri

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022

Tight Lower Bounds for Approximate & Exact k-Center in ℝ^d.

Rajesh Chitnis, Nitin Saurabh

Proceedings of the 38th International Symposium on Computational Geometry, 2022

Refined Lower Bounds for Nearest Neighbor Condensation.

Rajesh Chitnis

Proceedings of the International Conference on Algorithmic Learning Theory, 29 March, 2022

2021

Parameterized Approximation Algorithms for Bidirected Steiner Network Problems.

Rajesh Chitnis, Andreas Emil Feldmann, Pasin Manurangsi

ACM Trans. Algorithms, 2021

2020

Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions).

Rajesh Hemant Chitnis, Andreas Emil Feldmann, Mohammad Taghi Hajiaghayi, Dániel Marx

SIAM J. Comput., 2020

2019

A Tight Lower Bound for Planar Steiner Orientation.

Rajesh Chitnis, Andreas Emil Feldmann, Ondrej Suchý

Algorithmica, 2019

FPT Inapproximability of Directed Cut and Connectivity Problems.

Rajesh Chitnis, Andreas Emil Feldmann

Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

Towards a Theory of Parameterized Streaming Algorithms.

Rajesh Chitnis, Graham Cormode

Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

2018

Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets.

Sandip Banerjee, Sujoy Bhore, Rajesh Chitnis

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Can We Create Large k-Cores by Adding Few Edges?

Rajesh Chitnis, Nimrod Talmon

Proceedings of the Computer Science - Theory and Applications, 2018

A Tight Lower Bound for Steiner Orientation.

Rajesh Chitnis, Andreas Emil Feldmann

Proceedings of the Computer Science - Theory and Applications, 2018

2017

Faster exact algorithms for some terminal set problems.

Rajesh Chitnis, Fedor V. Fomin, Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh

J. Comput. Syst. Sci., 2017

Parameterized Approximation Algorithms for Directed Steiner Network Problems.

Rajesh Chitnis, Andreas Emil Feldmann, Pasin Manurangsi

CoRR, 2017

List H-Coloring a Graph by Removing Few Vertices.

Rajesh Chitnis, László Egri, Dániel Marx

Algorithmica, 2017

A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands.

Rajesh Chitnis, Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Saeed Seddighin

Algorithmica, 2017

2016

Shadowless Solutions for Fixed-Parameter Tractability of Directed Graphs.

Rajesh Chitnis, Mohammad Taghi Hajiaghayi

Encyclopedia of Algorithms, 2016

Designing FPT Algorithms for Cut Problems Using Randomized Contractions.

Rajesh Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk, Michal Pilipczuk

SIAM J. Comput., 2016

Parameterized complexity of the anchored k-core problem for directed graphs.

Rajesh Chitnis, Fedor V. Fomin, Petr A. Golovach

Inf. Comput., 2016

Tight Bounds for Gomory-Hu-like Cut Counting.

Rajesh Chitnis, Lior Kamma, Robert Krauthgamer

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams.

Rajesh Chitnis, Graham Cormode, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Andrew McGregor, Morteza Monemizadeh, Sofya Vorotnikova

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable.

Rajesh Hemant Chitnis, Marek Cygan, Mohammad Taghi Hajiaghayi, Dániel Marx

ACM Trans. Algorithms, 2015

Review of: Fundamentals of Parameterized Complexity by Rodney G. Downey and Michael R. Fellows.

Rajesh Hemant Chitnis

SIGACT News, 2015

Kernelization via Sampling with Applications to Dynamic Graph Streams.

Rajesh Hemant Chitnis, Graham Cormode, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Andrew McGregor, Morteza Monemizadeh, Sofya Vorotnikova

CoRR, 2015

Brief Announcement: New Streaming Algorithms for Parameterized Maximal Matching & Beyond.

Rajesh Hemant Chitnis, Graham Cormode, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Morteza Monemizadeh

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Parameterized Streaming: Maximal Matching and Vertex Cover.

Rajesh Hemant Chitnis, Graham Cormode, Mohammad Taghi Hajiaghayi, Morteza Monemizadeh

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

Parameterized Streaming Algorithms for Vertex Cover.

Rajesh Hemant Chitnis, Graham Cormode, Mohammad Taghi Hajiaghayi, Morteza Monemizadeh

CoRR, 2014

Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions).

Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Dániel Marx

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract).

Rajesh Hemant Chitnis, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Saeed Seddighin

Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

2013

Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset.

Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Dániel Marx

SIAM J. Comput., 2013

On the SIG-Dimension of Trees Under the L ∞-Metric.

L. Sunil Chandran, Rajesh Hemant Chitnis, Ramanjit Kumar

Graphs Comb., 2013

Brief announcement: a game-theoretic model motivated by the darpa network challenge.

Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Jonathan Katz, Koyel Mukherjee

Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Fixed-Parameter and Approximation Algorithms: A New Look.

Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Guy Kortsarz

Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

Preventing Unraveling in Social Networks Gets Harder.

Rajesh Hemant Chitnis, Fedor V. Fomin, Petr A. Golovach

Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012

A Game-Theoretic Model Motivated by the DARPA Network Challenge

Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Jonathan Katz, Koyel Mukherjee

CoRR, 2012

2011

Parameterized Complexity of Problems in Coalitional Resource Games.

Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Vahid Liaghat

Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010

Parameterized Algorithms for Boxicity.

Abhijin Adiga, Rajesh Hemant Chitnis, Saket Saurabh

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009

On the SIG dimension of trees under $L_{\infty}$ metric.

L. Sunil Chandran, Rajesh Chitnis, Ramanjit Kumar

CoRR, 2009