About
Technology
Issues
FAQ
Search
Scientometrics
Impact Factor
Discipline Ranks
h
-index
g
-index
Articles
Citations
Article Citations
Citation Distribution
Overviews
Top Institutions
Top Schools
Top Authors
Prolific Authors
Top Articles
Citing Bodies
Top Citing Authors
Top Citing Institutions
Top Citing Schools
Top Citing Journals
Top Citing Disciplines
exaly
›
Journals
›
Combinatorica
›
top-articles
Combinatorica
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
#
Title
Journal
Year
Citations
1
A new polynomial-time algorithm for linear programming
Combinatorica
1984
3,855
2
The ellipsoid method and its consequences in combinatorial optimization
Combinatorica
1981
1,464
3
Ramanujan graphs
Combinatorica
1988
1,013
4
Randomized rounding: A technique for provably good algorithms and algorithmic proofs
Combinatorica
1987
817
5
Eigenvalues and expanders
Combinatorica
1986
801
6
On Lovász’ lattice reduction and the nearest lattice point problem
Combinatorica
1986
697
7
The geometry of graphs and some of its algorithmic applications
Combinatorica
1995
642
8
Sorting inc logn parallel steps
Combinatorica
1983
497
9
How to draw a planar graph on a grid
Combinatorica
1990
487
10
The Diameter of a Scale-Free Random Graph
Combinatorica
2004
463
11
The eigenvalues of random symmetric matrices
Combinatorica
1981
460
12
Bin packing can be solved within 1 + ε in linear time
Combinatorica
1981
451
13
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
Combinatorica
1986
438
14
Intersection theorems with geometric consequences
Combinatorica
1981
421
15
A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem
Combinatorica
2001
383
16
Matching is as easy as matrix inversion
Combinatorica
1987
381
17
An analysis of the greedy algorithm for the submodular set covering problem
Combinatorica
1982
373
18
Extremal problems in discrete geometry
Combinatorica
1983
365
19
Colorings and orientations of graphs
Combinatorica
1992
358
20
An optimal lower bound on the number of variables for graph identification
Combinatorica
1992
330
21
Quick Approximation to Matrices and Applications
Combinatorica
1999
319
22
Quasi-random graphs
Combinatorica
1989
315
23
Call routing and the ratcatcher
Combinatorica
1994
295
24
A strongly polynomial minimum cost circulation algorithm
Combinatorica
1985
291
25
Pseudorandom generators for space-bounded computation
Combinatorica
1992
291
26
The monotone circuit complexity of boolean functions
Combinatorica
1987
282
27
The chromatic number of random graphs
Combinatorica
1988
272
28
Packet routing and job-shop scheduling inO(congestion+dilation) steps
Combinatorica
1994
261
29
Graphs drawn with few crossings per edge
Combinatorica
1997
244
30
Graph bisection algorithms with good average case behavior
Combinatorica
1987
241
31
An application of simultaneous diophantine approximation in combinatorial optimization
Combinatorica
1987
239
32
Explicit constructions of graphs without short cycles and low density codes
Combinatorica
1982
237
33
Recognizing Berge Graphs
Combinatorica
2005
234
34
Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes
Combinatorica
1986
231
35
On the combinatorial problems which I would most like to see solved
Combinatorica
1981
228
36
Efficient Testing of Large Graphs
Combinatorica
2000
224
37
Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
Combinatorica
1990
223
38
Lower bound of the hadwiger number of graphs by their average degree
Combinatorica
1984
222
39
On the full automorphism group of a graph
Combinatorica
1981
220
40
One way functions and pseudorandom generators
Combinatorica
1987
212
41
Hadwiger's conjecture forK 6-free graphs
Combinatorica
1993
211
42
A deterministic view of random sampling and its use in geometry
Combinatorica
1990
210
43
Constructing a perfect matching is in random NC
Combinatorica
1986
209
44
Blow-up Lemma
Combinatorica
1997
203
45
Supersaturated graphs and hypergraphs
Combinatorica
1983
197
46
The exact bound in the Erdös-Ko-Rado theorem
Combinatorica
1984
197
47
Threshold functions
Combinatorica
1987
189
48
Packing directed circuits fractionally
Combinatorica
1995
186
49
Mastermind
Combinatorica
1983
168
50
On optimal matchings
Combinatorica
1984
166
site/software ©
exaly
; All materials licenced under
CC by-SA
.