Rajesh Hemant Chitnis

According to our database1, Rajesh Hemant Chitnis authored at least 34 papers between 2009 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

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

A Tight Lower Bound for Planar Steiner Orientation.
Algorithmica, 2019

FPT Inapproximability of Directed Cut and Connectivity Problems.
Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

Towards a Theory of Parameterized Streaming Algorithms.
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.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Parameterized Approximation Algorithms for Bidirected Steiner Network Problems.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Can We Create Large k-Cores by Adding Few Edges?
Proceedings of the Computer Science - Theory and Applications, 2018

A Tight Lower Bound for Steiner Orientation.
Proceedings of the Computer Science - Theory and Applications, 2018

2017
Faster exact algorithms for some terminal set problems.
J. Comput. Syst. Sci., 2017

Parameterized Approximation Algorithms for Directed Steiner Network Problems.
CoRR, 2017

List H-Coloring a Graph by Removing Few Vertices.
Algorithmica, 2017

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

2016
Shadowless Solutions for Fixed-Parameter Tractability of Directed Graphs.
Encyclopedia of Algorithms, 2016

Designing FPT Algorithms for Cut Problems Using Randomized Contractions.
SIAM J. Comput., 2016

Parameterized complexity of the anchored k-core problem for directed graphs.
Inf. Comput., 2016

Tight Bounds for Gomory-Hu-like Cut Counting.
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.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015
Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable.
ACM Trans. Algorithms, 2015

Review of: Fundamentals of Parameterized Complexity by Rodney G. Downey and Michael R. Fellows.
SIGACT News, 2015

Kernelization via Sampling with Applications to Dynamic Graph Streams.
CoRR, 2015

Brief Announcement: New Streaming Algorithms for Parameterized Maximal Matching & Beyond.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Parameterized Streaming: Maximal Matching and Vertex Cover.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014
Parameterized Streaming Algorithms for Vertex Cover.
CoRR, 2014

Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions).
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).
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.
SIAM J. Comput., 2013

On the SIG-Dimension of Trees Under the L ∞-Metric.
Graphs and Combinatorics, 2013

Brief announcement: a game-theoretic model motivated by the darpa network challenge.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Fixed-Parameter and Approximation Algorithms: A New Look.
Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

Preventing Unraveling in Social Networks Gets Harder.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012
A Game-Theoretic Model Motivated by the DARPA Network Challenge
CoRR, 2012

2011
Parameterized Complexity of Problems in Coalitional Resource Games.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010
Parameterized Algorithms for Boxicity.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

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


  Loading...