Allan Lo
Impact in
-
- Limits and Structures in Graph Theory
- Finite Group Theory Research
-
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- Complexity and Algorithms in Graphs
Papers in
-
- Limits and Structures in Graph Theory 42
- Finite Group Theory Research 8
-
- Advanced Graph Theory Research 37
- Graph Labeling and Dimension Problems 8
- Complexity and Algorithms in Graphs 3
- Co-authors
- Klas Markström (6 shared papers)Deryk Osthus (12 shared papers)Daniela Kühn (11 shared papers)Andrew Treglown (5 shared papers)Béla Csaba (1 shared paper)Stefan Glock (3 shared papers)Yi Zhao (3 shared papers)Richard Montgomery (2 shared papers)
- Journals
- Combinatorics Probability Computing (6 papers)Journal of Combinatorial Theory Series B (5 papers)The Electronic Journal of Combinatorics (4 papers)SIAM Journal on Discrete Mathematics (4 papers)Journal of Graph Theory (3 papers)
- Partner nations
- United KingdomSwedenUnited States
In The Last Decade
Allan Lo
40 papers receiving 306 citations
Peers
Comparison fields: 5 of 23
- Discrete Mathematics and Combinatorics 294
- Computational Theory and Mathematics 261
- Geometry and Topology 113
- Electrical and Electronic Engineering 142
- Algebra and Number Theory 5
Countries citing papers authored by Allan Lo
This map shows the geographic impact of Allan Lo'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 Allan Lo with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Allan Lo more than expected).
Fields of papers citing papers by Allan Lo
This network shows the impact of papers produced by Allan Lo. 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 Allan Lo. The network helps show where Allan Lo may publish in the future.
Co-authors
The 18 scholars most cited alongside Allan Lo, 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 47 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2014 | 40 | |
| 2 | 2016 | 30 | |
| 3 | 2015 | 24 | |
| 4 | 2014 | 22 | |
| 5 | 2015 | 21 | |
| 6 | 2013 | 18 | |
| 7 | 2012 | 16 | |
| 8 | 2013 | 15 | |
| 9 | 2012 | 11 | |
| 10 | 2015 | 11 | |
| 11 | 2017 | 10 | |
| 12 | 2012 | 9 | |
| 13 | 2014 | 8 | |
| 14 | 2014 | 8 | |
| 15 | 2020 | 7 | |
| 16 | 2020 | 7 | |
| 17 | 2014 | 7 | |
| 18 | 2017 | 7 | |
| 19 | 2017 | 6 | |
| 20 | 2023 | 6 |
About Allan Lo
Allan Lo is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Electrical and Electronic Engineering, Geometry and Topology and Computer Networks and Communications, having authored 47 papers that have together received 333 indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (42 papers), Advanced Graph Theory Research (37 papers), graph theory and CDMA systems (24 papers), Graph Labeling and Dimension Problems (8 papers), Finite Group Theory Research (8 papers), Graph theory and applications (7 papers), Advanced Topology and Set Theory (3 papers) and Complexity and Algorithms in Graphs (3 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (294 citations), Computational Theory and Mathematics (261 citations), Geometry and Topology (113 citations), Electrical and Electronic Engineering (142 citations) and Algebra and Number Theory (5 citations). Allan Lo has collaborated with scholars based in United Kingdom, Sweden and United States. Frequent co-authors include Klas Markström, Deryk Osthus, Daniela Kühn, Andrew Treglown, Béla Csaba, Stefan Glock, Yi Zhao, Richard Montgomery, Florian Pfender and Jie Han. Their work appears in journals such as Combinatorics Probability Computing, Journal of Combinatorial Theory Series B, The Electronic Journal of Combinatorics, SIAM Journal on Discrete Mathematics and Journal of Graph Theory.
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.