Notable articles

P. Erdős: On the combinatorial problems which I would most like to see solved, Combinatorica 1(1981), 25–42.

J. Beck: Roth's estimate of the discrepancy of integer sequences is nearly sharp, Combinatorica 1(1981), 319–325. (Fulkerson Prize, 1985)

W. Fernandez de la Vega, G. S. Lueker, Bin packing can be solved within 1+epsilon in linear time, Combinatorica 1(1981), 349-355.

P. Frankl, R. M. Wilson: Intersection theorems with geometric consequences, Combinatorica 1(1981), 357-368.

M. Grötschel, L. Lovász, A. Schrijver: The ellipsoid method and its consequences in combinatorial optimization, Combinatorica 1(1981), 169–197. (Fulkerson Prize, 1982)

G. A. Margulis: Explicit constructions of graphs without short cycles and low density codes, Combinatorica 2(1982), 71-78.

M. Ajtai, J. Komlós and E. Szemerédi: Sorting in c log(n) parallel steps, Combinatorica 3(1983), 1-19.

W. T. Trotter Jr., E. Szemerédi: Extremal problems in discrete geometry, Combinatorica 3(1983), 381-392.

N. Karmarkar: A New Polynomial Time Algorithm for Linear Programming, Combinatorica 4(1984), 373–395. (Fulkerson Prize, 1988)

É. Tardos, A strongly polynomial minimum cost circulation algorithm, Combinatorica 5(1985), 247–256. (Fulkerson Prize, 1988)

L. Babai: On Lovász' lattice reduction and the nearest lattice point problem, Combinatorica 6(1986), 1-13.

N. Alon: Eigenvalues and expanders, Combinatorica 6(1986), 83-96.

N. Alon, R. B. Boppana: The monotone circuit complexity of boolean functions, Combinatorica 7(1987), 1-22.

K. Mulmuley, U. V. Vazirani, V. V. Vazirani: Matching is as easy as matrix inversion, Combinatorica 7(1987), 105-113.

P. Raghavan, C. D. Thompson: Randomized rounding: A technique for provably good algorithms and algorithmic proofs, Combinatorica 7(1987), 365-374.

B. Bollobás: The chromatic number of random graphs, Combinatorica 8(1988), 49–55.

A. Lubotzky, R. Phillips, P. Sarnak: Ramanujan graphs, Combinatorica 8(1988), 261-277.

F. R. K. Chung, R. L. Graham, R. M. Wilson: Quasi-random graphs, Combinatorica 9(1989), 345-362.

H. De Fraysseix, J. Pach, R. Pollack: How to draw a planar graph on a grid, Combinatorica 10(1990), 41-51.

N. Alon, M. Tarsi: Colorings and orientations of graphs, Combinatorica 12(1992), 125-134.

N. Nisan: Pseudorandom generators for space-bounded computation, Combinatorica 12(1992), 449-461.

N. Robertson, P. D. Seymour, R. Thomas: Hadwiger's conjecture for K6-free graphs, Combinatorica 13(1993), 279–361. (Fulkerson Prize, 1994)

F. T. Leighton, B. M. Maggs, S. B. Rao: Packet routing and job-shop scheduling in O(congestion+dilation) steps, Combinatorica 14(1994), 167-186.

P. D. Seymour, R. Thomas: Call routing and the ratcatcher, Combinatorica 14(1994), 217-241.

N. Linial, E. London, Y. Rabinovich: The geometry of graphs and some of its algorithmic applications, Combinatorica 15(1995), 215-245.

J. Komlós, G. N. Sárközy, E. Szemerédi: Blow-up Lemma, Combinatorica 17(1997), 109-123.

A. Frieze, R. Kannan: Quick approximation to matrices and applications, Combinatorica 19(1999), 175-220.

N. Alon, E. Fischer, M. Krivelevich, M. Szegedy: Efficient testing of large graphs, Combinatorica 20(2000), 451-476

K. Jain: A factor 2 approximation algorithm for the generalized Steiner network problem, Combinatorica 21(2001), 39–60

B. Bollobás, O. Riordan: The Diameter of a Scale-Free Random Graph, Combinatorica 24(2004), 5-34.