Gerhard J. Woeginger

Author

Also Known As

Burkard, Rainer E, Chao Ai, G. J. Woeginger, G. Woeginger, G.J Woeginger, G.J. Woeginger, GERHARD J. WOEGINGER, Gerhard J Woeginger, Gerhard J. Woeginger, Gerhard Woeginger

578

Publications

12.9K

Citations

H-Index

188

Concepts

All Affiliations

Graz University of Technology Eindhoven University of Technology University of Twente University of Warwick Technische Universität Berlin

About

Gerhard J. Woeginger is an author at Graz University of Technology specializing in engineering, combinatorial optimization, and mathematical programming.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	52	157	7K
2	Business	17	30	1.1K
3	Education	8	8	181
4	Arts	1	1	111
5	Health Sciences	1	1	15

Gerhard J. Woeginger

213

Publications

9.2K

Citations

H-Index

Page 1

	Year	Citations
When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? Gerhard J. Woeginger INFORMS journal on computing Mathematical ProgrammingNumerical AnalysisEngineeringFollowing FlavorComputational Complexity	2000	230
Approximation schemes for scheduling on parallel machines Noga Alon, Yossi Azar, Gerhard J. Woeginger, Journal of Scheduling	1998	207
A polynomial-time approximation scheme for maximizing the minimum machine completion time Gerhard J. Woeginger Operations Research Letters Mathematical ProgrammingComputational ScienceComputational Complexity TheoryEngineeringApproximate Computing	1997	207
Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey Rainer E. Burkard, Vladimir G. Deı̌neko, René van Dal, SIAM Review Mathematical ProgrammingHeuristic SearchEngineeringOptimization ProblemTraveling Salesman Problem	1998	165
Uncapacitated single and multiple allocation p-hub center problems Andreas Ernst, Horst W. Hamacher, Houyuan Jiang, Computers & Operations Research Mathematical ProgrammingEngineeringOptimization ProblemCombinatorial ProblemDiscrete Mathematics	2008	149
An axiomatic characterization of the Hirsch-index Gerhard J. Woeginger Mathematical Social Sciences Axiomatic CharacterizationIndex SystemSet-theoretic TopologyIndexing Technique	2008	147
Polynomial time approximation algorithms for machine scheduling: ten open problems Petra Schuurman, Gerhard J. Woeginger Journal of Scheduling	1999	141
Proceedings of the 5th Annual European Symposium on Algorithms Rainer E. Burkard, Gerhard J. Woeginger EngineeringAlgorithm DesignAnalysis Of AlgorithmComputational ComplexityComputer Science	1997	132
There is no asymptotic PTAS for two-dimensional vector packing Gerhard J. Woeginger Information Processing Letters Discrete GeometryEngineeringHigher Dimensional ProblemTwo-dimensional Vector PackingMatrix Theory	1997	123
On-line scheduling of jobs with fixed start and end times Gerhard J. Woeginger Theoretical Computer Science Job SchedulerEngineeringScheduling AnalysisScheduling ProblemAutomation	1994	120

Page 1