Paul C. Kainen

1.5k total citations
56 papers, 718 citations indexed

About

Paul C. Kainen is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Artificial Intelligence. According to data from OpenAlex, Paul C. Kainen has authored 56 papers receiving a total of 718 indexed citations (citations by other indexed papers that have themselves been cited), including 32 papers in Computational Theory and Mathematics, 14 papers in Geometry and Topology and 12 papers in Artificial Intelligence. Recurrent topics in Paul C. Kainen's work include Advanced Graph Theory Research (19 papers), Neural Networks and Applications (12 papers) and Graph Labeling and Dimension Problems (9 papers). Paul C. Kainen is often cited by papers focused on Advanced Graph Theory Research (19 papers), Neural Networks and Applications (12 papers) and Graph Labeling and Dimension Problems (9 papers). Paul C. Kainen collaborates with scholars based in United States, Czechia and Italy. Paul C. Kainen's co-authors include Věra Kůrková, Frank R. Bernhart, Andrew Vogt, Marcello Sanguineti, Владик Крейнович, Thomas L. Saaty, Arthur T. White, Richard H. Hammack and Frank Harary and has published in prestigious journals such as IEEE Transactions on Information Theory, Behavioral and Brain Sciences and Neural Computation.

In The Last Decade

Paul C. Kainen

51 papers receiving 614 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Paul C. Kainen United States 15 299 272 142 120 95 56 718
Bernd Gärtner Switzerland 14 240 0.8× 169 0.6× 179 1.3× 113 0.9× 71 0.7× 63 692
Dennis S. Arnon United States 13 357 1.2× 117 0.4× 196 1.4× 76 0.6× 17 0.2× 22 616
Mihai Bâdoiu United States 10 173 0.6× 255 0.9× 177 1.2× 200 1.7× 55 0.6× 15 565
H. Ratschek Germany 13 530 1.8× 93 0.3× 68 0.5× 43 0.4× 41 0.4× 42 783
Joseph D. Horton Canada 12 286 1.0× 135 0.5× 97 0.7× 59 0.5× 237 2.5× 33 663
Dmitrii V. Ṗasechnik Netherlands 14 448 1.5× 161 0.6× 51 0.4× 32 0.3× 164 1.7× 66 777
Raghu Meka United States 17 305 1.0× 332 1.2× 36 0.3× 148 1.2× 78 0.8× 48 792
Pascal Koiran France 18 577 1.9× 427 1.6× 17 0.1× 44 0.4× 73 0.8× 67 868
Hristo Djidjev United States 16 232 0.8× 210 0.8× 145 1.0× 91 0.8× 74 0.8× 64 605
Linda Pagli Italy 14 248 0.8× 147 0.5× 78 0.5× 62 0.5× 156 1.6× 74 613

Countries citing papers authored by Paul C. Kainen

Since Specialization
Citations

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

Fields of papers citing papers by Paul C. Kainen

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Paul C. Kainen

This figure shows the co-authorship network connecting the top 25 collaborators of Paul C. Kainen. A scholar is included among the top collaborators of Paul C. Kainen 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 Paul C. Kainen. Paul C. Kainen is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Kainen, Paul C., et al.. (2024). On Dispersability of Some Circulant Graphs. Journal of Graph Algorithms and Applications. 28(1). 225–241.
2.
Kůrková, Věra & Paul C. Kainen. (2014). Comparing fixed and variable-width Gaussian networks. Neural Networks. 57. 23–28. 8 indexed citations
3.
Kainen, Paul C., Věra Kůrková, & Marcello Sanguineti. (2008). Complexity of Gaussian-radial-basis networks approximating smooth functions. Journal of Complexity. 25(1). 63–74. 33 indexed citations
4.
Kainen, Paul C., Věra Kůrková, & Andrew Vogt. (2007). A Sobolev-type upper bound for rates of approximation by linear combinations of Heaviside plane waves. Journal of Approximation Theory. 147(1). 1–10. 13 indexed citations
5.
Kainen, Paul C., et al.. (2005). Rates of Minimization of Error Functionals over Boolean Variable-Basis Functions. Journal of Mathematical Modelling and Algorithms. 4(4). 355–368. 1 indexed citations
6.
Kainen, Paul C.. (2004). An octonion model for physics. International Ophthalmology Clinics. 8(1). 205–9. 2 indexed citations
7.
Kainen, Paul C.. (2004). Replacing points by compacta in neural network approximation. Journal of the Franklin Institute. 341(4). 391–399. 4 indexed citations
8.
Kainen, Paul C.. (2002). Isolated squares in hypercubes and robustness of commutativity. French digital mathematics library (Numdam). 43(3). 213–220. 4 indexed citations
9.
Kůrková, Věra & Paul C. Kainen. (2002). A geometric method to obtain error-correcting classification by neural networks with fewer hidden units. Proceedings of International Conference on Neural Networks (ICNN'96). 2. 1227–1232. 1 indexed citations
10.
Kainen, Paul C., Věra Kůrková, & Andrew Vogt. (2000). Geometry and Topology of Continuous Best and Near Best Approximations. Journal of Approximation Theory. 105(2). 252–262. 14 indexed citations
11.
Kainen, Paul C., et al.. (1994). Uniqueness of network parametrization and faster learning. Neural, Parallel & Scientific Computations archive. 2(4). 459–466. 4 indexed citations
12.
Kainen, Paul C. & Věra Kůrková. (1993). Quasiorthogonal dimension of euclidean spaces. Applied Mathematics Letters. 6(3). 7–10. 24 indexed citations
13.
Kainen, Paul C.. (1991). Upper bound for linear arboricity. Applied Mathematics Letters. 4(4). 53–55. 2 indexed citations
14.
Bernhart, Frank R. & Paul C. Kainen. (1979). The book thickness of a graph. Journal of Combinatorial Theory Series B. 27(3). 320–331. 172 indexed citations
15.
Kainen, Paul C. & Arthur T. White. (1978). On stable crossing numbers. Journal of Graph Theory. 2(3). 181–187. 13 indexed citations
16.
Saaty, Thomas L. & Paul C. Kainen. (1977). The four-color problem. CERN Document Server (European Organization for Nuclear Research). 28 indexed citations
17.
Kainen, Paul C.. (1975). Chromatic number and skewness. Journal of Combinatorial Theory Series B. 18(1). 32–34. 4 indexed citations
18.
Kainen, Paul C.. (1973). Relative colorings of graphs. Journal of Combinatorial Theory Series B. 14(3). 259–262. 1 indexed citations
19.
Kainen, Paul C.. (1972). On the stable crossing number of cubes. Proceedings of the American Mathematical Society. 36(1). 55–55. 8 indexed citations
20.
Kainen, Paul C.. (1972). On the Stable Crossing Number of Cubes. Proceedings of the American Mathematical Society. 36(1). 55–55. 3 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

Rankless by CCL
2026