L. M. Kelly
- Computational Theory and Mathematics top 5%
- Geometry and Topology top 5%
- Electrical and Electronic Engineering
- Computer Graphics and Computer-Aided Design top 5%
- Discrete Mathematics and Combinatorics top 5%
- Co-authors
- W. O. J. MoserLayne T. WatsonMichael EdelsteinRoyston GreenwoodBranko GrünbaumPaul R. HalmosKatta G. MurtyE. A. Nordhaus
- Topics
- Mathematics and Applications (8 papers)graph theory and CDMA systems (6 papers)Computational Geometry and Mesh Generation (5 papers)
- Cited by
- Computer Graphics and Computer-Aided DesignDiscrete Mathematics and CombinatoricsTheoretical Computer Science
- Journals
- Lecture notes in mathematicsMathematical ProgrammingTransactions of the American Mathematical Society
- Partner nations
- United StatesCanadaIndia
In The Last Decade
L. M. Kelly
22 papers receiving 252 citations
Peers
Comparison fields: 5 of 42
- Computational Theory and Mathematics 152
- Geometry and Topology 105
- Electrical and Electronic Engineering 95
- Computer Graphics and Computer-Aided Design 71
- Discrete Mathematics and Combinatorics 63
Countries citing papers authored by L. M. Kelly
This map shows the geographic impact of L. M. Kelly'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 L. M. Kelly with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites L. M. Kelly more than expected).
Fields of papers citing papers by L. M. Kelly
This network shows the impact of papers produced by L. M. Kelly. 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 L. M. Kelly. The network helps show where L. M. Kelly may publish in the future.
Co-authorship network of co-authors of L. M. Kelly
This figure shows the co-authorship network connecting the top 25 collaborators of L. M. Kelly. A scholar is included among the top collaborators of L. M. Kelly 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 L. M. Kelly. L. M. Kelly is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 9 | |
| 2 | 3 | |
| 3 | 10 | |
| 4 | 23 | |
| 5 | 26 | |
| 6 | 15 | |
| 7 | 33 | |
| 8 | 7 | |
| 9 | 20 | |
| 10 | 6 | |
| 11 | 0 | |
| 12 | 1 | |
| 13 | 11 | |
| 14 | 2 | |
| 15 | 5 | |
| 16 | 5 | |
| 17 | 73 | |
| 18 | 29 | |
| 19 | 9 | |
| 20 | 3 |
About L. M. Kelly
L. M. Kelly is a scholar working on Theoretical Computer Science, Computer Graphics and Computer-Aided Design and Geometry and Topology, having authored 23 papers that have together received 323 indexed citations. Recurring topics across this work include Mathematics and Applications (8 papers), graph theory and CDMA systems (6 papers) and Computational Geometry and Mesh Generation (5 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (71 citations), Discrete Mathematics and Combinatorics (63 citations) and Theoretical Computer Science (14 citations). L. M. Kelly has collaborated with scholars based in United States, Canada and India. Frequent co-authors include W. O. J. Moser, Layne T. Watson, Michael Edelstein, Royston Greenwood, Branko Grünbaum, Paul R. Halmos, Katta G. Murty, E. A. Nordhaus, M. F. Smiley and Endre Boros. Their work appears in journals such as Lecture notes in mathematics, Mathematical Programming and Transactions 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.