G. Woeginger

发表

Operations Research Letters

Gerhard J. Woeginger, Jan Karel Lenstra, George L. Nemhauser, 2011 .

Almost tight bounds for $\epsilon$-nets

J. Komlos, J. Pach, G. Woeginger, 1992 .

The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts

G. Woeginger, M. Chrobak, J. Csirik, 2001, ICALP.

Geometric three-dimensional assignment problems☆

F. Spieksma, G. Woeginger, 1996 .

Drawing graphs in the plane with high resolution

F. Leighton, E. Welzl, G. Woeginger, 1993 .

Approximation schemes for scheduling on parallel machines

N. Alon, Y. Azar, G. Woeginger, 1998 .

Drawing Planar Graphs Using the Canonical Ordering

F. Leighton, E. Welzl, G. Woeginger, 1996 .

A Lower Bound for Randomized On-Line Scheduling Algorithms

Gerhard J. Woeginger, Bo Chen, André van Vliet, 1994, Information Processing Letters.

The Travelling Salesman Problem on Permuted

R. Burkard, G. Woeginger, Vladimir G. De, 1999 .

Vehicle scheduling in two-cycle flexible manufacturing systems

Gerd Finke, Gerhard J. Woeginger, Jacek Blazewicz, 1994 .

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

Gerhard J. Woeginger, Amos Fiat, A. Fiat, 1998 .

A PTAS for minimizing the weighted sum of job completion times on parallel machines

Gerhard J. Woeginger, Martin Skutella, G. Woeginger, 1999, STOC '99.

Exact (Exponential) Algorithms for the Dominating Set Problem

Gerhard J. Woeginger, Fedor V. Fomin, Dieter Kratsch, 2004, WG.

Fully Decomposable Split Graphs

Gerhard J. Woeginger, Dieter Kratsch, Hajo Broersma, 2009, IWOCA.

Scheduling with Incompatible Jobs

Klaus Jansen, Gerhard J. Woeginger, Hans L. Bodlaender, 1992, Discret. Appl. Math..

A branch‐and‐price algorithm for a hierarchical crew scheduling problem

F. Spieksma, G. Woeginger, Diego B.C. Faneyte, 2002 .

CURRICULUM VITAE AND RESEARCH PLAN

G. Woeginger, L. Becchetti, 2010 .

The computational complexity of Steiner tree problems in graded matrices

G. Woeginger, T. Dudás, Bettina Klinz, 1997 .

Approximation Schemes – A Tutorial 1

G. Woeginger, P. Schuurman, 2009 .

On the recognition of permuted Supnick and incomplete Monge matrices

V. Deineko, G. Woeginger, Rüdiger Rudolf, 1996, Acta Informatica.

Workshop on Tractable special cases of hard combinatorial optimization problems

G. Woeginger, 2014 .

Competitive Odds and Ends

Gerhard J. Woeginger, Amos Fiat, A. Fiat, 1996, Online Algorithms.

The quadratic 0-1 knapsack problem with series-parallel support

Gerhard J. Woeginger, David J. Rader, G. Woeginger, 2002, Oper. Res. Lett..

The transportation problemwith conflicts

Annette M. C. Ficker, F. Spieksma, G. Woeginger, 2018 .

The Transportation Problem with Conflicts

Annette M. C. Ficker, F. Spieksma, G. Woeginger, 2017 .

Improved Lower Bounds for Online Hypercube and Rectangle Packing

G. Woeginger, A. V. Vliet, R. V. Stee, 2016 .

A polynomial‐time approximation scheme for single‐machine sequencing with delivery times and sequence‐independent batch set‐up times

Gerhard J. Woeginger, G. Woeginger, 1998 .

The one-dimensional Euclidean preferences : Finitely many forbidden substructures are not enough

K. Pruhs, G. Woeginger, Jiehua Chen, 2016 .

Exponential size neighborhoods for makespan minimization scheduling

G. Woeginger, J. Hurink, T. Vredeveld, 2011 .

Hardness of approximation of the discrete time-cost tradeoff problem

Gerhard J. Woeginger, Vladimir G. Deineko, V. Deineko, 2001, Oper. Res. Lett..

D S ] 1 M ay 2 01 6 The triangle scheduling problem

Óscar C. Vásquez, G. Woeginger, C. Dürr, 2018 .

Monge Matrices Make Maximization Manageable Monge Matrices Make Maximization Manageable

G. Woeginger, Ulrich Pferschy, udiger Rudolf, 1993 .

Linearizable special cases of the QAP

Gerhard J. Woeginger, Vladimir G. Deineko, Eranda Çela, 2014, J. Comb. Optim..

Combinatorial Algorithms: 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings

Wen Gao, Ralf Klasing, Gerhard Woeginger, 2020, IWOCA.

A Simple Solution to the Two Paths Problem in Planar Graphs

Gerhard J. Woeginger, G. Woeginger, 1990, Information Processing Letters.

An O(n log n) Algorithm for the K-Template Travelling Salesman Problem

Shuzhong Zhang, G. Woeginger, J. V. D. Veen, 1995 .

Uet-scheduling with Chain-type Precedence Constraints Uet|scheduling with Chain-type Precedence Constraints

G. Woeginger, Zhongliang Yu, 1993 .

The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts

Marek Chrobak, Gerhard J. Woeginger, János Csirik, 2001, ICALP.

The complexity of detecting crossingfree configurations in the plane

G. Woeginger, K. Jansen, 1993, BIT.

Backbone colorings for networks: tree and path backbones

Haitze J. Broersma, G. Woeginger, F. Fomin, 2003 .

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

G. Woeginger, Vladimir G. De, D. Suprunenko, 1995 .

A Personalized Approach

Annette M. C. Ficker, G. Woeginger, Bart Vangerven, 2022 .

Timetabling problems at the TU Eindhoven

G. Woeginger, C. Hurkens, J. V. D. Broek, 2006, Eur. J. Oper. Res..

Proceedings of the 1998 Symposium on Integer Programming and Combinatorial Optimization The Maximum Traveling Salesman Problemunder Polyhedral

David S. Johnson, G. Woeginger, NormsAlexander Barvinok, 1998 .

On the complexity of function learning

Philip M. Long, P. Auer, W. Maass, 1993, COLT '93.

When Cauchy and Hölder Met Minkowski: A Tour through Well-Known Inequalities

G. Woeginger, 2009 .

On-Line and Off-Line Approximation Algorithms for Vector Covering Problems

Arjen P. A. Vestjens, N. Alon, Y. Azar, 1996, Algorithmica.

Competitive Algorithms (Dagstuhl Seminar 99251)

Gerhard J. Woeginger, Amos Fiat, Anna R. Karlin, 2021 .

Exact Algorithms and Fixed-Parameter Tractability, 24.-27. July 2005

Gerhard J. Woeginger, Rodney G. Downey, Martin Grohe, 2006, Exact Algorithms and Fixed-Parameter Tractability.

On the recognition of permuted bottleneck

G. Woeginger, Bettina Klinz, R. Rudolf, 2003 .

Integer Programming and Combinatorial Optimization

Gerhard J. Woeginger, Gerhard Goos, Juris Hartmanis, 2013, Lecture Notes in Computer Science.

Competitive Analysis of Algorithms

Gerhard J. Woeginger, Amos Fiat, A. Fiat, 1996, Online Algorithms.

Online Algorithms (Dagstuhl Seminar 02271)

Gerhard J. Woeginger, Amos Fiat, Susanne Albers, 2021 .

On-line Algorithms (Dagstuhl Seminar 9626)

Gerhard J. Woeginger, Amos Fiat, A. Fiat, 2021 .

On the Complexity of Function Learning

Philip M. Long, P. Auer, W. Maass, 1993, Machine-mediated learning.

An O(n log n) Algorithm for the K-Template Travelling Salesman Problem

Shuzhong Zhang, G. Woeginger, J. V. D. Veen, 1995 .

Bilevel programming and the separation problem

G. Woeginger, T. Ralphs, Andrea Lodi, 2013, Mathematical Programming.

The one-dimensional Euclidean domain: finitely many obstructions are not enough

K. Pruhs, G. Woeginger, Jiehua Chen, 2016, Social Choice and Welfare.

A characterization of the single-crossing domain

G. Woeginger, Robert Bredereck, Jiehua Chen, 2012, Social Choice and Welfare.

Special issue on approximation algorithms: part 2

Gerhard J. Woeginger, G. Woeginger, 2000 .

Linearizable special cases of the QAP

V. Deineko, E. Çela, G. Woeginger, 2014, Journal of Combinatorial Optimization.

An algorithmic study of switch graphs

G. Woeginger, Ignaz Rutter, Bastian Katz, 2009, Acta Informatica.

The Dynamics of Power laws: Fitness and Aging in Preferential Attachment Trees

G. Woeginger, R. van der Hofstad, A. Garavaglia, 2017, Journal of Statistical Physics.

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

Gerhard J. Woeginger, Rainer E. Burkard, R. Burkard, 1995 .

Deposited in DRO : 07 October 2008 Version of attached le : Published Version Peer-review status of attached le : Peer-reviewed Citation for published item

G. Woeginger, F. Fomin, H. Bodlaender, 2014 .

The approximability of three-dimensional assignment problems with bottleneck objective

Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, 2010, Optim. Lett..

The Alcuin Number of a Graph and Its Connections to the Vertex Cover Number

Gerhard J. Woeginger, Péter Csorba, Cor A. J. Hurkens, 2010, SIAM Rev..

The Alcuin Number of a Graph

Gerhard J. Woeginger, Péter Csorba, Cor A. J. Hurkens, 2008, ESA.

The Complexity of Finding a Large Subgraph under Anonymity Constraints

Gerhard J. Woeginger, Robert Bredereck, Sepp Hartung, 2013, ISAAC.

Domination When the Stars Are Out

Erik Jan van Leeuwen, Gerhard J. Woeginger, Matthias Mnich, 2010, ICALP.

Space and Time Complexity of Exact Algorithms : Some Open Problems

Gerhard J. Woeginger, G. Woeginger, 2004 .

Exact Algorithms for NP-Hard Problems: A Survey

Gerhard J. Woeginger, G. Woeginger, 2001, Combinatorial Optimization.

Almost tight bounds forɛ-Nets

János Komlós, Gerhard J. Woeginger, János Pach, 1992, Discret. Comput. Geom..

A polynomial time equivalence between DNA sequencing and the exact perfect matching problem

Gerhard J. Woeginger, Jacek Blazewicz, Petra Schuurman, 2007, Discret. Optim..

Recognizing DNA graphs is difficult

Gerhard J. Woeginger, Petra Schuurman, Rudi Pendavingh, 2003, Discret. Appl. Math..

DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem

Gerhard J. Woeginger, Jacek Blazewicz, Petra Schuurman, 2002, WG.

De Bruijn Graphs and DNA Graphs

Gerhard J. Woeginger, Rudi Pendavingh, Petra Schuurman, 2001, WG.

Approximation Schemes for Broadcasting in Heterogenous Networks

Samir Khuller, Gerhard J. Woeginger, Yoo-Ah Kim, 2004, APPROX-RANDOM.

The no-wait flow-shop paradox

Frits C. R. Spieksma, Gerhard J. Woeginger, F. Spieksma, 2005, Oper. Res. Lett..

Which matrices are immune against the transportation paradox?

Gerhard J. Woeginger, Vladimir G. Deineko, Bettina Klinz, 2003, Discret. Appl. Math..

Finding minimum areak-gons

David Eppstein, Gerhard J. Woeginger, Günter Rote, 1992, Discret. Comput. Geom..

A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem

Gerhard J. Woeginger, Petra Schuurman, G. Woeginger, 2000, Theor. Comput. Sci..

A study of exponential neighborhoods for the Travelling Salesman Problem and for the Quadratic Assignment Problem

Gerhard J. Woeginger, Vladimir G. Deı̆neko, V. Deineko, 2000, Math. Program..

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

Gerhard J. Woeginger, G. Woeginger, 2000, INFORMS J. Comput..

Polynomial Graph-Colorings

Gerhard J. Woeginger, Emo Welzl, Wolfgang Gutjahr, 1989, STACS.

Detecting Cycles Through Three Fixed Vertices in a Graph

Gerhard J. Woeginger, Herbert Fleischner, G. Woeginger, 1992, Inf. Process. Lett..

When does a dynamic programming formulation guarantee the existence of an FPTAS?

Gerhard J. Woeginger, G. Woeginger, 1999, SODA '99.

Automata, Languages and Programming

Gerhard J. Woeginger, Jan Karel Lenstra, Joachim Parrow, 2003, Lecture Notes in Computer Science.

Repacking helps in bounded space on-line bind-packing

Gerhard J. Woeginger, Gábor Galambos, G. Woeginger, 1993, Computing.

There is no Asymptotic PTAS for Two-Dimensional Vector Packing

Gerhard J. Woeginger, G. Woeginger, 1997, Inf. Process. Lett..

On-line Packing and Covering Problems

Gerhard J. Woeginger, János Csirik, G. Woeginger, 1996, Online Algorithms.

On-line bin packing — A restricted survey

Gerhard J. Woeginger, Gábor Galambos, G. Woeginger, 1995, Math. Methods Oper. Res..

A Lower Bound for On-Line Vector-Packing Algorithms

Gerhard J. Woeginger, Hans Kellerer, Gábor Galambos, 1993, Acta Cybern..

Randomized online scheduling on two uniform machines

Gerhard J. Woeginger, Jirí Sgall, Leah Epstein, 2001, SODA '99.

A Review of Machine Scheduling: Complexity, Algorithms and Approximability

Gerhard J. Woeginger, Chris N. Potts, Bo Chen, 1998 .

Online Algorithms

Gerhard J. Woeginger, Amos Fiat, A. Fiat, 1998, Lecture Notes in Computer Science.

A minimax assignment problem in treelike communication networks

Gerhard J. Woeginger, Rainer E. Burkard, Eranda Çela, 1995 .

Complexity and Approximability of Double Digest

Gerhard J. Woeginger, Stephan Eidenbenz, Mark Cieliebak, 2005, J. Bioinform. Comput. Biol..

Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data

Gerhard J. Woeginger, Stephan Eidenbenz, Mark Cieliebak, 2003, COCOON.

The Traveling Salesman Problem with Few Inner Points

Gerhard J. Woeginger, Michael Hoffmann, Yoshio Okamoto, 2004, COCOON.

Another well-solvable case of the QAP: Maximizing the job completion time variance

Gerhard J. Woeginger, Vladimir G. Deineko, Eranda Çela, 2012, Oper. Res. Lett..

Computational problems without computation

Gerhard J. Woeginger, G. Woeginger, 2003 .

Computational Problems that can be Solved Without Computation

Gerhard J. Woeginger, G. Woeginger, 2002 .

The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases

Gerhard J. Woeginger, Günter Rote, Rainer E. Burkard, 1996, Math. Program..

A Note on the Maximum of a certain Bilinear Form

Gerhard J. Woeginger, Eranda Çela, E. Çela, 1994 .

Preemptive scheduling with rejection

Han Hoogeveen, Gerhard J. Woeginger, Martin Skutella, 2000, Math. Program..

On the dimension of simple monotonic games

Gerhard J. Woeginger, Vladimir G. Deineko, V. Deineko, 2006, Eur. J. Oper. Res..

The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases

Gerhard J. Woeginger, Leah Epstein, Asaf Levin, 2012, Algorithmica.

Pseudo-Hamiltonian Graphs

Gerhard J. Woeginger, Luitpold Babel, G. Woeginger, 1997, Acta Cybern..

VC-Dimensions for Graphs (Extended Abstract)

Gerhard J. Woeginger, Jorge Urrutia, Evangelos Kranakis, 1995, WG.

Monge matrices make maximization manageable

Gerhard J. Woeginger, Ulrich Pferschy, Rüdiger Rudolf, 1994, Oper. Res. Lett..

Maximum Covering with D Cliques

Klaus Jansen, Gerhard J. Woeginger, Petra Scheffler, 1993, FCT.

Semi-online scheduling with decreasing job sizes

Gerhard J. Woeginger, Jiří Sgall, Steve Seiden, 2000, Oper. Res. Lett..

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

Gerhard J. Woeginger, G. Woeginger, 1997, Oper. Res. Lett..

All-norm approximation algorithms

Gerhard J. Woeginger, Yossi Azar, Leah Epstein, 2002, J. Algorithms.

Non-Approximability Results for Scheduling Problems with Minsum Criteria

Han Hoogeveen, Gerhard J. Woeginger, Petra Schuurman, 1998, INFORMS J. Comput..

Approximability and nonapproximability results for minimizing total flow time on a single machine

Gerhard J. Woeginger, Hans Kellerer, Thomas Tautenhahn, 1996, STOC '96.

The Dynamics of Power laws: Fitness and Aging in Preferential Attachment Trees

Remco van der Hofstad, Alessandro Garavaglia, Gerhard Woeginger, 2017, 1703.05943.

A note on the complexity of the bilevel bottleneck assignment problem

G. Woeginger, Dennis Fischer, Komal Muluk, 2021, 4OR.

A Study on the Computational Complexity of the Bilevel Knapsack Problem

Gerhard J. Woeginger, Alberto Caprara, Andrea Lodi, 2014, SIAM J. Optim..

Approximation schemes for scheduling

Noga Alon, Gerhard J. Woeginger, Yossi Azar, 1997, SODA '97.

The Computational Complexity of Multi-Level Bottleneck Programming Problems

Gerhard J. Woeginger, Bettina Klinz, Tibor Dudás, 1998 .

Bilevel Knapsack with Interdiction Constraints

Gerhard J. Woeginger, Alberto Caprara, Andrea Lodi, 2016, INFORMS J. Comput..

A Complexity and Approximability Study of the Bilevel Knapsack Problem

Gerhard J. Woeginger, Alberto Caprara, Andrea Lodi, 2013, IPCO.

On the approximability of average completion time scheduling under precedence constraints

Gerhard J. Woeginger, G. Woeginger, 2001, Discret. Appl. Math..

The Disjoint Cliques Problem

Klaus Jansen, Gerhard J. Woeginger, Petra Scheffler, 1992, Universität Trier, Mathematik/Informatik, Forschungsbericht.

Vertex Cover Meets Scheduling

Gerhard J. Woeginger, Leah Epstein, Asaf Levin, 2015, Algorithmica.

The constrained minimum weighted sum of job completion times problem

Gerhard J. Woeginger, Asaf Levin, G. Woeginger, 2004, Math. Program..

On the complexity of cake cutting

Gerhard J. Woeginger, Jirí Sgall, G. Woeginger, 2007, Discret. Optim..

The VC-dimension of Set Systems Defined by Graphs

Gerhard J. Woeginger, Jorge Urrutia, Evangelos Kranakis, 1997, Discret. Appl. Math..

The Cinderella Game on Holes and Anti-holes

Gerhard J. Woeginger, Cor A. J. Hurkens, Marijke H. L. Bodlaender, 2011, WG.

Graph colorings

Gerhard J. Woeginger, Jaroslav Nesetril, J. Nesetril, 2005, Theor. Comput. Sci..

Complexity of Coloring Graphs without Forbidden Induced Subgraphs

Zsolt Tuza, Gerhard J. Woeginger, Daniel Král, 2001, WG.

A general approach to avoiding two by two submatrices

Gerhard J. Woeginger, Vladimir G. Deineko, Rüdiger Rudolf, 1994, Computing.

On the Euclidean two Paths Problem

Gerhard J. Woeginger, Hans Kellerer, G. Woeginger, 1993, Discret. Appl. Math..

Paths, trees and matchings under disjunctive constraints

Gerhard J. Woeginger, Ulrich Pferschy, Joachim Schauer, 2011, Discret. Appl. Math..

On the nearest neighbor rule for the traveling salesman problem

Gerhard J. Woeginger, Cor A. J. Hurkens, G. Woeginger, 2004, Oper. Res. Lett..

New special cases of the Quadratic Assignment Problem with diagonally structured coefficient matrices

Gerhard J. Woeginger, Vladimir G. Deineko, Eranda Çela, 2016, Eur. J. Oper. Res..

Partitioning Perfect Graphs into Stars

Gerhard J. Woeginger, Rolf Niedermeier, René van Bevern, 2014, J. Graph Theory.

Star Partitions of Perfect Graphs

Gerhard J. Woeginger, Rolf Niedermeier, René van Bevern, 2014, ICALP.

Sports tournaments, home-away assignments, and the break minimization problem

Gerhard J. Woeginger, Gerhard F. Post, G. Woeginger, 2006, Discret. Optim..

Vertex Cover Meets Scheduling

G. Woeginger, L. Epstein, Asaf Levin, 2016, Algorithmica.

Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines

Gerhard J. Woeginger, Tjark Vredeveld, Johann Hurink, 2007, WAOA.

Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines

Gerhard J. Woeginger, Tjark Vredeveld, Johann Hurink, 2006, Electron. Notes Discret. Math..

Resource augmentation for online bounded space bin packing

János Csirik, Gerhard J. Woeginger, G. Woeginger, 2000, J. Algorithms.

Off-line temporary tasks assignment

Gerhard J. Woeginger, Yossi Azar, Jirí Sgall, 1999, Theor. Comput. Sci..

Approximation algorithms for the multiprocessor open shop scheduling problem

Gerhard J. Woeginger, Petra Schuurman, G. Woeginger, 1999, Oper. Res. Lett..

heuristics for parallel machine scheduling with delivery times

Gerhard J. Woeginger, G. Woeginger, 1994, Acta Informatica.

A new on-line scheduling heuristic

G. Woeginger, 1993 .

A Tight Bound for 3-Partitioning

Gerhard J. Woeginger, Hans Kellerer, G. Woeginger, 1993, Discret. Appl. Math..

An On-Line Scheduling Heuristic With Better Worst Case Ratio Than Graham's List Scheduling

Gerhard J. Woeginger, Gábor Galambos, G. Woeginger, 1993, SIAM J. Comput..

A heuristic for preemptive scheduling with set-up times

Gerhard J. Woeginger, Zhongliang Yu, G. Woeginger, 1992, Computing.

Makespan minimization in preemptive two machine job shops

Gerhard J. Woeginger, Sergey V. Sevastianov, G. Woeginger, 2007, Computing.

Formulations, Relaxations, Approximations, and Gaps in the World of Scheduling

Gerhard J. Woeginger, G. Woeginger, 2005 .

Non-Preemptive Tree Packing

Gerhard J. Woeginger, Stefan Lendl, Lasse Wulf, 2022, Algorithmica.

How to Put Through Change in Collective Binary Decisions

N. Alon, G. Woeginger, R. Niedermeier, 2013 .

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

David Parker, Armin Biere, Wen Gao, 2020, TACAS.

Approximation Algorithms for Scheduling Malleable Tasks Under Precedence Constraints

RENAUD LEPÈRE, DENIS TRYSTRAM, GERHARD J. WOEGINGER, 2001, Int. J. Found. Comput. Sci..

Finding large degree-anonymous subgraphs is hard

Gerhard J. Woeginger, Robert Bredereck, Sepp Hartung, 2016, Theor. Comput. Sci..

The one-dimensional Euclidean domain: finitely many obstructions are not enough

Kirk Pruhs, Gerhard J. Woeginger, Jiehua Chen, 2015, Soc. Choice Welf..

Good Things Come to Those Who Swap Objects on Paths pdf

Gerhard J. Woeginger, Vincent Froese, Matthias Bentert, 2019, ArXiv.

The complexity of economic equilibria for house allocation markets

Gerhard J. Woeginger, Martin Skutella, Sándor P. Fekete, 2003, Inf. Process. Lett..

Associativity of recurrence multiplication

Gerhard J. Woeginger, Robert F. Tichy, Peter J. Grabner, 1994 .

Paths and cycles in colored graphs

Gerhard J. Woeginger, Shenggui Zhang, Hajo Broersma, 2001, Australas. J Comb..

Minimizing Makespan and Preemption Costs on a System of Uniform Machines

Gerhard J. Woeginger, Hadas Shachnai, Tami Tamir, 2002, ESA.

Tight bounds for break minimization in tournament scheduling

Gerhard J. Woeginger, Andries E. Brouwer, Gerhard F. Post, 2008, J. Comb. Theory, Ser. A.

Tight bounds for break minimization

Gerhard J. Woeginger, Andries E. Brouwer, Gerhard F. Post, 2007 .

The reconstruction of polyominoes from their orthogonal projections

Gerhard J. Woeginger, G. Woeginger, 2001, Inf. Process. Lett..

More About Subcolorings

Gerhard J. Woeginger, Jaroslav Nesetril, Fedor V. Fomin, 2002, Computing.

Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult

Gerhard J. Woeginger, Fedor V. Fomin, Jan Kratochvíl, 2006, Algorithmica.

Scheduling Two Agents on a Single Machine: A Parameterized Analysis of NP-hard Problems pdf

Gerhard J. Woeginger, Dvir Shabtay, Danny Hermelin, 2017, Omega.

Core Stability in Hedonic Coalition Formation

Gerhard J. Woeginger, G. Woeginger, 2012, SOFSEM.

On the complexity of function learning

Gerhard J. Woeginger, Philip M. Long, Peter Auer, 1993, COLT '93.

Banks winners in tournaments are difficult to recognize

Gerhard J. Woeginger, G. Woeginger, 2003, Soc. Choice Welf..

On-line scheduling of unit time jobs with rejection: minimizing the total completion time

Gerhard J. Woeginger, Leah Epstein, John Noga, 2002, Oper. Res. Lett..

Polynomial time approximation algorithms for machine scheduling: ten open problems

Gerhard J. Woeginger, Petra Schuurman, G. Woeginger, 1999 .

Scheduling with Time-Dependent Execution Times

Gerhard J. Woeginger, G. Woeginger, 1995, Inf. Process. Lett..

Minimum-cost strong network orientation problems : classification, complexity, and algorithms

Gerhard J. Woeginger, Rainer E. Burkard, Bettina Klinz, 1999 .

Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh

Gerhard J. Woeginger, Murat Firat, G. Woeginger, 2011, Oper. Res. Lett..

Foundations of Software Science and Computation Structures

Jean Goubault-Larrecq, Wen Gao, Gerhard Woeginger, 2019, Lecture Notes in Computer Science.

Planar 3-dimensional assignment problems with Monge-like cost arrays pdf

Gerhard J. Woeginger, Ante Custic, Bettina Klinz, 2014, ArXiv.

String execution time for finite languages: Max is easy, min is hard

Gerhard J. Woeginger, Rong Su, G. Woeginger, 2011, Autom..

Two hardness results for core stability in hedonic coalition formation games

Gerhard J. Woeginger, Vladimir G. Deineko, V. Deineko, 2013, Discret. Appl. Math..

Drawing graphs in the plane with high resolution

Gerhard J. Woeginger, Michael Kaufmann, Antonios Symvonis, 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

Uncapacitated single and multiple allocation p-hub center problems

Gerhard J. Woeginger, Andreas T. Ernst, Horst W. Hamacher, 2009, Comput. Oper. Res..

Faster algorithms for computing power indices in weighted voting games

Gerhard J. Woeginger, Bettina Klinz, G. Woeginger, 2005, Math. Soc. Sci..

Shelf Algorithms for On-Line Strip Packing

Gerhard J. Woeginger, János Csirik, G. Woeginger, 1997, Inf. Process. Lett..

Preemptive scheduling with rejection (Algorithm Engineering as a New Paradigm)

Han Hoogeveen, Gerhard J. Woeginger, Martin Skutella, 2001 .

An axiomatic characterization of the Hirsch-index

Gerhard J. Woeginger, G. Woeginger, 2008, Math. Soc. Sci..

Generalizations of Egghe's g-index

Gerhard J. Woeginger, G. Woeginger, 2009, J. Assoc. Inf. Sci. Technol..

A new family of scientific impact measures: The generalized Kosmulski-indices

Gerhard J. Woeginger, Vladimir G. Deineko, V. Deineko, 2009, Scientometrics.

An axiomatic analysis of Egghe's g-index

Gerhard J. Woeginger, G. Woeginger, 2008, J. Informetrics.

A symmetry axiom for scientific impact indices

Gerhard J. Woeginger, G. Woeginger, 2008, J. Informetrics.

Assigning chain-like tasks on a chain-like network of computers

David Eppstein, Gerhard J. Woeginger, D. Eppstein, 2001, ACM-SIAM Symposium on Discrete Algorithms.

Fine-grained Complexity Analysis of Two Classic TSP Variants pdf

Gerhard J. Woeginger, Mark de Berg, Kevin Buchin, 2016, ICALP.

Unweighted Coalitional Manipulation under the Borda Rule Is NP-Hard

Gerhard J. Woeginger, Rolf Niedermeier, Nadja Betzler, 2011, IJCAI.

Computing and Software Science: State of the Art and Perspectives

Bernhard Steffen, Gerhard Woeginger, G. Woeginger, 2019, Computing and Software Science.

Decomposition of integer matrices and multileaf collimator sequencing

Gerhard J. Woeginger, Horst W. Hamacher, Matthias Ehrgott, 2005, Discret. Appl. Math..

How Cinderella Won the Bucket Game (and Lived Happily Ever After)

Gerhard J. Woeginger, Cor A. J. Hurkens, G. Woeginger, 2011 .

Divorcing Made Easy

Kirk Pruhs, Gerhard J. Woeginger, K. Pruhs, 2012, FUN.

A Lower Bound for Cake Cutting

Gerhard J. Woeginger, Jirí Sgall, G. Woeginger, 2003, ESA.

An Approximation Scheme For Cake Division With A Linear Number Of Cuts

Jiří Sgall*, Gerhard J. Woeginger, G. Woeginger, 2002, Comb..

How to cut a cake almost fairly

Gerhard J. Woeginger, Leen Stougie, Maarten Lipmann, 2002, SODA '02.

The multi-stripe travelling salesman problem

Gerhard J. Woeginger, Vladimir G. Deineko, Eranda Çela, 2016, Annals of Operations Research.

Scheduling of pipelined operator graphs

G. Woeginger, H. Bodlaender, P. Schuurman, 2012, J. Sched..

Open problems around exact algorithms

Gerhard J. Woeginger, G. Woeginger, 2008, Discret. Appl. Math..

Local search for the minimum label spanning tree problem with bounded color classes

Gerhard J. Woeginger, Jérôme Monnot, Tobias Brüggemann, 2003, Oper. Res. Lett..

Well-solvable cases of the QAP with block-structured matrices

Gerhard J. Woeginger, Vladimir G. Deineko, Eranda Çela, 2014, Discret. Appl. Math..

Some Geometric Clustering Problems

Gerhard J. Woeginger, Ulrich Pferschy, Rüdiger Rudolf, 1994, Nord. J. Comput..

On the robust assignment problem under a fixed number of cost scenarios

Gerhard J. Woeginger, Vladimir G. Deineko, V. Deineko, 2006, Oper. Res. Lett..

A solvable case of the quadratic assignment problem

Gerhard J. Woeginger, Vladimir G. Deineko, V. Deineko, 1998, Oper. Res. Lett..

Group Activity Selection Problem

Gerhard J. Woeginger, Edith Elkind, Jérôme Lang, 2012, WINE.

Partitioning graphs into connected parts

Gerhard J. Woeginger, Pim van 't Hof, Daniël Paulusma, 2009, Theor. Comput. Sci..

The geometric maximum traveling salesman problem

Gerhard J. Woeginger, Sándor P. Fekete, Alexander I. Barvinok, 2002, JACM.

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

Gerhard J. Woeginger, Rainer E. Burkard, Jack A. A. van der Veen, 1998, SIAM Rev..

The Maximum Traveling Salesman Problem Under Polyhedral Norms

Gerhard J. Woeginger, David S. Johnson, Alexander Barvinok, 1998, IPCO.

Minimum-link paths among obstacles in the plane

Joseph S. B. Mitchell, Gerhard J. Woeginger, Günter Rote, 1990, SCG '90.

Geometric Clusterings

Gerhard J. Woeginger, Günter Rote, Vasilis Capoyleas, 1991, J. Algorithms.

A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines

Gerhard J. Woeginger, Martin Skutella, G. Woeginger, 2000, Math. Oper. Res..

Approximability and nonapproximability results for minimizing total flow time on a single machine

G. Woeginger, H. Kellerer, T. Tautenhahn, 1996, STOC '96.

A New Efficiently Solvable Special Case of the Three-Dimensional Axial Bottleneck Assignment Problem

Gerhard J. Woeginger, Bettina Klinz, G. Woeginger, 1995, Combinatorics and Computer Science.

The Stock Size Problem

Gerhard J. Woeginger, Franz Rendl, Hans Kellerer, 1998, Oper. Res..

G. Rinaldi, G. Woeginger, A. Mahjoub, 2015, Mathematical Programming.

A historical note on the complexity of scheduling problems

N. Megiddo, G. Nemhauser, P. Marcotte, 2022, Oper. Res. Lett..

A comment on scheduling two parallel machines with capacity constraints

Gerhard J. Woeginger, G. Woeginger, 2005, Discret. Optim..

The cone of Monge matrices: Extremal rays and applications

Gerhard J. Woeginger, Rüdiger Rudolf, G. Woeginger, 1995, Math. Methods Oper. Res..

On the Recognition of Permuted Bottleneck Monge Matrices

Gerhard J. Woeginger, Bettina Klinz, Rüdiger Rudolf, 1993, ESA.

Travelling salesman paths on Demidenko matrices

V. Deineko, E. Çela, G. Woeginger, 2020, Discrete Applied Mathematics.

Another Look at the Shoelace TSP: The Case of Very Old Shoes

Gerhard J. Woeginger, Vladimir G. Deineko, V. Deineko, 2014, FUN.

The Northwest corner rule revisited

Gerhard J. Woeginger, Bettina Klinz, G. Woeginger, 2011, Discret. Appl. Math..

Sequencing jobs that require common resources on a single machine: A solvable case of the TSP

Gerhard J. Woeginger, Shuzhong Zhang, Jack A. A. van der Veen, 1998, Math. Program..

Well-solvable special cases of the TSP : a survey

Gerhard J. Woeginger, Vladimir G. Deineko, Re Burkhard, 1996 .

Committee Selection with Intraclass and Interclass Synergies

Gerhard J. Woeginger, Nimrod Talmon, Rani Izsak, 2018, AAAI.

Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges pdf

Piotr Faliszewski, Gerhard J. Woeginger, Rolf Niedermeier, 2014, ArXiv.

Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs

Gerhard J. Woeginger, Dvir Shabtay, Danny Hermelin, 2015, IPEC.

Are there any nicely structured preference profiles nearby?

Gerhard J. Woeginger, Robert Bredereck, Jiehua Chen, 2013, Math. Soc. Sci..

Vote trading and subset sums

Gerhard J. Woeginger, Vincent Merlin, Sebastian Bervoets, 2015, Oper. Res. Lett..

The computational complexity of graph contractions I: Polynomially solvable and NP‐complete cases

Gerhard J. Woeginger, Daniël Paulusma, Asaf Levin, 2008, Networks.

Timeline-based planning over dense temporal domains

Gerhard J. Woeginger, Angelo Montanari, Adriano Peron, 2020, Theor. Comput. Sci..

Cinderella versus the Wicked Stepmother

Gerhard J. Woeginger, Hans Zantema, Frank Staals, 2012, IFIP TCS.

Integer Programming and Combinatoral Optimization - 15th International Conference, IPCO 2011, New York, NY, USA, June 15-17, 2011. Proceedings

Gerhard J. Woeginger, Oktay Günlük, G. Woeginger, 2011, IPCO.

Unbounded knapsack problems with arithmetic weight sequences

Gerhard J. Woeginger, Vladimir G. Deineko, V. Deineko, 2011, Eur. J. Oper. Res..

Quadratic programming and combinatorial minimum weight product problems

Gerhard J. Woeginger, Walter Kern, W. Kern, 2006, Math. Program..

The mathematics of playing golf, or: a new class of difficult non-linear mixed integer programs

Gerhard J. Woeginger, Giovanni Rinaldi, Ulrich Voigt, 2002, Math. Program..

Bilevel programming and the separation problem

Gerhard J. Woeginger, Andrea Lodi, Ted K. Ralphs, 2013, Mathematical Programming.

How to Put Through Your Agenda in Collective Binary Decisions

Noga Alon, Gerhard J. Woeginger, Rolf Niedermeier, 2013, TEAC.

A hardness result for core stability in additive hedonic games

Gerhard J. Woeginger, G. Woeginger, 2013, Math. Soc. Sci..

The exact LPT-bound for maximizing the minimum completion time

Gerhard J. Woeginger, János Csirik, Hans Kellerer, 1992, Oper. Res. Lett..

Exact algorithms for NP-hard problems

G. Woeginger, 2003 .

Integer Programming and Combinatorial Optimization

Gerhard J. Woeginger, Gérard Cornuéjols, Rainer E. Burkard, 2001, Lecture Notes in Computer Science.

More About Subcolorings

Gerhard J. Woeginger, Jaroslav Nesetril, Fedor V. Fomin, 2002, Computing.

More about Subcolorings (Extended Abstract)

Gerhard J. Woeginger, Jaroslav Nesetril, Fedor V. Fomin, 2002 .

Combinatorial Approximation Algorithms (Dagstuhl Seminar 9734)

Gerhard J. Woeginger, Yuval Rabani, David B. Shmoys, 2021 .

Space and Time Complexity of Exact Algorithms: Some Open Problems (Invited Talk)

Gerhard J. Woeginger, G. Woeginger, 2004, IWPEC.

On-Line Scheduling of Jobs with Fixed Start and End Times

Gerhard J. Woeginger, G. Woeginger, 1994, Theor. Comput. Sci..

G. Rinaldi, G. Woeginger, A. Mahjoub, 2015, Mathematical Programming.

A faster algorithm for the continuous bilevel knapsack problem

Dennis Fischer, Gerhard J. Woeginger, G. Woeginger, 2020, Oper. Res. Lett..

Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points

Mark de Berg, Marcel Roeloffzen, André van Renssen, 2017, ISAAC.

Network-Based Vertex Dissolution

Gerhard J. Woeginger, Rolf Niedermeier, René van Bevern, 2014, SIAM J. Discret. Math..

Motion Planning with Pulley, Rope, and Baskets

Gerhard J. Woeginger, Christian Eggermont, G. Woeginger, 2013, Theory of Computing Systems.

Roll cutting in the curtain industry, or: A well-solvable allocation problem

Gerhard J. Woeginger, Arianna Alfieri, Steef L. van de Velde, 2007, Eur. J. Oper. Res..

Roll Cutting in the Curtain Industry

Gerhard J. Woeginger, Arianna Alfieri, Steef L. van de Velde, 2005, ESA.

Approximation schemes for a class of subset selection problems

Kirk Pruhs, Gerhard J. Woeginger, K. Pruhs, 2004, Theor. Comput. Sci..

A note on the bottleneck graph partition problem

Gerhard J. Woeginger, Bettina Klinz, G. Woeginger, 1999, Networks.

Investigations on the step-based research indices of Chambers and Miller

Gerhard J. Woeginger, G. Woeginger, 2014, J. Informetrics.

Geometric versions of the three-dimensional assignment problem under general norms

Gerhard J. Woeginger, Ante Custic, Bettina Klinz, 2015, Discret. Optim..

Minimizing Makespan and Preemption Costs on a System of Uniform Machines

Gerhard J. Woeginger, Hadas Shachnai, Tami Tamir, 2005, Algorithmica.

Some Easy and Some Not so Easy Geometric Optimization Problems

Gerhard J. Woeginger, G. Woeginger, 2018, WAOA.

Angle-Restricted Tours in the Plane

G. Woeginger, Sándor P. Fekete, 1997, Comput. Geom..

Backbone colorings for graphs: Tree and path backbones

Gerhard J. Woeginger, Petr A. Golovach, Fedor V. Fomin, 2007, J. Graph Theory.

Backbone Colorings for Networks

Gerhard J. Woeginger, Petr A. Golovach, Fedor V. Fomin, 2003, WG.

Random Redundant Storage in Disk Arrays: Complexity of Retrieval Problems

Frits C. R. Spieksma, Gerhard J. Woeginger, Jan H. M. Korst, 2003, IEEE Trans. Computers.

Approximability and in-approximability results for no-wait shop scheduling

Gerhard J. Woeginger, Maxim Sviridenko, G. Woeginger, 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

Approximation schemes-a tutorial

Gerhard J. Woeginger, Petra Schuurman, G. Woeginger, 2001 .

Getting the best response for your erg

Kirk Pruhs, Gerhard J. Woeginger, Patchrawat Uthaisombut, 2004, TALG.

Some Comments on Sequencing with Controllable Processing Times

Han Hoogeveen, Gerhard J. Woeginger, G. Woeginger, 2002, Computing.

Charlemagne's challenge: The periodic latency problem

Frits C. R. Spieksma, Gerhard J. Woeginger, Sofie Coene, 2011, 2009 IEEE International Conference on Industrial Engineering and Engineering Management.

The trouble with the second quantifier

Gerhard J. Woeginger, G. Woeginger, 2021, 4OR.

On-line scheduling on a single machine: maximizing the number of early jobs

Han Hoogeveen, Gerhard J. Woeginger, Chris N. Potts, 2000, Oper. Res. Lett..

Combinatorial Algorithms

G. Woeginger, L. Gąsieniec, Wen Gao, 2011 .

Simple But Efficient Approaches for the Collapsing Knapsack Problem

Gerhard J. Woeginger, David Pisinger, Ulrich Pferschy, 1997, Discret. Appl. Math..

Permuting Matrices to Avoid Forbidden Submatrices

Gerhard J. Woeginger, Bettina Klinz, Rüdiger Rudolf, 1995, Discret. Appl. Math..

A note on the complexity of the transportation problem with a permutable demand vector

Gerhard J. Woeginger, Bettina Klinz, Mihály Hujter, 1999, Math. Methods Oper. Res..

Well-Solvable Special Cases of the TSP: A Survey

R. Burkard, G. Woeginger, Diskrete Optimierung, 1995 .

Seventeen lines and one-hundred-and-one points

Gerhard J. Woeginger, G. Woeginger, 2003, Theoretical Computer Science.

Graph Colorings (Dagstuhl Seminar 03391)

Gerhard J. Woeginger, Jaroslav Nesetril, J. Nesetril, 2021 .

A characterization of the single-crossing domain

Gerhard J. Woeginger, Robert Bredereck, Jiehua Chen, 2013, Soc. Choice Welf..

Monge strikes again: optimal placement of web proxies in the internet

Gerhard J. Woeginger, G. Woeginger, 2000, Oper. Res. Lett..

Three-dimensional Axial Assignment Problems with Decomposable Cost Coefficients

Gerhard J. Woeginger, Rainer E. Burkard, Rüdiger Rudolf, 1996, Discret. Appl. Math..

Integer Programming and Combinatorial Optimization

J. Hartmanis, G. Woeginger, G. Goos, 2013, Lecture Notes in Computer Science.

Precedence-constrained scheduling problems parameterized by partial order width

Gerhard J. Woeginger, Christian Komusiewicz, René van Bevern, 2016, DOOR.

On-line scheduling on a single machine: minimizing the total completion time

Gerhard J. Woeginger, Amos Fiat, A. Fiat, 1999, Acta Informatica.

Optimal on-line algorithms for variable-sized bin covering

Gerhard J. Woeginger, Guochuan Zhang, G. Woeginger, 1999, Oper. Res. Lett..

The two-dimensional cutting stock problem revisited

Gerhard J. Woeginger, Steven S. Seiden, G. Woeginger, 2005, Math. Program..

The bipartite travelling salesman problem: A pyramidally solvable case

V. Deineko, G. Woeginger, Bettina Klinz, 2023, Oper. Res. Lett..