Edit Profile (opens in new tab) Garey, Michael Randolph Co-Author Distance Author ID: garey.michael-r Published as: Garey, M. R.; Garey, Michael R. External Links: MGP · Wikidata · Google Scholar · dblp · GND · IdRef Documents Indexed: 69 Publications since 1972, including 2 Books 2 Further Contributions Co-Authors: 39 Co-Authors with 64 Joint Publications 2,001 Co-Co-Authors all top 5 Co-Authors 6 single-authored 42 Johnson, David Stifler 14 Graham, Ronald Lewis 11 Coffman, Edward Grady jun. 8 Tarjan, Robert Endre 4 Chung, Fan 4 Hwang, Frank Kwangming 4 Ullman, Jeffrey David 2 Aho, Alfred Vaino 2 Courcoubetis, Costas A. 2 Lawler, Eugene Leighton 2 Papadimitriou, Christos Harilaos 2 Pinter, Ron Yair 2 Shor, Peter Williston 1 Agrawala, Ashok K. 1 Anderson, Peter Gordon 1 Ausiello, Giorgio 1 Boyce, William M. 1 Brucker, Peter J. 1 Chvátal, Václav 1 D’Atri, Alessandro 1 Demers, Alan J. 1 Edelberg, M. 1 Edmonds, Jack R. 1 Flatto, Leopold 1 Frazer, W. Donald 1 Furedi, Zoltan 1 Giulianelli, S. 1 Hakimi, Seifollah Louis 1 Heindel, Lee E. 1 Johson, D. S. 1 Knuth, Donald Ervin 1 LaPaugh, Andrea S. 1 Lenstra, Jan Karel 1 Lucertini, Mario 1 Maffioli, Francesco 1 Megiddo, Nimrod 1 Miller, Gary Lee 1 Preparata, Franco P. 1 Protasi, Marco 1 Richards, Gaylord W. 1 Rinnooy Kan, Alexander Hendrik George 1 Simons, Barbara B. 1 So, Hing-Cheung 1 Stockmeyer, Larry J. 1 Tripathi, Satish K. 1 Weber, Richard Robert 1 Whitehead, Earl Glen jun. 1 Wilfong, Gordon T. 1 Witsenhausen, Hans S. 1 Yannakakis, Mihalis 1 Yao, Andrew Chi-Chih all top 5 Serials 13 SIAM Journal on Computing 6 Journal of the Association for Computing Machinery 4 SIAM Journal on Algebraic and Discrete Methods 4 SIAM Journal on Applied Mathematics 3 IEEE Transactions on Computers 3 Mathematics of Operations Research 3 Networks 2 Discrete Mathematics 2 Information Processing Letters 2 Journal of Combinatorial Theory. Series B 2 Journal of Complexity 2 SIAM Journal on Discrete Mathematics 1 Acta Informatica 1 Advances in Applied Probability 1 Bell System Technical Journal 1 IEEE Transactions on Information Theory 1 Computing 1 IEEE Transactions on Circuits and Systems 1 IEEE Transactions on Communications 1 Journal of the American Statistical Association 1 Journal of Combinatorial Theory. Series A 1 Journal of Graph Theory 1 Operations Research 1 Theoretical Computer Science 1 SIAM Review 1 AT& T Bell Laboratories Technical Journal 1 CISM International Centre for Mechanical Sciences. Courses and Lectures all top 5 Fields 47 Computer science (68-XX) 31 Combinatorics (05-XX) 23 Operations research, mathematical programming (90-XX) 10 Information and communication theory, circuits (94-XX) 3 Numerical analysis (65-XX) 2 Mathematical logic and foundations (03-XX) 2 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 1 General and overarching topics; collections (00-XX) 1 Number theory (11-XX) 1 Group theory and generalizations (20-XX) 1 Functions of a complex variable (30-XX) 1 Geometry (51-XX) 1 Statistics (62-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH Open 67 Publications have been cited 15,600 times in 14,110 Documents Cited by ▼ Year ▼ Computers and intractability. A guide to the theory of NP-completeness. Zbl 0411.68039 Garey, Michael R.; Johnson, David S. 10,929 1979 Some simplified NP-complete graph problems. Zbl 0338.05120 Garey, M. R.; Johnson, D. S.; Stockmeyer, L. 722 1976 The complexity of flow shop and jobshop scheduling. Zbl 0396.90041 Garey, M. R.; Johnson, D. S.; Sethi, Ravi 414 1976 The rectilinear Steiner tree problem is NP-complete. Zbl 0396.05009 Garey, M. R.; Johnson, D. S. 278 1977 “Strong” NP-completeness results: Motivation, examples, and implications. Zbl 0379.68035 Garey, M. R.; Johnson, D. S. 244 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. 210 1975 The planar Hamiltonian circuit problem is NP-complete. Zbl 0346.05110 Garey, M. R.; Johnson, D. S.; Tarjan, R. Endre 190 1976 Crossing number is NP-complete. Zbl 0536.05016 Garey, M. R.; Johnson, D. S. 186 1983 An application of bin-packing to multiprocessor scheduling. Zbl 0374.68032 Coffman, E. G. jun.; Garey, M. R.; Johnson, D. S. 135 1978 The complexity of computing Steiner minimal trees. Zbl 0399.05023 Garey, M. R.; Graham, R. L.; Johnson, D. S. 131 1977 The complexity of searching a graph. Zbl 0637.68081 Megiddo, N.; Hakimi, S. L.; Garey, M. R.; Johnson, D. S.; Papadimitriou, C. H. 130 1988 Approximation algorithms for bin-packing - an updated survey. Zbl 0558.68062 Coffman, E. G. jun.; Garey, M. R.; Johnson, D. S. 126 1984 One-processor scheduling with symmetric earliness and tardiness penalties. Zbl 0671.90033 Garey, Michael R.; Tarjan, Robert E.; Wilfong, Gordon T. 120 1988 The transitive reduction of a directed graph. Zbl 0247.05128 Aho, A. V.; Garey, M. R.; Ullman, J. D. 119 1972 The complexity of coloring circular arcs and chords. Zbl 0499.05058 Garey, M. R.; Johnson, D. S.; Miller, G. L.; Papadimitriou, C. H. 118 1980 Complexity results for bandwidth minimization. Zbl 0385.05048 Garey, M. R.; Graham, R. L.; Johnson, D. S.; Knuth, D. E. 116 1978 Two-processor scheduling with start-times and deadlines. Zbl 0369.90053 Garey, M. R.; Johnson, D. S. 114 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. 114 1980 Complexity results for multiprocessor scheduling under resource constraints. Zbl 0365.90076 Garey, M. R.; Johnson, D. S. 100 1975 Resource constrained scheduling as generalized bin packing. Zbl 0384.90053 Garey, M. R.; Graham, R. L.; Johnson, D. S.; Yao, Andrew Chi-Chih 76 1976 The complexity of near-optimal graph coloring. Zbl 0322.05111 Garey, M. R.; Johnson, D. S. 73 1976 Some NP-complete geometric problems. Zbl 0377.68036 Garey, M. R.; Graham, R. L.; Johnson, D. S. 70 1976 Triangulating a simple polygon. Zbl 0384.68040 Garey, Michael R.; Johnson, David S.; Preparata, Franco P.; Tarjan, Robert E. 60 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. 59 1976 Bounds for multiprocessor scheduling with resource constraints. Zbl 0333.68041 Garey, M. R.; Graham, R. L. 57 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 Diameter bounds for altered graphs. Zbl 0562.05030 Chung, F. R. K.; Garey, M. R. 39 1984 Scheduling file transfers. Zbl 0604.68039 Coffman, E. G. jun.; Garey, M. R.; Johnson, D. S.; Lapaugh, A. S. 39 1985 Scheduling tasks with nonuniform deadlines on two processors. Zbl 0338.68048 Garey, M. R.; Johnson, D. S. 34 1976 Dynamic bin packing. Zbl 0512.68050 Coffman, E. G. jun.; Garey, M. R.; Johnson, D. S. 32 1983 Strongly connected orientations of mixed multigraphs. Zbl 0645.90097 Chung, Fan R. K.; Garey, Michael R.; Tarjan, Robert E. 31 1985 An application of graph coloring to printed circuit testing. Zbl 0342.94021 Garey, Michael R.; Johnson, David Stifler; So, Hing C. 30 1976 Bin packing with divisible item sizes. Zbl 0641.68097 Coffman, E. G. jun.; Garey, M. R.; Johson, D. S. 30 1987 Worst-case analysis of memory allocation algorithms. Zbl 0357.68027 Garey, M. R.; Graham, R. L.; Ullman, J. D. 29 1972 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 Optimal binary identification procedures. Zbl 0229.68037 Garey, M. R. 29 1972 Computers and intractability. Transl. from the English by E. V. Levner and M. A. Frumkin. (Вычислителъные машины и труднорешаемые задачи.) Zbl 0522.68040 Garey, Michael R.; Johnson, David S. 28 1982 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. 20 1975 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. 19 1984 Performance guarantees for scheduling algorithms. Zbl 0371.90068 Garey, M. R.; Graham, R. L.; Johnson, D. S. 19 1978 Optimal task sequencing with precedence constraints. Zbl 0253.90057 Garey, M. R. 18 1973 Rectilinear Steiner trees: Efficient special-case algorithms. Zbl 0351.05102 Aho, A. V.; Garey, M. R.; Hwang, F. K. 18 1977 Optimal binary search trees with restricted maximal depth. Zbl 0288.68058 Garey, M. R. 13 1974 Approximation algorithms for combinatorial problems: An annotated bibliography. Zbl 0382.05001 Garey, M. R.; Johnson, D. S. 13 1976 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 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 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. 10 2000 Minimizing expected makespans on uniform processor systems. Zbl 0617.90044 Coffman, E. G. jun.; Flatto, L.; Garey, M. R.; Weber, R. R. 9 1987 Performance bounds on the splitting algorithm for binary testing. Zbl 0276.68023 Garey, M. R.; Graham, R. L. 7 1974 Analysis and design of algorithms in combinatorial optimization. (School held in Udine in September 1979). Zbl 0484.68028 6 1981 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 Efficient generation of optimal prefix code: Equiprobable words using unequal cost letters. Zbl 0301.68058 Perl, Y.; Garey, M. R.; Even, S. 4 1975 Simple binary identification problems. Zbl 0234.94035 Garey, M. R. 4 1972 A linear-time algorithm for finding all feedback vertices. Zbl 0389.05038 Garey, Michael R.; Tarjan, Robert E. 3 1978 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 Isolating a single defective using group testing. Zbl 0281.62063 Garey, M. R.; Hwang, F. K. 3 1974 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. 2 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. 10 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. 130 1988 One-processor scheduling with symmetric earliness and tardiness penalties. Zbl 0671.90033 Garey, Michael R.; Tarjan, Robert E.; Wilfong, Gordon T. 120 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. 30 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. 39 1985 Strongly connected orientations of mixed multigraphs. Zbl 0645.90097 Chung, Fan R. K.; Garey, Michael R.; Tarjan, Robert E. 31 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. 126 1984 Diameter bounds for altered graphs. Zbl 0562.05030 Chung, F. R. K.; Garey, M. R. 39 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. 19 1984 Crossing number is NP-complete. Zbl 0536.05016 Garey, M. R.; Johnson, D. S. 186 1983 Dynamic bin packing. Zbl 0512.68050 Coffman, E. G. jun.; Garey, M. R.; Johnson, D. S. 32 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. 28 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 Analysis and design of algorithms in combinatorial optimization. (School held in Udine in September 1979). Zbl 0484.68028 6 1981 The complexity of coloring circular arcs and chords. Zbl 0499.05058 Garey, M. R.; Johnson, D. S.; Miller, G. L.; Papadimitriou, C. H. 118 1980 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. 114 1980 Computers and intractability. A guide to the theory of NP-completeness. Zbl 0411.68039 Garey, Michael R.; Johnson, David S. 10,929 1979 “Strong” NP-completeness results: Motivation, examples, and implications. Zbl 0379.68035 Garey, M. R.; Johnson, D. S. 244 1978 An application of bin-packing to multiprocessor scheduling. Zbl 0374.68032 Coffman, E. G. jun.; Garey, M. R.; Johnson, D. S. 135 1978 Complexity results for bandwidth minimization. Zbl 0385.05048 Garey, M. R.; Graham, R. L.; Johnson, D. S.; Knuth, D. E. 116 1978 Triangulating a simple polygon. Zbl 0384.68040 Garey, Michael R.; Johnson, David S.; Preparata, Franco P.; Tarjan, Robert E. 60 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. 2 1978 The rectilinear Steiner tree problem is NP-complete. Zbl 0396.05009 Garey, M. R.; Johnson, D. S. 278 1977 The complexity of computing Steiner minimal trees. Zbl 0399.05023 Garey, M. R.; Graham, R. L.; Johnson, D. S. 131 1977 Two-processor scheduling with start-times and deadlines. Zbl 0369.90053 Garey, M. R.; Johnson, D. S. 114 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. 722 1976 The complexity of flow shop and jobshop scheduling. Zbl 0396.90041 Garey, M. R.; Johnson, D. S.; Sethi, Ravi 414 1976 The planar Hamiltonian circuit problem is NP-complete. Zbl 0346.05110 Garey, M. R.; Johnson, D. S.; Tarjan, R. Endre 190 1976 Resource constrained scheduling as generalized bin packing. Zbl 0384.90053 Garey, M. R.; Graham, R. L.; Johnson, D. S.; Yao, Andrew Chi-Chih 76 1976 The complexity of near-optimal graph coloring. Zbl 0322.05111 Garey, M. R.; Johnson, D. S. 73 1976 Some NP-complete geometric problems. Zbl 0377.68036 Garey, M. R.; Graham, R. L.; Johnson, D. S. 70 1976 On the distance matrix of a tree. Zbl 0328.05103 Edelberg, M.; Garey, M. R.; Graham, R. L. 59 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. 30 1976 Approximation algorithms for combinatorial problems: An annotated bibliography. Zbl 0382.05001 Garey, M. R.; Johnson, D. S. 13 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. 210 1975 Complexity results for multiprocessor scheduling under resource constraints. Zbl 0365.90076 Garey, M. R.; Johnson, D. S. 100 1975 Bounds for multiprocessor scheduling with resource constraints. Zbl 0333.68041 Garey, M. R.; Graham, R. L. 57 1975 On cubical graphs. Zbl 0301.05104 Garey, M. R.; Graham, R. L. 20 1975 Efficient generation of optimal prefix code: Equiprobable words using unequal cost letters. Zbl 0301.68058 Perl, Y.; Garey, M. R.; Even, S. 4 1975 Optimal binary search trees with restricted maximal depth. Zbl 0288.68058 Garey, M. R. 13 1974 Performance bounds on the splitting algorithm for binary testing. Zbl 0276.68023 Garey, M. R.; Graham, R. L. 7 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. 18 1973 The transitive reduction of a directed graph. Zbl 0247.05128 Aho, A. V.; Garey, M. R.; Ullman, J. D. 119 1972 Worst-case analysis of memory allocation algorithms. Zbl 0357.68027 Garey, M. R.; Graham, R. L.; Ullman, J. D. 29 1972 Optimal binary identification procedures. Zbl 0229.68037 Garey, M. R. 29 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 cited Publications top 5 cited Publications all top 5 Cited by 16,142 Authors 128 Woeginger, Gerhard 76 Golovach, Petr A. 73 Cheng, Tai-Chiu Edwin 71 Paulusma, Daniël 62 Yuan, Jinjiang 60 Epstein, Leah 60 Pardalos, Panos M. 59 Jansen, Klaus 55 Bodlaender, Hans L. 55 Lin, Guohui 54 Niedermeier, Rolf 53 Fomin, Fedor V. 53 Monnot, Jérôme 49 Boysen, Nils 48 Kovalëv, Mikhail Yakovlevich 43 Chen, Jian-er 43 Paschos, Vangelis Th. 43 Thilikos, Dimitrios M. 42 Leung, Joseph Y.-T. 41 Błażewicz, Jacek 41 Saurabh, Saket 40 Kratsch, Dieter 38 de Werra, Dominique 38 Ito, Takehiro 37 Tuza, Zsolt 36 Dósa, György 36 Otachi, Yota 35 Fellows, Michael Ralph 34 Ono, Hirotaka 34 Rothe, Jörg-Matthias 34 Yang, Boting 34 Zhang, Guochuan 33 Ibaraki, Toshihide 32 Wang, Jianxin 31 Szwarcfiter, Jayme Luiz 30 Brandstädt, Andreas 30 de Figueiredo, Celina M. Herrera 30 Fernau, Henning 30 Heggernes, Pinar 30 Krumke, Sven Oliver 30 Levin, Asaf 30 Papadimitriou, Christos Harilaos 29 Hertz, Alain 29 Sau, Ignasi 29 Zehavi, Meirav 28 Prokopyev, Oleg Alexan 28 Rautenbach, Dieter 28 Spieksma, Frits C. R. 27 Du, Ding-Zhu 27 Lin, Bertrand Miao-Tsong 27 Marathe, Madhav V. 27 Pesch, Erwin 26 Broersma, Hajo J. 26 Chen, Yong 26 Demaine, Erik D. 26 Demange, Marc 26 Dourado, Mitre Costa 26 Escoffier, Bruno 26 Kel’manov, Aleksandr Vasil’evich 26 Li, Jianping 26 Nagamochi, Hiroshi 26 Pyatkin, Artëm Valer’evich 26 Ravi, S. S. 25 Briskorn, Dirk 25 Hell, Pavol 25 Lee, Chung-Yee 25 Makino, Kazuhisa 25 Miyano, Eiji 25 Ng, C. T. Daniel 25 van ’t Hof, Pim 24 Boros, Endre 24 Gupta, Jatinder N. D. 24 Kubiak, Wiesław X. 24 Lingas, Andrzej 24 Miyazawa, Flavio Keidi 24 Picouleau, Christophe 24 Serna Iglesias, Maria José 24 Uehara, Ryuhei 24 Yannakakis, Mihalis 23 Giroudeau, Rodolphe 23 Hansen, Pierre 23 Hedetniemi, Stephen Travis 23 Kellerer, Johann 23 Lokshtanov, Daniel 23 Rajasingh, Indra 23 Wakabayashi, Yoshiko 23 Yi, Eunjeong 22 Bazgan, Cristina 22 Han, Xin 22 Hao, Jin-Kao 22 Kratochvíl, Jan 22 Lu, Lingfa 22 Panda, Bhawani Sankar 22 Shachnai, Hadas 22 Smith, J. Cole 22 Sriskandarajah, Chelliah 22 Zhang, An 21 Choi, Byung-Cheon 21 Dell’Olmo, Paolo 21 Grigorev, Aleksandr ...and 16,042 more Authors all top 5 Cited in 602 Serials 1,163 Theoretical Computer Science 1,147 Discrete Applied Mathematics 1,059 European Journal of Operational Research 581 Computers & Operations Research 531 Information Processing Letters 415 Algorithmica 356 Discrete Mathematics 307 Journal of Combinatorial Optimization 285 Operations Research Letters 276 Journal of Computer and System Sciences 244 Annals of Operations Research 239 Networks 234 Journal of Scheduling 211 Artificial Intelligence 152 Mathematical Programming. Series A. Series B 124 Discrete Optimization 117 Information and Computation 106 Journal of Discrete Algorithms 102 Optimization Letters 98 Theory of Computing Systems 97 Information Sciences 96 Computational Geometry 83 Journal of Global Optimization 82 Discrete Mathematics, Algorithms and Applications 79 International Transactions in Operational Research 72 Naval Research Logistics 72 International Journal of Foundations of Computer Science 68 SIAM Journal on Discrete Mathematics 67 Annals of Mathematics and Artificial Intelligence 65 Applied Mathematics and Computation 65 Journal of Graph Theory 65 RAIRO. Operations Research 64 Graphs and Combinatorics 61 Acta Informatica 60 Computers & Mathematics with Applications 60 Journal of Combinatorial Theory. Series B 60 Discrete & Computational Geometry 60 Linear Algebra and its Applications 57 International Journal of Computer Mathematics 54 European Journal of Combinatorics 54 SIAM Journal on Algebraic and Discrete Methods 49 International Journal of Production Research 47 Computational Optimization and Applications 44 Diskretnyĭ Analiz i Issledovanie Operatsiĭ 43 Journal of Heuristics 42 Mathematical and Computer Modelling 41 Applied Mathematical Modelling 39 Computing 38 OR Spectrum 36 Asia-Pacific Journal of Operational Research 36 INFORMS Journal on Computing 35 4OR 34 Discussiones Mathematicae. Graph Theory 33 Mathematical Problems in Engineering 32 Journal of Optimization Theory and Applications 31 Journal of Parallel and Distributed Computing 31 International Journal of Computational Geometry & Applications 30 Natural Computing 29 Journal of Complexity 29 Algorithms 28 Journal of Symbolic Computation 27 Automatica 26 Applied Mathematics Letters 26 Journal of Graph Algorithms and Applications 25 Acta Mathematicae Applicatae Sinica. English Series 25 International Journal of Approximate Reasoning 25 Automation and Remote Control 25 The Electronic Journal of Combinatorics 25 Constraints 24 Mathematical Social Sciences 24 Mathematical Methods of Operations Research 23 SIAM Journal on Computing 23 AKCE International Journal of Graphs and Combinatorics 22 Combinatorica 22 Annals of Pure and Applied Logic 22 Journal of Computer and Systems Sciences International 21 Mathematical Programming 21 CEJOR. Central European Journal of Operations Research 20 Fuzzy Sets and Systems 20 Journal of Combinatorial Theory. Series A 19 Operations Research 19 Computational Complexity 19 Journal of Mathematical Sciences (New York) 18 Advances in Applied Mathematics 18 Journal of Information & Optimization Sciences 18 Real-Time Systems 18 Cybernetics and Systems Analysis 18 Discrete Mathematics and Theoretical Computer Science. DMTCS 18 JMMA. Journal of Mathematical Modelling and Algorithms 18 Computer Science Review 17 BIT 17 Mathematical Systems Theory 17 Order 17 Optimization 17 Games and Economic Behavior 16 Journal of Mathematical Psychology 16 Machine Learning 16 Random Structures & Algorithms 16 Top 16 Optimization Methods & Software ...and 502 more Serials all top 5 Cited in 54 Fields 7,492 Computer science (68-XX) 6,205 Operations research, mathematical programming (90-XX) 4,479 Combinatorics (05-XX) 737 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 400 Numerical analysis (65-XX) 333 Mathematical logic and foundations (03-XX) 327 Information and communication theory, circuits (94-XX) 290 Biology and other natural sciences (92-XX) 219 Convex and discrete geometry (52-XX) 162 Statistics (62-XX) 114 Systems theory; control (93-XX) 107 Order, lattices, ordered algebraic structures (06-XX) 106 Linear and multilinear algebra; matrix theory (15-XX) 99 Number theory (11-XX) 91 Quantum theory (81-XX) 89 Probability theory and stochastic processes (60-XX) 71 Group theory and generalizations (20-XX) 50 Calculus of variations and optimal control; optimization (49-XX) 47 Statistical mechanics, structure of matter (82-XX) 36 Geometry (51-XX) 33 Dynamical systems and ergodic theory (37-XX) 31 General algebraic systems (08-XX) 30 Commutative algebra (13-XX) 26 Algebraic geometry (14-XX) 22 Manifolds and cell complexes (57-XX) 20 General and overarching topics; collections (00-XX) 19 Field theory and polynomials (12-XX) 12 History and biography (01-XX) 12 Associative rings and algebras (16-XX) 11 Mechanics of deformable solids (74-XX) 9 General topology (54-XX) 9 Mechanics of particles and systems (70-XX) 8 Measure and integration (28-XX) 8 Functions of a complex variable (30-XX) 7 Approximations and expansions (41-XX) 6 Ordinary differential equations (34-XX) 6 Operator theory (47-XX) 5 Category theory; homological algebra (18-XX) 5 Partial differential equations (35-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) 3 Mathematics education (97-XX) 2 Relativity and gravitational theory (83-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 Global analysis, analysis on manifolds (58-XX) 1 Optics, electromagnetic theory (78-XX) Citations by Year Wikidata Timeline The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.