Gerhard Woeginger

Cited by

	All	Since 2016
Citations	18114	5504
h-index	70	34
i10-index	256	142

1100

550

275

825

199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202145 91 111 195 267 256 294 352 348 468 477 632 721 755 788 874 905 827 870 968 1031 964 955 951 962 956 993 669

Public access

View all

33 articles

2 articles

available

not available

Based on funding mandates

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
Frits SpieksmaTU EindhovenVerified email at tue.nl
Cor HurkensTU EindhovenVerified email at tue.nl
Bo Chen, Ph.D., D.Sc., FAcSSChair of Operational Research & Management Science, University of WarwickVerified email at warwick.ac.uk
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
Leah EpsteinUniversity of HaifaVerified email at math.haifa.ac.il
Robert BredereckHumboldt-Universität zu BerlinVerified email at hu-berlin.de
Amos FiatProfessor of Computer Science, Tel Aviv UniversityVerified email at tau.ac.il
Kirk PruhsProfessor of Computer Science, University of PittsburghVerified email at cs.pitt.edu
Hans KellererUniversity of GrazVerified email at uni-graz.at
Jiehua ChenTU ViennaVerified email at tuwien.ac.at
Gábor GalambosProfessor, University of SzegedVerified email at jgypk.szte.hu
Ulrich PferschyUniversity of GrazVerified email at uni-graz.at
Pierluigi CrescenziProfessor of Computer Science, GSSI, L'Aquila, ItalyVerified email at gssi.it
Jack van der VeenHoogleraar Supply Chain Management, NyenrodeVerified email at nyenrode.nl

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	2059*	1998
Exact algorithms for NP-hard problems: A survey GJ Woeginger Combinatorial optimization — Eureka, you shrink!, 185-207, 2003	837	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	725*	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	244*	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	227	2000
On-line packing and covering problems J Csirik, GJ Woeginger Online Algorithms, 147-177, 1998	218	1998
Approximation schemes for scheduling on parallel machines N Alon, Y Azar, GJ Woeginger, T Yadid Journal of Scheduling 1 (1), 55-66, 1998	209	1998
Computing and Software Science B Steffen, G Woeginger Springer Nature, LNCS 10000, 2019	203*	2019
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	196	2009
Complexity of coloring graphs without forbidden subgraphs D Král, J Kratochvíl, Z Tuza, G Woeginger 27th International Workshop on Graph-Theoretic Concepts in Computer Science …, 2001	186	2001
A polynomial-time approximation scheme for maximizing the minimum machine completion time GJ Woeginger Operations Research Letters 20 (4), 149-154, 1997	182	1997
Almost tight bounds for ɛ-Nets J Komlós, J Pach, G Woeginger Discrete & Computational Geometry 7 (1), 163-173, 1992	173	1992
An axiomatic characterization of the Hirsch-index GJ Woeginger Mathematical Social Sciences 56 (2), 224-232, 2008	172	2008
Getting the best response for your erg K Pruhs, P Uthaisombut, G Woeginger ACM Transactions on Algorithms (TALG) 4 (3), 1-17, 2008	170*	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	170	1999
Polynomial time approximation algorithms for machine scheduling: Ten open problems P Schuurman, GJ Woeginger Journal of Scheduling 2 (5), 203-213, 1999	157	1999
Dagstuhl seminar June 1996 on online algorithms A Fiat, G Woeginger Dagstuhl Seminar Report, 1996	153*	1996
On-line scheduling of jobs with fixed start and end times GJ Woeginger Theoretical Computer Science 130 (1), 5-16, 1994	150	1994
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	149	2004

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

Follow this author

Cited by

Co-authors