Gerhard J. Woeginger
Orcid: 0000-0001-8816-2693Affiliations:
- RWTH Aachen University, Department of Computer Science, Germany
- Eindhoven University of Technology, Department of Mathematics and Computer Science, The Netherlands
According to our database1,
Gerhard J. Woeginger
authored at least 391 papers
between 1988 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
-
on win.tue.nl
-
on isni.org
-
on dl.acm.org
On csauthors.net:
Bibliography
2023
Oper. Res. Lett., November, 2023
Hardness of flow time minimization in a crossdock with a single door and asymmetric handover relations.
Oper. Res. Lett., May, 2023
A Linear Time Algorithm for Linearizing Quadratic and Higher-Order Shortest Path Problems.
Proceedings of the Integer Programming and Combinatorial Optimization, 2023
2022
2021
ACM Trans. Algorithms, 2021
Discret. Appl. Math., 2021
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021
2020
Oper. Res. Lett., 2020
Non-Monochromatic and Conflict-Free Colorings on Tree Spaces and Planar Network Spaces.
Algorithmica, 2020
2019
Proceedings of the Computing and Software Science - State of the Art and Perspectives, 2019
Theor. Comput. Sci., 2019
Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points.
Int. J. Comput. Geom. Appl., 2019
2018
Theory Comput. Syst., 2018
Int. J. Game Theory, 2018
New special cases of the Quadratic Assignment Problem with diagonally structured coefficient matrices.
Eur. J. Oper. Res., 2018
Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018
Timeline-Based Planning over Dense Temporal Domains with Trigger-less Rules is NP-Complete.
Proceedings of the 19th Italian Conference on Theoretical Computer Science, 2018
Non-monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018
2017
Soc. Choice Welf., 2017
Scheduling Two Agents on a Single Machine: A Parameterized Analysis of NP-hard Problems.
CoRR, 2017
CoRR, 2017
Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017
2016
Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016
Proceedings of the Discrete Optimization and Operations Research, 2016
2015
ACM Trans. Economics and Comput., 2015
Inf. Process. Lett., 2015
Discret. Optim., 2015
Discret. Appl. Math., 2015
Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015
Proceedings of the Combinatorial Optimization and Applications, 2015
2014
SIAM J. Optim., 2014
J. Informetrics, 2014
J. Artif. Intell. Res., 2014
Discret. Optim., 2014
CoRR, 2014
Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges.
CoRR, 2014
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014
Proceedings of the Fun with Algorithms - 7th International Conference, 2014
2013
Oper. Res. Lett., 2013
Math. Soc. Sci., 2013
Discret. Appl. Math., 2013
4OR, 2013
Proceedings of the SOFSEM 2013: Theory and Practice of Computer Science, 2013
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013
Proceedings of the Integer Programming and Combinatorial Optimization, 2013
2012
Oper. Res. Lett., 2012
Math. Methods Oper. Res., 2012
Guest Editorial to the special issue "Operations Research in Health Care" (EURO XXIII, July 5-8, 2009, Bonn).
Eur. J. Oper. Res., 2012
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012
Proceedings of the Theoretical Computer Science, 2012
Proceedings of the Fun with Algorithms - 6th International Conference, 2012
2011
Oper. Res. Lett., 2011
Eur. J. Oper. Res., 2011
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011
Proceedings of the Reachability Problems - 5th International Workshop, 2011
Proceedings of the IJCAI 2011, 2011
Proceedings of the Algorithms - ESA 2011, 2011
2010
SIAM J. Discret. Math., 2010
Oper. Res. Lett., 2010
The approximability of three-dimensional assignment problems with bottleneck objective.
Optim. Lett., 2010
Discret. Optim., 2010
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010
2009
Theor. Comput. Sci., 2009
Scientometrics, 2009
A comment on parallel-machine scheduling under a grade of service provision to minimize makespan.
Inf. Process. Lett., 2009
Comput. Oper. Res., 2009
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009
2008
Multigraph realizations of degree sequences: Maximization is easy, minimization is hard.
Oper. Res. Lett., 2008
The computational complexity of graph contractions II: Two tough polynomially solvable cases.
Networks, 2008
The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases.
Networks, 2008
J. Comb. Theory, Ser. A, 2008
Four Non-Deterministic Programming Exercises.
Bull. EATCS, 2008
The Freudenthal Problem and its Ramifications (Part III).
Bull. EATCS, 2008
2007
Theor. Comput. Sci., 2007
Oper. Res. Lett., 2007
Math. Program., 2007
Eur. J. Oper. Res., 2007
The Freudenthal Problem and its Ramifications (Part II).
Bull. EATCS, 2007
A polynomial time equivalence between DNA sequencing and the exact perfect matching problem.
Discret. Optim., 2007
Discret. Appl. Math., 2007
Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines.
Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007
2006
Oper. Res. Lett., 2006
Oper. Res. Lett., 2006
Math. Program., 2006
Int. J. Uncertain. Fuzziness Knowl. Based Syst., 2006
Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines.
Electron. Notes Discret. Math., 2006
Some Problems around Traveling Salesmen, Dart Boards, and Euro-coins.
Bull. EATCS, 2006
The Freudenthal Problem and its Ramifications (Part I).
Bull. EATCS, 2006
Discret. Optim., 2006
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult.
Algorithmica, 2006
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006
2005
Math. Soc. Sci., 2005
Discret. Optim., 2005
Discret. Appl. Math., 2005
Algorithmica, 2005
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005
Proceedings of the Discrete Geometry for Computer Imagery, 12th International Conference, 2005
Proceedings of the Exact Algorithms and Fixed-Parameter Tractability, 24.-27. July 2005, 2005
Proceedings of the Exact Algorithms and Fixed-Parameter Tractability, 24.-27. July 2005, 2005
2004
Oper. Res. Lett., 2004
Project scheduling with irregular costs: complexity, approximability, and algorithms.
Acta Informatica, 2004
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004
Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004
Proceedings of the Approximation, 2004
2003
IEEE Trans. Computers, 2003
Oper. Res. Lett., 2003
Oper. Res. Lett., 2003
Math. Soc. Sci., 2003
A note on the complexity of determining optimal strategies in games with common payoffs.
Math. Methods Oper. Res., 2003
Inf. Process. Lett., 2003
Inf. Process. Lett., 2003
Eur. J. Oper. Res., 2003
On the approximability of average completion time scheduling under precedence constraints.
Discret. Appl. Math., 2003
Discret. Appl. Math., 2003
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003
Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data.
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003
2002
Oper. Res. Lett., 2002
Oper. Res. Lett., 2002
Oper. Res. Lett., 2002
On-line scheduling of unit time jobs with rejection: minimizing the total completion time.
Oper. Res. Lett., 2002
The mathematics of playing golf, or: a new class of difficult non-linear mixed integer programs.
Math. Program., 2002
Inf. Process. Lett., 2002
Approximation Algorithms for Scheduling Malleable Tasks Under Precedence Constraints.
Int. J. Found. Comput. Sci., 2002
Open problems in the theory of scheduling.
Bull. EATCS, 2002
Acta Cybern., 2002
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002
Proceedings of the Algorithm Theory, 2002
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002
Proceedings of the Algorithms, 2002
2001
Oper. Res. Lett., 2001
Oper. Res. Lett., 2001
Oper. Res. Lett., 2001
Inf. Process. Lett., 2001
INFORMS J. Comput., 2001
Electron. Colloquium Comput. Complex., 2001
Electron. Colloquium Comput. Complex., 2001
Discret. Appl. Math., 2001
Discret. Appl. Math., 2001
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001
Proceedings of the Combinatorial Optimization, 2001
2000
A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem.
Theor. Comput. Sci., 2000
Oper. Res. Lett., 2000
Oper. Res. Lett., 2000
Oper. Res. Lett., 2000
A study of exponential neighborhoods for the Travelling Salesman Problem and for the Quadratic Assignment Problem.
Math. Program., 2000
A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines.
Math. Oper. Res., 2000
When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
INFORMS J. Comput., 2000
Discret. Appl. Math., 2000
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000
1999
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine.
SIAM J. Comput., 1999
Oper. Res. Lett., 1999
A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources.
Oper. Res. Lett., 1999
Minimum-cost strong network orientation problems: Classification, complexity, and algorithms.
Networks, 1999
A note on the complexity of the transportation problem with a permutable demand vector.
Math. Methods Oper. Res., 1999
J. Comb. Optim., 1999
An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine.
INFORMS J. Comput., 1999
Discret. Appl. Math., 1999
Acta Informatica, 1999
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999
Proceedings of the Automata, 1999
1998
SIAM Rev., 1998
One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs.
Oper. Res. Lett., 1998
Sequencing jobs that require common resources on a single machine: A solvable case of the TSP.
Math. Program., 1998
Math. Program., 1998
The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases.
Math. Program., 1998
J. Comb. Optim., 1998
Algorithmica, 1998
Acta Cybern., 1998
Proceedings of the Integer Programming and Combinatorial Optimization, 1998
1997
A polynomial-time approximation scheme for maximizing the minimum machine completion time.
Oper. Res. Lett., 1997
Oper. Res. Lett., 1997
Inf. Process. Lett., 1997
Discret. Appl. Math., 1997
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997
1996
Discret. Appl. Math., 1996
Acta Informatica, 1996
Proceedings of the Algorithms, 1996
1995
Math. Methods Oper. Res., 1995
Math. Methods Oper. Res., 1995
Math. Methods Oper. Res., 1995
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995
A New Efficiently Solvable Special Case of the Three-Dimensional Axial Bottleneck Assignment Problem.
Proceedings of the Combinatorics and Computer Science, 1995
Proceedings of the Combinatorics and Computer Science, 1995
1994
Some Geometric Clustering Problems.
Nord. J. Comput., 1994
Inf. Process. Lett., 1994
Acta Informatica, 1994
1993
An On-Line Scheduling Heuristic With Better Worst Case Ratio Than Graham's List Scheduling.
SIAM J. Comput., 1993
Computing the optimum stock size.
Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993
Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993
1992
The Complexity of Detecting Crossingfree Configurations in the Plane
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992
The Disjoint Cliques Problem
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992
Scheduling with Incompatible Jobs
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992
Oper. Res. Lett., 1992
1991
1990
Inf. Process. Lett., 1990
On the reconstruction of simple polygons.
Bull. EATCS, 1990
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990
1988
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1988