H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 64 Citations 12,616 335 World Ranking 1211 National Ranking 41
Mathematics H-index 61 Citations 11,283 316 World Ranking 231 National Ranking 13

Research.com Recognitions

Awards & Achievements

2014 - Member of Academia Europaea

Overview

What is he best known for?

The fields of study he is best known for:

  • Algorithm
  • Combinatorics
  • Statistics

Combinatorics, Scheduling, Mathematical optimization, Approximation algorithm and Discrete mathematics are his primary areas of study. His biological study spans a wide range of topics, including Algorithm, Combinatorial optimization and Worst case ratio. His studies deal with areas such as Upper and lower bounds, Competitive analysis, Online algorithm and Randomized algorithm as well as Scheduling.

His work carried out in the field of Mathematical optimization brings together such families of science as Dynamic priority scheduling, Open-shop scheduling, Round-robin scheduling and Fair-share scheduling. His Approximation algorithm study combines topics in areas such as Assignment problem and Bounded function. His Discrete mathematics research is multidisciplinary, relying on both Tournament and Transitive relation.

His most cited work include:

  • Exact algorithms for NP-hard problems: a survey (490 citations)
  • Online algorithms : The state of the art (318 citations)
  • A Review of Machine Scheduling: Complexity, Algorithms and Approximability (244 citations)

What are the main themes of his work throughout his whole career to date?

Gerhard J. Woeginger mainly investigates Combinatorics, Discrete mathematics, Time complexity, Mathematical optimization and Computational complexity theory. His research integrates issues of Travelling salesman problem and Combinatorial optimization in his study of Combinatorics. Many of his studies on Discrete mathematics apply to Quadratic assignment problem as well.

His studies in Time complexity integrate themes in fields like Distance matrix, Bounded function, Set and Special case. His Mathematical optimization research incorporates elements of Scheduling, Flow shop scheduling and Job shop scheduling. His Computational complexity theory research is multidisciplinary, relying on both Assignment problem, Optimization problem and Theoretical computer science.

He most often published in these fields:

  • Combinatorics (52.19%)
  • Discrete mathematics (27.67%)
  • Time complexity (26.62%)

What were the highlights of his more recent work (between 2012-2021)?

  • Combinatorics (52.19%)
  • Computational complexity theory (21.37%)
  • Discrete mathematics (27.67%)

In recent papers he was focusing on the following fields of study:

The scientist’s investigation covers issues in Combinatorics, Computational complexity theory, Discrete mathematics, Time complexity and Mathematical optimization. His work in Combinatorics tackles topics such as Matrix which are related to areas like Dynamic programming. His Computational complexity theory study integrates concerns from other disciplines, such as Robust optimization, Assignment problem, Mathematical economics, Set and Optimization problem.

The Discrete mathematics study combines topics in areas such as Quadratic assignment problem, Preference, Special case and Travelling salesman problem. His studies deal with areas such as Monotone polygon, Quadratic equation, Matching, Knapsack problem and Decision problem as well as Time complexity. His study in Mathematical optimization is interdisciplinary in nature, drawing from both Element, Job shop scheduling and Fair-share scheduling.

Between 2012 and 2021, his most popular works were:

  • A characterization of the single-crossing domain (56 citations)
  • The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases (42 citations)
  • Parameterized algorithmics for computational social choice: Nine research challenges (42 citations)

In his most recent research, the most cited papers focused on:

  • Algorithm
  • Combinatorics
  • Statistics

His primary areas of study are Combinatorics, Computational complexity theory, Discrete mathematics, Time complexity and Parameterized complexity. His Combinatorics study frequently draws connections to adjacent fields such as Point. His work deals with themes such as Mathematical economics, Combinatorial optimization and Computational problem, which intersect with Computational complexity theory.

He has included themes like Assignment problem, Quadratic assignment problem, Preference and Special case in his Discrete mathematics study. As a member of one scientific family, Gerhard J. Woeginger mostly works in the field of Parameterized complexity, focusing on Scheduling and, on occasion, Distributed computing. His biological study spans a wide range of topics, including Simple and Job shop scheduling.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Top Publications

Exact algorithms for NP-hard problems: a survey

Gerhard J. Woeginger.
Combinatorial optimization - Eureka, you shrink! (2003)

851 Citations

Online algorithms : The state of the art

Amos Fiat;Gerhard J. Woeginger.
Lecture Notes in Computer Science (1998)

486 Citations

A Review of Machine Scheduling: Complexity, Algorithms and Approximability

Bo Chen;Chris N. Potts;Gerhard J. Woeginger.
Handbook of combinatorial optimization, volume 3 (1998)

439 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 (2000)

252 Citations

On-line Packing and Covering Problems

János Csirik;Gerhard J. Woeginger.
Lecture Notes in Computer Science (1998)

214 Citations

Approximation schemes for scheduling on parallel machines

Noga Alon;Yossi Azar;Gerhard J. Woeginger;Tal Yadid.
Journal of Scheduling (1998)

206 Citations

Uncapacitated single and multiple allocation p-hub center problems

Andreas T. Ernst;Horst Hamacher;Houyuan Jiang;Mohan Krishnamoorthy.
Computers & Operations Research (2009)

199 Citations

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

Rainer E. Burkard;Vladimir G. Deineko;René van Dal;Jack A. A. van.
Siam Review (1998)

196 Citations

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

Gerhard J. Woeginger.
Operations Research Letters (1997)

181 Citations

An axiomatic characterization of the Hirsch-index

GJ Gerhard Woeginger.
Mathematical Social Sciences (2008)

174 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

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

Contact us

Top Scientists Citing Gerhard J. Woeginger

Leah Epstein

Leah Epstein

University of Haifa

Publications: 152

Klaus Jansen

Klaus Jansen

Kiel University

Publications: 65

Rolf Niedermeier

Rolf Niedermeier

Technical University of Berlin

Publications: 56

Fedor V. Fomin

Fedor V. Fomin

University of Bergen

Publications: 55

Nikhil Bansal

Nikhil Bansal

Eindhoven University of Technology

Publications: 41

Yossi Azar

Yossi Azar

Tel Aviv University

Publications: 41

Martin Skutella

Martin Skutella

Technical University of Berlin

Publications: 40

Dieter Kratsch

Dieter Kratsch

University of Lorraine

Publications: 37

Maxim Sviridenko

Maxim Sviridenko

Yahoo (United Kingdom)

Publications: 37

Kirk Pruhs

Kirk Pruhs

University of Pittsburgh

Publications: 34

Joseph S. B. Mitchell

Joseph S. B. Mitchell

Stony Brook University

Publications: 33

Saket Saurabh

Saket Saurabh

University of Bergen

Publications: 32

Piotr Faliszewski

Piotr Faliszewski

AGH University of Science and Technology

Publications: 32

Toby Walsh

Toby Walsh

Commonwealth Scientific and Industrial Research Organisation

Publications: 31

Michael R. Fellows

Michael R. Fellows

University of Bergen

Publications: 31

Something went wrong. Please try again later.