| Online algorithms: The state of the art A Fiat, GJ Woeginger LNCS, Springer-Verlag 1442, 1998 | 2206* | 1998 |
| Exact algorithms for NP-hard problems: A survey GJ Woeginger Combinatorial optimization — Eureka, you shrink!, 185-207, 2003 | 964 | 2003 |
| A compendium of NP optimization problems P Crescenzi, V Kann, MM Halldórsson, M Karpinski, GJ Woeginger URL http://www.nada.kth.se/~viggo/problemlist/compendium.html, 2000 | 769* | 2000 |
| Computing and Software Science B Steffen, G Woeginger Springer Nature, LNCS 10000, 2019 | 510* | 2019 |
| A review of machine scheduling: Complexity, algorithms and approximability B Chen, CN Potts, GJ Woeginger Handbook of Combinatorial Optimization 3, 21-169, 1998 | 500* | 1998 |
| When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)? GJ Woeginger INFORMS Journal on Computing 12 (1), 57-74, 2000 | 271 | 2000 |
| Well-solvable special cases of the traveling salesman problem: a survey RE Burkard, VG Deineko, R van Dal, JAA van der Veen, GJ Woeginger SIAM Review 40 (3), 496-546, 1998 | 270* | 1998 |
| Approximation schemes for scheduling on parallel machines N Alon, Y Azar, GJ Woeginger, T Yadid Journal of Scheduling 1 (1), 55-66, 1998 | 244 | 1998 |
| On-line packing and covering problems J Csirik, GJ Woeginger Online algorithms: the state of the art, 147-177, 2005 | 236 | 2005 |
| A polynomial-time approximation scheme for maximizing the minimum machine completion time GJ Woeginger Operations Research Letters 20 (4), 149-154, 1997 | 224 | 1997 |
| Uncapacitated single and multiple allocation p-hub center problems AT Ernst, H Hamacher, H Jiang, M Krishnamoorthy, G Woeginger Computers & Operations Research 36 (7), 2230-2241, 2009 | 221 | 2009 |
| Complexity of coloring graphs without forbidden induced subgraphs D Král’, J Kratochvíl, Z Tuza, GJ Woeginger Graph-Theoretic Concepts in Computer Science: 27th InternationalWorkshop, WG …, 2001 | 213* | 2001 |
| Almost tight bounds for ɛ-Nets J Komlós, J Pach, G Woeginger Discrete & Computational Geometry 7 (1), 163-173, 1992 | 188 | 1992 |
| An axiomatic characterization of the Hirsch-index GJ Woeginger Mathematical Social Sciences 56 (2), 224-232, 2008 | 183 | 2008 |
| Polynomial time approximation algorithms for machine scheduling: Ten open problems P Schuurman, GJ Woeginger Journal of Scheduling 2 (5), 203-213, 1999 | 179 | 1999 |
| Approximability and nonapproximability results for minimizing total flow time on a single machine H Kellerer, T Tautenhahn, GJ Woeginger Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing …, 1996 | 179 | 1996 |
| Getting the best response for your erg K Pruhs, P Uthaisombut, G Woeginger ACM Transactions on Algorithms (TALG) 4 (3), 1-17, 2008 | 172* | 2008 |
| Exact (exponential) algorithms for the dominating set problem FV Fomin, D Kratsch, GJ Woeginger Graph-Theoretic Concepts in Computer Science (WG) 3353, 245-256, 2004 | 172 | 2004 |
| Dagstuhl seminar June 1996 on online algorithms A Fiat, G Woeginger Dagstuhl Seminar Report, 1996 | 168* | 1996 |
| Proceedings of 43rd Workshop on Graph-Theoretic Concepts in Computer Science HL Bodlaender, GJ Woeginger Springer LNCS 10520, 2017 | 163* | 2017 |
Rainer E. BurkardProfessor emer. of Mathematics, TU Grazopt.math.tu-graz.ac.at의 이메일 확인됨
