Discrete and Continuous: Two Sides of the Same?

[1]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[2]  S. Zelditch.  EIGENFUNCTIONS AND NODAL SETS , 2012, 1205.2812.

[3]  Michel Deza,et al.  Geometry of cuts and metrics , 2009, Algorithms and combinatorics.

[4]  G. M. Clemence,et al.  Blow up of smooth solutions to the barotropic compressible magnetohydrodynamic equations with finite mass and energy , 2008, 0811.4359.

[5]  Johan Håstad,et al.  Some optimal inapproximability results , 1997, STOC '97.

[6]  F. Chung.  Spectral Graph Theory , 1996 .

[7]  Shang-Hua Teng,et al.  Spectral partitioning works: planar graphs and finite element meshes , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[8]  A. Björner.  Topological methods , 1996 .

[9]  R. Graham,et al.  Handbook of Combinatorics , 1995 .

[10]  Hein Vanderholst,et al.  A Short Proof of the Planarity Characterization of Colin de Verdière , 1995, J. Comb. Theory, Ser. B.

[11]  Farid Alizadeh,et al.  Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization , 1995, SIAM J. Optim..

[12]  Nathan Linial,et al.  The geometry of graphs and some of its algorithmic applications , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[13]  David P. Williamson,et al.  .879-approximation algorithms for MAX CUT and MAX 2SAT , 1994, STOC '94.

[14]  Charles Delorme,et al.  Combinatorial Properties and the Complexity of a Max-cut Approximation , 1993, Eur. J. Comb..

[15]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[16]  Martin E. Dyer,et al.  A random polynomial-time algorithm for approximating the volume of convex bodies , 1991, JACM.

[17]  Y. D. Verdière.  On a novel graph invariant and a planarity criterion , 1990 .

[18]  Mark Jerrum,et al.  Approximating the Permanent , 1989, SIAM J. Comput..

[19]  Frank Thomson Leighton,et al.  An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[20]  J. Beck,et al.  Irregularities of distribution , 1987 .

[21]  J. Bourgain.  On lipschitz embedding of finite metric spaces in Hilbert space , 1985 .

[22]  József Beck,et al.  Roth’s estimate of the discrepancy of integer sequences is nearly sharp , 1981, Comb..

[23]  H. Wolkowicz,et al.  Some applications of optimization in matrix theory , 1981 .

[24]  William W. L. Chen.  On irregularities of distribution. , 1980 .

[25]  Imre Bárány,et al.  A Short Proof of Kneser's Conjecture , 1978, J. Comb. Theory, Ser. A.

[26]  László Lovász,et al.  Kneser's Conjecture, Chromatic Number, and Homotopy , 1978, J. Comb. Theory A.

[27]  D. Ornstein.  Bernoulli shifts with the same entropy are isomorphic , 1970 .

[28]  R. Dudley.  Distances of Probability Measures and Random Variables , 1968 .

[29]  K. F. Roth.  On irregularities of distribution , 1954 .

[30]  Alexander Schrijver,et al.  A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs , 1998 .

[31]  Jiří Matoušek,et al.  Discrepancy in arithmetic progressions , 1996 .

[32]  Alexandre J. Chorin,et al.  Vorticity and turbulence , 1994 .

[33]  Miklós Simonovits,et al.  Random Walks in a Convex Body and an Improved Volume Algorithm , 1993, Random Struct. Algorithms.

[34]  Béla Bollobás,et al.  Probabilistic Combinatorics and Its Applications , 1992 .

[35]  Alexander Schrijver,et al.  Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

[36]  M. Dyer.  Computing the volume of convex bodies : a case where randomness provably helps , 1991 .

[37]  Yves Colin de Verdière,et al.  Sur un nouvel invariant des graphes et un critère de planarité , 1990, J. Comb. Theory, Ser. B.

[38]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1988, Algorithms and Combinatorics.

[39]  B. Rodin,et al.  The convergence of circle packings to the Riemann mapping , 1987 .

[40]  László Lovász,et al.  On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.

[41]  W. Thurston.  The geometry and topology of three-manifolds , 1979 .

[42]  D. A. Edwards.  On the existence of probability measures with given marginals , 1978 .

[43]  W. Schmidt.  Irregularities of distribution , 1968 .

[44]  K. F. Roth.  Remark concerning integer sequences , 1964 .

[45]  H. Weinberger,et al.  An optimal Poincaré inequality for convex domains , 1960 .