Finding Shortest Paths With Computational Geometry. - Po-Shen Loh (J. Graph Algorithms Appl., 2003)

Improved Expansion of Random Cayley Graphs. - Po-Shen Loh; Leonard J. Schulman (Discret. Math. Theor. Comput. Sci., 2004)

Bounding the Number of Edges in Permutation Graphs. - Peter Keevash; Po-Shen Loh; Benny Sudakov (Electron. J. Comb., 2006)

Constrained Ramsey Numbers. - Po-Shen Loh; Benny Sudakov (Electron. Notes Discret. Math., 2007)

Independent transversals in locally sparse graphs. - Po-Shen Loh; Benny Sudakov (J. Comb. Theory B, 2007)

On the Strong Chromatic Number of Random Graphs. - Po-Shen Loh; Benny Sudakov (Comb. Probab. Comput., 2008)

A Note on Embedding Hypertrees. - Po-Shen Loh (Electron. J. Comb., 2009)

Large induced trees in Kr-free graphs. - Jacob Fox; Po-Shen Loh; Benny Sudakov (J. Comb. Theory B, 2009)

Avoiding small subgraphs in Achlioptas processes. - Michael Krivelevich; Po-Shen Loh; Benny Sudakov (Random Struct. Algorithms, 2009)

Ramsey games with giants. - Tom Bohman; Alan M. Frieze; Michael Krivelevich; Po-Shen Loh; Benny Sudakov (Random Struct. Algorithms, 2011)

Stochastic coalescence in logarithmic time. - Po-Shen Loh; Eyal Lubetzky (SODA, 2012)

On a problem of Erdös and Rothschild on edges in triangles. - Jacob Fox; Po-Shen Loh (Comb., 2012)

Optimal Divisibility Conditions for Loose Hamilton Cycles in Random Hypergraphs. - Andrzej Dudek; Alan M. Frieze; Po-Shen Loh; Shelley Speiss (Electron. J. Comb., 2012)

The Size of a Hypergraph and its Matching Number. - Hao Huang 005; Po-Shen Loh; Benny Sudakov (Comb. Probab. Comput., 2012)

Variations on cops and robbers. - Alan M. Frieze; Michael Krivelevich; Po-Shen Loh (J. Graph Theory, 2012)

Packing tight Hamilton cycles in 3-uniform hypergraphs. - Alan M. Frieze; Michael Krivelevich; Po-Shen Loh (Random Struct. Algorithms, 2012)

Bisections of graphs. - Choongbum Lee; Po-Shen Loh; Benny Sudakov (J. Comb. Theory B, 2013)

Self-Similarity of Graphs. - Choongbum Lee; Po-Shen Loh; Benny Sudakov (SIAM J. Discret. Math., 2013)

Thresholds for Extreme Orientability. - Po-Shen Loh; Rasmus Pagh (Algorithmica, 2014)

Packing Tree Factors in Random and Pseudo-random Graphs. - Deepak Bal; Alan M. Frieze; Michael Krivelevich; Po-Shen Loh (Electron. J. Comb., 2014)

Rainbow hamilton cycles in random graphs. - Alan M. Frieze; Po-Shen Loh (Random Struct. Algorithms, 2014)

Computing with Voting Trees. - Jennifer Iglesias; Nathaniel Ince; Po-Shen Loh (SIAM J. Discret. Math., 2014)

The critical window for the classical Ramsey-Turán problem. - Jacob Fox; Po-Shen Loh; Yufei Zhao (Comb., 2015)

Maximizing the Number of Independent Sets of a Fixed Size. - Wenying Gan; Po-Shen Loh; Benny Sudakov (Comb. Probab. Comput., 2015)

Diameter critical graphs. - Po-Shen Loh; Jie Ma 002 (J. Comb. Theory B, 2016)

Increasing Hamiltonian paths in random edge orderings. - Mikhail Lavrov; Po-Shen Loh (Random Struct. Algorithms, 2016)

Judicious partitions of directed graphs. - Choongbum Lee; Po-Shen Loh; Benny Sudakov (Random Struct. Algorithms, 2016)

Anarchy Is Free in Network Creation. - Ronald L. Graham; Linus Hamilton; Ariel Levavi; Po-Shen Loh (ACM Trans. Algorithms, 2016)

Cops and Robbers on Planar-Directed Graphs. - Po-Shen Loh; Siyoung Oh (J. Graph Theory, 2017)

Classifying unavoidable Tverberg partitions. - Boris Bukh; Po-Shen Loh; Gabriel Nivasch (J. Comput. Geom., 2017)

Packing Hamilton Cycles Online. - Joseph Briggs; Alan M. Frieze; Michael Krivelevich; Po-Shen Loh (Comb. Probab. Comput., 2018)

Induced Turán Numbers. - Po-Shen Loh; Michael Tait; Craig Timmons; Rodrigo M. Zhou (Comb. Probab. Comput., 2018)

The random k-matching-free process. - Michael Krivelevich; Matthew Kwan 001; Po-Shen Loh; Benny Sudakov (Random Struct. Algorithms, 2018)

Distance-Uniform Graphs with Large Diameter. - Mikhail Lavrov; Po-Shen Loh; Arnau Messegué (SIAM J. Discret. Math., 2019)

Flipping the Perspective in Contact Tracing. - Po-Shen Loh (CoRR, 2020)

Minimizing the numbers of cliques and cycles of fixed size in an F-saturated graph. - Debsoumya Chakraborti; Po-Shen Loh (Eur. J. Comb., 2020)

Extremal Graphs with Local Covering Conditions. - Debsoumya Chakraborti; Po-Shen Loh (SIAM J. Discret. Math., 2020)

Harnessing the Power of Smart and Connected Health to Tackle COVID-19: IoT, AI, Robotics, and Blockchain for a Better World. - Farshad Firouzi; Bahareh J. Farahani; Mahmoud Daneshmand; Kathy Grise; Jaeseung Song; Roberto Saracco; Lucy Lu Wang; Kyle Lo; Plamen Angelov 001; Eduardo A. Soares 001; Po-Shen Loh; Zeynab Talebpour; et al. (IEEE Internet Things J., 2021)