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
›
SIAM Journal on Discrete Mathematics
›
top-articles
SIAM Journal on Discrete Mathematics
0.7
(top 50%)
impact factor
3.2K
(top 10%)
papers
47.6K
(top 10%)
citations
87
(top 5%)
h
-index
0.7
(top 50%)
extended IF
3.2K
all documents
50.4K
doc citations
137
(top 5%)
g
-index
Top Articles
#
Title
Journal
Year
Citations
1
A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
SIAM Journal on Discrete Mathematics
1990
676
2
Singularity Analysis of Generating Functions
SIAM Journal on Discrete Mathematics
1990
628
3
Labelling Graphs with a Condition at Distance 2
SIAM Journal on Discrete Mathematics
1992
575
4
Comparing Top k Lists
SIAM Journal on Discrete Mathematics
2003
500
5
A Mathematical Model for Periodic Scheduling Problems
SIAM Journal on Discrete Mathematics
1989
384
6
Sorting by Transpositions
SIAM Journal on Discrete Mathematics
1998
330
7
Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
SIAM Journal on Discrete Mathematics
1992
322
8
The Probabilistic Communication Complexity of Set Intersection
SIAM Journal on Discrete Mathematics
1992
321
9
The Laplacian Spectrum of a Graph II
SIAM Journal on Discrete Mathematics
1994
315
10
The $L(2,1)$-Labeling Problem on Graphs
SIAM Journal on Discrete Mathematics
1996
311
11
On the Metric Dimension of Cartesian Products of Graphs
SIAM Journal on Discrete Mathematics
2007
307
12
Dynamic Steiner Tree Problem
SIAM Journal on Discrete Mathematics
1991
266
13
Complexity of Scheduling Parallel Task Systems
SIAM Journal on Discrete Mathematics
1989
265
14
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
SIAM Journal on Discrete Mathematics
1999
258
15
Domination in Graphs Applied to Electric Power Networks
SIAM Journal on Discrete Mathematics
2002
249
16
Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
SIAM Journal on Discrete Mathematics
1993
247
17
Tighter Bounds for Graph Steiner Tree Approximation
SIAM Journal on Discrete Mathematics
2005
236
18
On the Approximability of Influence in Social Networks
SIAM Journal on Discrete Mathematics
2009
234
19
Algorithms for Vertex Partitioning Problems on Partial k-Trees
SIAM Journal on Discrete Mathematics
1997
225
20
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
SIAM Journal on Discrete Mathematics
2000
223
21
Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
SIAM Journal on Discrete Mathematics
1998
221
22
Chernoff–Hoeffding Bounds for Applications with Limited Independence
SIAM Journal on Discrete Mathematics
1995
219
23
On the Position Value for Communication Situations
SIAM Journal on Discrete Mathematics
1992
218
24
Multiprocessor Scheduling with Rejection
SIAM Journal on Discrete Mathematics
2000
215
25
The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
SIAM Journal on Discrete Mathematics
1990
214
26
Second-Order Rigidity and Prestress Stability for Tensegrity Frameworks
SIAM Journal on Discrete Mathematics
1996
212
27
On the Size of Systems of Sets Every t of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
SIAM Journal on Discrete Mathematics
1989
204
28
Augmenting Graphs to Meet Edge-Connectivity Requirements
SIAM Journal on Discrete Mathematics
1992
203
29
New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem
SIAM Journal on Discrete Mathematics
1994
200
30
New Ressults on Server Problems
SIAM Journal on Discrete Mathematics
1991
189
31
Monotone Circuits for Connectivity Require Super-Logarithmic Depth
SIAM Journal on Discrete Mathematics
1990
187
32
Sorting Permutations by Reversals and Eulerian Cycle Decompositions
SIAM Journal on Discrete Mathematics
1999
184
33
Kernelization Lower Bounds by Cross-Composition
SIAM Journal on Discrete Mathematics
2014
170
34
Labeling Chordal Graphs: Distance Two Condition
SIAM Journal on Discrete Mathematics
1994
161
35
Spanning Trees with Many Leaves
SIAM Journal on Discrete Mathematics
1991
160
36
Tree Spanners
SIAM Journal on Discrete Mathematics
1995
158
37
Implicat Representation of Graphs
SIAM Journal on Discrete Mathematics
1992
156
38
Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
SIAM Journal on Discrete Mathematics
2000
155
39
Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
SIAM Journal on Discrete Mathematics
1993
153
40
Harmonic Analysis of Polynomial Threshold Functions
SIAM Journal on Discrete Mathematics
1990
152
41
Contrast Optimal Threshold Visual Cryptography Schemes
SIAM Journal on Discrete Mathematics
2003
152
42
Parallel Symmetry-Breaking in Sparse Graphs
SIAM Journal on Discrete Mathematics
1988
151
43
The Number of Independent Sets in a Grid Graph
SIAM Journal on Discrete Mathematics
1998
149
44
Routing with Polynomial Communication-Space Trade-Off
SIAM Journal on Discrete Mathematics
1992
142
45
Ranking Tournaments
SIAM Journal on Discrete Mathematics
2006
142
46
The Diameter of a Cycle Plus a Random Matching
SIAM Journal on Discrete Mathematics
1988
141
47
The Problem of Compatible Representatives
SIAM Journal on Discrete Mathematics
1992
135
48
The Pathwidth and Treewidth of Cographs
SIAM Journal on Discrete Mathematics
1993
134
49
Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
SIAM Journal on Discrete Mathematics
1990
133
50
On the $\lambda$-Number of $Q_n $ and Related Graphs
SIAM Journal on Discrete Mathematics
1995
132
site/software ©
exaly
; All materials licenced under
CC by-SA
.