1.0(top 50%)
impact factor
1.7K(top 20%)
papers
51.8K(top 10%)
citations
96(top 5%)
h-index
1.1(top 50%)
extended IF
1.8K
all documents
55.1K
doc citations
180(top 5%)
g-index

Top Articles

#TitleJournalYearCitations
1A new polynomial-time algorithm for linear programmingCombinatorica19843,855
2The ellipsoid method and its consequences in combinatorial optimizationCombinatorica19811,464
3Ramanujan graphsCombinatorica19881,013
4Randomized rounding: A technique for provably good algorithms and algorithmic proofsCombinatorica1987817
5Eigenvalues and expandersCombinatorica1986801
6On Lovász’ lattice reduction and the nearest lattice point problemCombinatorica1986697
7The geometry of graphs and some of its algorithmic applicationsCombinatorica1995642
8Sorting inc logn parallel stepsCombinatorica1983497
9How to draw a planar graph on a gridCombinatorica1990487
10The Diameter of a Scale-Free Random GraphCombinatorica2004463
11The eigenvalues of random symmetric matricesCombinatorica1981460
12Bin packing can be solved within 1 + ε in linear timeCombinatorica1981451
13Efficient algorithms for finding minimum spanning trees in undirected and directed graphsCombinatorica1986438
14Intersection theorems with geometric consequencesCombinatorica1981421
15A Factor 2 Approximation Algorithm for the Generalized Steiner Network ProblemCombinatorica2001383
16Matching is as easy as matrix inversionCombinatorica1987381
17An analysis of the greedy algorithm for the submodular set covering problemCombinatorica1982373
18Extremal problems in discrete geometryCombinatorica1983365
19Colorings and orientations of graphsCombinatorica1992358
20An optimal lower bound on the number of variables for graph identificationCombinatorica1992330
21Quick Approximation to Matrices and ApplicationsCombinatorica1999319
22Quasi-random graphsCombinatorica1989315
23Call routing and the ratcatcherCombinatorica1994295
24A strongly polynomial minimum cost circulation algorithmCombinatorica1985291
25Pseudorandom generators for space-bounded computationCombinatorica1992291
26The monotone circuit complexity of boolean functionsCombinatorica1987282
27The chromatic number of random graphsCombinatorica1988272
28Packet routing and job-shop scheduling inO(congestion+dilation) stepsCombinatorica1994261
29Graphs drawn with few crossings per edgeCombinatorica1997244
30Graph bisection algorithms with good average case behaviorCombinatorica1987241
31An application of simultaneous diophantine approximation in combinatorial optimizationCombinatorica1987239
32Explicit constructions of graphs without short cycles and low density codesCombinatorica1982237
33Recognizing Berge GraphsCombinatorica2005234
34Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemesCombinatorica1986231
35On the combinatorial problems which I would most like to see solvedCombinatorica1981228
36Efficient Testing of Large GraphsCombinatorica2000224
37Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal latticeCombinatorica1990223
38Lower bound of the hadwiger number of graphs by their average degreeCombinatorica1984222
39On the full automorphism group of a graphCombinatorica1981220
40One way functions and pseudorandom generatorsCombinatorica1987212
41Hadwiger's conjecture forK 6-free graphsCombinatorica1993211
42A deterministic view of random sampling and its use in geometryCombinatorica1990210
43Constructing a perfect matching is in random NCCombinatorica1986209
44Blow-up LemmaCombinatorica1997203
45Supersaturated graphs and hypergraphsCombinatorica1983197
46The exact bound in the Erdös-Ko-Rado theoremCombinatorica1984197
47Threshold functionsCombinatorica1987189
48Packing directed circuits fractionallyCombinatorica1995186
49MastermindCombinatorica1983168
50On optimal matchingsCombinatorica1984166