×

Garey, Michael Randolph

Author ID: garey.michael-r Recent zbMATH articles by "Garey, Michael Randolph"
Published as: Garey, M. R.; Garey, Michael R.
External Links: MGP · Wikidata · Google Scholar · dblp · GND · IdRef

Publications by Year

Citations contained in zbMATH Open

66 Publications have been cited 13,874 times in 12,531 Documents Cited by Year
Computers and intractability. A guide to the theory of NP-completeness. Zbl 0411.68039
Garey, Michael R.; Johnson, David S.
1979
Some simplified NP-complete graph problems. Zbl 0338.05120
Garey, M. R.; Johnson, D. S.; Stockmeyer, L.
673
1976
The complexity of flow shop and jobshop scheduling. Zbl 0396.90041
Garey, M. R.; Johnson, D. S.; Sethi, Ravi
389
1976
The rectilinear Steiner tree problem is NP-complete. Zbl 0396.05009
Garey, M. R.; Johnson, D. S.
260
1977
“Strong” NP-completeness results: Motivation, examples, and implications. Zbl 0379.68035
Garey, M. R.; Johnson, D. S.
233
1978
Worst-case performance bounds for simple one-dimensional packing algorithms. Zbl 0297.68028
Johnson, D. S.; Demers, A.; Ullman, J. D.; Garey, M. R.; Graham, R. L.
199
1975
The planar Hamiltonian circuit problem is NP-complete. Zbl 0346.05110
Garey, M. R.; Johnson, D. S.; Tarjan, R. Endre
179
1976
Crossing number is NP-complete. Zbl 0536.05016
Garey, M. R.; Johnson, D. S.
168
1983
An application of bin-packing to multiprocessor scheduling. Zbl 0374.68032
Coffman, E. G. jun.; Garey, M. R.; Johnson, D. S.
129
1978
The complexity of computing Steiner minimal trees. Zbl 0399.05023
Garey, M. R.; Graham, R. L.; Johnson, D. S.
125
1977
The complexity of searching a graph. Zbl 0637.68081
Megiddo, N.; Hakimi, S. L.; Garey, M. R.; Johnson, D. S.; Papadimitriou, C. H.
123
1988
One-processor scheduling with symmetric earliness and tardiness penalties. Zbl 0671.90033
Garey, Michael R.; Tarjan, Robert E.; Wilfong, Gordon T.
117
1988
Approximation algorithms for bin-packing - an updated survey. Zbl 0558.68062
Coffman, E. G. jun.; Garey, M. R.; Johnson, D. S.
117
1984
The transitive reduction of a directed graph. Zbl 0247.05128
Aho, A. V.; Garey, M. R.; Ullman, J. D.
113
1972
Two-processor scheduling with start-times and deadlines. Zbl 0369.90053
Garey, M. R.; Johnson, D. S.
110
1977
Performance bounds for level-oriented two-dimensional packing algorithms. Zbl 0447.68079
Coffman, E. G. jun.; Garey, M. R.; Johnson, D. S.; Tarjan, R. E.
109
1980
Complexity results for bandwidth minimization. Zbl 0385.05048
Garey, M. R.; Graham, R. L.; Johnson, D. S.; Knuth, D. E.
109
1978
The complexity of coloring circular arcs and chords. Zbl 0499.05058
Garey, M. R.; Johnson, D. S.; Miller, G. L.; Papadimitriou, C. H.
108
1980
Complexity results for multiprocessor scheduling under resource constraints. Zbl 0365.90076
Garey, M. R.; Johnson, D. S.
93
1975
Resource constrained scheduling as generalized bin packing. Zbl 0384.90053
Garey, M. R.; Graham, R. L.; Johnson, D. S.; Yao, Andrew Chi-Chih
75
1976
The complexity of near-optimal graph coloring. Zbl 0322.05111
Garey, M. R.; Johnson, D. S.
67
1976
Some NP-complete geometric problems. Zbl 0377.68036
Garey, M. R.; Graham, R. L.; Johnson, D. S.
60
1976
Triangulating a simple polygon. Zbl 0384.68040
Garey, Michael R.; Johnson, David S.; Preparata, Franco P.; Tarjan, Robert E.
59
1978
On packing two-dimensional bins. Zbl 0495.05016
Chung, F. R. K.; Garey, M. R.; Johnson, D. S.
59
1982
On the distance matrix of a tree. Zbl 0328.05103
Edelberg, M.; Garey, M. R.; Graham, R. L.
54
1976
Bounds for multiprocessor scheduling with resource constraints. Zbl 0333.68041
Garey, M. R.; Graham, R. L.
53
1975
Scheduling unit-time tasks with arbitrary release times and deadlines. Zbl 0472.68021
Garey, M. R.; Johnson, D. S.; Simons, B. B.; Tarjan, R. E.
40
1981
Scheduling file transfers. Zbl 0604.68039
Coffman, E. G. jun.; Garey, M. R.; Johnson, D. S.; Lapaugh, A. S.
38
1985
Diameter bounds for altered graphs. Zbl 0562.05030
Chung, F. R. K.; Garey, M. R.
36
1984
Scheduling tasks with nonuniform deadlines on two processors. Zbl 0338.68048
Garey, M. R.; Johnson, D. S.
34
1976
Strongly connected orientations of mixed multigraphs. Zbl 0645.90097
Chung, Fan R. K.; Garey, Michael R.; Tarjan, Robert E.
30
1985
Dynamic bin packing. Zbl 0512.68050
Coffman, E. G. jun.; Garey, M. R.; Johnson, D. S.
30
1983
Scheduling equal-length tasks under treelike precedence constraints to minimize maximum lateness. Zbl 0397.90044
Brucker, Peter; Garey, M. R.; Johnson, D. S.
29
1977
An application of graph coloring to printed circuit testing. Zbl 0342.94021
Garey, Michael R.; Johnson, David Stifler; So, Hing C.
28
1976
Bin packing with divisible item sizes. Zbl 0641.68097
Coffman, E. G. jun.; Garey, M. R.; Johson, D. S.
28
1987
Optimal binary identification procedures. Zbl 0229.68037
Garey, M. R.
28
1972
Worst-case analysis of memory allocation algorithms. Zbl 0357.68027
Garey, M. R.; Graham, R. L.; Ullman, J. D.
22
1972
A 71/60 theorem for bin packing. Zbl 0604.68046
Johnson, David S.; Garey, Michael R.
22
1985
Scheduling opposing forests. Zbl 0507.68021
Garey, M. R.; Johnson, D. S.; Tarjan, R. E.; Yannakakis, M.
21
1983
On cubical graphs. Zbl 0301.05104
Garey, M. R.; Graham, R. L.
19
1975
Performance guarantees for scheduling algorithms. Zbl 0371.90068
Garey, M. R.; Graham, R. L.; Johnson, D. S.
19
1978
Rectilinear Steiner trees: Efficient special-case algorithms. Zbl 0351.05102
Aho, A. V.; Garey, M. R.; Hwang, F. K.
18
1977
A stochastic optimization algorithm minimizing expected flow times on uniform processors. Zbl 0528.68022
Agrawala, Ashok K.; Coffman, Edward G. jun.; Garey, Michael R.; Tripathi, Satish K.
18
1984
Optimal task sequencing with precedence constraints. Zbl 0253.90057
Garey, M. R.
17
1973
Computers and intractability. Transl. from the English by E. V. Levner and M. A. Frumkin. (Вычислителъные машины и труднорешаемые задачи.) Zbl 0522.68040
Garey, Michael R.; Johnson, David S.
17
1982
On the fractional covering number of hypergraphs. Zbl 0724.05054
Chung, F. R. K.; Füredi, Z.; Garey, M. R.; Graham, R. L.
13
1988
Optimal binary search trees with restricted maximal depth. Zbl 0288.68058
Garey, M. R.
12
1974
The complexity of the generalized Lloyd-Max problem. Zbl 0476.94009
Garey, M. R.; Johnson, D. S.; Witsenhausen, Hans S.
11
1982
Two results concerning multicoloring. Zbl 0374.05025
Chvatal, V.; Garey, M. R.; Johnson, D. S.
10
1978
Approximation algorithms for combinatorial problems: An annotated bibliography. Zbl 0382.05001
Garey, M. R.; Johnson, D. S.
10
1976
Minimizing expected makespans on uniform processor systems. Zbl 0617.90044
Coffman, E. G. jun.; Flatto, L.; Garey, M. R.; Weber, R. R.
9
1987
Bin packing with discrete item sizes. I: Perfect packing theorems and the average case behavior of optimal packings. Zbl 0951.68192
Coffman, E. G. jun.; Courcoubetis, C.; Garey, M. R.; Johnson, D. S.; Shor, P. W.
8
2000
Performance bounds on the splitting algorithm for binary testing. Zbl 0276.68023
Garey, M. R.; Graham, R. L.
6
1974
Computational aspects of deciding if all roots of a polynomial lie within the unit circle. Zbl 0321.65029
Anderson, P. G.; Garey, M. R.; Heindel, L. E.
5
1976
Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two- processor scheduling. Zbl 0794.68015
Coffman, E. G. jun.; Garey, M. R.
5
1993
Simple binary identification problems. Zbl 0234.94035
Garey, M. R.
4
1972
Isolating a single defective using group testing. Zbl 0281.62063
Garey, M. R.; Hwang, F. K.
3
1974
Efficient generation of optimal prefix code: Equiprobable words using unequal cost letters. Zbl 0301.68058
Perl, Y.; Garey, M. R.; Even, S.
3
1975
Algorithms for a set partitioning problem arising in the design of multipurpose units. Zbl 0358.68070
Garey, Michael R.; Hwang, Frank K.; Johnson, David S.
3
1977
A linear-time algorithm for finding all feedback vertices. Zbl 0389.05038
Garey, Michael R.; Tarjan, Robert E.
3
1978
On enumerating tournaments that admit exactly one Hamiltonian circuit. Zbl 0233.05004
Garey, M. R.
3
1972
On a number-theoretic bin packing conjecture. Zbl 0399.05019
Garey, M. R.; Graham, R. L.; Johnson, D. S.
2
1978
A note on bisecting minimum spanning trees. Zbl 0387.05005
Boyce, W. M.; Garey, M. R.; Johnson, D. S.
1
1978
Perfect packing theorems and the average-case behavior of optimal and online bin packing. Zbl 0999.68260
Coffman, E. G. jun.; Courcoubetis, C.; Garey, M. R.; Johnson, D. S.; Shor, P. W.
1
2002
Composing functions to minimize image size. Zbl 0602.68093
Garey, M. R.; Johnson, D. S.
1
1985
Optimal test point selection for sequential manufacturing processes. Zbl 0238.90035
Garey, M. R.
1
1972
Perfect packing theorems and the average-case behavior of optimal and online bin packing. Zbl 0999.68260
Coffman, E. G. jun.; Courcoubetis, C.; Garey, M. R.; Johnson, D. S.; Shor, P. W.
1
2002
Bin packing with discrete item sizes. I: Perfect packing theorems and the average case behavior of optimal packings. Zbl 0951.68192
Coffman, E. G. jun.; Courcoubetis, C.; Garey, M. R.; Johnson, D. S.; Shor, P. W.
8
2000
Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two- processor scheduling. Zbl 0794.68015
Coffman, E. G. jun.; Garey, M. R.
5
1993
The complexity of searching a graph. Zbl 0637.68081
Megiddo, N.; Hakimi, S. L.; Garey, M. R.; Johnson, D. S.; Papadimitriou, C. H.
123
1988
One-processor scheduling with symmetric earliness and tardiness penalties. Zbl 0671.90033
Garey, Michael R.; Tarjan, Robert E.; Wilfong, Gordon T.
117
1988
On the fractional covering number of hypergraphs. Zbl 0724.05054
Chung, F. R. K.; Füredi, Z.; Garey, M. R.; Graham, R. L.
13
1988
Bin packing with divisible item sizes. Zbl 0641.68097
Coffman, E. G. jun.; Garey, M. R.; Johson, D. S.
28
1987
Minimizing expected makespans on uniform processor systems. Zbl 0617.90044
Coffman, E. G. jun.; Flatto, L.; Garey, M. R.; Weber, R. R.
9
1987
Scheduling file transfers. Zbl 0604.68039
Coffman, E. G. jun.; Garey, M. R.; Johnson, D. S.; Lapaugh, A. S.
38
1985
Strongly connected orientations of mixed multigraphs. Zbl 0645.90097
Chung, Fan R. K.; Garey, Michael R.; Tarjan, Robert E.
30
1985
A 71/60 theorem for bin packing. Zbl 0604.68046
Johnson, David S.; Garey, Michael R.
22
1985
Composing functions to minimize image size. Zbl 0602.68093
Garey, M. R.; Johnson, D. S.
1
1985
Approximation algorithms for bin-packing - an updated survey. Zbl 0558.68062
Coffman, E. G. jun.; Garey, M. R.; Johnson, D. S.
117
1984
Diameter bounds for altered graphs. Zbl 0562.05030
Chung, F. R. K.; Garey, M. R.
36
1984
A stochastic optimization algorithm minimizing expected flow times on uniform processors. Zbl 0528.68022
Agrawala, Ashok K.; Coffman, Edward G. jun.; Garey, Michael R.; Tripathi, Satish K.
18
1984
Crossing number is NP-complete. Zbl 0536.05016
Garey, M. R.; Johnson, D. S.
168
1983
Dynamic bin packing. Zbl 0512.68050
Coffman, E. G. jun.; Garey, M. R.; Johnson, D. S.
30
1983
Scheduling opposing forests. Zbl 0507.68021
Garey, M. R.; Johnson, D. S.; Tarjan, R. E.; Yannakakis, M.
21
1983
On packing two-dimensional bins. Zbl 0495.05016
Chung, F. R. K.; Garey, M. R.; Johnson, D. S.
59
1982
Computers and intractability. Transl. from the English by E. V. Levner and M. A. Frumkin. (Вычислителъные машины и труднорешаемые задачи.) Zbl 0522.68040
Garey, Michael R.; Johnson, David S.
17
1982
The complexity of the generalized Lloyd-Max problem. Zbl 0476.94009
Garey, M. R.; Johnson, D. S.; Witsenhausen, Hans S.
11
1982
Scheduling unit-time tasks with arbitrary release times and deadlines. Zbl 0472.68021
Garey, M. R.; Johnson, D. S.; Simons, B. B.; Tarjan, R. E.
40
1981
Performance bounds for level-oriented two-dimensional packing algorithms. Zbl 0447.68079
Coffman, E. G. jun.; Garey, M. R.; Johnson, D. S.; Tarjan, R. E.
109
1980
The complexity of coloring circular arcs and chords. Zbl 0499.05058
Garey, M. R.; Johnson, D. S.; Miller, G. L.; Papadimitriou, C. H.
108
1980
Computers and intractability. A guide to the theory of NP-completeness. Zbl 0411.68039
Garey, Michael R.; Johnson, David S.
1979
“Strong” NP-completeness results: Motivation, examples, and implications. Zbl 0379.68035
Garey, M. R.; Johnson, D. S.
233
1978
An application of bin-packing to multiprocessor scheduling. Zbl 0374.68032
Coffman, E. G. jun.; Garey, M. R.; Johnson, D. S.
129
1978
Complexity results for bandwidth minimization. Zbl 0385.05048
Garey, M. R.; Graham, R. L.; Johnson, D. S.; Knuth, D. E.
109
1978
Triangulating a simple polygon. Zbl 0384.68040
Garey, Michael R.; Johnson, David S.; Preparata, Franco P.; Tarjan, Robert E.
59
1978
Performance guarantees for scheduling algorithms. Zbl 0371.90068
Garey, M. R.; Graham, R. L.; Johnson, D. S.
19
1978
Two results concerning multicoloring. Zbl 0374.05025
Chvatal, V.; Garey, M. R.; Johnson, D. S.
10
1978
A linear-time algorithm for finding all feedback vertices. Zbl 0389.05038
Garey, Michael R.; Tarjan, Robert E.
3
1978
On a number-theoretic bin packing conjecture. Zbl 0399.05019
Garey, M. R.; Graham, R. L.; Johnson, D. S.
2
1978
A note on bisecting minimum spanning trees. Zbl 0387.05005
Boyce, W. M.; Garey, M. R.; Johnson, D. S.
1
1978
The rectilinear Steiner tree problem is NP-complete. Zbl 0396.05009
Garey, M. R.; Johnson, D. S.
260
1977
The complexity of computing Steiner minimal trees. Zbl 0399.05023
Garey, M. R.; Graham, R. L.; Johnson, D. S.
125
1977
Two-processor scheduling with start-times and deadlines. Zbl 0369.90053
Garey, M. R.; Johnson, D. S.
110
1977
Scheduling equal-length tasks under treelike precedence constraints to minimize maximum lateness. Zbl 0397.90044
Brucker, Peter; Garey, M. R.; Johnson, D. S.
29
1977
Rectilinear Steiner trees: Efficient special-case algorithms. Zbl 0351.05102
Aho, A. V.; Garey, M. R.; Hwang, F. K.
18
1977
Algorithms for a set partitioning problem arising in the design of multipurpose units. Zbl 0358.68070
Garey, Michael R.; Hwang, Frank K.; Johnson, David S.
3
1977
Some simplified NP-complete graph problems. Zbl 0338.05120
Garey, M. R.; Johnson, D. S.; Stockmeyer, L.
673
1976
The complexity of flow shop and jobshop scheduling. Zbl 0396.90041
Garey, M. R.; Johnson, D. S.; Sethi, Ravi
389
1976
The planar Hamiltonian circuit problem is NP-complete. Zbl 0346.05110
Garey, M. R.; Johnson, D. S.; Tarjan, R. Endre
179
1976
Resource constrained scheduling as generalized bin packing. Zbl 0384.90053
Garey, M. R.; Graham, R. L.; Johnson, D. S.; Yao, Andrew Chi-Chih
75
1976
The complexity of near-optimal graph coloring. Zbl 0322.05111
Garey, M. R.; Johnson, D. S.
67
1976
Some NP-complete geometric problems. Zbl 0377.68036
Garey, M. R.; Graham, R. L.; Johnson, D. S.
60
1976
On the distance matrix of a tree. Zbl 0328.05103
Edelberg, M.; Garey, M. R.; Graham, R. L.
54
1976
Scheduling tasks with nonuniform deadlines on two processors. Zbl 0338.68048
Garey, M. R.; Johnson, D. S.
34
1976
An application of graph coloring to printed circuit testing. Zbl 0342.94021
Garey, Michael R.; Johnson, David Stifler; So, Hing C.
28
1976
Approximation algorithms for combinatorial problems: An annotated bibliography. Zbl 0382.05001
Garey, M. R.; Johnson, D. S.
10
1976
Computational aspects of deciding if all roots of a polynomial lie within the unit circle. Zbl 0321.65029
Anderson, P. G.; Garey, M. R.; Heindel, L. E.
5
1976
Worst-case performance bounds for simple one-dimensional packing algorithms. Zbl 0297.68028
Johnson, D. S.; Demers, A.; Ullman, J. D.; Garey, M. R.; Graham, R. L.
199
1975
Complexity results for multiprocessor scheduling under resource constraints. Zbl 0365.90076
Garey, M. R.; Johnson, D. S.
93
1975
Bounds for multiprocessor scheduling with resource constraints. Zbl 0333.68041
Garey, M. R.; Graham, R. L.
53
1975
On cubical graphs. Zbl 0301.05104
Garey, M. R.; Graham, R. L.
19
1975
Efficient generation of optimal prefix code: Equiprobable words using unequal cost letters. Zbl 0301.68058
Perl, Y.; Garey, M. R.; Even, S.
3
1975
Optimal binary search trees with restricted maximal depth. Zbl 0288.68058
Garey, M. R.
12
1974
Performance bounds on the splitting algorithm for binary testing. Zbl 0276.68023
Garey, M. R.; Graham, R. L.
6
1974
Isolating a single defective using group testing. Zbl 0281.62063
Garey, M. R.; Hwang, F. K.
3
1974
Optimal task sequencing with precedence constraints. Zbl 0253.90057
Garey, M. R.
17
1973
The transitive reduction of a directed graph. Zbl 0247.05128
Aho, A. V.; Garey, M. R.; Ullman, J. D.
113
1972
Optimal binary identification procedures. Zbl 0229.68037
Garey, M. R.
28
1972
Worst-case analysis of memory allocation algorithms. Zbl 0357.68027
Garey, M. R.; Graham, R. L.; Ullman, J. D.
22
1972
Simple binary identification problems. Zbl 0234.94035
Garey, M. R.
4
1972
On enumerating tournaments that admit exactly one Hamiltonian circuit. Zbl 0233.05004
Garey, M. R.
3
1972
Optimal test point selection for sequential manufacturing processes. Zbl 0238.90035
Garey, M. R.
1
1972
all top 5

Cited by 14,720 Authors

112 Woeginger, Gerhard
70 Golovach, Petr A.
66 Cheng, Tai-Chiu Edwin
64 Paulusma, Daniël
57 Epstein, Leah
56 Jansen, Klaus
56 Pardalos, Panos M.
52 Yuan, Jinjiang
50 Niedermeier, Rolf
48 Bodlaender, Hans L.
48 Fomin, Fedor V.
47 Monnot, Jérôme
44 Kovalëv, Mikhail Yakovlevich
42 Lin, Guohui
40 Leung, Joseph Y.-T.
40 Paschos, Vangelis Th.
39 Błażewicz, Jacek
39 Chen, Jian-er
39 Kratsch, Dieter
38 Boysen, Nils
38 Thilikos, Dimitrios M.
36 de Werra, Dominique
35 Ito, Takehiro
33 Ibaraki, Toshihide
33 Rothe, Jörg-Matthias
33 Saurabh, Saket
33 Tuza, Zsolt
32 Dósa, György
32 Fellows, Michael Ralph
31 Otachi, Yota
31 Szwarcfiter, Jayme Luiz
31 Yang, Boting
31 Zhang, Guochuan
30 Ono, Hirotaka
29 Brandstädt, Andreas
29 Heggernes, Pinar
28 Fernau, Henning
28 Papadimitriou, Christos Harilaos
26 Levin, Asaf
26 Nagamochi, Hiroshi
25 Broersma, Hajo J.
25 Du, Ding-Zhu
25 Kel’manov, Aleksandr Vasil’evich
25 Makino, Kazuhisa
25 Pesch, Erwin
25 Rautenbach, Dieter
25 Ravi, S. S.
25 Spieksma, Frits C. R.
24 Demange, Marc
24 Kubiak, Wiesław X.
24 Lee, Chung-Yee
24 Lin, Bertrand Miao-Tsong
24 Lingas, Andrzej
24 van ’t Hof, Pim
24 Zehavi, Meirav
23 Boros, Endre
23 de Figueiredo, Celina M. Herrera
23 Dourado, Mitre Costa
23 Escoffier, Bruno
23 Krumke, Sven Oliver
23 Li, Jianping
23 Ng, C. T. Daniel
23 Pyatkin, Artëm Valer’evich
23 Rajasingh, Indra
23 Sau, Ignasi
23 Wang, Jianxin
22 Bazgan, Cristina
22 Gupta, Jatinder N. D.
22 Hedetniemi, Stephen Travis
22 Kellerer, Johann
22 Marathe, Madhav V.
22 Sriskandarajah, Chelliah
22 Uehara, Ryuhei
22 Yannakakis, Mihalis
21 Demaine, Erik D.
21 Guo, Jiong
21 Han, Xin
21 Hansen, Pierre
21 Hao, Jin-Kao
21 Hell, Pavol
21 Kratochvíl, Jan
21 Picouleau, Christophe
21 Ries, Bernard
21 Wakabayashi, Yoshiko
21 Werner, Frank
21 Yi, Eunjeong
20 Choi, Byung-Cheon
20 Della Croce, Federico
20 Dell’Olmo, Paolo
20 Gottlob, Georg
20 Grigorev, Aleksandr
20 Gutin, Gregory Z.
20 Lokshtanov, Daniel
20 Miyano, Eiji
20 Miyazawa, Flavio Keidi
20 Serna Iglesias, Maria José
20 Shachnai, Hadas
20 Wu, Weili
19 Giroudeau, Rodolphe
19 Hertz, Alain
...and 14,620 more Authors
all top 5

Cited in 570 Serials

1,042 Discrete Applied Mathematics
1,041 Theoretical Computer Science
987 European Journal of Operational Research
504 Information Processing Letters
500 Computers & Operations Research
387 Algorithmica
335 Discrete Mathematics
274 Journal of Combinatorial Optimization
261 Operations Research Letters
250 Journal of Computer and System Sciences
221 Annals of Operations Research
202 Journal of Scheduling
198 Artificial Intelligence
192 Networks
147 Mathematical Programming. Series A. Series B
120 Discrete Optimization
104 Information and Computation
101 Journal of Discrete Algorithms
93 Theory of Computing Systems
92 Computational Geometry
92 Optimization Letters
84 Information Sciences
82 Journal of Global Optimization
75 Discrete Mathematics, Algorithms and Applications
66 International Journal of Foundations of Computer Science
62 Annals of Mathematics and Artificial Intelligence
60 Applied Mathematics and Computation
60 International Transactions in Operational Research
59 Acta Informatica
59 Graphs and Combinatorics
58 SIAM Journal on Discrete Mathematics
57 RAIRO. Operations Research
56 International Journal of Computer Mathematics
55 Journal of Graph Theory
55 Naval Research Logistics
55 Linear Algebra and its Applications
54 Discrete & Computational Geometry
53 Computers & Mathematics with Applications
53 SIAM Journal on Algebraic and Discrete Methods
52 Journal of Combinatorial Theory. Series B
49 European Journal of Combinatorics
49 International Journal of Production Research
44 Computational Optimization and Applications
43 Journal of Heuristics
39 Computing
39 Mathematical and Computer Modelling
36 Asia-Pacific Journal of Operational Research
36 Applied Mathematical Modelling
34 Diskretnyĭ Analiz i Issledovanie Operatsiĭ
33 Discussiones Mathematicae. Graph Theory
31 Journal of Optimization Theory and Applications
31 Journal of Parallel and Distributed Computing
31 Mathematical Problems in Engineering
30 International Journal of Computational Geometry & Applications
28 Natural Computing
28 Algorithms
26 Automatica
25 Applied Mathematics Letters
25 INFORMS Journal on Computing
25 4OR
24 Journal of Complexity
24 Constraints
23 Mathematical Social Sciences
23 Acta Mathematicae Applicatae Sinica. English Series
23 International Journal of Approximate Reasoning
23 OR Spectrum
22 Combinatorica
22 Journal of Symbolic Computation
22 Journal of Graph Algorithms and Applications
21 Mathematical Programming
21 SIAM Journal on Computing
21 Journal of Computer and Systems Sciences International
21 The Electronic Journal of Combinatorics
21 Mathematical Methods of Operations Research
21 AKCE International Journal of Graphs and Combinatorics
20 Annals of Pure and Applied Logic
19 Journal of Combinatorial Theory. Series A
19 Automation and Remote Control
19 Journal of Mathematical Sciences (New York)
18 Journal of Information & Optimization Sciences
18 Real-Time Systems
18 Cybernetics and Systems Analysis
18 Computational Complexity
18 JMMA. Journal of Mathematical Modelling and Algorithms
17 BIT
17 Fuzzy Sets and Systems
17 Mathematical Systems Theory
17 Computer Science Review
16 Order
16 Optimization
16 Optimization Methods & Software
16 Journal of Discrete Mathematical Sciences & Cryptography
15 Machine Learning
15 Random Structures & Algorithms
15 RAIRO. Informatique Théorique et Applications
14 Advances in Applied Mathematics
14 Systems & Control Letters
14 Discrete Mathematics and Theoretical Computer Science. DMTCS
14 Proceedings of the Steklov Institute of Mathematics
13 Journal of Mathematical Psychology
...and 470 more Serials
all top 5

Cited in 54 Fields

6,621 Computer science (68-XX)
5,490 Operations research, mathematical programming (90-XX)
3,954 Combinatorics (05-XX)
614 Game theory, economics, finance, and other social and behavioral sciences (91-XX)
368 Numerical analysis (65-XX)
293 Mathematical logic and foundations (03-XX)
285 Information and communication theory, circuits (94-XX)
252 Biology and other natural sciences (92-XX)
193 Convex and discrete geometry (52-XX)
145 Statistics (62-XX)
102 Systems theory; control (93-XX)
100 Order, lattices, ordered algebraic structures (06-XX)
95 Linear and multilinear algebra; matrix theory (15-XX)
79 Number theory (11-XX)
74 Probability theory and stochastic processes (60-XX)
72 Quantum theory (81-XX)
64 Group theory and generalizations (20-XX)
45 Calculus of variations and optimal control; optimization (49-XX)
39 Statistical mechanics, structure of matter (82-XX)
33 Geometry (51-XX)
31 Dynamical systems and ergodic theory (37-XX)
29 General algebraic systems (08-XX)
25 Commutative algebra (13-XX)
19 Algebraic geometry (14-XX)
16 General and overarching topics; collections (00-XX)
16 Field theory and polynomials (12-XX)
16 Manifolds and cell complexes (57-XX)
10 Associative rings and algebras (16-XX)
10 Mechanics of deformable solids (74-XX)
9 History and biography (01-XX)
9 General topology (54-XX)
9 Mechanics of particles and systems (70-XX)
8 Functions of a complex variable (30-XX)
6 Measure and integration (28-XX)
5 Ordinary differential equations (34-XX)
5 Partial differential equations (35-XX)
5 Approximations and expansions (41-XX)
5 Operator theory (47-XX)
4 Category theory; homological algebra (18-XX)
4 Real functions (26-XX)
4 Functional analysis (46-XX)
4 Geophysics (86-XX)
3 Differential geometry (53-XX)
3 Algebraic topology (55-XX)
3 Fluid mechanics (76-XX)
3 Classical thermodynamics, heat transfer (80-XX)
2 Global analysis, analysis on manifolds (58-XX)
2 Relativity and gravitational theory (83-XX)
2 Mathematics education (97-XX)
1 Potential theory (31-XX)
1 Several complex variables and analytic spaces (32-XX)
1 Difference and functional equations (39-XX)
1 Harmonic analysis on Euclidean spaces (42-XX)
1 Optics, electromagnetic theory (78-XX)

Citations by Year

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.