Anil Kamath

589 total citations
13 papers, 333 citations indexed

About

Anil Kamath is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Anil Kamath has authored 13 papers receiving a total of 333 indexed citations (citations by other indexed papers that have themselves been cited), including 8 papers in Computational Theory and Mathematics, 6 papers in Computer Networks and Communications and 4 papers in Artificial Intelligence. Recurrent topics in Anil Kamath's work include Optimization and Search Problems (5 papers), Complexity and Algorithms in Graphs (4 papers) and Logic, Reasoning, and Knowledge (3 papers). Anil Kamath is often cited by papers focused on Optimization and Search Problems (5 papers), Complexity and Algorithms in Graphs (4 papers) and Logic, Reasoning, and Knowledge (3 papers). Anil Kamath collaborates with scholars based in United States and Greece. Anil Kamath's co-authors include K. G. Ramakrishnan, Serge Plotkin, Narendra Karmarkar, Maurício G. C. Resende, Paul G. Spirakis, Krishna V. Palem, Rajeev Motwani and R. Motwani and has published in prestigious journals such as Mathematical Programming, Annals of Operations Research and Journal of Global Optimization.

In The Last Decade

Anil Kamath

13 papers receiving 305 citations

Peers

Anil Kamath

CNC

CTM

AI

EEE

IME

Shlomi Rubinstein Israel

Joost P. Warners Netherlands

Naonori Kakimura Japan

Justin Ward United Kingdom

Toshihiro Fujito Japan

Pascal Schweitzer Germany

Hiromu Ariyoshi Japan

Évelyne Contejean France

Glencora Borradaile United States

Jeremy T. Bradley United Kingdom

Shlomi Rubinstein Israel

Anil Kamath

108 ×0.5

CNC

166 ×1.2

CTM

53 ×0.5

AI

30 ×0.6

EEE

102 ×3.5

IME

Citations per year, relative to Anil Kamath Anil Kamath (= 1×) peers Shlomi Rubinstein

Countries citing papers authored by Anil Kamath

Since Specialization

Citations

This map shows the geographic impact of Anil Kamath'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 Anil Kamath with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Anil Kamath more than expected).

Fields of papers citing papers by Anil Kamath

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Anil Kamath. 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 Anil Kamath. The network helps show where Anil Kamath may publish in the future.

Co-authorship network of co-authors of Anil Kamath

This figure shows the co-authorship network connecting the top 25 collaborators of Anil Kamath. A scholar is included among the top collaborators of Anil Kamath 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 Anil Kamath. Anil Kamath 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:

13 of 13 papers shown

1.

Kamath, Anil. (2015). Optimizing Marketing Impact through Data Driven Decisioning. 1631–1631. 1 indexed citations

2.

Kamath, Anil, R. Motwani, Krishna V. Palem, & Paul G. Spirakis. (2002). Tail bounds for occupancy and the satisfiability threshold conjecture. 592–603. 13 indexed citations

3.

Kamath, Anil, Narendra Karmarkar, K. G. Ramakrishnan, & Maurício G. C. Resende. (2002). An interior point approach to Boolean vector function synthesis. 185–189. 3 indexed citations

4.

Kamath, Anil, et al.. (1998). Routing and Admission Control in General Topology Networks with Poisson Arrivals. Journal of Algorithms. 27(2). 236–258. 18 indexed citations

5.

Kamath, Anil, et al.. (1996). Routing and admission control in general topology networks with Poisson arrivals. Symposium on Discrete Algorithms. 27(2). 269–278. 43 indexed citations

6.

Kamath, Anil, et al.. (1995). Improved interior point algorithms for exact and approximate solution of multicommodity flow problems. Symposium on Discrete Algorithms. 502–511. 19 indexed citations

7.

Kamath, Anil, et al.. (1995). Fast approximation algorithm for minimum cost multicommodity flow. Symposium on Discrete Algorithms. 493–501. 10 indexed citations

8.

Kamath, Anil, et al.. (1995). Routing and Admission Control in General Topology Networks. 39 indexed citations

9.

Kamath, Anil, Rajeev Motwani, Krishna V. Palem, & Paul G. Spirakis. (1995). Tail bounds for occupancy and the satisfiability threshold conjecture. Random Structures and Algorithms. 7(1). 59–80. 70 indexed citations

10.

Kamath, Anil, Narendra Karmarkar, K. G. Ramakrishnan, & Maurício G. C. Resende. (1992). A continuous approach to inductive inference. Mathematical Programming. 57(1-3). 215–238. 62 indexed citations

11.

Kamath, Anil & Narendra Karmarkar. (1992). A continuous method for computing bounds in integer quadratic optimization problems. Journal of Global Optimization. 2(3). 9 indexed citations

12.

Kamath, Anil, Narendra Karmarkar, K. G. Ramakrishnan, & Maurício G. C. Resende. (1990). Computational Experience with an Interior Point Algorithm on the Satisfiability Problem. 333–349. 3 indexed citations

13.

Kamath, Anil, Narendra Karmarkar, K. G. Ramakrishnan, & Maurício G. C. Resende. (1990). Computational experience with an interior point algorithm on the satisfiability problem. Annals of Operations Research. 25(1). 43–58. 43 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