Po‐Shen Loh

926 total citations
36 papers, 358 citations indexed

About

Po‐Shen Loh is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Geometry and Topology. According to data from OpenAlex, Po‐Shen Loh has authored 36 papers receiving a total of 358 indexed citations (citations by other indexed papers that have themselves been cited), including 28 papers in Discrete Mathematics and Combinatorics, 25 papers in Computational Theory and Mathematics and 16 papers in Geometry and Topology. Recurrent topics in Po‐Shen Loh's work include Limits and Structures in Graph Theory (28 papers), Advanced Graph Theory Research (22 papers) and Graph theory and applications (11 papers). Po‐Shen Loh is often cited by papers focused on Limits and Structures in Graph Theory (28 papers), Advanced Graph Theory Research (22 papers) and Graph theory and applications (11 papers). Po‐Shen Loh collaborates with scholars based in United States, Israel and Switzerland. Po‐Shen Loh's co-authors include Benny Sudakov, Alan Frieze, Michael Krivelevich, Hao Huang, Choongbum Lee, Leonard J. Schulman, Oleg Pikhurko, Jacob Fox, Michael Tait and Andrzej Dudek and has published in prestigious journals such as Public Health Reports, Proceedings of the London Mathematical Society and Journal of Combinatorial Theory Series B.

In The Last Decade

Po‐Shen Loh

33 papers receiving 332 citations

Peers

Po‐Shen Loh

CTM

DMC

GT

EEE

MP

Norbert Sauer Canada

Michael Stiebitz Germany

Jarosław Grytczuk Poland

Norbert Seifter Austria

Mohamed H. El-Zahar Canada

Jochen Harant Germany

Péter Komjáth Hungary

Bill Sands Canada

Robert Woodrow Canada

Lorenzo Traldi United States

Norbert Sauer Canada

Po‐Shen Loh

346 ×1.2

CTM

226 ×0.8

DMC

174 ×1.1

GT

81 ×1.8

EEE

43 ×1.5

MP

Citations per year, relative to Po‐Shen Loh Po‐Shen Loh (= 1×) peers Norbert Sauer

Countries citing papers authored by Po‐Shen Loh

Since Specialization

Citations

This map shows the geographic impact of Po‐Shen Loh'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 Po‐Shen Loh with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Po‐Shen Loh more than expected).

Fields of papers citing papers by Po‐Shen Loh

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Po‐Shen Loh. 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 Po‐Shen Loh. The network helps show where Po‐Shen Loh may publish in the future.

Co-authorship network of co-authors of Po‐Shen Loh

This figure shows the co-authorship network connecting the top 25 collaborators of Po‐Shen Loh. A scholar is included among the top collaborators of Po‐Shen Loh 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 Po‐Shen Loh. Po‐Shen Loh is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Loh, Po‐Shen, et al.. (2020). Minimizing the numbers of cliques and cycles of fixed size in an F-saturated graph. European Journal of Combinatorics. 90. 103185–103185. 4 indexed citations

2.

Loh, Po‐Shen, et al.. (2019). Minimizing the number of copies of $K_r$ in an $F$-saturated graph. arXiv (Cornell University). 1 indexed citations

3.

Graham, Ronald, et al.. (2016). Anarchy Is Free in Network Creation. ACM Transactions on Algorithms. 12(2). 1–10.

4.

Loh, Po‐Shen & Jie Ma. (2015). Diameter critical graphs. Journal of Combinatorial Theory Series B. 117. 34–58. 2 indexed citations

5.

Loh, Po‐Shen, et al.. (2015). Maximizing the Number of Independent Sets of a Fixed Size. Figshare. 21 indexed citations

6.

Loh, Po‐Shen, et al.. (2014). Computing with Voting Trees. SIAM Journal on Discrete Mathematics. 28(2). 673–684. 1 indexed citations

7.

Loh, Po‐Shen. (2014). 55th International Mathematical Olympiad. Mathematics Magazine. 87(4). 310–317.

8.

Lee, Choongbum, Po‐Shen Loh, & Benny Sudakov. (2014). Judicious partitions of directed graphs. Random Structures and Algorithms. 48(1). 147–170. 10 indexed citations

9.

Frieze, Alan, et al.. (2014). Packing Tree Factors in Random and Pseudo-Random Graphs. The Electronic Journal of Combinatorics. 21(2). 2 indexed citations

10.

Frieze, Alan & Po‐Shen Loh. (2013). Rainbow hamilton cycles in random graphs. Random Structures and Algorithms. 44(3). 328–354. 15 indexed citations

11.

Lee, Choongbum, Po‐Shen Loh, & Benny Sudakov. (2013). Bisections of graphs. Journal of Combinatorial Theory Series B. 103(5). 599–629. 29 indexed citations

12.

Dudek, Andrzej, et al.. (2012). Optimal Divisibility Conditions for Loose Hamilton Cycles in Random Hypergraphs. The Electronic Journal of Combinatorics. 19(4). 10 indexed citations

13.

Frieze, Alan, Michael Krivelevich, & Po‐Shen Loh. (2011). Packing tight Hamilton cycles in 3-uniform hypergraphs. Symposium on Discrete Algorithms. 913–932. 2 indexed citations

14.

Frieze, Alan, Michael Krivelevich, & Po‐Shen Loh. (2011). Variations on cops and robbers. Journal of Graph Theory. 69(4). 383–402. 36 indexed citations

15.

Loh, Po‐Shen. (2009). A Note on Embedding Hypertrees. The Electronic Journal of Combinatorics. 16(1). 5 indexed citations

16.

Krivelevich, Michael, Po‐Shen Loh, & Benny Sudakov. (2008). Avoiding small subgraphs in Achlioptas processes. Random Structures and Algorithms. 34(1). 165–195. 15 indexed citations

17.

Loh, Po‐Shen & Benny Sudakov. (2007). Independent transversals in locally sparse graphs. Journal of Combinatorial Theory Series B. 97(6). 904–918. 12 indexed citations

18.

Loh, Po‐Shen & Benny Sudakov. (2007). Constrained Ramsey Numbers. Combinatorics Probability Computing. 18(1-2). 247–258. 4 indexed citations

19.

Loh, Po‐Shen & Benny Sudakov. (2007). Constrained Ramsey Numbers. Electronic Notes in Discrete Mathematics. 29. 41–45.

20.

Loh, Po‐Shen & Emmanuel J. Candès. (2003). Image Reconstruction With Ridgelets. 2 indexed citations

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.

Explore authors with similar magnitude of impact