default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPo-Shen Loh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j37]Farshad Firouzi
, Bahareh J. Farahani, Mahmoud Daneshmand, Kathy Grise, Jaeseung Song, Roberto Saracco, Lucy Lu Wang, Kyle Lo, Plamen 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 C. 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): 12826-12846 (2021)- 2020
- [j36]Debsoumya Chakraborti, Po-Shen Loh:
Minimizing the numbers of cliques and cycles of fixed size in an F-saturated graph. Eur. J. Comb. 90: 103185 (2020) - [j35]Debsoumya Chakraborti, Po-Shen Loh:
Extremal Graphs with Local Covering Conditions. SIAM J. Discret. Math. 34(2): 1354-1374 (2020) - [i6]Po-Shen Loh:
Flipping the Perspective in Contact Tracing. CoRR abs/2010.03806 (2020)
2010 – 2019
- 2019
- [j34]Mikhail Lavrov, Po-Shen Loh, Arnau Messegué:
Distance-Uniform Graphs with Large Diameter. SIAM J. Discret. Math. 33(2): 994-1005 (2019) - 2018
- [j33]Po-Shen Loh, Michael Tait, Craig Timmons, Rodrigo M. Zhou:
Induced Turán Numbers. Comb. Probab. Comput. 27(2): 274-288 (2018) - [j32]Joseph Briggs, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh:
Packing Hamilton Cycles Online. Comb. Probab. Comput. 27(4): 475-495 (2018) - [j31]Michael Krivelevich, Matthew Kwan, Po-Shen Loh, Benny Sudakov:
The random k-matching-free process. Random Struct. Algorithms 53(4): 692-716 (2018) - 2017
- [j30]Po-Shen Loh, Siyoung Oh:
Cops and Robbers on Planar-Directed Graphs. J. Graph Theory 86(3): 329-340 (2017) - [j29]Boris Bukh, Po-Shen Loh, Gabriel Nivasch:
Classifying unavoidable Tverberg partitions. J. Comput. Geom. 8(1): 174-205 (2017) - 2016
- [j28]Po-Shen Loh, Jie Ma:
Diameter critical graphs. J. Comb. Theory B 117: 34-58 (2016) - [j27]Choongbum Lee, Po-Shen Loh, Benny Sudakov:
Judicious partitions of directed graphs. Random Struct. Algorithms 48(1): 147-170 (2016) - [j26]Mikhail Lavrov, Po-Shen Loh:
Increasing Hamiltonian paths in random edge orderings. Random Struct. Algorithms 48(3): 588-611 (2016) - [j25]Ronald L. Graham, Linus Hamilton, Ariel Levavi, Po-Shen Loh:
Anarchy Is Free in Network Creation. ACM Trans. Algorithms 12(2): 15:1-15:10 (2016) - [i5]Boris Bukh, Po-Shen Loh, Gabriel Nivasch:
Classifying unavoidable Tverberg partitions. CoRR abs/1611.01078 (2016) - 2015
- [j24]Jacob Fox, Po-Shen Loh, Yufei Zhao:
The critical window for the classical Ramsey-Turán problem. Comb. 35(4): 435-476 (2015) - [j23]Wenying Gan, Po-Shen Loh, Benny Sudakov:
Maximizing the Number of Independent Sets of a Fixed Size. Comb. Probab. Comput. 24(3): 521-527 (2015) - 2014
- [j22]Po-Shen Loh, Rasmus Pagh:
Thresholds for Extreme Orientability. Algorithmica 69(3): 522-539 (2014) - [j21]Deepak Bal, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh:
Packing Tree Factors in Random and Pseudo-random Graphs. Electron. J. Comb. 21(2): 2 (2014) - [j20]Alan M. Frieze, Po-Shen Loh:
Rainbow hamilton cycles in random graphs. Random Struct. Algorithms 44(3): 328-354 (2014) - [j19]Jennifer Iglesias, Nathaniel Ince, Po-Shen Loh:
Computing with Voting Trees. SIAM J. Discret. Math. 28(2): 673-684 (2014) - 2013
- [j18]Choongbum Lee, Po-Shen Loh, Benny Sudakov:
Bisections of graphs. J. Comb. Theory B 103(5): 599-629 (2013) - [j17]Choongbum Lee, Po-Shen Loh, Benny Sudakov:
Self-Similarity of Graphs. SIAM J. Discret. Math. 27(2): 959-972 (2013) - [c3]Ronald L. Graham, Linus Hamilton, Ariel Levavi, Po-Shen Loh:
Anarchy Is Free in Network Creation. WAW 2013: 220-231 - [i4]Ronald L. Graham, Linus Hamilton, Ariel Levavi, Po-Shen Loh:
Anarchy is free in network creation. CoRR abs/1307.3113 (2013) - 2012
- [j16]Jacob Fox, Po-Shen Loh:
On a problem of Erdös and Rothschild on edges in triangles. Comb. 32(6): 619-628 (2012) - [j15]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): 44 (2012) - [j14]Hao Huang, Po-Shen Loh, Benny Sudakov:
The Size of a Hypergraph and its Matching Number. Comb. Probab. Comput. 21(3): 442-450 (2012) - [j13]Alan M. Frieze, Michael Krivelevich, Po-Shen Loh:
Variations on cops and robbers. J. Graph Theory 69(4): 383-402 (2012) - [j12]Alan M. Frieze, Michael Krivelevich, Po-Shen Loh:
Packing tight Hamilton cycles in 3-uniform hypergraphs. Random Struct. Algorithms 40(3): 269-300 (2012) - [c2]Po-Shen Loh, Eyal Lubetzky:
Stochastic coalescence in logarithmic time. SODA 2012: 541-550 - [i3]Po-Shen Loh, Rasmus Pagh:
Thresholds for Extreme Orientability. CoRR abs/1202.1111 (2012) - [i2]Jennifer Iglesias, Nathaniel Ince, Po-Shen Loh:
Computing with voting trees. CoRR abs/1211.0515 (2012) - 2011
- [j11]Tom Bohman, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh, Benny Sudakov:
Ramsey games with giants. Random Struct. Algorithms 38(1-2): 1-32 (2011) - [c1]Alan M. Frieze, Michael Krivelevich, Po-Shen Loh:
Packing tight Hamilton cycles in 3-uniform hypergraphs. SODA 2011: 913-932 - [i1]Choongbum Lee, Po-Shen Loh, Benny Sudakov:
Bisections of graphs. CoRR abs/1109.3180 (2011)
2000 – 2009
- 2009
- [j10]Po-Shen Loh:
A Note on Embedding Hypertrees. Electron. J. Comb. 16(1) (2009) - [j9]Po-Shen Loh, Benny Sudakov:
Constrained Ramsey Numbers. Comb. Probab. Comput. 18(1-2): 247-258 (2009) - [j8]Jacob Fox, Po-Shen Loh, Benny Sudakov:
Large induced trees in Kr-free graphs. J. Comb. Theory B 99(2): 494-501 (2009) - [j7]Michael Krivelevich, Po-Shen Loh, Benny Sudakov:
Avoiding small subgraphs in Achlioptas processes. Random Struct. Algorithms 34(1): 165-195 (2009) - 2008
- [j6]Po-Shen Loh, Benny Sudakov:
On the Strong Chromatic Number of Random Graphs. Comb. Probab. Comput. 17(2): 271-286 (2008) - 2007
- [j5]Po-Shen Loh, Benny Sudakov:
Constrained Ramsey Numbers. Electron. Notes Discret. Math. 29: 41-45 (2007) - [j4]Po-Shen Loh, Benny Sudakov:
Independent transversals in locally sparse graphs. J. Comb. Theory B 97(6): 904-918 (2007) - 2006
- [j3]Peter Keevash, Po-Shen Loh, Benny Sudakov:
Bounding the Number of Edges in Permutation Graphs. Electron. J. Comb. 13(1) (2006) - 2004
- [j2]Po-Shen Loh, Leonard J. Schulman:
Improved Expansion of Random Cayley Graphs. Discret. Math. Theor. Comput. Sci. 6(2): 523-528 (2004) - 2003
- [j1]Po-Shen Loh:
Finding Shortest Paths With Computational Geometry. J. Graph Algorithms Appl. 7(3): 287-303 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
