 | 2009 |
|---|
| 9 |       | Po-Shen Loh,
Benny Sudakov:
Constrained Ramsey Numbers.
Combinatorics, Probability & Computing 18(1-2): 247-258 (2009) |
| 8 | | Jacob Fox,
Po-Shen Loh,
Benny Sudakov:
Large induced trees in Kr-free graphs.
J. Comb. Theory, Ser. B 99(2): 494-501 (2009) |
| 7 | | Michael Krivelevich,
Po-Shen Loh,
Benny Sudakov:
Avoiding small subgraphs in Achlioptas processes.
Random Struct. Algorithms 34(1): 165-195 (2009) |
| 2008 |
|---|
| 6 | | Po-Shen Loh,
Benny Sudakov:
On the Strong Chromatic Number of Random Graphs.
Combinatorics, Probability & Computing 17(2): 271-286 (2008) |
| 2007 |
|---|
| 5 | | Po-Shen Loh,
Benny Sudakov:
Constrained Ramsey Numbers.
Electronic Notes in Discrete Mathematics 29: 41-45 (2007) |
| 4 | | Po-Shen Loh,
Benny Sudakov:
Independent transversals in locally sparse graphs.
J. Comb. Theory, Ser. B 97(6): 904-918 (2007) |
| 2006 |
|---|
| 3 | | Peter Keevash,
Po-Shen Loh,
Benny Sudakov:
Bounding the Number of Edges in Permutation Graphs.
Electr. J. Comb. 13(1): (2006) |
| 2004 |
|---|
| 2 | | Po-Shen Loh,
Leonard J. Schulman:
Improved Expansion of Random Cayley Graphs.
Discrete Mathematics & Theoretical Computer Science 6(2): 523-528 (2004) |
| 2003 |
|---|
| 1 | | Po-Shen Loh:
Finding Shortest Paths With Computational Geometry.
J. Graph Algorithms Appl. 7(3): 287-303 (2003) |
