Alexander Kelmans
Impact in
-
- Limits and Structures in Graph Theory
- Geometry and Topology top 2%
- Graph theory and applications
Papers in
-
- Limits and Structures in Graph Theory 9
-
- Advanced Graph Theory Research 34
- Graph Labeling and Dimension Problems 11
- Matrix Theory and Algorithms 5
- Co-authors
- P. L. HammerAtsushi KanekoTsuyoshi NishimuraDhruv MubayiAiping DengYoshimi EgawaMikio KanōBenny Sudakov
- Journals
- Discrete Mathematics (11 papers)Journal of Graph Theory (10 papers)Discrete Applied Mathematics (5 papers)European Journal of Combinatorics (3 papers)Random Structures and Algorithms (2 papers)
- Partner nations
- United StatesPuerto RicoRussia
In The Last Decade
Alexander Kelmans
39 papers receiving 472 citations
Peers
Comparison fields: 5 of 50
- Discrete Mathematics and Combinatorics 128
- Geometry and Topology 306
- Computational Theory and Mathematics 396
- Computer Graphics and Computer-Aided Design 23
- Computer Networks and Communications 110
Countries citing papers authored by Alexander Kelmans
This map shows the geographic impact of Alexander Kelmans'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 Alexander Kelmans with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Alexander Kelmans more than expected).
Fields of papers citing papers by Alexander Kelmans
This network shows the impact of papers produced by Alexander Kelmans. 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 Alexander Kelmans. The network helps show where Alexander Kelmans may publish in the future.
Co-authors
The 13 scholars most cited alongside Alexander Kelmans, 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 | 2016 | 0 | |
| 2 | 2012 | 9 | |
| 3 | 2010 | 17 | |
| 4 | 2008 | 2 | |
| 5 | 2006 | 3 | |
| 6 | 2002 | 0 | |
| 7 | 2001 | 1 | |
| 8 | 2001 | 23 | |
| 9 | 2000 | 3 | |
| 10 | 1999 | 3 | |
| 11 | 1997 | 8 | |
| 12 | 1996 | 42 | |
| 13 | 1987 | 3 | |
| 14 | 1984 | 3 | |
| 15 | 1983 | 15 | |
| 16 | 1982 | 4 | |
| 17 | 1976 | 1 | |
| 18 | 1976 | 45 | |
| 19 | 1974 | 121 | |
| 20 | 1973 | 19 |
About Alexander Kelmans
Alexander Kelmans is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Geometry and Topology, Computer Graphics and Computer-Aided Design and Software, having authored 43 papers that have together received 526 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (34 papers), Graph theory and applications (20 papers), graph theory and CDMA systems (14 papers), Graph Labeling and Dimension Problems (11 papers), Limits and Structures in Graph Theory (9 papers), Matrix Theory and Algorithms (5 papers), Interconnection Networks and Systems (4 papers) and Computational Geometry and Mesh Generation (4 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (128 citations), Geometry and Topology (306 citations), Computational Theory and Mathematics (396 citations), Computer Graphics and Computer-Aided Design (23 citations) and Computer Networks and Communications (110 citations). Alexander Kelmans has collaborated with scholars based in United States, Puerto Rico and Russia. Frequent co-authors include P. L. Hammer, Atsushi Kaneko, Tsuyoshi Nishimura, Dhruv Mubayi, Aiping Deng, Yoshimi Egawa, Mikio Kanō, Benny Sudakov, Xuerong Yong and Alexander Postnikov. Their work appears in journals such as Discrete Mathematics, Journal of Graph Theory, Discrete Applied Mathematics, European Journal of Combinatorics and Random Structures and Algorithms.
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.