Ajai Kapoor

487 total citations
16 papers, 263 citations indexed

About

Ajai Kapoor is a scholar working on Computational Theory and Mathematics, Electrical and Electronic Engineering and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Ajai Kapoor has authored 16 papers receiving a total of 263 indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Computational Theory and Mathematics, 3 papers in Electrical and Electronic Engineering and 2 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Ajai Kapoor's work include Advanced Graph Theory Research (11 papers), Complexity and Algorithms in Graphs (6 papers) and Graph Labeling and Dimension Problems (5 papers). Ajai Kapoor is often cited by papers focused on Advanced Graph Theory Research (11 papers), Complexity and Algorithms in Graphs (6 papers) and Graph Labeling and Dimension Problems (5 papers). Ajai Kapoor collaborates with scholars based in Italy, United States and United Kingdom. Ajai Kapoor's co-authors include Michele Conforti, Gérard Cornuéjols, Kristina Vušković, A.M.H. Gerards, Jim Geelen, Roméo Rizzi, Umesh Vazirani, Alan Frieze, Ravi Kannan and Martin Dyer and has published in prestigious journals such as European Journal of Operational Research, Journal of Algorithms and Journal of Combinatorial Theory Series B.

In The Last Decade

Ajai Kapoor

16 papers receiving 246 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Ajai Kapoor Italy	10	213	84	59	42	30	16	263
Garth Isaak United States	11	216 1.0×	73 0.9×	45 0.8×	43 1.0×	38 1.3×	31	305
David A. Grable Germany	10	169 0.8×	71 0.8×	46 0.8×	114 2.7×	51 1.7×	22	254
Mathieu Liedloff France	11	217 1.0×	39 0.5×	31 0.5×	110 2.6×	20 0.7×	36	276
Phyllis Zweig Chinn United States	4	227 1.1×	35 0.4×	59 1.0×	91 2.2×	24 0.8×	11	286
Holger Dell Germany	7	206 1.0×	31 0.4×	19 0.3×	64 1.5×	62 2.1×	20	241
Jakub Onufry Wojtaszczyk Poland	8	187 0.9×	28 0.3×	20 0.3×	82 2.0×	29 1.0×	16	218
Rudini Sampaio Brazil	8	155 0.7×	84 1.0×	16 0.3×	27 0.6×	31 1.0×	49	198
V. E. Alekseev Russia	9	242 1.1×	97 1.2×	52 0.9×	78 1.9×	14 0.5×	24	297
Zbigniew Lonc Poland	10	174 0.8×	89 1.1×	100 1.7×	32 0.8×	52 1.7×	57	269
Lucien Haddad Canada	9	173 0.8×	40 0.5×	67 1.1×	14 0.3×	55 1.8×	45	229

Countries citing papers authored by Ajai Kapoor

Since Specialization

Citations

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

Fields of papers citing papers by Ajai Kapoor

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Ajai Kapoor

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

16 of 16 papers shown

Conforti, Michele, Gérard Cornuéjols, Ajai Kapoor, & Kristina Vušković. (2002). Finding an even hole in a graph. Padua Research Archive (University of Padova). 480–485. 2 indexed citations

Conforti, Michele, Gérard Cornuéjols, Ajai Kapoor, & Kristina Vušković. (2002). Even‐hole‐free graphs part II: Recognition algorithm. Journal of Graph Theory. 40(4). 238–266. 32 indexed citations

Conforti, Michele, Gérard Cornuéjols, Ajai Kapoor, & Kristina Vušković. (2001). Balanced 0, ±1 Matrices II. Recognition Algorithm. Journal of Combinatorial Theory Series B. 81(2). 275–306. 8 indexed citations

Conforti, Michele, Gérard Cornuéjols, Ajai Kapoor, & Kristina Vušković. (2001). Balanced 0, ±1 Matrices I. Decomposition. Journal of Combinatorial Theory Series B. 81(2). 243–274. 15 indexed citations

Conforti, Michele, Gérard Cornuéjols, Ajai Kapoor, & Kristina Vušković. (2001). Perfect, ideal and balanced matrices. European Journal of Operational Research. 133(3). 455–461. 10 indexed citations

Conforti, Michele, Gérard Cornuéjols, Ajai Kapoor, & Kristina Vušković. (2001). Even‐hole‐free graphs part I: Decomposition theorem. Journal of Graph Theory. 39(1). 6–49. 31 indexed citations

Geelen, Jim, A.M.H. Gerards, & Ajai Kapoor. (2000). The Excluded Minors for GF(4)-Representable Matroids. Journal of Combinatorial Theory Series B. 79(2). 247–299. 38 indexed citations

Kapoor, Ajai & Roméo Rizzi. (2000). Edge-Coloring Bipartite Graphs. Journal of Algorithms. 34(2). 390–396. 19 indexed citations

Conforti, Michele, Gérard Cornuéjols, Ajai Kapoor, & Kristina Vušković. (2000). Triangle-free graphs that are signable without even holes. Journal of Graph Theory. 34(3). 204–220. 7 indexed citations

10.

Conforti, Michele, Bert Gerards, & Ajai Kapoor. (2000). A Theorem of Truemper. COMBINATORICA. 20(1). 15–26. 8 indexed citations

11.

Conforti, Michele, Gérard Cornuéjols, Ajai Kapoor, & Kristina Vušković. (1999). Even and odd holes in cap-free graphs. Journal of Graph Theory. 30(4). 289–308. 25 indexed citations

12.

Conforti, Michele, Gérard Cornuéjols, Ajai Kapoor, & Kristina Vušković. (1997). Universally signable graphs. COMBINATORICA. 17(1). 67–77. 16 indexed citations

13.

Geelen, James F., A.M.H. Gerards, & Ajai Kapoor. (1997). The excluded minors for GF(4)--representable matroids. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 1–35. 5 indexed citations

14.

Conforti, Michele, Gérard Cornuéjols, Ajai Kapoor, & Kristina Vušković. (1996). Perfect matchings in balanced hypergraphs. COMBINATORICA. 16(3). 325–329. 12 indexed citations

15.

Conforti, Michele, Gérard Cornuéjols, Ajai Kapoor, & Kristina Vušković. (1994). Recognizing balanced 0,±matrices. Symposium on Discrete Algorithms. 103–111. 1 indexed citations

16.

Dyer, Martin, Alan Frieze, Ravi Kannan, et al.. (1993). A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem. Combinatorics Probability Computing. 2(3). 271–284. 34 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