We stand with Ukraine  

Po-Shen Loh

Orcid: 0000-0002-0777-0644

According to our database1, Po-Shen Loh authored at least 38 papers between 2003 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Harnessing the Power of Smart and Connected Health to Tackle COVID-19: IoT, AI, Robotics, and Blockchain for a Better World.
[BibTeX]
[DOI]
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 C. Li
,
Kristen L. Beck
,
Olexandr Isayev
,
NakMyoung Sung
,
Alan Luo
IEEE Internet Things J., 2021

2020
Extremal Graphs with Local Covering Conditions.
[BibTeX]
[DOI]
Debsoumya Chakraborti
,
Po-Shen Loh
SIAM J. Discret. Math., 2020

Minimizing the numbers of cliques and cycles of fixed size in an F-saturated graph.
[BibTeX]
[DOI]
Debsoumya Chakraborti
,
Po-Shen Loh
Eur. J. Comb., 2020

Flipping the Perspective in Contact Tracing.
[BibTeX]
[DOI]
Po-Shen Loh
CoRR, 2020

2019
Distance-Uniform Graphs with Large Diameter.
[BibTeX]
[DOI]
Mikhail Lavrov
,
Po-Shen Loh
,
Arnau Messegué
SIAM J. Discret. Math., 2019

2018
The random k-matching-free process.
[BibTeX]
[DOI]
Michael Krivelevich
,
Matthew Kwan
,
Po-Shen Loh
,
Benny Sudakov
Random Struct. Algorithms, 2018

Induced Turán Numbers.
[BibTeX]
[DOI]
Po-Shen Loh
,
Michael Tait
,
Craig Timmons
,
Rodrigo M. Zhou
Comb. Probab. Comput., 2018

Packing Hamilton Cycles Online.
[BibTeX]
[DOI]
Joseph Briggs
,
Alan M. Frieze
,
Michael Krivelevich
,
Po-Shen Loh
Comb. Probab. Comput., 2018

2017
Classifying unavoidable Tverberg partitions.
[BibTeX]
[DOI]
Boris Bukh
,
Po-Shen Loh
,
Gabriel Nivasch
J. Comput. Geom., 2017

Cops and Robbers on Planar-Directed Graphs.
[BibTeX]
[DOI]
Po-Shen Loh
,
Siyoung Oh
J. Graph Theory, 2017

2016
Anarchy Is Free in Network Creation.
[BibTeX]
[DOI]
Ronald L. Graham
,
Linus Hamilton
,
Ariel Levavi
,
Po-Shen Loh
ACM Trans. Algorithms, 2016

Judicious partitions of directed graphs.
[BibTeX]
[DOI]
Choongbum Lee
,
Po-Shen Loh
,
Benny Sudakov
Random Struct. Algorithms, 2016

Increasing Hamiltonian paths in random edge orderings.
[BibTeX]
[DOI]
Mikhail Lavrov
,
Po-Shen Loh
Random Struct. Algorithms, 2016

Diameter critical graphs.
[BibTeX]
[DOI]
Po-Shen Loh
,
Jie Ma
J. Comb. Theory, Ser. B, 2016

2015
Maximizing the Number of Independent Sets of a Fixed Size.
[BibTeX]
[DOI]
Wenying Gan
,
Po-Shen Loh
,
Benny Sudakov
Comb. Probab. Comput., 2015

The critical window for the classical Ramsey-Turán problem.
[BibTeX]
[DOI]
Jacob Fox
,
Po-Shen Loh
,
Yufei Zhao
Comb., 2015

2014
Computing with Voting Trees.
[BibTeX]
[DOI]
Jennifer Iglesias
,
Nathaniel Ince
,
Po-Shen Loh
SIAM J. Discret. Math., 2014

Rainbow hamilton cycles in random graphs.
[BibTeX]
[DOI]
Alan M. Frieze
,
Po-Shen Loh
Random Struct. Algorithms, 2014

Packing Tree Factors in Random and Pseudo-random Graphs.
[BibTeX]
[DOI]
Deepak Bal
,
Alan M. Frieze
,
Michael Krivelevich
,
Po-Shen Loh
Electron. J. Comb., 2014

Thresholds for Extreme Orientability.
[BibTeX]
[DOI]
Po-Shen Loh
,
Rasmus Pagh
Algorithmica, 2014

2013
Self-Similarity of Graphs.
[BibTeX]
[DOI]
Choongbum Lee
,
Po-Shen Loh
,
Benny Sudakov
SIAM J. Discret. Math., 2013

Bisections of graphs.
[BibTeX]
[DOI]
Choongbum Lee
,
Po-Shen Loh
,
Benny Sudakov
J. Comb. Theory, Ser. B, 2013

2012
Packing tight Hamilton cycles in 3-uniform hypergraphs.
[BibTeX]
[DOI]
Alan M. Frieze
,
Michael Krivelevich
,
Po-Shen Loh
Random Struct. Algorithms, 2012

Variations on cops and robbers.
[BibTeX]
[DOI]
Alan M. Frieze
,
Michael Krivelevich
,
Po-Shen Loh
J. Graph Theory, 2012

The Size of a Hypergraph and its Matching Number.
[BibTeX]
[DOI]
Hao Huang
,
Po-Shen Loh
,
Benny Sudakov
Comb. Probab. Comput., 2012

Optimal Divisibility Conditions for Loose Hamilton Cycles in Random Hypergraphs.
[BibTeX]
[DOI]
Andrzej Dudek
,
Alan M. Frieze
,
Po-Shen Loh
,
Shelley Speiss
Electron. J. Comb., 2012

On a problem of Erdös and Rothschild on edges in triangles.
[BibTeX]
[DOI]
Jacob Fox
,
Po-Shen Loh
Comb., 2012

Stochastic coalescence in logarithmic time.
[BibTeX]
[DOI]
Po-Shen Loh
,
Eyal Lubetzky
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011
Ramsey games with giants.
[BibTeX]
[DOI]
Tom Bohman
,
Alan M. Frieze
,
Michael Krivelevich
,
Po-Shen Loh
,
Benny Sudakov
Random Struct. Algorithms, 2011

2009
Avoiding small subgraphs in Achlioptas processes.
[BibTeX]
[DOI]
Michael Krivelevich
,
Po-Shen Loh
,
Benny Sudakov
Random Struct. Algorithms, 2009

Large induced trees in K<sub>r</sub>-free graphs.
[BibTeX]
[DOI]
Jacob Fox
,
Po-Shen Loh
,
Benny Sudakov
J. Comb. Theory, Ser. B, 2009

A Note on Embedding Hypertrees.
[BibTeX]
[DOI]
Po-Shen Loh
Electron. J. Comb., 2009

2008
On the Strong Chromatic Number of Random Graphs.
[BibTeX]
[DOI]
Po-Shen Loh
,
Benny Sudakov
Comb. Probab. Comput., 2008

2007
Independent transversals in locally sparse graphs.
[BibTeX]
[DOI]
Po-Shen Loh
,
Benny Sudakov
J. Comb. Theory, Ser. B, 2007

Constrained Ramsey Numbers.
[BibTeX]
[DOI]
Po-Shen Loh
,
Benny Sudakov
Electron. Notes Discret. Math., 2007

2006
Bounding the Number of Edges in Permutation Graphs.
[BibTeX]
[DOI]
Peter Keevash
,
Po-Shen Loh
,
Benny Sudakov
Electron. J. Comb., 2006

2004
Improved Expansion of Random Cayley Graphs.
[BibTeX]
[DOI]
Po-Shen Loh
,
Leonard J. Schulman
Discret. Math. Theor. Comput. Sci., 2004

2003
Finding Shortest Paths With Computational Geometry.
[BibTeX]
[DOI]
Po-Shen Loh
J. Graph Algorithms Appl., 2003


  Loading...