Po-Shen Loh

Publication Activity (10 Years)

Years Active: 2003-2021
Publications (10 Years): 17

Top Topics

Equivalence Classes

Gallium Arsenide

Top Venues

Random Struct. Algorithms

Comb. Probab. Comput.

SIAM J. Discret. Math.

Publications

Farshad Firouzi, Bahareh J. Farahani, Mahmoud Daneshmand, Kathy Grise, Jaeseung Song, Roberto Saracco, Lucy Lu Wang, Kyle Lo, Plamen P. Angelov, Eduardo A. Soares, Po-Shen Loh, Zeynab Talebpour, Reza Moradi, Mohsen Goodarzi, Haleh Ashraf, Mohammad Talebpour, Alireza Talebpour, Luca Romeo, Rupam Das, Hadi Heidari, Dana K. Pasquale, James Moody, Chris Woods, Erich S. Huang, Payam M. Barnaghi, Majid Sarrafzadeh, Ron Li, Kristen L. Beck, Olexandr Isayev, NakMyoung Sung, Alan Luo
Harnessing the Power of Smart and Connected Health to Tackle COVID-19: IoT, AI, Robotics, and Blockchain for a Better World. IEEE Internet Things J. 8 (16) (2021)
Debsoumya Chakraborti, Po-Shen Loh
Minimizing the numbers of cliques and cycles of fixed size in an F-saturated graph. Eur. J. Comb. 90 (2020)
Po-Shen Loh
Flipping the Perspective in Contact Tracing. CoRR (2020)
Debsoumya Chakraborti, Po-Shen Loh
Extremal Graphs with Local Covering Conditions. SIAM J. Discret. Math. 34 (2) (2020)
Mikhail Lavrov, Po-Shen Loh, Arnau Messegué
Distance-Uniform Graphs with Large Diameter. SIAM J. Discret. Math. 33 (2) (2019)
Michael Krivelevich, Matthew Kwan, Po-Shen Loh, Benny Sudakov
The random k-matching-free process. Random Struct. Algorithms 53 (4) (2018)
Po-Shen Loh, Michael Tait, Craig Timmons, Rodrigo M. Zhou
Induced Turán Numbers. Comb. Probab. Comput. 27 (2) (2018)
Joseph Briggs, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh
Packing Hamilton Cycles Online. Comb. Probab. Comput. 27 (4) (2018)
Boris Bukh, Po-Shen Loh, Gabriel Nivasch
Classifying unavoidable Tverberg partitions. J. Comput. Geom. 8 (1) (2017)
Po-Shen Loh, Siyoung Oh
Cops and Robbers on Planar-Directed Graphs. J. Graph Theory 86 (3) (2017)
Boris Bukh, Po-Shen Loh, Gabriel Nivasch
Classifying unavoidable Tverberg partitions. CoRR (2016)
Po-Shen Loh, Jie Ma
Diameter critical graphs. J. Comb. Theory, Ser. B 117 (2016)
Mikhail Lavrov, Po-Shen Loh
Increasing Hamiltonian paths in random edge orderings. Random Struct. Algorithms 48 (3) (2016)
Choongbum Lee, Po-Shen Loh, Benny Sudakov
Judicious partitions of directed graphs. Random Struct. Algorithms 48 (1) (2016)
Ronald L. Graham, Linus Hamilton, Ariel Levavi, Po-Shen Loh
Anarchy Is Free in Network Creation. ACM Trans. Algorithms 12 (2) (2016)
Jacob Fox, Po-Shen Loh, Yufei Zhao
The critical window for the classical Ramsey-Turán problem. Comb. 35 (4) (2015)
Wenying Gan, Po-Shen Loh, Benny Sudakov
Maximizing the Number of Independent Sets of a Fixed Size. Comb. Probab. Comput. 24 (3) (2015)
Jennifer Iglesias, Nathaniel Ince, Po-Shen Loh
Computing with Voting Trees. SIAM J. Discret. Math. 28 (2) (2014)
Po-Shen Loh, Rasmus Pagh
Thresholds for Extreme Orientability. Algorithmica 69 (3) (2014)
Alan M. Frieze, Po-Shen Loh
Rainbow hamilton cycles in random graphs. Random Struct. Algorithms 44 (3) (2014)
Deepak Bal, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh
Packing Tree Factors in Random and Pseudo-random Graphs. Electron. J. Comb. 21 (2) (2014)
Ronald L. Graham, Linus Hamilton, Ariel Levavi, Po-Shen Loh
Anarchy Is Free in Network Creation. WAW (2013)
Choongbum Lee, Po-Shen Loh, Benny Sudakov
Bisections of graphs. J. Comb. Theory, Ser. B 103 (5) (2013)
Choongbum Lee, Po-Shen Loh, Benny Sudakov
Self-Similarity of Graphs. SIAM J. Discret. Math. 27 (2) (2013)
Ronald L. Graham, Linus Hamilton, Ariel Levavi, Po-Shen Loh
Anarchy is free in network creation. CoRR (2013)
Po-Shen Loh, Eyal Lubetzky
Stochastic coalescence in logarithmic time. SODA (2012)
Andrzej Dudek, Alan M. Frieze, Po-Shen Loh, Shelley Speiss
Optimal Divisibility Conditions for Loose Hamilton Cycles in Random Hypergraphs. Electron. J. Comb. 19 (4) (2012)
Po-Shen Loh, Rasmus Pagh
Thresholds for Extreme Orientability CoRR (2012)
Alan M. Frieze, Michael Krivelevich, Po-Shen Loh
Packing tight Hamilton cycles in 3-uniform hypergraphs. Random Struct. Algorithms 40 (3) (2012)
Jacob Fox, Po-Shen Loh
On a problem of Erdös and Rothschild on edges in triangles. Comb. 32 (6) (2012)
Hao Huang, Po-Shen Loh, Benny Sudakov
The Size of a Hypergraph and its Matching Number. Comb. Probab. Comput. 21 (3) (2012)
Alan M. Frieze, Michael Krivelevich, Po-Shen Loh
Variations on cops and robbers. J. Graph Theory 69 (4) (2012)
Jennifer Iglesias, Nathaniel Ince, Po-Shen Loh
Computing with voting trees CoRR (2012)
Choongbum Lee, Po-Shen Loh, Benny Sudakov
Bisections of graphs CoRR (2011)
Tom Bohman, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh, Benny Sudakov
Ramsey games with giants. Random Struct. Algorithms 38 (1-2) (2011)
Alan M. Frieze, Michael Krivelevich, Po-Shen Loh
Packing tight Hamilton cycles in 3-uniform hypergraphs. SODA (2011)
Jacob Fox, Po-Shen Loh, Benny Sudakov
-free graphs. J. Comb. Theory, Ser. B 99 (2) (2009)
Michael Krivelevich, Po-Shen Loh, Benny Sudakov
Avoiding small subgraphs in Achlioptas processes. Random Struct. Algorithms 34 (1) (2009)
Po-Shen Loh, Benny Sudakov
Constrained Ramsey Numbers. Comb. Probab. Comput. 18 (1-2) (2009)
Po-Shen Loh
A Note on Embedding Hypertrees. Electron. J. Comb. 16 (1) (2009)
Po-Shen Loh, Benny Sudakov
On the Strong Chromatic Number of Random Graphs. Comb. Probab. Comput. 17 (2) (2008)
Po-Shen Loh, Benny Sudakov
Constrained Ramsey Numbers. Electron. Notes Discret. Math. 29 (2007)
Po-Shen Loh, Benny Sudakov
Independent transversals in locally sparse graphs. J. Comb. Theory, Ser. B 97 (6) (2007)
Peter Keevash, Po-Shen Loh, Benny Sudakov
Bounding the Number of Edges in Permutation Graphs. Electron. J. Comb. 13 (1) (2006)
Po-Shen Loh, Leonard J. Schulman
Improved Expansion of Random Cayley Graphs. Discret. Math. Theor. Comput. Sci. 6 (2) (2004)
Po-Shen Loh
Finding Shortest Paths With Computational Geometry. J. Graph Algorithms Appl. 7 (3) (2003)