Rajesh Chitnis

609 total citations
20 papers, 145 citations indexed

About

Rajesh Chitnis is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Rajesh Chitnis has authored 20 papers receiving a total of 145 indexed citations (citations by other indexed papers that have themselves been cited), including 19 papers in Computational Theory and Mathematics, 7 papers in Computer Networks and Communications and 4 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Rajesh Chitnis's work include Complexity and Algorithms in Graphs (18 papers), Advanced Graph Theory Research (16 papers) and Optimization and Search Problems (5 papers). Rajesh Chitnis is often cited by papers focused on Complexity and Algorithms in Graphs (18 papers), Advanced Graph Theory Research (16 papers) and Optimization and Search Problems (5 papers). Rajesh Chitnis collaborates with scholars based in United States, United Kingdom and Israel. Rajesh Chitnis's co-authors include MohammadTaghi Hajiaghayi, Dániel Marx, Marek Cygan, Graham Cormode, Morteza Monemizadeh, Marcin Pilipczuk, Michał Pilipczuk, Petr A. Golovach, Fedor V. Fomin and Mohammad Taghi Hajiaghayi and has published in prestigious journals such as SIAM Journal on Computing, Journal of Computer and System Sciences and Algorithmica.

In The Last Decade

Rajesh Chitnis

18 papers receiving 140 citations

Peers

Rajesh Chitnis

CTM

CNC

DMC

CVPR

Pål Grønås Drange Norway

Johan M. M. van Rooij Netherlands

Euiwoong Lee United States

Tamás Király Hungary

Markus Sortland Dregi Norway

Russell Martin United Kingdom

Alexander Langer Germany

Jakub Onufry Wojtaszczyk Poland

Fahad Panolan India

Maximilian Probst Gutenberg Switzerland

Pål Grønås Drange Norway

Rajesh Chitnis

135 ×1.1

CTM

57 ×1.0

CNC

16 ×0.6

11 ×0.9

DMC

7 ×0.6

CVPR

Citations per year, relative to Rajesh Chitnis Rajesh Chitnis (= 1×) peers Pål Grønås Drange

Countries citing papers authored by Rajesh Chitnis

Since Specialization

Citations

This map shows the geographic impact of Rajesh Chitnis's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Rajesh Chitnis with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Rajesh Chitnis more than expected).

Fields of papers citing papers by Rajesh Chitnis

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Rajesh Chitnis. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Rajesh Chitnis. The network helps show where Rajesh Chitnis may publish in the future.

Co-authorship network of co-authors of Rajesh Chitnis

This figure shows the co-authorship network connecting the top 25 collaborators of Rajesh Chitnis. A scholar is included among the top collaborators of Rajesh Chitnis based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Rajesh Chitnis. Rajesh Chitnis is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Chitnis, Rajesh. (2023). A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs. SIAM Journal on Discrete Mathematics. 37(2). 556–572.

Chitnis, Rajesh, Andreas Emil Feldmann, & Pasin Manurangsi. (2021). Parameterized Approximation Algorithms for Bidirected Steiner Network Problems. ACM Transactions on Algorithms. 17(2). 1–68. 4 indexed citations

Chitnis, Rajesh, et al.. (2020). Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions). SIAM Journal on Computing. 49(2). 318–364. 3 indexed citations

Chitnis, Rajesh & Graham Cormode. (2019). Towards a Theory of Parameterized Streaming Algorithms. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).

Chitnis, Rajesh, Andreas Emil Feldmann, & Ondřej Suchý. (2019). A Tight Lower Bound for Planar Steiner Orientation. Algorithmica. 81(8). 3200–3216. 1 indexed citations

Chitnis, Rajesh, Andreas Emil Feldmann, & Pasin Manurangsi. (2018). Parameterized Approximation Algorithms for Bidirected Steiner Network Problems. Warwick Research Archive Portal (University of Warwick). 16. 4 indexed citations

Chitnis, Rajesh, et al.. (2017). Faster exact algorithms for some terminal set problems. Journal of Computer and System Sciences. 88. 195–207. 4 indexed citations

Chitnis, Rajesh, Hossein Esfandiari, MohammadTaghi Hajiaghayi, et al.. (2016). A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands. Algorithmica. 77(4). 1216–1239. 2 indexed citations

Chitnis, Rajesh, Marek Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk, & Michał Pilipczuk. (2016). Designing FPT Algorithms for Cut Problems Using Randomized Contractions. SIAM Journal on Computing. 45(4). 1171–1229. 23 indexed citations

10.

Chitnis, Rajesh, et al.. (2016). List H-Coloring a Graph by Removing Few Vertices. Algorithmica. 78(1). 110–146. 5 indexed citations

11.

Chitnis, Rajesh, Fedor V. Fomin, & Petr A. Golovach. (2015). Parameterized complexity of the anchored k-core problem for directed graphs. Information and Computation. 247. 11–22. 14 indexed citations

12.

Chitnis, Rajesh, Graham Cormode, Hossein Esfandiari, et al.. (2015). Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams. University of Birmingham Research Portal (University of Birmingham). 20 indexed citations

13.

Chitnis, Rajesh, et al.. (2015). Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable. ACM Transactions on Algorithms. 11(4). 1–28. 18 indexed citations

14.

Chitnis, Rajesh, Graham Cormode, Hossein Esfandiari, MohammadTaghi Hajiaghayi, & Morteza Monemizadeh. (2015). New Streaming Algorithms for Parameterized Maximal Matching & Beyond. Warwick Research Archive Portal (University of Warwick). 56–58. 1 indexed citations

15.

Chitnis, Rajesh, Graham Cormode, Mohammad Taghi Hajiaghayi, & Morteza Monemizadeh. (2014). Parameterized Streaming: Maximal Matching and Vertex Cover. Warwick Research Archive Portal (University of Warwick). 14 indexed citations

16.

Chitnis, Rajesh, MohammadTaghi Hajiaghayi, & Dániel Marx. (2013). Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset. SIAM Journal on Computing. 42(4). 1674–1696. 17 indexed citations

17.

Chitnis, Rajesh, Marek Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk, & Michał Pilipczuk. (2012). Designing FPT Algorithms for Cut Problems Using Randomized Contractions. 460–469. 8 indexed citations

18.

Chandran, L. Sunil, et al.. (2012). On the SIG-Dimension of Trees Under the L ∞-Metric. Graphs and Combinatorics. 29(4). 773–794. 1 indexed citations

19.

Chitnis, Rajesh, MohammadTaghi Hajiaghayi, & Vahid Liaghat. (2011). Parameterized Complexity of Problems in Coalitional Resource Games. Proceedings of the AAAI Conference on Artificial Intelligence. 25(1). 620–625. 4 indexed citations

20.

Chitnis, Rajesh, Mohammad Taghi Hajiaghayi, & Vahid Liaghat. (2011). Parameterized Complexity of Problems in Coalitional Resource Games. arXiv (Cornell University). 620–625. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact