|
2016-present
-
Extreme values of the stationary distribution of random walks on directed graphs
,
Advance in Applied Math., 81, (2016), 128--155,
(with Sinan Aksoy and Xing Peng).
-
On the discrepancy of circular sequences of reals, J. Number Theory, 164 (2016), 52--65,
(with R. L. Graham).
-
Decomposition of random graphs into complete bipartite graphs , SIAM J. Discrete Math., 30, no. 1, (2016), 296--310,
(with X. Peng).
2011-2015
2006-2010
Back to top
2001-2005
Back to top
-
A spectral Turán theorem,
Combinatorics, Probability and Computing 14 (2005), 755--767.
-
Discrete isoperimetric inequalities,
Surveys in Differential Geometry IX, International Press, (2004), 53--82.
-
The average distances in random graphs with given expected degrees,
abstract,
paper (short version),
Proc. National Academy of Sciences 99, no. 25, (December, 2002), 15879--15882,
paper (long version)
,
Internet Mathematics 1 (2003), 91--113,
(with L. Lu).
-
Spectral Partitioning with Indefinite Kernels using the Nyström Extension,
European Conference on Computer Vision, 2002, III, 531--542.
Paper version:
Spectral grouping using the Nyström method,
IEEE Transactions on Pattern Analysis and Machine Intelligence
26, No. 2, (2004), 214--225,
(with Charless Fowlkes, Serge Belongie, and Jitendra Malik).
-
Sparse quasi-random graphs,
abstract,
Combinatorica 22 (2002), 217--244,
(with Ronald Graham)
-
Connected components in random graphs with given expected degree sequences,
abstract,
Annals of Combinatorics 6 (2002), 125-145,
(with L. Lu).
-
Random evolution of massive graphs,
abstract,
Handbook of Massive Data Sets, (Eds. James Abello et al.), Kluwer Academic
Publishers, (2002), 97--122,
extended abstract appeared in FOCS 2001, 510--519,
(with W. Aiello and L. Lu).
-
Guessing secrets,
abstract,
Electronic Journal of Combinatorics 8 (2001), R13, 25 pp,
extended
abstract appeared in
Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms
(Washington, DC, 2001), SIAM, Philadelphia, 723--726,
(with Ron Graham and Tom Leighton).
also, SODA'01, 723--726,
(with Ronald Graham and F. Tom Leighton).
-
The diameter of sparse random graphs,
abstract,
Advances in Applied Math. 26 (2001), 257--279,
(with Linyuan Lu).
1996-2000
Back to top
-
Higher eigenvalues and isoperimetric inequalities on
Riemannian manifolds and graphs,
Communications on Analysis and Geometry 8, (2000), 969--1026,
(with A. Grigor'yan and S.-T. Yau).
-
A random graph model for massive graphs,
abstract,
Proceedings of the
Thirtysecond Annual ACM Symposium on Theory of Computing
(2000),
171--180,
(with Bill Aiello and Linyuan Lu).
The complete paper version
has a different title
A random graph model for power law graphs,
Experimental Math. 10 (2001), 53--66.
-
On polynomials of spanning trees,
abstract,
Annals of Combinatorics 4 (2000), 13--26,
(with C. Yang).
-
An upper bound for the Turan number t3(n,4),
Journal of Combinatorial Theory (A) 87 (1999), 381--389,
(with Linyuan Lu).
-
Coverings, heat kernels and spanning trees,
Electronic Journal of Combinatorics 6 (1999), R12, 21 pp,
(with S.-T. Yau).
1991-1995
Back to top
-
On the cover polynomial of a digraph,
J. Combinatorial Theory (B) 65 (1995), 273--290,
(with R. L. Graham).
-
Quasi-random set systems,
J. Amer. Math. Soc. 4 (1991), 151--196,
(with R. L. Graham).
-
Constructing random-like graphs,
Probabilistic Combinatorics and Its Applications, (B. Bollobas ed.), Amer. Math. Soc., Providence, (1991), 21--55.
-
Quasi-random tournaments,
J. of Graph Theory 15 (1991), 173--198,
(with R.L. Graham).
-
Regularity lemmas for hypergraphs and quasi-randomness,
Random Structures and Algorithms 2 (1991), 241--252.
1986-1990
Back to top
-
Quasi-random classes of hypergraphs,
Random Structures and Algorithms 1 (1990), 363--382.
Corrigendum.
-
On graphs not containing prescribed induced subgraphs,
in A Tribute to Paul Erdos, Cambridge University Press (1990), 111--120,
(with R.L. Graham).
-
Graphs with small bandwidth and cutwidth,
Discrete Math. 75 (1989), 113--119,
(with P.D. Seymour).
-
A dynamic location problem for graphs,
Combinatorica 9 (1989), 111--131,
(with R. L. Graham and M. Saks).
-
Universal graphs for
bounded-degree trees and planar graphs,
SIAM J. Discrete Math. 2 (1989), 145--155,
(with S. Bhatt, F. T. Leighton and A. L. Rosenberg).
-
On the fractional covering number of hypergraphs,
SIAM J. on Discrete Math. 1 (1988), 45--49,
(with Z. Furedi, M. R. Garey and R. L. Graham).
-
On induced subgraphs of the cube,
J. Comb. Th. (A) 49 (1988), 180--187,
(with Z. Furedi, R.L. Graham and P. Seymour).
-
The average distance and the independence number,
J. Graph Theory 12 (1988), 229--235.
-
Pursuit-evasion games on graphs,
J. Graph Theory 12 (1988), no. 2, 159--167,
(with J.E. Cohen and R.L. Graham).
-
Labelings of graphs,
Selected Topics in Graph Theory 3, Academic Press, San Diego, CA, 1988, 151--168.
-
Explicit construction of linear sized tolerant networks,
Discrete Math. 72 (1988), 15--19,
(with N. Alon).
-
The maximum number of edges in a 3-graph not containing a given star,
Graphs and Combinatorics 3 (1987), 111--126,
(with P. Frankl).
-
Highly irregular graphs,
J. Graph Theory 11 (1987), 235--249,
(with Yousef Alavi, Gary Chartrand, Paul Erdos, R. L. Graham and Ortrud R. Oellermann).
-
On unavoidable hypergraphs,
J. Graph Theory 11 (1987), 251--263,
(with P. Erdos).
1981-1985
Back to top
1975-1980
Back to top
1973-1975
Back to top
|