Discrete Applied Mathematics

0.9(top 50%)

impact factor

9.1K(top 2%)

papers

125.2K(top 5%)

citations

113(top 5%)

h-index

0.9(top 50%)

impact factor

10.8K

all documents

132.3K

doc citations

177(top 5%)

g-index

Top Articles

#	Title	Journal	Year	Citations
1	Scheduling subject to resource constraints: classification and complexity	Discrete Applied Mathematics	1983	1,142
2	Complement reducible graphs	Discrete Applied Mathematics	1981	612
3	Resolvability in graphs and the metric dimension of a graph	Discrete Applied Mathematics	2000	608
4	Landmarks in graphs	Discrete Applied Mathematics	1996	551
5	Pseudo-Boolean optimization	Discrete Applied Mathematics	2002	547
6	Reverse search for enumeration	Discrete Applied Mathematics	1996	518
7	Pairings for cryptographers	Discrete Applied Mathematics	2008	506
8	A survey of very large-scale neighborhood search techniques	Discrete Applied Mathematics	2002	492
9	Upper bounds to the clique width of graphs	Discrete Applied Mathematics	2000	468
10	Directed hypergraphs and applications	Discrete Applied Mathematics	1993	454
11	A fast algorithm for the maximum clique problem	Discrete Applied Mathematics	2002	448
12	Signed graphs	Discrete Applied Mathematics	1982	431
13	Linear time algorithms for NP-hard problems restricted to partial k-trees	Discrete Applied Mathematics	1989	431
14	A branch and bound algorithm for the job-shop scheduling problem	Discrete Applied Mathematics	1994	361
15	Models, relaxations and exact approaches for the capacitated vehicle routing problem	Discrete Applied Mathematics	2002	360
16	The selective travelling salesman problem	Discrete Applied Mathematics	1990	326
17	Birthday paradox, coupon collectors, caching algorithms and self-organizing search	Discrete Applied Mathematics	1992	324
18	A survey of scheduling with controllable processing times	Discrete Applied Mathematics	2007	323
19	Methods and problems of communication in usual networks	Discrete Applied Mathematics	1994	321
20	Some remarks on the stable matching problem	Discrete Applied Mathematics	1985	320
21	The Riordan group	Discrete Applied Mathematics	1991	311
22	On some counting polynomials in chemistry	Discrete Applied Mathematics	1988	301
23	The maximum edge biclique problem is NP-complete	Discrete Applied Mathematics	2003	274
24	Cluster graph modification problems	Discrete Applied Mathematics	2004	274
25	A game of cops and robbers	Discrete Applied Mathematics	1984	271
26	Optimal normal bases in GF(pn)	Discrete Applied Mathematics	1988	260
27	A simplified NP-complete satisfiability problem	Discrete Applied Mathematics	1984	259
28	Scheduling jobs with fixed start and end times	Discrete Applied Mathematics	1987	256
29	Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots	Discrete Applied Mathematics	2000	251
30	Recent advances on two-dimensional bin packing problems	Discrete Applied Mathematics	2002	250
31	A hierarchy of relaxations and convex hull characterizations for mixed-integer zero—one programming problems	Discrete Applied Mathematics	1994	248
32	Approximation algorithms for the geometric covering salesman problem	Discrete Applied Mathematics	1994	248
33	A note on greedy algorithms for the maximum weighted independent set problem	Discrete Applied Mathematics	2003	248
34	Disjunctive programming: Properties of the convex hull of feasible points	Discrete Applied Mathematics	1998	246
35	Resistance distance and the normalized Laplacian spectrum	Discrete Applied Mathematics	2007	234
36	Lower bounds and reduction procedures for the bin packing problem	Discrete Applied Mathematics	1990	224
37	Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem	Discrete Applied Mathematics	1984	219
38	Efficient bounds for the stable set, vertex cover and set packing problems	Discrete Applied Mathematics	1983	214
39	Perspectives of Monge properties in optimization	Discrete Applied Mathematics	1996	211
40	Decreasing energy functions as a tool for studying threshold networks	Discrete Applied Mathematics	1985	206
41	On the complexity of cutting-plane proofs	Discrete Applied Mathematics	1987	202
42	Solving satisfiability in less than 2n steps	Discrete Applied Mathematics	1985	201
43	The shortest-path problem for graphs with random arc-lengths	Discrete Applied Mathematics	1985	199
44	Stable marriage and indifference	Discrete Applied Mathematics	1994	199
45	The b-chromatic number of a graph	Discrete Applied Mathematics	1999	198
46	Bipartite permutation graphs	Discrete Applied Mathematics	1987	197
47	Formulating the single machine sequencing problem with release dates as a mixed integer program	Discrete Applied Mathematics	1990	195
48	Ejection chains, reference structures and alternating path methods for traveling salesman problems	Discrete Applied Mathematics	1996	195
49	Clustering and domination in perfect graphs	Discrete Applied Mathematics	1984	190
50	Bundle-based relaxation methods for multicommodity capacitated fixed charge network design	Discrete Applied Mathematics	2001	190

Scientometrics

Overviews

Citing Bodies

Discrete Applied Mathematics

Top Articles