World's Best Scientists 2026 revealed!
Gerhard J. Woeginger

Gerhard J. Woeginger

Award Badge
Computer Science
Germany
2025

D-Index & Metrics

Computer Science

D-Index
73
Citations
17297
World Ranking
1621
National Ranking
64

Mathematics

D-Index
73
Citations
17375
World Ranking
234
National Ranking
12

Research.com Recognitions

  • 2025 - Research.com Computer Science in Germany Leader Award
  • 2023 - Research.com Computer Science in Germany Leader Award
  • 2022 - Research.com Computer Science in Germany Leader Award
  • 2014 - Member of Academia Europaea

Overview

Gerhard J. Woeginger was affiliated with RWTH Aachen University in Germany. The main fields of Woeginger's research were Computer Science and Engineering, with notable contributions to the subfields of Industrial and Manufacturing Engineering, Computational Theory and Mathematics, Computer Networks and Communications, Electrical and Electronic Engineering, and Management Science and Operations Research.

The research topics Woeginger pursued included Optimization and Search Problems, Advanced Graph Theory Research, Complexity and Algorithms in Graphs, Vehicle Routing Optimization Methods, Optimization and Packing Problems, Facility Location and Emergency Management, and graph theory and CDMA systems.

Woeginger's recent papers covered a range of topics: "The trouble with the second quantifier" (2021, 4OR), "Fine-grained Complexity Analysis of Two Classic TSP Variants" (2020, ACM Transactions on Algorithms), "Timeline-based planning over dense temporal domains" (2020, Theoretical Computer Science), "A faster algorithm for the continuous bilevel knapsack problem" (2020, Operations Research Letters), and "An Investigation of the Recoverable Robust Assignment Problem" (2020, Leibniz-Zentrum für Informatik [Schloss Dagstuhl]).

Frequent collaborators in Woeginger's work included Stefan Lendl, Eranda Çela, Bettina Klinz, Lasse Wulf, and Vladimir G. Deı̌neko.

Woeginger published frequently in venues such as Operations Research Letters, arXiv (Cornell University), 4OR, Mathematical Programming, and Discrete Applied Mathematics.

Among book publications, Woeginger contributed to titles released by Springer Science+Business Media, including "Variable Neighborhood Search" (2020), "Information Security and Cryptology - ICISC 2019" (2020), "Cross-Cultural Design. Applications in Cultural Heritage, Tourism, Autonomous Vehicles, and Intelligent Agents" (2021), "Cross-Cultural Design. Applications in Arts, Learning, Well-being, and Social Development" (2021), and "Information Security and Cryptology" (2021).

Woeginger was recognized as a Member of Academia Europaea since 2014.

Best Publications

  • Exact algorithms for NP-hard problems: a survey

    Gerhard J. Woeginger

  • Online algorithms : The state of the art

    Amos Fiat;Gerhard J. Woeginger

  • A Review of Machine Scheduling: Complexity, Algorithms and Approximability

    Bo Chen;Chris N. Potts;Gerhard J. Woeginger

  • Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine

    Hans Kellerer;T. Tautenhahn;G. Woeginger

  • When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)

    Gerhard J. Woeginger

  • Non-Approximability Results for Scheduling Problems with Minsum Criteria

    Han Hoogeveen;Petra Schuurman;Gerhard J. Woeginger

  • Approximation schemes for scheduling on parallel machines

    Noga Alon;Yossi Azar;Gerhard J. Woeginger;Tal Yadid

  • On-line Packing and Covering Problems

    János Csirik;Gerhard J. Woeginger

  • A polynomial-time approximation scheme for maximizing the minimum machine completion time

    Gerhard J. Woeginger

  • Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey

    Rainer E. Burkard;Vladimir G. Deineko;René van Dal;Jack A. A. van

  • Uncapacitated single and multiple allocation p-hub center problems

    Andreas T. Ernst;Horst Hamacher;Houyuan Jiang;Mohan Krishnamoorthy

  • Complexity of Coloring Graphs without Forbidden Induced Subgraphs

    Daniel Král;Jan Kratochvíl;Zsolt Tuza;Gerhard J. Woeginger

  • Almost tight bounds for e-nets

    János Komlós;János Pach;Gerhard Woeginger

  • An axiomatic characterization of the Hirsch-index

    GJ Gerhard Woeginger

  • Exact (exponential) algorithms for the dominating set problem

    Fedor V. Fomin;Dieter Kratsch;Gerhard J. Woeginger

  • Polynomial time approximation algorithms for machine scheduling: ten open problems

    P Petra Schuurman;GJ Gerhard Woeginger

  • Preemptive scheduling with rejection

    Han Hoogeveen;Martin Skutella;Gerhard J. Woeginger

  • There is no asymptotic PTAS for two-dimensional vector packing

    Gerhard J. Woeginger

  • On-line scheduling of jobs with fixed start and end times

    Gerhard J. Woeginger

  • Getting the best response for your erg

    Kirk Pruhs;Patchrawat Uthaisombut;Gerhard Woeginger

  • Developments from a June 1996 seminar on Online algorithms: the state of the art

    Amos Fiat;Gerhard J. Woeginger

  • Preface: graph colorings

    Jaroslav Nešetřil;Gerhard Woeginger

  • Preface to Special issue dedicated to ISCO 2012

    AR Mahjoub;G Rinaldi;GJ Gerhard Woeginger

Frequent Co-Authors

Frits C. R. Spieksma
Frits C. R. Spieksma Eindhoven University of Technology
Fedor V. Fomin
Fedor V. Fomin University of Bergen
Rolf Niedermeier
Rolf Niedermeier Technical University of Berlin
Rainer E. Burkard
Rainer E. Burkard Graz University of Technology
Hans Kellerer
Hans Kellerer University of Graz
Mark de Berg
Mark de Berg Eindhoven University of Technology
Leah Epstein
Leah Epstein University of Haifa
János Csirik
János Csirik University of Szeged
Günter Rote
Günter Rote Freie Universität Berlin
Kirk Pruhs
Kirk Pruhs University of Pittsburgh

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students interested in Mathematics and its practical applications, exploring related online degrees can open diverse career pathways. One popular option is pursuing an MBA alongside your math expertise. If you’re considering a flexible transition, programs that can you transfer MBA programs offer the chance to build on previous coursework and accelerate your studies.

Data-driven fields are booming, making programs like the best masters in data analytics programs highly relevant. These programs combine advanced math skills with real-world data analysis, opening doors to roles in data science, finance, and technology.

For those balancing busy schedules or new to business studies, considering the easiest MBA options can provide accessible pathways without compromising career growth. Many of these programs offer flexible pacing and practical knowledge suitable for professionals from a math background.

Equally, the easiest MBA programs available online blend convenience with quality education, allowing students worldwide to advance their qualifications while continuing to work or study mathematics.

Best Scientists Citing Gerhard J. Woeginger