Gerhard Woeginger - Google Scholar

Cited by

	All	Since 2015
Citations	17068	5597
h-index	69	36
i10-index	252	148

1100

550

275

825

19941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202047 75 114 186 264 256 299 342 332 448 469 619 723 717 799 864 893 820 872 959 1031 957 981 932 940 955 824

Co-authors

Vladimir Deineko, PhD, DScAssociate Professor (Reader) Warwick Business SchoolVerified email at wbs.ac.uk
Rainer E. BurkardProfessor emer. of Mathematics, TU GrazVerified email at opt.math.tu-graz.ac.at
Jiri SgallComputer Science Institute of Charles UniversityVerified email at iuuk.mff.cuni.cz
Janos CsirikProfessor of Computer Science, University of SzegedVerified email at inf.u-szeged.hu
Yossi AzarTel Aviv UniversityVerified email at tau.ac.il
Frits SpieksmaTU EindhovenVerified email at tue.nl
Cor HurkensTU EindhovenVerified email at tue.nl
Hajo BroersmaFaculty EEMCS, University of Twente, NLVerified email at utwente.nl
Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
Han HoogeveenUniversiteit UtrechtVerified email at uu.nl
Amos FiatProfessor of Computer Science, Tel Aviv UniversityVerified email at tau.ac.il
Leah EpsteinUniversity of HaifaVerified email at math.haifa.ac.il
Robert BredereckHumboldt-Universität zu BerlinVerified email at hu-berlin.de
Bo Chen, Ph.D., D.Sc., FAcSSChair of Operational Research & Management Science, University of WarwickVerified email at warwick.ac.uk
Kirk PruhsProfessor of Computer Science, University of PittsburghVerified email at cs.pitt.edu
Gábor GalambosProfessor, University of SzegedVerified email at jgypk.szte.hu
Hans KellererUniversity of GrazVerified email at uni-graz.at
Ulrich PferschyUniversity of GrazVerified email at uni-graz.at
Pierluigi CrescenziProfessor of Computer Science, GSSI, L'Aquila, ItalyVerified email at gssi.it
Asaf LevinAssociate Professor in Operations Research, The TechnionVerified email at technion.ac.il

Gerhard Woeginger

Professor of Computer Science, RWTH Aachen

Verified email at cs.rwth-aachen.de

Theoretical Computer Science Discrete Mathematics Operations Research


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Online algorithms: The state of the art A Fiat, GJ Woeginger LNCS, Springer-Verlag 1442, 1998	1997*	1998
Exact algorithms for NP-hard problems: A survey GJ Woeginger Combinatorial optimization — Eureka, you shrink!, 185-207, 2003	795	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	712*	2000
A review of machine scheduling: Complexity, algorithms and approximability B Chen, CN Potts, GJ Woeginger Handbook of Combinatorial Optimization 3, 21-169, 1998	443*	1998
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	232*	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	217	2000
On-line packing and covering problems J Csirik, GJ Woeginger Online Algorithms, 147-177, 1998	202	1998
Approximation schemes for scheduling on parallel machines N Alon, Y Azar, GJ Woeginger, T Yadid Journal of Scheduling 1 (1), 55-66, 1998	192	1998
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	182	2009
Complexity of coloring graphs without forbidden induced subgraphs D Král, J Kratochvíl, Z Tuza, GJ Woeginger 27th International Workshop on Graph-Theoretic Concepts in Computer Science …, 2001	171	2001
An axiomatic characterization of the Hirsch-index GJ Woeginger Mathematical Social Sciences 56 (2), 224-232, 2008	169	2008
A polynomial-time approximation scheme for maximizing the minimum machine completion time GJ Woeginger Operations Research Letters 20 (4), 149-154, 1997	169	1997
Almost tight bounds for ɛ-Nets J Komlós, J Pach, G Woeginger Discrete & Computational Geometry 7 (1), 163-173, 1992	169*	1992
Getting the best response for your erg K Pruhs, P Uthaisombut, G Woeginger ACM Transactions on Algorithms (TALG) 4 (3), 1-17, 2008	163*	2008
Approximability and nonapproximability results for minimizing total flow time on a single machine H Kellerer, T Tautenhahn, G Woeginger SIAM Journal on Computing 28 (4), 1155-1166, 1999	158	1999
Polynomial time approximation algorithms for machine scheduling: Ten open problems P Schuurman, GJ Woeginger Journal of Scheduling 2 (5), 203-213, 1999	149	1999
On-line scheduling of jobs with fixed start and end times GJ Woeginger Theoretical Computer Science 130 (1), 5-16, 1994	147	1994
Dagstuhl seminar June 1996 on online algorithms A Fiat, G Woeginger Dagstuhl Seminar Report, 1996	146*	1996
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	144	2004
Non-approximability results for scheduling problems with minsum criteria H Hoogeveen, P Schuurman, GJ Woeginger INFORMS Journal on Computing 13 (2), 157-168, 2001	134	2001

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors