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

#TitleJournalYearCitations
1A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming ProblemsSIAM Journal on Discrete Mathematics1990676
2Singularity Analysis of Generating FunctionsSIAM Journal on Discrete Mathematics1990628
3Labelling Graphs with a Condition at Distance 2SIAM Journal on Discrete Mathematics1992575
4Comparing Top k ListsSIAM Journal on Discrete Mathematics2003500
5A Mathematical Model for Periodic Scheduling ProblemsSIAM Journal on Discrete Mathematics1989384
6Sorting by TranspositionsSIAM Journal on Discrete Mathematics1998330
7Computing Edge-Connectivity in Multigraphs and Capacitated GraphsSIAM Journal on Discrete Mathematics1992322
8The Probabilistic Communication Complexity of Set IntersectionSIAM Journal on Discrete Mathematics1992321
9The Laplacian Spectrum of a Graph IISIAM Journal on Discrete Mathematics1994315
10The $L(2,1)$-Labeling Problem on GraphsSIAM Journal on Discrete Mathematics1996311
11On the Metric Dimension of Cartesian Products of GraphsSIAM Journal on Discrete Mathematics2007307
12Dynamic Steiner Tree ProblemSIAM Journal on Discrete Mathematics1991266
13Complexity of Scheduling Parallel Task SystemsSIAM Journal on Discrete Mathematics1989265
14A 2-Approximation Algorithm for the Undirected Feedback Vertex Set ProblemSIAM Journal on Discrete Mathematics1999258
15Domination in Graphs Applied to Electric Power NetworksSIAM Journal on Discrete Mathematics2002249
16Discrete Logarithms in $GF ( P )$ Using the Number Field SieveSIAM Journal on Discrete Mathematics1993247
17Tighter Bounds for Graph Steiner Tree ApproximationSIAM Journal on Discrete Mathematics2005236
18On the Approximability of Influence in Social NetworksSIAM Journal on Discrete Mathematics2009234
19Algorithms for Vertex Partitioning Problems on Partial k-TreesSIAM Journal on Discrete Mathematics1997225
20Approximating Fractional Multicommodity Flow Independent of the Number of CommoditiesSIAM Journal on Discrete Mathematics2000223
21Combinatorial Properties and Constructions of Traceability Schemes and Frameproof CodesSIAM Journal on Discrete Mathematics1998221
22Chernoff–Hoeffding Bounds for Applications with Limited IndependenceSIAM Journal on Discrete Mathematics1995219
23On the Position Value for Communication SituationsSIAM Journal on Discrete Mathematics1992218
24Multiprocessor Scheduling with RejectionSIAM Journal on Discrete Mathematics2000215
25The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled TreesSIAM Journal on Discrete Mathematics1990214
26Second-Order Rigidity and Prestress Stability for Tensegrity FrameworksSIAM Journal on Discrete Mathematics1996212
27On 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 ProblemsSIAM Journal on Discrete Mathematics1989204
28Augmenting Graphs to Meet Edge-Connectivity RequirementsSIAM Journal on Discrete Mathematics1992203
29New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability ProblemSIAM Journal on Discrete Mathematics1994200
30New Ressults on Server ProblemsSIAM Journal on Discrete Mathematics1991189
31Monotone Circuits for Connectivity Require Super-Logarithmic DepthSIAM Journal on Discrete Mathematics1990187
32Sorting Permutations by Reversals and Eulerian Cycle DecompositionsSIAM Journal on Discrete Mathematics1999184
33Kernelization Lower Bounds by Cross-CompositionSIAM Journal on Discrete Mathematics2014170
34Labeling Chordal Graphs: Distance Two ConditionSIAM Journal on Discrete Mathematics1994161
35Spanning Trees with Many LeavesSIAM Journal on Discrete Mathematics1991160
36Tree SpannersSIAM Journal on Discrete Mathematics1995158
37Implicat Representation of GraphsSIAM Journal on Discrete Mathematics1992156
38Bounds for Dispersers, Extractors, and Depth-Two SuperconcentratorsSIAM Journal on Discrete Mathematics2000155
39Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner BasesSIAM Journal on Discrete Mathematics1993153
40Harmonic Analysis of Polynomial Threshold FunctionsSIAM Journal on Discrete Mathematics1990152
41Contrast Optimal Threshold Visual Cryptography SchemesSIAM Journal on Discrete Mathematics2003152
42Parallel Symmetry-Breaking in Sparse GraphsSIAM Journal on Discrete Mathematics1988151
43The Number of Independent Sets in a Grid GraphSIAM Journal on Discrete Mathematics1998149
44Routing with Polynomial Communication-Space Trade-OffSIAM Journal on Discrete Mathematics1992142
45Ranking TournamentsSIAM Journal on Discrete Mathematics2006142
46The Diameter of a Cycle Plus a Random MatchingSIAM Journal on Discrete Mathematics1988141
47The Problem of Compatible RepresentativesSIAM Journal on Discrete Mathematics1992135
48The Pathwidth and Treewidth of CographsSIAM Journal on Discrete Mathematics1993134
49Integer Polyhedra Arising from Certain Network Design Problems with Connectivity ConstraintsSIAM Journal on Discrete Mathematics1990133
50On the $\lambda$-Number of $Q_n $ and Related GraphsSIAM Journal on Discrete Mathematics1995132