Lane Clark
Impact in
-
- Limits and Structures in Graph Theory
- Geometry and Topology top 5%
- Graph theory and applications
Papers in
-
- Advanced Graph Theory Research 19
- Complexity and Algorithms in Graphs 7
- Graph Labeling and Dimension Problems 6
- Computability, Logic, AI Algorithms 5
-
- Graph theory and applications 17
- Co-authors
- Frank Gaitan (7 shared papers)R. C. Entringer (8 shared papers)Łászló A. Székely (4 shared papers)J. W. Moon (2 shared papers)William G. Macready (3 shared papers)Fabián A. Chudak (2 shared papers)Zhengbing Bian (2 shared papers)İvan Gutman (2 shared papers)
- Journals
- Discrete Mathematics (8 papers)Journal of Graph Theory (3 papers)Physical Review Letters (2 papers)Graphs and Combinatorics (1 paper)Applicable Analysis and Discrete Mathematics (1 paper)
- Partner nations
- United StatesHungaryNetherlands
In The Last Decade
Lane Clark
37 papers receiving 400 citations
Peers
Comparison fields: 5 of 40
- Discrete Mathematics and Combinatorics 134
- Geometry and Topology 160
- Computational Theory and Mathematics 289
- Artificial Intelligence 150
- Computer Networks and Communications 52
Countries citing papers authored by Lane Clark
This map shows the geographic impact of Lane Clark'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 Lane Clark with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Lane Clark more than expected).
Fields of papers citing papers by Lane Clark
This network shows the impact of papers produced by Lane Clark. 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 Lane Clark. The network helps show where Lane Clark may publish in the future.
Co-authors
The 17 scholars most cited alongside Lane Clark, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 39 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2013 | 61 | |
| 2 | 2012 | 44 | |
| 3 | 1986 | 31 | |
| 4 | On the General Randic Index for Certain Families of Trees. | 1999 | 28 |
| 5 | 1983 | 28 | |
| 6 | 2014 | 27 | |
| 7 | 1992 | 24 | |
| 8 | 1996 | 20 | |
| 9 | 1992 | 18 | |
| 10 | 1984 | 15 | |
| 11 | 1998 | 15 | |
| 12 | 2006 | 14 | |
| 13 | Extremal problems for local properties of graphs. | 1991 | 9 |
| 14 | 1998 | 8 | |
| 15 | Experimental determination of Ramsey numbers with quantum annealing | 2012 | 7 |
| 16 | Hamilton-like indices of graphs | 1983 | 7 |
| 17 | 1992 | 7 | |
| 18 | 1997 | 7 | |
| 19 | 1990 | 6 | |
| 20 | 1989 | 6 |
About Lane Clark
Lane Clark is a scholar working on Computational Theory and Mathematics, Geometry and Topology, Discrete Mathematics and Combinatorics, Artificial Intelligence and Computer Networks and Communications, having authored 39 papers that have together received 428 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (19 papers), Graph theory and applications (17 papers), Limits and Structures in Graph Theory (11 papers), Quantum Computing Algorithms and Architecture (7 papers), Complexity and Algorithms in Graphs (7 papers), Graph Labeling and Dimension Problems (6 papers), Computability, Logic, AI Algorithms (5 papers) and Analytic Number Theory Research (3 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (134 citations), Geometry and Topology (160 citations), Computational Theory and Mathematics (289 citations), Artificial Intelligence (150 citations) and Computer Networks and Communications (52 citations). Lane Clark has collaborated with scholars based in United States, Hungary and Netherlands. Frequent co-authors include Frank Gaitan, R. C. Entringer, Łászló A. Székely, J. W. Moon, William G. Macready, Fabián A. Chudak, Zhengbing Bian, İvan Gutman, H.J. Veldman and Henry D. Shapiro. Their work appears in journals such as Discrete Mathematics, Journal of Graph Theory, Physical Review Letters, Graphs and Combinatorics and Applicable Analysis and Discrete Mathematics.
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.