Kenneth A. Berman
Impact in
-
- Limits and Structures in Graph Theory
-
- Advanced Graph Theory Research
Papers in
-
- Limits and Structures in Graph Theory 5
-
- Advanced Graph Theory Research 19
- Graph Labeling and Dimension Problems 8
- Co-authors
- Michael HawrylyczJerome L. PaulFred S. AnnexsteinNoga AlonAnil G. JeggaCheng ZhuChittabrata GhoshVictor Kaftal
- Journals
- Discrete Mathematics (4 papers)Journal of Combinatorial Theory Series B (3 papers)Discrete Applied Mathematics (3 papers)SIAM Journal on Discrete Mathematics (3 papers)Proceedings of the American Mathematical Society (3 papers)
- Partner nations
- United StatesCanadaGermany
In The Last Decade
Kenneth A. Berman
37 papers receiving 267 citations
Peers
Comparison fields: 5 of 67
- Discrete Mathematics and Combinatorics 41
- Computational Theory and Mathematics 103
- Computer Networks and Communications 127
- Geometry and Topology 34
- Computer Graphics and Computer-Aided Design 11
Countries citing papers authored by Kenneth A. Berman
This map shows the geographic impact of Kenneth A. Berman'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 Kenneth A. Berman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Kenneth A. Berman more than expected).
Fields of papers citing papers by Kenneth A. Berman
This network shows the impact of papers produced by Kenneth A. Berman. 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 Kenneth A. Berman. The network helps show where Kenneth A. Berman may publish in the future.
Co-authors
The 20 scholars most cited alongside Kenneth A. Berman, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2012 | 15 | |
| 2 | 2010 | 7 | |
| 3 | 2006 | 3 | |
| 4 | 2006 | 4 | |
| 5 | 2006 | 2 | |
| 6 | 2006 | 1 | |
| 7 | Algorithms: Sequential, Parallel, and Distributed | 2004 | 22 |
| 8 | 2003 | 4 | |
| 9 | 2002 | 1 | |
| 10 | 2000 | 2 | |
| 11 | 1998 | 4 | |
| 12 | On Computing Nearly Optimal Multi-Tree Paths and s, t-Numberings. | 1997 | 1 |
| 13 | 1997 | 1 | |
| 14 | 1995 | 1 | |
| 15 | 1990 | 12 | |
| 16 | 1989 | 1 | |
| 17 | 1989 | 1 | |
| 18 | 1987 | 1 | |
| 19 | 1986 | 20 | |
| 20 | 1981 | 0 |
About Kenneth A. Berman
Kenneth A. Berman is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design, Geometry and Topology and Computer Networks and Communications, having authored 43 papers that have together received 291 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (19 papers), Graph Labeling and Dimension Problems (8 papers), graph theory and CDMA systems (7 papers), Peer-to-Peer Network Technologies (5 papers), Interconnection Networks and Systems (5 papers), Limits and Structures in Graph Theory (5 papers), Graph theory and applications (5 papers) and Computational Geometry and Mesh Generation (4 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (41 citations), Computational Theory and Mathematics (103 citations), Computer Networks and Communications (127 citations), Geometry and Topology (34 citations) and Computer Graphics and Computer-Aided Design (11 citations). Kenneth A. Berman has collaborated with scholars based in United States, Canada and Germany. Frequent co-authors include Michael Hawrylycz, Jerome L. Paul, Fred S. Annexstein, Noga Alon, Anil G. Jegga, Cheng Zhu, Chittabrata Ghosh, Victor Kaftal, Dharma P. Agrawal and Herbert Halpern. Their work appears in journals such as Discrete Mathematics, Journal of Combinatorial Theory Series B, Discrete Applied Mathematics, SIAM Journal on Discrete Mathematics and Proceedings of the American Mathematical Society.
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.