Gerhard J. Woeginger | Academic Influence

Gerhard J. Woeginger's AcademicInfluence.com Rankings

Gerhard J. Woeginger

Mathematics

#2640

World Rank

#4041

Historical Rank

Measure Theory

#820

World Rank

#1087

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Gerhard J. Woeginger's Degrees

PhD Mathematics University of Klagenfurt

Why Is Gerhard J. Woeginger Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Gerhard J. Woeginger was an Austrian mathematician and computer scientist who worked in Germany as a professor at RWTH Aachen University, where he chaired the algorithms and complexity group in the department of computer science.

(See a Problem?)

Gerhard J. Woeginger's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Exact Algorithms for NP-Hard Problems: A Survey (2001) (712)
A Review of Machine Scheduling: Complexity, Algorithms and Approximability (1998) (348)
Online Algorithms (1998) (265)
Developments from a June 1996 seminar on Online algorithms: the state of the art (1998) (253)
When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? (2000) (221)
Complexity of Coloring Graphs without Forbidden Induced Subgraphs (2001) (203)
A polynomial-time approximation scheme for maximizing the minimum machine completion time (1997) (201)
Approximation schemes for scheduling on parallel machines (1998) (190)
Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey (1998) (165)
Graph colorings (2005) (164)
On-line Packing and Covering Problems (1996) (164)
Uncapacitated single and multiple allocation p-hub center problems (2009) (159)
Approximability and nonapproximability results for minimizing total flow time on a single machine (1996) (152)
Automata, Languages and Programming (2003) (150)
An axiomatic characterization of the Hirsch-index (2008) (149)
Polynomial time approximation algorithms for machine scheduling: ten open problems (1999) (141)
Getting the best response for your erg (2004) (135)
Preemptive scheduling with rejection (2000) (133)
On-Line Scheduling of Jobs with Fixed Start and End Times (1994) (131)
Exact (Exponential) Algorithms for the Dominating Set Problem (2004) (130)
Almost tight bounds forɛ-Nets (1992) (126)
Non-Approximability Results for Scheduling Problems with Minsum Criteria (1998) (122)
An On-Line Scheduling Heuristic With Better Worst Case Ratio Than Graham's List Scheduling (1993) (120)
There is no Asymptotic PTAS for Two-Dimensional Vector Packing (1997) (120)
Approximation schemes for scheduling (1997) (110)
Operations Research Letters (2011) (109)
Makespan minimization in open shops: A polynomial time approximation scheme (1998) (107)
The reconstruction of polyominoes from their orthogonal projections (2001) (106)
Semi-online scheduling with decreasing job sizes (2000) (105)
Decomposition of integer matrices and multileaf collimator sequencing (2005) (102)
Paths and cycles in colored graphs (2001) (101)
A study of exponential neighborhoods for the Travelling Salesman Problem and for the Quadratic Assignment Problem (2000) (101)
Approximation Algorithms for Scheduling Malleable Tasks Under Precedence Constraints (2001) (100)
Minimum-link paths among obstacles in the plane (1990) (99)
When does a dynamic programming formulation guarantee the existence of an FPTAS? (1999) (96)
Randomized online scheduling on two uniform machines (2001) (96)
Geometric Clusterings (1991) (95)
Unweighted Coalitional Manipulation under the Borda Rule Is NP-Hard (2011) (93)
Scheduling with Incompatible Jobs (1992) (93)
Drawing graphs in the plane with high resolution (1990) (92)
New lower and upper bounds for on-line scheduling (1994) (90)
Paths, trees and matchings under disjunctive constraints (2011) (87)
The complexity of multiple wordlength assignment (2002) (81)
Minimum‐cost dynamic flows: The series‐parallel case (2004) (81)
Almost tight bounds for $\epsilon$-nets (1992) (80)
Three-dimensional Axial Assignment Problems with Decomposable Cost Coefficients (1996) (79)
Polynomial Graph-Colorings (1989) (79)
Open problems around exact algorithms (2008) (78)
An axiomatic analysis of Egghe's g-index (2008) (78)
The exact LPT-bound for maximizing the minimum completion time (1992) (77)
An optimal algorithm for preemptive on-line scheduling (1994) (75)
On-line scheduling of unit time jobs with rejection: minimizing the total completion time (2002) (74)
All-norm approximation algorithms (2002) (74)
On-line bin packing — A restricted survey (1995) (72)
Group Activity Selection Problem (2012) (71)
A characterization of the single-crossing domain (2013) (70)
Are there any nicely structured preference profiles nearby? (2013) (69)
Banks winners in tournaments are difficult to recognize (2003) (68)
The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases (1996) (68)
On the approximability of average completion time scheduling under precedence constraints (2001) (66)
Finding minimum areak-gons (1992) (66)
Bilevel Knapsack with Interdiction Constraints (2016) (66)
A new characterization of the majority rule (2003) (66)
The complexity of coloring graphs without long induced paths (2001) (65)
On the Equal-Subset-Sum Problem (1992) (64)
A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines (2000) (64)
A Lower Bound for Randomized On-Line Scheduling Algorithms (1994) (63)
On the complexity of cake cutting (2007) (63)
Shelf Algorithms for On-Line Strip Packing (1997) (61)
Space and Time Complexity of Exact Algorithms : Some Open Problems (2004) (60)
Drawing Planar Graphs Using the Canonical Ordering (1996) (60)
Local search for the minimum label spanning tree problem with bounded color classes (2003) (60)
Caching Is Hard—Even in the Fault Model (2012) (58)
Core Stability in Hedonic Coalition Formation (2012) (58)
Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges (2014) (55)
Approximation schemes-a tutorial (2001) (54)
The quadratic 0-1 knapsack problem with series-parallel support (2002) (54)
The geometric maximum traveling salesman problem (2002) (54)
On-line scheduling on a single machine: maximizing the number of early jobs (2000) (53)
Well-solvable special cases of the TSP : a survey (1996) (53)
heuristics for parallel machine scheduling with delivery times (1994) (52)
The Maximum Traveling Salesman Problem Under Polyhedral Norms (1998) (52)
Some Comments on Sequencing with Controllable Processing Times (2002) (52)
Geometric three-dimensional assignment problems☆ (1996) (51)
Space and Time Complexity of Exact Algorithms: Some Open Problems (Invited Talk) (2004) (51)
The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases (2012) (50)
On the nearest neighbor rule for the traveling salesman problem (2004) (49)
Angle-Restricted Tours in the Plane (1997) (48)
Approximation schemes for a class of subset selection problems (2004) (48)
A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves (2003) (47)
Approximation algorithms for the multiprocessor open shop scheduling problem (1999) (46)
A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem (2000) (46)
Hardness of approximation of the discrete time-cost tradeoff problem (2001) (46)
Some new bounds for Epsilon-nets (1990) (45)
Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh (2011) (45)
Sometimes Travelling is Easy: The Master Tour Problem (1995) (45)
A Study on the Computational Complexity of the Bilevel Knapsack Problem (2014) (44)
Multigraph realizations of degree sequences: Maximization is easy, minimization is hard (2008) (43)
The Travelling Salesman and the PQ-Tree (1996) (42)
On the dimension of simple monotonic games (2006) (42)
Resource augmentation for online bounded space bin packing (2000) (42)
The complexity of detecting crossingfree configurations in the plane (1993) (42)
A hardness result for core stability in additive hedonic games (2013) (42)
The Wiener maximum quadratic assignment problem (2011) (41)
Parallel machine scheduling with nested job assignment restrictions (2010) (41)
Improved Space for Bounded-Space, On-Line Bin-Packing (1993) (40)
A symmetry axiom for scientific impact indices (2008) (40)
Vehicle scheduling in two-cycle flexible manufacturing systems (1994) (40)
The Traveling Salesman Problem with Few Inner Points (2004) (38)
Permuting Matrices to Avoid Forbidden Submatrices (1995) (38)
On the robust assignment problem under a fixed number of cost scenarios (2006) (37)
A solvable case of the quadratic assignment problem (1998) (37)
Timetabling problems at the TU Eindhoven (2006) (37)
Approximate solutions to bin packing problems (2002) (36)
Bilevel programming and the separation problem (2014) (36)
Faster algorithms for computing power indices in weighted voting games (2005) (36)
A PTAS for minimizing the weighted sum of job completion times on parallel machines (1999) (35)
Minimizing Makespan and Preemption Costs on a System of Uniform Machines (2005) (35)
Repacking helps in bounded space on-line bind-packing (1993) (34)
Backbone colorings for graphs: Tree and path backbones (2007) (34)
Exact algorithms for NP-hard problems (2003) (33)
Domination When the Stars Are Out (2010) (33)
Linear time approximation scheme for the multiprocessor open shop problem (2001) (33)
Exact algorithms for NP-hard problems (2003) (33)
A Complexity and Approximability Study of the Bilevel Knapsack Problem (2013) (32)
Approximation of the supply scheduling problem (2005) (32)
More on the majority rule : Profiles, societies, and responsiveness (2005) (32)
A comment on scheduling two parallel machines with capacity constraints (2005) (32)
Sequencing jobs that require common resources on a single machine: A solvable case of the TSP (1998) (31)
String execution time for finite languages: Max is easy, min is hard (2011) (31)
A comment on scheduling on uniform machines under chain-type precedence constraints (2000) (31)
Competitive Analysis of Algorithms (1996) (31)
Monge strikes again: optimal placement of web proxies in the internet (2000) (31)
Inapproximability results for no-wait job shop scheduling (2004) (31)
Exact algorithms for the Hamiltonian cycle problem in planar graphs (2006) (30)
A polynomial‐time approximation scheme for single‐machine sequencing with delivery times and sequence‐independent batch set‐up times (1998) (30)
Partitioning graphs into connected parts (2009) (30)
The Dynamics of Power laws: Fitness and Aging in Preferential Attachment Trees (2017) (29)
Hamiltonian cycles in circulant digraphs with two stripes (1997) (29)
Fast algorithms for the maximum convolution problem (1994) (29)
Precedence-constrained scheduling problems parameterized by partial order width (2016) (29)
Minimum Cost Dynamic Flows: The Series-Parallel Case (1995) (28)
Fine-grained Complexity Analysis of Two Classic TSP Variants (2016) (28)
Counting Convex Polygons in Planar Point Sets (1995) (28)
The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts (2001) (27)
Preemptive scheduling with job-dependent setup times (1999) (27)
The toughness of split graphs (1998) (27)
The cone of Monge matrices: Extremal rays and applications (1995) (27)
On-Line Scheduling of Two-Machine Open Shops Where Jobs Arrive Over Time (1998) (27)
Simple But Efficient Approaches for the Collapsing Knapsack Problem (1997) (27)
Backbone Colorings for Networks (2003) (27)
The Travelling Salesman Problem on Permuted (1999) (26)
The VC-dimension of Set Systems Defined by Graphs (1997) (25)
A new family of scientific impact measures: The generalized Kosmulski-indices (2009) (25)
Graph Similarity and Approximate Isomorphism (2018) (24)
Integer Programming and Combinatoral Optimization - 15th International Conference, IPCO 2011, New York, NY, USA, June 15-17, 2011. Proceedings (2011) (24)
Optimal on-line algorithms for variable-sized bin covering (1999) (24)
Quadratic programming and combinatorial minimum weight product problems (2006) (24)
On-Line and Off-Line Approximation Algorithms for Vector Covering Problems (1996) (24)
Hamiltonian index is NP-complete (2011) (24)
Pinpointing the complexity of the interval min-max regret knapsack problem (2010) (23)
Linearizable special cases of the QAP (2014) (23)
A Lower Bound for On-Line Vector-Packing Algorithms (1993) (23)
The computational complexity of graph contractions I: Polynomially solvable and NP‐complete cases (2008) (22)
Some Geometric Clustering Problems (1994) (22)
Sports tournaments, home-away assignments, and the break minimization problem (2006) (22)
Motion Planning with Pulley, Rope, and Baskets (2013) (21)
The Disjoint Cliques Problem (1992) (21)
Generalizations of Egghe's g-index (2009) (21)
The computational complexity of graph contractions II: Two tough polynomially solvable cases (2008) (21)
Algorithms — ESA '97 (1997) (21)
Cinderella versus the Wicked Stepmother (2012) (21)
The one-dimensional Euclidean domain: finitely many obstructions are not enough (2015) (20)
More About Subcolorings (2002) (20)
Group activity selection problem with approval preferences (2018) (20)
Network-Based Vertex Dissolution (2014) (20)
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult (2006) (20)
A STUDY OF ON-LINE SCHEDULING TWO-STAGE SHOPS· (1995) (19)
A Lower Bound for Cake Cutting (2003) (19)
The two-dimensional cutting stock problem revisited (2005) (19)
The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases (2008) (19)
Competitive Odds and Ends (1996) (19)
Conference Scheduling — A Personalized Approach (2017) (18)
On-line scheduling on a single machine: minimizing the total completion time (1999) (18)
The Convex-Hull-and-k-Line Travelling Salesman Problem (1996) (18)
An algorithmic analysis of the Honey-Bee game (2010) (18)
Four point conditions and exponential neighborhoods for symmetric TSP (2006) (18)
Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs (2015) (18)
The three-dimensional matching problem in Kalmanson matrices (2013) (17)
Sensitivity Analysis for Knapsack Problems: Another Negative Result (1999) (17)
Scheduling Two Agents on a Single Machine: A Parameterized Analysis of NP-hard Problems (2017) (17)
On the recognition of permuted Supnick and incomplete Monge matrices (1996) (17)
On tiling under tomographic constraints (2003) (17)
A Tight Bound for 3-Partitioning (1993) (17)
On the rate of taxation in a cooperative bin packing game (1995) (17)
Which matrices are immune against the transportation paradox? (2003) (17)
Geometric versions of the three-dimensional assignment problem under general norms (2015) (16)
On the Recognition of Permuted Bottleneck Monge Matrices (1993) (16)
A Note on Semi-online Machine Covering (2005) (16)
Two hardness results for core stability in hedonic coalition formation games (2013) (16)
An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine (1999) (16)
Reconstructing sets of orthogonal line segments in the plane (1993) (16)
An algorithmic study of switch graphs (2009) (15)
The complexity of economic equilibria for house allocation markets (2003) (15)
Solution of a problem in DNA computing (2002) (15)
A polynomially solvable special case of the unbounded knapsack problem (2001) (15)
The Stock Size Problem (1998) (15)
The Complexity of Finding a Large Subgraph under Anonymity Constraints (2013) (15)
The hardness of train rearrangements (2009) (14)
Recognizing DNA graphs is difficult (2003) (14)
The Travelling Salesman Problem on Permuted Monge Matrices (1998) (14)
How to cut a cake almost fairly (2002) (14)
Three easy special cases of the euclidean travelling salesman problem (1997) (14)
Monge matrices make maximization manageable (1994) (14)
One, Two, Three, Many, or: Complexity Aspects of Dynamic Network Flows with Dedicated Arcs (1996) (14)
An Approximation Scheme For Cake Division With A Linear Number Of Cuts (2002) (14)
Project scheduling with irregular costs: complexity, approximability, and algorithms (2002) (14)
New special cases of the Quadratic Assignment Problem with diagonally structured coefficient matrices (2016) (14)
A branch‐and‐price algorithm for a hierarchical crew scheduling problem (2002) (14)
The no-wait flow-shop paradox (2005) (14)
On the complexity of function learning (1993) (13)
A comment on parallel-machine scheduling under a grade of service provision to minimize makespan (2009) (13)
Four-point conditions for the TSP: The complete complexity classification (2014) (13)
UET-scheduling with constrained processor allocations (1992) (13)
Divorcing Made Easy (2012) (13)
Computing Maximum Valued Regions (1992) (13)
Well-solvable cases of the QAP with block-structured matrices (2014) (13)
Partitioning Perfect Graphs into Stars (2014) (12)
Graph coloring with rejection (2006) (12)
Complexity and approximation of an area packing problem (2012) (12)
The approximability of three-dimensional assignment problems with bottleneck objective (2010) (12)
Complexity and in-approximability of a selection problem in robust optimization (2013) (12)
Scheduling with Time-Dependent Execution Times (1995) (12)
The Maximum Travelling Salesman Problem on Symmetric Demidenko Matrices (2000) (12)
The constrained minimum weighted sum of job completion times problem (2004) (12)
Radio Labeling with Preassigned Frequencies (2004) (12)
The complexity of Dominating Set in geometric intersection graphs (2019) (11)
The Computational Complexity of the Minimum Weight Processor Assignment Problem (2004) (11)
DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem (2002) (11)
An Investigation of the Recoverable Robust Assignment Problem (2020) (11)
A New Efficiently Solvable Special Case of the Three-Dimensional Axial Bottleneck Assignment Problem (1995) (11)
Associativity of recurrence multiplication (1994) (11)
Minimizing the total completion time in a unit-time open shop with release times (1997) (11)
The two-machine open shop problem: To fit or not to fit, that is the question (2003) (11)
Another well-solvable case of the QAP: Maximizing the job completion time variance (2012) (11)
Committee Selection with Intraclass and Interclass Synergies (2018) (11)
Star Partitions of Perfect Graphs (2014) (11)
A comment on a minmax location problem (1998) (10)
Counting k-Subsets and Convex k-gons in the Plane (1991) (10)
Greedy Algorithms for On-Line Data Compression (1997) (10)
Scheduling with step-improving processing times (2006) (10)
Good Things Come to Those Who Swap Objects on Paths (2019) (10)
Foundations of Software Science and Computation Structures (2019) (10)
Between a rock and a hard place: the two-to-one assignment problem (2009) (10)
Caching Is Hard—Even in the Fault Model (2010) (10)
The Computational Complexity of Multi-Level Bottleneck Programming Problems (1998) (10)
Equilibria for two parallel links : The strong price of anarchy versus the price of anarchy (2007) (10)
Buying a Constant Competitive Ratio for Paging (2001) (10)
On the Complexity of Function Learning (1993) (10)
An efficient algorithm for a class of constraint satisfaction problems (2002) (10)
Charlemagne's challenge: The periodic latency problem (2011) (10)
A note on scoring rules that respect majority in choice and elimination (2003) (10)
A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources (1999) (10)
A Personalized Approach (10)
A faster off-line algorithm for the TCP acknowledgement problem (2002) (9)
How to Put Through Your Agenda in Collective Binary Decisions (2013) (9)
A well-solvable special case of the bounded knapsack problem (2011) (9)
Scheduling of pipelined operator graphs (2012) (9)
Two-Bounded-Space Bin Packing Revisited (2011) (9)
Erratum: The Travelling Salesman and the PQ-Tree (1999) (9)
Fully decomposable split graphs (2009) (9)
A note on the complexity of the transportation problem with a permutable demand vector (1999) (9)
A polynomial time equivalence between DNA sequencing and the exact perfect matching problem (2007) (9)
Detecting Cycles Through Three Fixed Vertices in a Graph (1992) (9)
How hard is it to find extreme Nash equilibria in network congestion games? (2008) (8)
Makespan minimization in preemptive two machine job shops (2007) (8)
Unit-time scheduling problems with time dependent resources (1997) (8)
A note on the bottleneck graph partition problem (1999) (8)
On the reconstruction of simple polygons (1990) (8)
Approximability and parameterized complexity of multicover by c-intervals (2015) (8)
The Steiner Tree Problem in Kalmanson Matrices and in Circulant Matrices (1999) (8)
Counting Convex k-Gons in Planar Point Sets (1992) (8)
UET-scheduling with chain-type precedence constraints (1995) (8)
When Cauchy and Hölder Met Minkowski: A Tour through Well-Known Inequalities (2009) (8)
The Alcuin Number of a Graph (2008) (8)
A Simple Solution to the Two Paths Problem in Planar Graphs (1990) (8)
Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data (2003) (8)
Minimizing the Number of Tardy Jobs on a Single Machine with Batch Setup Times (1998) (8)
The Northwest corner rule revisited (2011) (7)
The Magnus-Derek game revisited (2008) (7)
Assigning chain-like tasks to a chain-like network (2001) (7)
Squares from Products of Consecutive Integers (2002) (7)
Open problems in the theory of scheduling (2002) (7)
Approximability and in-approximability results for no-wait shop scheduling (2000) (7)
The multi-stripe travelling salesman problem (2016) (7)
On-line -adic covering by the method of the -th segment and its application to on-line covering by cubes. (1996) (7)
Finding large degree-anonymous subgraphs is hard (2016) (7)
Vote trading and subset sums (2015) (7)
Improved Lower Bounds for Online Hypercube and Rectangle Packing (2016) (7)
Off-line temporary tasks assignment (1999) (7)
How * not * to solve a Sudoku (2010) (7)
A general approach to avoiding two by two submatrices (1994) (7)
Random Redundant Storage in Disk Arrays: Complexity of Retrieval Problems (2003) (7)
A Note on the Maximum of a certain Bilinear Form (1994) (7)
The Alcuin Number of a Graph and Its Connections to the Vertex Cover Number (2010) (7)
How Cinderella Won the Bucket Game (and Lived Happily Ever After) (2011) (6)
It is tough to be a plumber (2004) (6)
On Minimizing the Sum of k Tardinesses (1991) (6)
Time complexity and linear-time approximation of the ancient two-machine flow shop (1998) (6)
A Note on Fair Division under Interval Uncertainty (2006) (6)
The x-and-y-axes travelling salesman problem (2012) (6)
Minimum-cost strong network orientation problems : classification, complexity, and algorithms (1999) (6)
Radio Labeling with Pre-assigned Frequencies (2002) (6)
The Traveling Salesman Problem Under Squared Euclidean Distances (2010) (6)
The trouble with the second quantifier (2021) (6)
How to detect a counterfeit coin: Adaptive versus non-adaptive solutions (2003) (6)
Minimizing the weighted number of late jobs in UET open shops (1995) (6)
Minimum-cost strong network orientation problems: Classification, complexity, and algorithms (1999) (6)
The computational complexity of Steiner tree problems in graded matrices (1997) (5)
Formulations, Relaxations, Approximations, and Gaps in the World of Scheduling (2005) (5)
Combinatorial approximation algorithms: a comparative review (2005) (5)
Maximum Covering with D Cliques (1993) (5)
Computing the optimum stock size (1993) (5)
A Note on Tiling under Tomographic Constraints (2001) (5)
Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points (2017) (5)
Optimierung Und Kontrolle Projektbereich Diskrete Optimierung the Quadratic Assignment Problem with an Anti-monge Matrix and a Toeplitz Matrix: Easy and Hard Cases the Quadratic Assignment Problem with an Anti-monge and a Toeplitz Matrix: Easy and Hard Cases (2007) (5)
The Open Shop Scheduling Problem (2018) (5)
Roll cutting in the curtain industry, or: A well-solvable allocation problem (2007) (5)
Computational problems without computation (2003) (5)
Tight bounds for break minimization in tournament scheduling (2008) (5)
Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines (2006) (5)
Epsilon-Nets for Halfplanes (1988) (5)
Timeline-based planning over dense temporal domains (2020) (5)
Timeline-Based Planning over Dense Temporal Domains with Trigger-less Rules is NP-Complete (2018) (5)
The post correspondence problem over a unary alphabet (2003) (5)
The computational complexity of the κ-minimum spanning tree problem in graded matrices☆ (1998) (5)
A faster algorithm for the continuous bilevel knapsack problem (2020) (5)
Eliminating graphs by means of parallel knock-out schemes (2007) (5)
Vehicle refueling with limited resources (2011) (5)
The Cinderella Game on Holes and Anti-holes (2011) (5)
The transportation problem with conflicts (2017) (5)
Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines (2007) (5)
The mathematics of playing golf, or: a new class of difficult non-linear mixed integer programs (2002) (5)
A New Tractable Case of the QAP with a Robinson Matrix (2015) (4)
The Focus of Attention Problem (2010) (4)
A linear time algorithm for the robust recoverable selection problem (2020) (4)
The Complexity of Finding Arborescences in Hypergraphs (1992) (4)
Note: Open shop scheduling with release dates to minimize maximum lateness (1995) (4)
Network-Based Dissolution (2014) (4)
Continuous facility location on graphs (2020) (4)
Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous (2002) (4)
Computing and Software Science: State of the Art and Perspectives (2019) (4)
Dispersing Obnoxious Facilities on a Graph (2018) (4)
Scheduling with safety distances (1995) (4)
Pseudo-Hamiltonian Graphs (1997) (4)
2-piercings via Graph Theory (2008) (4)
Uniqueness in quadratic and hyperbolic 0-1 programming problems (2013) (4)
Tight bounds for break minimization (2007) (4)
The Freudenthal Problem and its Ramifications (Part I) (2006) (4)
Vc-Dimensions For Graphs (1994) (4)
VC-Dimensions for Graphs (Extended Abstract) (1995) (3)
De Bruijn Graphs and DNA Graphs (2001) (3)
More about Subcolorings (Extended Abstract) (2002) (3)
Vertex Cover Meets Scheduling (2016) (3)
Combinatorial optimization problems with conflict graphs (2009) (3)
Unbounded knapsack problems with arithmetic weight sequences (2011) (3)
Realizing Small Tournaments Through Few Permutations (2013) (3)
Minimizing Makespan and Preemption Costs on a System of Uniform Machines (2002) (3)
Another Look at the Shoelace TSP: The Case of Very Old Shoes (2014) (3)
Scheduling a pipelined operator graph (2000) (3)
Some Easy and Some Not so Easy Geometric Optimization Problems (2018) (3)
Backbone colorings for graphs (2003) (3)
A combinatorial approximation algorithm for CDMA downlink rate allocation (2004) (3)
Complexity and Approximability of Double Digest (2005) (3)
Guest Editorial to the special issue "Operations Research in Health Care" (EURO XXIII, July 5-8, 2009, Bonn) (2012) (3)
Complexity and in-approximability of a selection problem in robust optimization (2013) (3)
Two Remarks on Reconstructing Binary Vectors from Their Absorbed Projections (2005) (3)
A minimax assignment problem in treelike communication networks (1995) (3)
Some Problems around Traveling Salesmen, Dart Boards, and Euro-coins (2006) (2)
Combinatorial Algorithms: 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings (2020) (2)
Proceedings of the 30th international conference on Automata, languages and programming (2003) (2)
Parallel Knock-Out Schemes in Networks (2004) (2)
A note on the depth function of combinatorial optimization problems (2001) (2)
Approximation Schemes for Broadcasting in Heterogenous Networks (2004) (2)
On the recognition of permuted Supnick and incomplete Monge matrices (1996) (2)
Integer Programming and Combinatorial Optimization (1999) (2)
Geometric versions of the 3-dimensional assignment problem under general norms (2014) (2)
Two hardness results for Gamson’s game (2014) (2)
Tools and Algorithms for the Construction and Analysis of Systems: 26th International Conference, TACAS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25–30, 2020, Proceedings, Part II (2020) (2)
A characterization of the single-crossing domain (2012) (2)
Balanced vector optimization (2017) (2)
Exponential size neighborhoods for makespan minimization scheduling (2011) (2)
A heuristic for preemptive scheduling with set-up times (1992) (2)
Robust balanced optimization (2018) (2)
Planar 3-dimensional assignment problems with Monge-like cost arrays (2014) (2)
Steiner diagrams and k-star hubs (2007) (2)
The transportation problem with conflicts (2018) (2)
Between a rock and a hard place : the two-toone assignment problem (2012) (2)
Complexity of the job insertion problem in multi-stage scheduling (2007) (2)
Embeddings of planar graphs that minimize the number of long-face cycles (2002) (2)
The Dominating Set Problem in Geometric Intersection Graphs (2017) (2)
The triangle scheduling problem (2016) (2)
The mathematics of playing golf (2002) (2)
Computational Problems that can be Solved Without Computation (2002) (1)
Linearizable Special Cases of the Quadratic Shortest Path Problem (2021) (1)
The Complexity of Graph Contractions (2003) (1)
The problem of the moody chess players (2008) (1)
An algorithmic study of switch graphs (2012) (1)
Nothing New about Equiangular Polygons (2013) (1)
Threshold aggregation of multi-graded rankings (2009) (1)
Travelling salesman paths on Demidenko matrices (2020) (1)
Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms (2014) (1)
A PTAS for single machine scheduling with controllable processing times (2002) (1)
Roll Cutting in the Curtain Industry (2005) (1)
Group activity selection problem with approval preferences (2017) (1)
Erratum: Cinderella versus the Wicked Stepmother (2012) (1)
Parameterized and Exact Computation (2012) (1)
Bilevel programming and the separation problem (2013) (1)
Seventeen lines and one-hundred-and-one points (2003) (1)
Proceedings of the 11th International Computer Science Symposium on Computer Science --- Theory and Applications - Volume 9691 (2016) (1)
Backbone colorings for networks: tree and path backbones (2003) (1)
Polygons with inscribed circles and prescribed side lengths (2009) (1)
Complexity and approximability results for slicing floorplan designs (2003) (1)
Partitioning Graphs into Two Trees (1994) (1)
Analysis of multi-stage open shop processing systems (2011) (1)
An Algorithmic Comparison of Three Scientific Impact Indices (2010) (1)
The subset sum game revisited (2017) (1)
Timetabling problems at the TU Eindhoven (Abstract) (2006) (1)
Well-solvable instances for the partition problem (2006) (1)
A very difficult scheduling problem with communication delays (2001) (1)
The one-dimensional Euclidean domain: finitely many obstructions are not enough (2016) (1)
An FPTAS for Agreeably Weighted Variance on a Single Machine (1999) (1)
A comment on consecutive-2-out-of-n systems (2001) (1)
A Greedy-heuristic for 3-partitioning with similar elements (1993) (1)
Complexity and Multi-level Optimization (2012) (1)
The complexity of computing the Muirhead-Dalton distance (2009) (1)
Investigations on the step-based research indices of Chambers and Miller (2014) (1)
Preface to Special issue dedicated to ISCO 2012 (2015) (0)
Complexity and approximation of an area packing problem (2010) (0)
Combinatorial Approximation Algorithms (Dagstuhl Seminar 9734) (2021) (0)
Mongestrikesagain:optimalplacementofwebproxies intheinternet ( (2000) (0)
Transportation under Nasty Side Constraints (2012) (0)
Competitive Algorithms (Dagstuhl Seminar 99251) (2021) (0)
The Path-TSP: Two Solvable Cases (2020) (0)
Motion Planning with Pulley, Rope, and Baskets (2013) (0)
A lower bound for ake utting (2003) (0)
Non-Preemptive Tree Packing (2022) (0)
Disjoint Pairs with Distinct Sums (2006) (0)
Hardness of flow time minimization in a crossdock with a single door and asymmetric handover relations (2023) (0)
How to Put Through Change in Collective Binary Decisions (2013) (0)
Caching for Web Searching (2002) (0)
An O(n log n) Algorithm for the K-Template Travelling Salesman Problem (1995) (0)
On the Euclidean two Paths Problem (1993) (0)
Monge Matrices Make Maximization Manageable Monge Matrices Make Maximization Manageable (1993) (0)
Reachability and Deadlocking Problems in Multi-stage Scheduling (2011) (0)
Worst-Case Analysis for On-Line Data Compression (1995) (0)
The triangle scheduling (2017) (0)
Two hardness results for Gamson’s game (2014) (0)
Non-Monochromatic and Conflict-Free Colorings in Tree Spaces (2018) (0)
Colouring contact graphs of squares and rectilinear polygons (2016) (0)
Preface to the Special Issue on Computer Science in Russia 2016 (2018) (0)
The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases (2014) (0)
Graph Colorings (Dagstuhl Seminar 03391) (2021) (0)
The one-dimensional Euclidean preferences : Finitely many forbidden substructures are not enough (2016) (0)
Exact Algorithms and Fixed-Parameter Tractability, 24.-27. July 2005 (2006) (0)
D S ] 1 M ay 2 01 6 The triangle scheduling problem (2018) (0)
05301 Abstracts Collection - Exact Algorithms and Fixed-Parameter Tractability (2005) (0)
Introduction (Special issue ESA'97) (2000) (0)
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization (1999) (0)
Computation and Complexity (2019) (0)
Preface: Volume 13 (2003) (0)
The fractional greedy algorithm for data compression (2005) (0)
The mathematics of playing olf: a new class of difficult non-linear mixed integer programsg (2001) (0)
The Disjoint Cliques (1997) (0)
On-line Algorithms (Dagstuhl Seminar 9626) (2021) (0)
Uet-scheduling with Chain-type Precedence Constraints Uet|scheduling with Chain-type Precedence Constraints (1993) (0)
Graph-Theoretic Concepts in Computer Science (2015) (0)
The Dynamics of Power laws: Fitness and Aging in Preferential Attachment Trees (2017) (0)
Special issue on approximation algorithms: part 2 (2000) (0)
Preemptive scheduling with rejection (Algorithm Engineering as a New Paradigm) (2001) (0)
Preface (Special issue on ICALP 2003) (2007) (0)
The bipartite travelling salesman problem: A pyramidally solvable case (2023) (0)
Deposited in DRO : 07 October 2008 Version of attached le : Published Version Peer-review status of attached le : Peer-reviewed Citation for published item (2014) (0)
Preface to the Special Issue on Computer Science in Russia 2016 (2018) (0)
Start Project Y43-mat Combinatorial Approximation Algorithms Time Complexity and Linear-time Approximation of the Ancient Two Machine Flow Shop Time Complexity and Linear-time Approximation of the Ancient Two Machine Ow Shop (1997) (0)
Dagstuhl Seminar on Competitive Algorithms June 20 – 25 1999 Organized (2008) (0)
Proceedings of the 7th international conference on Parameterized and Exact Computation (2012) (0)
Problem Solver's Toolkit: No. 9 (2013) (0)
Balanced Optimization with Vector Costs (2016) (0)
Non-Monochromatic and Conflict-Free Colorings on Tree Spaces and Planar Network Spaces (2018) (0)
Approximations through relaxations (2004) (0)
A new on-line scheduling heuristic (1993) (0)
A note on the complexity of the bilevel bottleneck assignment problem (2021) (0)
Approximation Schemes – A Tutorial 1 (2009) (0)
The Interval Ordering Problem (2010) (0)
A note on the complexity of determining optimal strategies in games with common payoffs (2003) (0)
CURRICULUM VITAE AND RESEARCH PLAN (2010) (0)
The Travelling Salesman Problem (Dagstuhl Seminar 02261) (2021) (0)
Proceedings of the 5th Annual European Symposium on Algorithms (1997) (0)
School of Computer Science Scheduling and Load Balancing (2009) (0)
Analysis of multi-stage open shop processing systems (2012) (0)
Finding the Closest Extreme Vertex to a Fixed Point (1992) (0)
Special Issue on Approximation Algorithms: Part 1 (2000) (0)
On-lineschedulingonasinglemachine:maximizingthenumberof earlyjobs (2000) (0)
Summations according to Gauss (2011) (0)
A linear time algorithm for linearizing quadratic and higher-order shortest path problems (2023) (0)
05301 Summary - Exact Algorithms and Fixed-Parameter Tractability (2005) (0)
Online Algorithms (Dagstuhl Seminar 02271) (2021) (0)
Vertex Cover Meets Scheduling (2015) (0)
Optimierung Und Kontrolle Projektbereich Diskrete Optimierung Long-chord-free and Fence-free Tours for the Travelling Salesman Problem Long-chord-free and Fence-free Tours for the Travelling Salesman Problem (1995) (0)
The triangle scheduling problem (2017) (0)
A polynomial time approximation scheme for preemptive scheduling with setup times (1997) (0)
On the recognition of permuted bottleneck (2003) (0)
EGMO 2013 Problems with Solutions Problem Selection Committee : (2013) (0)
Integer Programming and Combinatorial Optimization (2001) (0)
Local search with exponential neighborhoods (2002) (0)
Proceedings of the 1998 Symposium on Integer Programming and Combinatorial Optimization The Maximum Traveling Salesman Problemunder Polyhedral (1998) (0)
Game-Theoretic , Permutable Symmetries for the Producer-Consumer Problem (0)
Workshop on Tractable special cases of hard combinatorial optimization problems (2014) (0)
Special issue on efficient scheduling algorithms (2001) (0)
Between a rock and a hard place: the two-to-one assignment problem (2012) (0)
Travelling is Easy : The Master Tour Prob lem * (0)
Integer Programming and Combinatorial Optimization (2013) (0)
Scheduling of pipelined operator graphs (2011) (0)
Preface (2007) (0)
News and Letters (2012) (0)
Model checking and testing combined (2003) (0)
The Focus of Attention Problem (2014) (0)
Exact algorithms and fixed-parameter tractability (Proceedings Dagstuhl Seminar, July 24-29, 2005) (2006) (0)
DNA sequencing, eulerian graphs (2002) (0)
Long-chord-free and fenche-free tours for the Travelling Salesman Problem (1995) (0)
Caching for Web Searching (2000) (0)
The computational complexity of a bin packing game (1994) (0)
The three-dimensional matching problem in Kalmanson matrices (2011) (0)
Four Non-Deterministic Programming Exercises (2008) (0)
Linearizable special cases of the QAP (2014) (0)
Non-Monochromatic and Conflict-Free Colorings on Tree Spaces and Planar Network Spaces (2019) (0)
The multi-stripe travelling salesman problem (2017) (0)
That old root flipping trick of Andrey Andreyevich Markov (2011) (0)
Double digest revisited (2002) (0)
Polynomials Without Sign Changes (2010) (0)
Assigning chain-like tasks on a chain-like network of computers (2001) (0)
Recognising permuted Demidenko matrices (2023) (0)

This paper list is powered by the following services:

Other Resources About Gerhard J. Woeginger

en.wikipedia.org

What Schools Are Affiliated With Gerhard J. Woeginger?

Gerhard J. Woeginger is affiliated with the following schools:

Image Attributions

Image Source for Gerhard J. Woeginger