Gerhard J. Woeginger

Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginger: Fully decomposable split graphs. Eur. J. Comb. 34(3): 567-575 (2013)

Gerhard J. Woeginger: A hardness result for core stability in additive hedonic games. Mathematical Social Sciences 65(2): 101-104 (2013)

Alberto Caprara, Margarida Carvalho, Andrea Lodi, Gerhard J. Woeginger: A Complexity and Approximability Study of the Bilevel Knapsack Problem. IPCO 2013: 98-109

Gerhard J. Woeginger: Core Stability in Hedonic Coalition Formation. SOFSEM 2013: 33-50

Bastian Katz, Ignaz Rutter, Gerhard J. Woeginger: An algorithmic study of switch graphs. Acta Inf. 49(5): 295-312 (2012)

Marek Chrobak, Gerhard J. Woeginger, Kazuhisa Makino, Haifeng Xu: Caching Is Hard - Even in the Fault Model. Algorithmica 63(4): 781-794 (2012)

Christoph Dürr, Maurice Queyranne, Frits C. R. Spieksma, Fabrice Talla Nobibon, Gerhard J. Woeginger: The interval ordering problem. Discrete Applied Mathematics 160(7-8): 1094-1103 (2012)

Erwin Pesch, Gerhard J. Woeginger: Guest Editorial to the special issue "Operations Research in Health Care" (EURO XXIII, July 5-8, 2009, Bonn). European Journal of Operational Research 219(3): 489-490 (2012)

Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger: The x-and-y-axes travelling salesman problem. European Journal of Operational Research 223(2): 333-345 (2012)

Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger: Between a rock and a hard place: the two-to-one assignment problem. Math. Meth. of OR 76(2): 223-237 (2012)

Cor A. J. Hurkens, Andrea Lodi, Silvano Martello, Michele Monaci, Gerhard J. Woeginger: Complexity and approximation of an area packing problem. Optimization Letters 6(1): 1-9 (2012)

Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger: Another well-solvable case of the QAP: Maximizing the job completion time variance. Oper. Res. Lett. 40(5): 356-359 (2012)

Hans L. Bodlaender, Petra Schuurman, Gerhard J. Woeginger: Scheduling of pipelined operator graphs. J. Scheduling 15(3): 323-332 (2012)

Péter Csorba, Cor A. J. Hurkens, Gerhard J. Woeginger: The Alcuin Number of a Graph and Its Connections to the Vertex Cover Number. SIAM Review 54(1): 141-154 (2012)

Rudolf Fleischer, Gerhard J. Woeginger: An algorithmic analysis of the Honey-Bee game. Theor. Comput. Sci. 452: 75-87 (2012)

Kirk Pruhs, Gerhard J. Woeginger: Divorcing Made Easy. FUN 2012: 305-314

Marijke H. L. Bodlaender, Cor A. J. Hurkens, Vincent J. J. Kusters, Frank Staals, Gerhard J. Woeginger, Hans Zantema: Cinderella versus the Wicked Stepmother. IFIP TCS 2012: 57-71

Gerhard J. Woeginger: Transportation under Nasty Side Constraints. MFCS 2012: 61-62

Christian Eggermont, Gerhard J. Woeginger: Motion planning with pulley, rope, and baskets. STACS 2012: 374-383

Leah Epstein, Asaf Levin, Gerhard J. Woeginger: The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases. WG 2012: 114-125

Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard J. Woeginger: Group Activity Selection Problem. WINE 2012: 156-169

Dimitrios M. Thilikos, Gerhard J. Woeginger (Eds.): Parameterized and Exact Computation - 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings. Lecture Notes in Computer Science 7535, Springer 2012, isbn 978-3-642-33292-0

Gerhard J. Woeginger: Core stability in hedonic coalition formation. CoRR abs/1212.2236 (2012)

Rong Su, Gerhard J. Woeginger: String execution time for finite languages: Max is easy, min is hard. Automatica 47(10): 2326-2329 (2011)

Zdenek Ryjácek, Gerhard J. Woeginger, Liming Xiong: Hamiltonian index is NP-complete. Discrete Applied Mathematics 159(4): 246-250 (2011)

Bettina Klinz, Gerhard J. Woeginger: The Northwest corner rule revisited. Discrete Applied Mathematics 159(12): 1284-1289 (2011)

Andreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger: Paths, trees and matchings under disjunctive constraints. Discrete Applied Mathematics 159(16): 1726-1735 (2011)

Eranda Çela, Nina S. Schmuck, Shmuel Wimer, Gerhard J. Woeginger: The Wiener maximum quadratic assignment problem. Discrete Optimization 8(3): 411-416 (2011)

Vladimir G. Deineko, Gerhard J. Woeginger: Unbounded knapsack problems with arithmetic weight sequences. European Journal of Operational Research 213(2): 384-387 (2011)

Sofie Coene, Frits C. R. Spieksma, Gerhard J. Woeginger: Charlemagne's Challenge: The Periodic Latency Problem. Operations Research 59(3): 674-683 (2011)

Leah Epstein, Asaf Levin, Gerhard J. Woeginger: Graph coloring with rejection. J. Comput. Syst. Sci. 77(2): 439-447 (2011)

Murat Firat, Gerhard J. Woeginger: Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh. Oper. Res. Lett. 39(1): 32-35 (2011)

Vladimir G. Deineko, Gerhard J. Woeginger: A well-solvable special case of the bounded knapsack problem. Oper. Res. Lett. 39(2): 118-120 (2011)

Marek Chrobak, Jiri Sgall, Gerhard J. Woeginger: Two-Bounded-Space Bin Packing Revisited. ESA 2011: 263-274

Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger: Domination When the Stars Are Out. ICALP (1) 2011: 462-473

Nadja Betzler, Rolf Niedermeier, Gerhard J. Woeginger: Unweighted Coalitional Manipulation under the Borda Rule Is NP-Hard. IJCAI 2011: 55-60

Christian Eggermont, Gerhard J. Woeginger: Reachability and Deadlocking Problems in Multi-stage Scheduling. RP 2011: 153-164

Christian Eggermont, Alexander Schrijver, Gerhard J. Woeginger: Analysis of multi-stage open shop processing systems. STACS 2011: 484-494

Marijke H. L. Bodlaender, Cor A. J. Hurkens, Gerhard J. Woeginger: The Cinderella Game on Holes and Anti-holes. WG 2011: 71-82

Oktay Günlük, Gerhard J. Woeginger (Eds.): Integer Programming and Combinatoral Optimization - 15th International Conference, IPCO 2011, New York, NY, USA, June 15-17, 2011. Proceedings. Lecture Notes in Computer Science 6655, Springer 2011, isbn 978-3-642-20806-5

Rudolf Fleischer, Gerhard J. Woeginger: An Algorithmic Analysis of the Honey-Bee Game. CoRR abs/1102.3025 (2011)

Christian Eggermont, Alexander Schrijver, Gerhard J. Woeginger: Analysis of multi-stage open shop processing systems. CoRR abs/1102.3029 (2011)

Christoph Dürr, Maurice Queyranne, Frits C. R. Spieksma, Fabrice Talla Nobibon, Gerhard J. Woeginger: The interval ordering problem. CoRR abs/1112.0534 (2011)

Gerhard J. Woeginger: An Algorithmic Comparison of Three Scientific Impact Indices. Acta Cybern. 19(3): 661-672 (2010)

Vladimir G. Deineko, Gerhard J. Woeginger: Pinpointing the complexity of the interval min-max regret knapsack problem. Discrete Optimization 7(4): 191-196 (2010)

Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger: The approximability of three-dimensional assignment problems with bottleneck objective. Optimization Letters 4(1): 7-16 (2010)

Gabriella Muratore, Ulrich M. Schwarz, Gerhard J. Woeginger: Parallel machine scheduling with nested job assignment restrictions. Oper. Res. Lett. 38(1): 47-50 (2010)

Adriana Felicia Gabor, Gerhard J. Woeginger: How * not * to solve a Sudoku. Oper. Res. Lett. 38(6): 582-584 (2010)

Péter Csorba, Cor A. J. Hurkens, Gerhard J. Woeginger: The Alcuin Number of a Graph and Its Connections to the Vertex Cover Number. SIAM J. Discrete Math. 24(3): 757-769 (2010)

Marek Chrobak, Gerhard J. Woeginger, Kazuhisa Makino, Haifeng Xu: Caching Is Hard - Even in the Fault Model. ESA (1) 2010: 195-206

Rudolf Fleischer, Gerhard J. Woeginger: An Algorithmic Analysis of the Honey-Bee Game. FUN 2010: 178-189

Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger: The Focus of Attention Problem. SODA 2010: 312-317

Fred van Nijnatten, René Sitters, Gerhard J. Woeginger, Alexander Wolff, Mark de Berg: The Traveling Salesman Problem under Squared Euclidean Distances. STACS 2010: 239-250

Mark de Berg, Fred van Nijnatten, René Sitters, Gerhard J. Woeginger, Alexander Wolff: The Traveling Salesman Problem Under Squared Euclidean Distances. CoRR abs/1001.0236 (2010)

Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger: Domination When the Stars Are Out. CoRR abs/1012.0012 (2010)

Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger: Polygons with inscribed circles and prescribed side lengths. Appl. Math. Lett. 22(5): 704-706 (2009)

Andreas T. Ernst, Horst W. Hamacher, Houyuan Jiang, Mohan Krishnamoorthy, Gerhard J. Woeginger: Uncapacitated single and multiple allocation p-hub center problems. Computers & OR 36(7): 2230-2241 (2009)

John van den Broek, Cor A. J. Hurkens, Gerhard J. Woeginger: Timetabling problems at the TU Eindhoven. European Journal of Operational Research 196(3): 877-885 (2009)

Gerhard J. Woeginger: A comment on parallel-machine scheduling under a grade of service provision to minimize makespan. Inf. Process. Lett. 109(7): 341-342 (2009)

Gerhard J. Woeginger: Generalizations of Egghe's g-index. JASIST 60(6): 1267-1273 (2009)

Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger: The complexity of computing the Muirhead-Dalton distance. Mathematical Social Sciences 57(2): 282-284 (2009)

Gerhard J. Woeginger: Threshold aggregation of multi-graded rankings. Mathematical Social Sciences 58(1): 58-63 (2009)

Christian Eggermont, Cor A. J. Hurkens, Maciej Modelski, Gerhard J. Woeginger: The hardness of train rearrangements. Oper. Res. Lett. 37(2): 80-82 (2009)

Vladimir G. Deineko, Gerhard J. Woeginger: A new family of scientific impact measures: The generalized Kosmulski-indices. Scientometrics 80(3): 819-826 (2009)

Pim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger: Partitioning graphs into connected parts. Theor. Comput. Sci. 410(47-49): 4834-4843 (2009)

Elisabeth Gassner, Johannes Hatzl, Sven Oliver Krumke, Heike Sperber, Gerhard J. Woeginger: How hard is it to find extreme Nash equilibria in network congestion games? Theor. Comput. Sci. 410(47-49): 4989-4999 (2009)

Andreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger: Combinatorial Optimization Problems with Conflict Graphs. CTW 2009: 293-296

Pim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger: Partitioning Graphs into Connected Parts. CSR 2009: 143-154

Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginger: Fully Decomposable Split Graphs. IWOCA 2009: 105-112

Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger: Between a Rock and a Hard Place: The Two-to-One Assignment Problem. WAOA 2009: 159-169

Bastian Katz, Ignaz Rutter, Gerhard J. Woeginger: An Algorithmic Study of Switch Graphs. WG 2009: 226-237

Gerhard J. Woeginger: Open problems around exact algorithms. Discrete Applied Mathematics 156(3): 397-405 (2008)

Rudi Pendavingh, Quintijn Puite, Gerhard J. Woeginger: 2-piercings via graph theory. Discrete Applied Mathematics 156(18): 3510-3512 (2008)

Gerhard J. Woeginger: Four Non-Deterministic Programming Exercises. Bulletin of the EATCS 94: 207-211 (2008)

Axel Born, Cor A. J. Hurkens, Gerhard J. Woeginger: The Freudenthal Problem and its Ramifications (Part III). Bulletin of the EATCS 95: 201-219 (2008)

Fokko J. van de Bult, Gerhard J. Woeginger: The problem of the moody chess players. Inf. Process. Lett. 108(5): 336-337 (2008)

Cor A. J. Hurkens, Rudi Pendavingh, Gerhard J. Woeginger: The Magnus-Derek game revisited. Inf. Process. Lett. 109(1): 38-40 (2008)

Andries E. Brouwer, Gerhard F. Post, Gerhard J. Woeginger: Tight bounds for break minimization in tournament scheduling. J. Comb. Theory, Ser. A 115(6): 1065-1068 (2008)

Gerhard J. Woeginger: A symmetry axiom for scientific impact indices. J. Informetrics 2(4): 298-303 (2008)

Gerhard J. Woeginger: An axiomatic analysis of Egghe's g-index. J. Informetrics 2(4): 364-368 (2008)

Gerhard J. Woeginger: An axiomatic characterization of the Hirsch-index. Mathematical Social Sciences 56(2): 224-232 (2008)

Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger: The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases. Networks 51(3): 178-189 (2008)

Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger: The computational complexity of graph contractions II: Two tough polynomially solvable cases. Networks 52(1): 32-56 (2008)

Heather Hulett, Todd G. Will, Gerhard J. Woeginger: Multigraph realizations of degree sequences: Maximization is easy, minimization is hard. Oper. Res. Lett. 36(5): 594-596 (2008)

Kirk Pruhs, Patchrawat Uthaisombut, Gerhard J. Woeginger: Getting the best response for your erg. ACM Transactions on Algorithms 4(3) (2008)

Péter Csorba, Cor A. J. Hurkens, Gerhard J. Woeginger: The Alcuin Number of a Graph. ESA 2008: 320-331

Elisabeth Gassner, Johannes Hatzl, Sven Oliver Krumke, Heike Sperber, Gerhard J. Woeginger: How Hard Is It to Find Extreme Nash Equilibria in Network Congestion Games? WINE 2008: 82-93

Jiri Sgall, Gerhard J. Woeginger: An Approximation Scheme For Cake Division With A Linear Number Of Cuts. Combinatorica 27(2): 205-211 (2007)

Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic, Gerhard J. Woeginger: Eliminating graphs by means of parallel knock-out schemes. Discrete Applied Mathematics 155(2): 92-102 (2007)

Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak, Petra Schuurman, Gerhard J. Woeginger: A polynomial time equivalence between DNA sequencing and the exact perfect matching problem. Discrete Optimization 4(2): 154-162 (2007)

Gerhard J. Woeginger, Jiri Sgall: On the complexity of cake cutting. Discrete Optimization 4(2): 213-220 (2007)

Axel Born, Cor A. J. Hurkens, Gerhard J. Woeginger: The Freudenthal Problem and its Ramifications (Part II). Bulletin of the EATCS 91: 189-204 (2007)

Arianna Alfieri, Steef L. van de Velde, Gerhard J. Woeginger: Roll cutting in the curtain industry, or: A well-solvable allocation problem. European Journal of Operational Research 183(3): 1397-1404 (2007)

Ulrich Blasum, Winfried Hochstättler, Peter Oertel, Gerhard J. Woeginger: Steiner diagrams and k-star hubs. J. Discrete Algorithms 5(3): 622-634 (2007)

Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger: Backbone colorings for graphs: Tree and path backbones. Journal of Graph Theory 55(2): 137-152 (2007)

Walter Kern, Gerhard J. Woeginger: Quadratic programming and combinatorial minimum weight product problems. Math. Program. 110(3): 641-649 (2007)

Arjen P. A. Vestjens, Marc Wennink, Gerhard J. Woeginger: Complexity of the job insertion problem in multi-stage scheduling. Oper. Res. Lett. 35(6): 754-758 (2007)

Jos C. M. Baeten, Jan Karel Lenstra, Gerhard J. Woeginger: Preface. Theor. Comput. Sci. 379(3): 305 (2007)

Kirk Pruhs, Gerhard J. Woeginger: Approximation schemes for a class of subset selection problems. Theor. Comput. Sci. 382(2): 151-156 (2007)

Tobias Brüggemann, Johann Hurink, Tjark Vredeveld, Gerhard J. Woeginger: Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines. WAOA 2007: 41-54

Steven J. Brams, Kirk Pruhs, Gerhard J. Woeginger (Eds.): Fair Division, 24.06. - 29.06.2007. Dagstuhl Seminar Proceedings 07261, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007

Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger: Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult. Algorithmica 44(4): 343-361 (2006)

Vladimir G. Deineko, Gerhard J. Woeginger: Well-solvable instances for the partition problem. Appl. Math. Lett. 19(10): 1053-1056 (2006)

Gerhard F. Post, Gerhard J. Woeginger: Sports tournaments, home-away assignments, and the break minimization problem. Discrete Optimization 3(2): 165-173 (2006)

Vladimir G. Deineko, Gerhard J. Woeginger: Some Problems around Traveling Salesmen, Dart Boards, and Euro-coins. Bulletin of the EATCS 90: 43-52 (2006)

Axel Born, Cor A. J. Hurkens, Gerhard J. Woeginger: The Freudenthal Problem and its Ramifications (Part I). Bulletin of the EATCS 90: 175-191 (2006)

John van den Broek, Cor A. J. Hurkens, Gerhard J. Woeginger: Timetabling problems at the TU Eindhoven. Electronic Notes in Discrete Mathematics 25: 27-28 (2006)

Tobias Brüggemann, Johann Hurink, Tjark Vredeveld, Gerhard J. Woeginger: Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines. Electronic Notes in Discrete Mathematics 25: 29-33 (2006)

Vladimir G. Deineko, Gerhard J. Woeginger: On the dimension of simple monotonic games. European Journal of Operational Research 170(1): 315-318 (2006)

Gerhard J. Woeginger: A Note on Fair Division under Interval Uncertainty. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 14(6): 753-756 (2006)

Asaf Levin, Gerhard J. Woeginger: The constrained minimum weighted sum of job completion times problem. Math. Program. 108(1): 115-126 (2006)

T. C. Edwin Cheng, Yong He, Han Hoogeveen, Min Ji, Gerhard J. Woeginger: Scheduling with step-improving processing times. Oper. Res. Lett. 34(1): 37-40 (2006)

Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger: The traveling salesman problem with few inner points. Oper. Res. Lett. 34(1): 106-110 (2006)

Vladimir G. Deineko, Gerhard J. Woeginger: On the robust assignment problem under a fixed number of cost scenarios. Oper. Res. Lett. 34(2): 175-179 (2006)

Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger: Exact algorithms for the Hamiltonian cycle problem in planar graphs. Oper. Res. Lett. 34(3): 269-274 (2006)

Walter Kern, Gerhard J. Woeginger: Quadratic Programming and Combinatorial Minimum Weight Product Problems. CIAC 2006: 42-49

Leah Epstein, Asaf Levin, Gerhard J. Woeginger: Graph Coloring with Rejection. ESA 2006: 364-375

John van den Broek, Cor A. J. Hurkens, Gerhard J. Woeginger: Timetabling Problems at the TU Eindhoven. PATAT 2006: 210-227

Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger: Four point conditions and exponential neighborhoods for symmetric TSP. SODA 2006: 544-553

Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger (Eds.): Exact Algorithms and Fixed-Parameter Tractability, 24.-27. July 2005. Dagstuhl Seminar Proceedings 05301, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006

Hadas Shachnai, Tami Tamir, Gerhard J. Woeginger: Minimizing Makespan and Preemption Costs on a System of Uniform Machines. Algorithmica 42(3-4): 309-334 (2005)

Davaatseren Baatar, Horst W. Hamacher, Matthias Ehrgott, Gerhard J. Woeginger: Decomposition of integer matrices and multileaf collimator sequencing. Discrete Applied Mathematics 152(1-3): 6-34 (2005)

Gerhard J. Woeginger: A comment on scheduling two parallel machines with capacity constraints. Discrete Optimization 2(3): 269-272 (2005)

Mark Cieliebak, Stephan Eidenbenz, Gerhard J. Woeginger: Complexity and Approximability of Double Digest. J. Bioinformatics and Computational Biology 3(2): 207-224 (2005)

Steven S. Seiden, Gerhard J. Woeginger: The two-dimensional cutting stock problem revisited. Math. Program. 102(3): 519-530 (2005)

Bettina Klinz, Gerhard J. Woeginger: Faster algorithms for computing power indices in weighted voting games. Mathematical Social Sciences 49(1): 111-116 (2005)

Gerhard J. Woeginger: Combinatorial approximation algorithms: a comparative review. Oper. Res. Lett. 33(2): 210-215 (2005)

Satyaveer Singh Chauhan, Anton V. Eremeev, Anna A. Romanova, Vladimir V. Servakh, Gerhard J. Woeginger: Approximation of the supply scheduling problem. Oper. Res. Lett. 33(3): 249-254 (2005)

Frits C. R. Spieksma, Gerhard J. Woeginger: The no-wait flow-shop paradox. Oper. Res. Lett. 33(6): 603-608 (2005)

Jaroslav Nesetril, Gerhard J. Woeginger: Graph colorings. Theor. Comput. Sci. 349(1): 1 (2005)

Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger: 05301 Summary - Exact Algorithms and Fixed-Parameter Tractability. Exact Algorithms and Fixed-Parameter Tractability 2005

Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger: 05301 Abstracts Collection - Exact Algorithms and Fixed-Parameter Tractability. Exact Algorithms and Fixed-Parameter Tractability 2005

Attila Kuba, Gerhard J. Woeginger: Two Remarks on Reconstructing Binary Vectors from Their Absorbed Projections. DGCI 2005: 148-152

Arianna Alfieri, Steef L. van de Velde, Gerhard J. Woeginger: Roll Cutting in the Curtain Industry. ESA 2005: 283-292

Tomás Ebenlendr, John Noga, Jiri Sgall, Gerhard J. Woeginger: A Note on Semi-online Machine Covering. WAOA 2005: 110-118

Alexander Grigoriev, Gerhard J. Woeginger: Project scheduling with irregular costs: complexity, approximability, and algorithms. Acta Inf. 41(2-3): 83-97 (2004)

Yossi Azar, Leah Epstein, Yossi Richter, Gerhard J. Woeginger: All-norm approximation algorithms. J. Algorithms 52(2): 120-133 (2004)

Bettina Klinz, Gerhard J. Woeginger: Minimum-cost dynamic flows: The series-parallel case. Networks 43(3): 153-162 (2004)

Cor A. J. Hurkens, Gerhard J. Woeginger: On the nearest neighbor rule for the traveling salesman problem. Oper. Res. Lett. 32(1): 1-4 (2004)

Gerhard J. Woeginger: Inapproximability results for no-wait job shop scheduling. Oper. Res. Lett. 32(4): 320-325 (2004)

Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger: Radio Labeling with Preassigned Frequencies. SIAM Journal on Optimization 15(1): 1-16 (2004)

Daniel Král, Vladan Majerech, Jiri Sgall, Tomás Tichý, Gerhard J. Woeginger: It is tough to be a plumber. Theor. Comput. Sci. 303(3): 473-484 (2004)

Gerhard J. Woeginger: Seventeen lines and one-hundred-and-one points. Theor. Comput. Sci. 321(2-3): 415-421 (2004)

Samir Khuller, Yoo Ah Kim, Gerhard J. Woeginger: Approximation Schemes for Broadcasting in Heterogenous Networks. APPROX-RANDOM 2004: 163-170

Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger: The Traveling Salesman Problem with Few Inner Points. COCOON 2004: 268-277

Asaf Levin, Gerhard J. Woeginger: The Constrained Minimum Weighted Sum of Job Completion Times Problem. IPCO 2004: 298-307

Gerhard J. Woeginger: Space and Time Complexity of Exact Algorithms: Some Open Problems (Invited Talk). IWPEC 2004: 281-290

Kirk Pruhs, Gerhard J. Woeginger: Approximation Schemes for a Class of Subset Selection Problems. LATIN 2004: 203-211

Hajo Broersma, Fedor V. Fomin, Gerhard J. Woeginger: Parallel Knock-Out Schemes in Networks. MFCS 2004: 204-214

Kirk Pruhs, Patchrawat Uthaisombut, Gerhard J. Woeginger: Getting the Best Response for Your Erg. SWAT 2004: 14-25

Hajo Broersma, Daniël Paulusma, Gerard J. M. Smit, Frank Vlaardingerbroek, Gerhard J. Woeginger: The Computational Complexity of the Minimum Weight Processor Assignment Problem. WG 2004: 189-200

Fedor V. Fomin, Dieter Kratsch, Gerhard J. Woeginger: Exact (Exponential) Algorithms for the Dominating Set Problem. WG 2004: 245-256

Piotr Rudnicki, Gerhard J. Woeginger: The post correspondence problem over a unary alphabet. Appl. Math. Lett. 16(5): 723-727 (2003)

Rudi Pendavingh, Petra Schuurman, Gerhard J. Woeginger: Recognizing DNA graphs is difficult. Discrete Applied Mathematics 127(1): 85-94 (2003)

Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger: Which matrices are immune against the transportation paradox? Discrete Applied Mathematics 130(3): 495-501 (2003)

Gerhard J. Woeginger: On the approximability of average completion time scheduling under precedence constraints. Discrete Applied Mathematics 131(1): 237-252 (2003)

Hajo Broersma, Ulrich Faigle, Johann Hurink, Stefan Pickl, Gerhard J. Woeginger: Preface: Volume 13. Electronic Notes in Discrete Mathematics 13: 128 (2003)

Vladimir G. Deineko, Gerhard J. Woeginger: Complexity and approximability results for slicing floorplan designs. European Journal of Operational Research 149(3): 533-539 (2003)

Axel Born, Cor A. J. Hurkens, Gerhard J. Woeginger: How to detect a counterfeit coin: Adaptive versus non-adaptive solutions. Inf. Process. Lett. 86(3): 137-141 (2003)

Sándor P. Fekete, Martin Skutella, Gerhard J. Woeginger: The complexity of economic equilibria for house allocation markets. Inf. Process. Lett. 88(5): 219-223 (2003)

Alexander I. Barvinok, Sándor P. Fekete, David S. Johnson, Arie Tamir, Gerhard J. Woeginger, Russell Woodroofe: The geometric maximum traveling salesman problem. J. ACM 50(5): 641-664 (2003)

Gerhard J. Woeginger: A note on the complexity of determining optimal strategies in games with common payoffs. Math. Meth. of OR 58(2): 183-189 (2003)

Han Hoogeveen, Martin Skutella, Gerhard J. Woeginger: Preemptive scheduling with rejection. Math. Program. 94(2-3): 361-374 (2003)

Gerhard J. Woeginger: A note on scoring rules that respect majority in choice and elimination. Mathematical Social Sciences 46(3): 347-354 (2003)

Tobias Brüggemann, Jérôme Monnot, Gerhard J. Woeginger: Local search for the minimum label spanning tree problem with bounded color classes. Oper. Res. Lett. 31(3): 195-201 (2003)

Marjan van den Akker, Han Hoogeveen, Gerhard J. Woeginger: The two-machine open shop problem: To fit or not to fit, that is the question. Oper. Res. Lett. 31(3): 219-224 (2003)

Gerhard J. Woeginger: Banks winners in tournaments are difficult to recognize. Social Choice and Welfare 20(3): 523-528 (2003)

Joep Aerts, Jan H. M. Korst, Frits C. R. Spieksma, Wim F. J. Verhaegh, Gerhard J. Woeginger: Random Redundant Storage in Disk Arrays: Complexity of Retrieval Problems. IEEE Trans. Computers 52(9): 1210-1214 (2003)

Marek Chrobak, Peter Couperus, Christoph Dürr, Gerhard J. Woeginger: On tiling under tomographic constraints. Theor. Comput. Sci. 290(3): 2125-2136 (2003)

Mark Cieliebak, Stephan Eidenbenz, Gerhard J. Woeginger: Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data. COCOON 2003: 519-527

Jiri Sgall, Gerhard J. Woeginger: A Lower Bound for Cake Cutting. ESA 2003: 459-469

Gerhard J. Woeginger: Seventeen Lines and One-Hundred-and-One Points. ESA 2003: 527-531

Paul S. Bonsma, Tobias Brüggemann, Gerhard J. Woeginger: A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves. MFCS 2003: 259-268

Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger: Backbone Colorings for Networks. WG 2003: 131-142

Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger: The Complexity of Graph Contractions. WG 2003: 322-333

Jos C. M. Baeten, Jan Karel Lenstra, Joachim Parrow, Gerhard J. Woeginger (Eds.): Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings. Lecture Notes in Computer Science 2719, Springer 2003, isbn 3-540-40493-7

Petra Schuurman, Gerhard J. Woeginger: A PTAS for single machine scheduling with controllable processing times. Acta Cybern. 15(3): 369-378 (2002)

Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger: Caching for Web Searching. Algorithmica 33(3): 353-370 (2002)

George A. Constantinides, Gerhard J. Woeginger: The complexity of multiple wordlength assignment. Appl. Math. Lett. 15(2): 137-140 (2002)

Han Hoogeveen, Gerhard J. Woeginger: Some Comments on Sequencing with Controllable Processing Times. Computing 68(2): 181-192 (2002)

Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger: More About Subcolorings. Computing 69(3): 187-203 (2002)

Gerhard J. Woeginger: Open problems in the theory of scheduling. Bulletin of the EATCS 76: 67-83 (2002)

Renaud Lepère, Denis Trystram, Gerhard J. Woeginger: Approximation Algorithms for Scheduling Malleable Tasks Under Precedence Constraints. Int. J. Found. Comput. Sci. 13(4): 613-627 (2002)

John Noga, Steven S. Seiden, Gerhard J. Woeginger: A faster off-line algorithm for the TCP acknowledgement problem. Inf. Process. Lett. 81(2): 71-73 (2002)

János Csirik, Gerhard J. Woeginger: Resource augmentation for online bounded space bin packing. J. Algorithms 44(2): 308-320 (2002)

Giovanni Rinaldi, Ulrich Voigt, Gerhard J. Woeginger: The mathematics of playing golf, or: a new class of difficult non-linear mixed integer programs. Math. Program. 93(1): 77-86 (2002)

Gerhard J. Woeginger: An efficient algorithm for a class of constraint satisfaction problems. Oper. Res. Lett. 30(1): 9-16 (2002)

David J. Rader Jr., Gerhard J. Woeginger: The quadratic 0-1 knapsack problem with series-parallel support. Oper. Res. Lett. 30(3): 159-166 (2002)

Gerhard J. Woeginger: Embeddings of planar graphs that minimize the number of long-face cycles. Oper. Res. Lett. 30(3): 167-168 (2002)

Leah Epstein, John Noga, Gerhard J. Woeginger: On-line scheduling of unit time jobs with rejection: minimizing the total completion time. Oper. Res. Lett. 30(6): 415-420 (2002)

Alf van der Poorten, Gerhard J. Woeginger: Squares from Products of Consecutive Integers. The American Mathematical Monthly 109(5): 459-462 (2002)

Eric Anderson, Marek Chrobak, John Noga, Jiri Sgall, Gerhard J. Woeginger: Solution of a problem in DNA computing. Theor. Comput. Sci. 287(2): 387-391 (2002)

Yossi Azar, Oded Regev, Jiri Sgall, Gerhard J. Woeginger: Off-line temporary tasks assignment. Theor. Comput. Sci. 287(2): 419-428 (2002)

Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger: Radio Labeling with Pre-assigned Frequencies. ESA 2002: 211-222

Hadas Shachnai, Tami Tamir, Gerhard J. Woeginger: Minimizing Makespan and Preemption Costs on a System of Uniform Machines. ESA 2002: 859-871

Gerhard J. Woeginger: An Approximation Scheme for Cake Division with a Linear Number of Cuts. ESA 2002: 896-901

Alexander Grigoriev, Gerhard J. Woeginger: Project Scheduling with Irregular Costs: Complexity, Approximability, and Algorithms. ISAAC 2002: 381-390

Sven Oliver Krumke, Maarten Lipmann, Willem de Paepe, Diana Poensgen, Jörg Rambau, Leen Stougie, Gerhard J. Woeginger: How to cut a cake almost fairly. SODA 2002: 263-264

Giovanni Rinaldi, Ulrich Voigt, Gerhard J. Woeginger: The mathematics of playing golf. SODA 2002: 265-266

Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger: Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous. SWAT 2002: 160-169

Yossi Azar, Leah Epstein, Yossi Richter, Gerhard J. Woeginger: All-Norm Approximation Algorithms. SWAT 2002: 288-297

Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak, Petra Schuurman, Gerhard J. Woeginger: DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem. WG 2002: 13-24

Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger: More about Subcolorings. WG 2002: 68-79

Alexander I. Barvinok, Sándor P. Fekete, David S. Johnson, Arie Tamir, Gerhard J. Woeginger, Russell Woodroofe: The Geometric Maximum Traveling Salesman Problem. CoRR cs.DS/0204024 (2002)

Gerhard J. Woeginger, Jiri Sgall: The complexity of coloring graphs without long induced paths. Acta Cybern. 15(1): 107- (2001)

Gerhard J. Woeginger: A note on the depth function of combinatorial optimization problems. Discrete Applied Mathematics 108(3): 325-328 (2001)

Sergey V. Sevastianov, Gerhard J. Woeginger: Linear time approximation scheme for the multiprocessor open shop problem. Discrete Applied Mathematics 114(1-3): 273-288 (2001)

Han Hoogeveen, Petra Schuurman, Gerhard J. Woeginger: Non-Approximability Results for Scheduling Problems with Minsum Criteria. INFORMS Journal on Computing 13(2): 157-168 (2001)

Gerhard J. Woeginger: The reconstruction of polyominoes from their orthogonal projections. Inf. Process. Lett. 77(5-6): 225-229 (2001)

Vladimir G. Deineko, Gerhard J. Woeginger: A comment on consecutive-2-out-of-n systems. Oper. Res. Lett. 28(4): 169-171 (2001)

Moshe Zukerman, Long Jia, Timothy D. Neame, Gerhard J. Woeginger: A polynomially solvable special case of the unbounded knapsack problem. Oper. Res. Lett. 29(1): 13-16 (2001)

Vladimir G. Deineko, Gerhard J. Woeginger: Hardness of approximation of the discrete time-cost tradeoff problem. Oper. Res. Lett. 29(5): 207-210 (2001)

Han Hoogeveen, Gerhard J. Woeginger: A very difficult scheduling problem with communication delays. Oper. Res. Lett. 29(5): 241-245 (2001)

Gerhard J. Woeginger: Exact Algorithms for NP-Hard Problems: A Survey. Combinatorial Optimization 2001: 185-208

János Csirik, Csanád Imreh, John Noga, Steven S. Seiden, Gerhard J. Woeginger: Buying a Constant Competitive Ratio for Paging. ESA 2001: 98-108

Renaud Lepère, Denis Trystram, Gerhard J. Woeginger: Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints. ESA 2001: 146-157

Marek Chrobak, János Csirik, Csanád Imreh, John Noga, Jiri Sgall, Gerhard J. Woeginger: The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts. ICALP 2001: 862-874

Gerhard J. Woeginger: On the Approximability of Average Completion Time Scheduling under Precedence Constraints. ICALP 2001: 887-897

Gerhard J. Woeginger: Assigning chain-like tasks to a chain-like network. SODA 2001: 765-766

Daniel Král, Jan Kratochvíl, Zsolt Tuza, Gerhard J. Woeginger: Complexity of Coloring Graphs without Forbidden Induced Subgraphs. WG 2001: 254-262

Rudi Pendavingh, Petra Schuurman, Gerhard J. Woeginger: De Bruijn Graphs and DNA Graphs. WG 2001: 296-305

Marek Chrobak, Peter Couperus, Christoph Dürr, Gerhard J. Woeginger: A Note on Tiling under Tomographic Constraints. CoRR cs.CC/0108010 (2001)

Gerhard J. Woeginger: When does a dynamic programming formulation guarantee the existence of an FPTAS? Electronic Colloquium on Computational Complexity (ECCC)(084) (2001)

Gerhard J. Woeginger: Resource augmentation for online bounded space bin packing. Electronic Colloquium on Computational Complexity (ECCC)(085) (2001)

Luitpold Babel, Gerhard J. Woeginger: Pseudo-Hamiltonian Graphs. Acta Cybern. 14(4): 553-567 (2000)

Gerhard J. Woeginger: Introduction. Algorithmica 28(1): 1 (2000)

Vladimir G. Deineko, Gerhard J. Woeginger: The Maximum Travelling Salesman Problem on Symmetric Demidenko Matrices. Discrete Applied Mathematics 99(1-3): 413-425 (2000)

Gerhard J. Woeginger: When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? INFORMS Journal on Computing 12(1): 57-74 (2000)

Martin Skutella, Gerhard J. Woeginger: A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines. Math. Oper. Res. 25(1): 63-75 (2000)

Gerhard J. Woeginger: A comment on scheduling on uniform machines under chain-type precedence constraints. Oper. Res. Lett. 26(3): 107-109 (2000)

Gerhard J. Woeginger: Monge strikes again: optimal placement of web proxies in the internet. Oper. Res. Lett. 27(3): 93-96 (2000)

Han Hoogeveen, Chris N. Potts, Gerhard J. Woeginger: On-line scheduling on a single machine: maximizing the number of early jobs. Oper. Res. Lett. 27(5): 193-197 (2000)

Steven S. Seiden, Jiri Sgall, Gerhard J. Woeginger: Semi-online scheduling with decreasing job sizes. Oper. Res. Lett. 27(5): 215-221 (2000)

Petra Schuurman, Gerhard J. Woeginger: A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem. Theor. Comput. Sci. 237(1-2): 105-122 (2000)

Han Hoogeveen, Martin Skutella, Gerhard J. Woeginger: Preemptive Scheduling with Rejection. ESA 2000: 268-277

Maxim Sviridenko, Gerhard J. Woeginger: Approximability and in-approximability results for no-wait shop scheduling. FOCS 2000: 116-125

János Csirik, Gerhard J. Woeginger: Resource Augmentation for Online Bounded Space Bin Packing. ICALP 2000: 296-304

Petra Schuurman, Gerhard J. Woeginger: Scheduling a pipelined operator graph. SODA 2000: 207-212

Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger: Caching for Web Searching. SWAT 2000: 150-163

Peter Auer, Philip M. Long, Wolfgang Maass, Gerhard J. Woeginger: On the Complexity of Function Learning. Electronic Colloquium on Computational Complexity (ECCC) 7(50) (2000)

Amos Fiat, Gerhard J. Woeginger: On-Line Scheduling on a Single Machine: Minimizing the Total Completion Time. Acta Inf. 36(4): 287-293 (1999)

Gerhard J. Woeginger: Sensitivity Analysis for Knapsack Problems: Another Negative Result. Discrete Applied Mathematics 92(2-3): 247-251 (1999)

Gerhard J. Woeginger: An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine. INFORMS Journal on Computing 11(2): 211-216 (1999)

Bettina Klinz, Gerhard J. Woeginger: The Steiner Tree Problem in Kalmanson Matrices and in Circulant Matrices. J. Comb. Optim. 3(1): 51-58 (1999)

Mihály Hujter, Bettina Klinz, Gerhard J. Woeginger: A note on the complexity of the transportation problem with a permutable demand vector. Math. Meth. of OR 50(1): 9-16 (1999)

Rainer E. Burkard, Karin Feldbacher, Bettina Klinz, Gerhard J. Woeginger: Minimum-cost strong network orientation problems: Classification, complexity, and algorithms. Networks 33(1): 57-70 (1999)

Bettina Klinz, Gerhard J. Woeginger: A note on the bottleneck graph partition problem. Networks 33(3): 189-191 (1999)

Dorit S. Hochbaum, Gerhard J. Woeginger: A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources. Oper. Res. Lett. 24(1-2): 25-28 (1999)

Petra Schuurman, Gerhard J. Woeginger: Approximation algorithms for the multiprocessor open shop scheduling problem. Oper. Res. Lett. 24(4): 157-163 (1999)

Gerhard J. Woeginger, Guochuan Zhang: Optimal on-line algorithms for variable-sized bin covering. Oper. Res. Lett. 25(1): 47-50 (1999)

Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woeginger: Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine. SIAM J. Comput. 28(4): 1155-1166 (1999)

Gerhard J. Woeginger: An FPTAS for Agreeably Weighted Variance on a Single Machine. ICALP 1999: 707-716

Leah Epstein, John Noga, Steven S. Seiden, Jiri Sgall, Gerhard J. Woeginger: Randomized Online Scheduling on Two Uniform Machines. SODA 1999: 317-326

Petra Schuurman, Gerhard J. Woeginger: Preemptive Scheduling with Job-Dependent Setup Times. SODA 1999: 759-767

Gerhard J. Woeginger: When Does a Dynamic Programming Formulation Guarantee the Existence of an FPTAS? SODA 1999: 820-829

Martin Skutella, Gerhard J. Woeginger: A PTAS for Minimizing the Weighted Sum of Job Completion Times on Parallel Machines. STOC 1999: 400-407

Gérard Cornuéjols, Rainer E. Burkard, Gerhard J. Woeginger (Eds.): Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings. Lecture Notes in Computer Science 1610, Springer 1999, isbn 3-540-66019-4

Günter Rote, Gerhard J. Woeginger: Minimizing the Number of Tardy Jobs. Acta Cybern. 13(4): 423-430 (1998)

Noga Alon, Yossi Azar, János Csirik, Leah Epstein, Sergey V. Sevastianov, Arjen P. A. Vestjens, Gerhard J. Woeginger: On-Line and Off-Line Approximation Algorithms for Vector Covering Problems. Algorithmica 21(1): 104-118 (1998)

Sergey V. Sevastianov, Gerhard J. Woeginger: Makespan Minimization in Preemptive Two Machine Job Shops. Computing 60(1): 73-80 (1998)

Gerhard J. Woeginger: The toughness of split graphs. Discrete Mathematics 190(1-3): 295-297 (1998)

Bo Chen, Arjen P. A. Vestjens, Gerhard J. Woeginger: On-Line Scheduling of Two-Machine Open Shops Where Jobs Arrive Over Time. J. Comb. Optim. 1(4): 355-365 (1998)

Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger: The Travelling Salesman Problem on Permuted Monge Matrices. J. Comb. Optim. 2(4): 333-350 (1998)

Rainer E. Burkard, Eranda Çela, Günter Rote, Gerhard J. Woeginger: The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases. Math. Program. 82: 125-158 (1998)

Sergey V. Sevastianov, Gerhard J. Woeginger: Makespan minimization in open shops: A polynomial time approximation scheme. Math. Program. 82: 191-198 (1998)

Jack A. A. van der Veen, Gerhard J. Woeginger, Shuzhong Zhang: Sequencing jobs that require common resources on a single machine: A solvable case of the TSP. Math. Program. 82: 235-254 (1998)

Vladimir G. Deineko, Gerhard J. Woeginger: A solvable case of the quadratic assignment problem. Oper. Res. Lett. 22(1): 13-17 (1998)

Bettina Klinz, Gerhard J. Woeginger: One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs. Oper. Res. Lett. 22(4-5): 119-127 (1998)

Gerhard J. Woeginger: A comment on a minmax location problem. Oper. Res. Lett. 23(1-2): 41-43 (1998)

Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger: Sometimes Travelling is Easy: The Master Tour Problem. SIAM J. Discrete Math. 11(1): 81-93 (1998)

Alexander I. Barvinok, David S. Johnson, Gerhard J. Woeginger, Russell Woodroofe: The Maximum Traveling Salesman Problem Under Polyhedral Norms. IPCO 1998: 195-201

Han Hoogeveen, Petra Schuurman, Gerhard J. Woeginger: Non-approximability Results for Scheduling Problems with Minsum Criteria. IPCO 1998: 353-366

Amos Fiat, Gerhard J. Woeginger (Eds.): Online Algorithms, The State of the Art (the book grow out of a Dagstuhl Seminar, June 1996). Lecture Notes in Computer Science 1442, Springer 1998, isbn 3-540-64917-4

Sándor P. Fekete, Gerhard J. Woeginger: Angle-Restricted Tours in the Plane. Comput. Geom. 8: 195-218 (1997)

Thomas Tautenhahn, Gerhard J. Woeginger: Unit-Time Scheduling Problems with Time Dependent Resources. Computing 58(2): 97-112 (1997)

Evangelos Kranakis, Danny Krizanc, Berthold Ruf, Jorge Urrutia, Gerhard J. Woeginger: The VC-dimension of Set Systems Defined by Graphs. Discrete Applied Mathematics 77(3): 237-257 (1997)

Ulrich Pferschy, David Pisinger, Gerhard J. Woeginger: Simple But Efficient Approaches for the Collapsing Knapsack Problem. Discrete Applied Mathematics 77(3): 271-280 (1997)

Qi Fan Yang, Rainer E. Burkard, Eranda Çela, Gerhard J. Woeginger: Hamiltonian cycles in circulant digraphs with two stripes. Discrete Mathematics 176(1-3): 233-254 (1997)

János Csirik, Gerhard J. Woeginger: Shelf Algorithms for On-Line Strip Packing. Inf. Process. Lett. 63(4): 171-175 (1997)

Gerhard J. Woeginger: There is no Asymptotic PTAS for Two-Dimensional Vector Packing. Inf. Process. Lett. 64(6): 293-297 (1997)

József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger: Greedy Algorithms for On-Line Data Compression. J. Algorithms 25(2): 274-289 (1997)

Noga Alon, Yossi Azar, Gerhard J. Woeginger, Tal Yadid: Approximation Schemes for Scheduling. SODA 1997: 493-500

Luitpold Babel, Gerhard J. Woeginger: Pseudo-Hamiltonian Graphs. WG 1997: 38-51

Rainer E. Burkard, Gerhard J. Woeginger (Eds.): Algorithms - ESA '97, 5th Annual European Symposium, Graz, Austria, September 15-17, 1997, Proceedings. Lecture Notes in Computer Science 1284, Springer 1997, isbn 3-540-63397-9

Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger: On the Recognition of Permuted Supnick and Incomplete Monge Matrices. Acta Inf. 33(6): 559-569 (1996)

József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger: The Fractional Greedy Algorithm for Data Compression. Computing 56(1): 29-46 (1996)

Rainer E. Burkard, Rüdiger Rudolf, Gerhard J. Woeginger: Three-dimensional Axial Assignment Problems with Decomposable Cost Coefficients. Discrete Applied Mathematics 65(1-3): 123-139 (1996)

Vladimir G. Deineko, Gerhard J. Woeginger: The Convex-Hull-and-k-Line Travelling Salesman Problem. Inf. Process. Lett. 59(6): 295-301 (1996)

Amos Fiat, Gerhard J. Woeginger: Competitive Analysis of Algorithms. Online Algorithms 1996: 1-12

János Csirik, Gerhard J. Woeginger: On-line Packing and Covering Problems. Online Algorithms 1996: 147-177

Amos Fiat, Gerhard J. Woeginger: Competitive Odds and Ends. Online Algorithms 1996: 385-394

Noga Alon, János Csirik, Sergey V. Sevastianov, Arjen P. A. Vestjens, Gerhard J. Woeginger: On-line and Off-line Approximation Algorithms for Vector Covering Problems. ESA 1996: 406-418

Rainer E. Burkard, Eranda Çela, Günter Rote, Gerhard J. Woeginger: The Quadratic Assignment Problem with a Monotone Anti-Monge and a Symmetric Toeplitz Matrix: Easy and Hard Cases. IPCO 1996: 204-218

Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger: The Travelling Salesman and the PQ-Tree. IPCO 1996: 490-504

Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woeginger: Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine. STOC 1996: 418-426

Bettina Klinz, Gerhard J. Woeginger: One, Two, Three, Many, or: Complexity Aspects of Dynamic Network Flows with Dedicated Arcs. WG 1996: 254-267

Klaus Jansen, Gerhard J. Woeginger, Zhongliang Yu: UET-scheduling with chain-type precedence constraints. Computers & OR 22(9): 915-920 (1995)

Bettina Klinz, Rüdiger Rudolf, Gerhard J. Woeginger: Permuting Matrices to Avoid Forbidden Submatrices. Discrete Applied Mathematics 60(1-3): 223-248 (1995)

Bettina Klinz, Rüdiger Rudolf, Gerhard J. Woeginger: on the Recognition of Permuted Bottleneck Monge Matrices. Discrete Applied Mathematics 63(1): 43-74 (1995)

Gerhard J. Woeginger: Scheduling with Time-Dependent Execution Times. Inf. Process. Lett. 54(3): 155-156 (1995)

Joseph S. B. Mitchell, Günter Rote, Gopalakrishnan Sundaram, Gerhard J. Woeginger: Counting Convex Polygons in Planar Point Sets. Inf. Process. Lett. 56(1): 45-49 (1995)

Peter Auer, Philip M. Long, Wolfgang Maass, Gerhard J. Woeginger: On the Complexity of Function Learning. Machine Learning 18(2-3): 187-230 (1995)

Gábor Galambos, Gerhard J. Woeginger: Minimizing the weighted number of late jobs in UET open shops. Math. Meth. of OR 41(1): 109-114 (1995)

Gábor Galambos, Gerhard J. Woeginger: On-line bin packing - A restricted survey. Math. Meth. of OR 42(1): 25-45 (1995)

Rüdiger Rudolf, Gerhard J. Woeginger: The cone of Monge matrices: Extremal rays and applications. Math. Meth. of OR 42(2): 161-168 (1995)

Gerhard J. Woeginger: On the rate of taxation in a cooperative bin packing game. Math. Meth. of OR 42(3): 313-324 (1995)

Bettina Klinz, Gerhard J. Woeginger: A New Efficiently Solvable Special Case of the Three-Dimensional Axial Bottleneck Assignment Problem. Combinatorics and Computer Science 1995: 150-162

József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger: Worst-Case Analysis for On-Line Data Compression. Combinatorics and Computer Science 1995: 288-300

Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger: Sometimes Travelling is Easy: The Master Tour Problem. ESA 1995: 128-141

Bettina Klinz, Gerhard J. Woeginger: Minimum Cost Dynamic Flows: The Series-Parallel Case. IPCO 1995: 329-343

Evangelos Kranakis, Danny Krizanc, Berthold Ruf, Jorge Urrutia, Gerhard J. Woeginger: VC-Dimensions for Graphs (Extended Abstract). WG 1995: 1-13

Gerhard J. Woeginger: Heuristics for Parallel Machine Scheduling with Delivery Times. Acta Inf. 31(6): 503-512 (1994)

Ulrich Pferschy, Gerhard J. Woeginger, En-Yu Yao: Partitioning Graphs into Two Trees. Acta Cybern. 11(3): 233-240 (1994)

Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger: A general approach to avoiding two by two submatrices. Computing 52(4): 371-388 (1994)

Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger: Scheduling with Incompatible Jobs. Discrete Applied Mathematics 55(3): 219-232 (1994)

Bo Chen, André van Vliet, Gerhard J. Woeginger: A Lower Bound for Randomized On-Line Scheduling Algorithms. Inf. Process. Lett. 51(5): 219-222 (1994)

Ulrich Pferschy, Rüdiger Rudolf, Gerhard J. Woeginger: Some Geometric Clustering Problems. Nord. J. Comput. 1(2): 246-263 (1994)

Gerhard J. Woeginger: On-Line Scheduling of Jobs with Fixed Start and End Times. Theor. Comput. Sci. 130(1): 5-16 (1994)

Bo Chen, André van Vliet, Gerhard J. Woeginger: An Optimal Algorithm for Preemptive On-line Scheduling. ESA 1994: 300-306

Gábor Galambos, Hans Kellerer, Gerhard J. Woeginger: A Lower Bound for On-Line Vector-Packing Algorithms. Acta Cybern. 11(1-2): 23-34 (1993)

Klaus Jansen, Gerhard J. Woeginger: The Complexity of Detecting Crossingfree Configurations in the Plane. BIT 33(4): 580-595 (1993)

Hans Kellerer, Gerhard J. Woeginger: A Tight Bound for 3-Partitioning. Discrete Applied Mathematics 45(3): 249-259 (1993)

Hans Kellerer, Gerhard J. Woeginger: On the Euclidean two Paths Problem. Discrete Applied Mathematics 47(2): 165-173 (1993)

Franz Rendl, Gerhard J. Woeginger: Reconstructing sets of orthogonal line segments in the plane. Discrete Mathematics 119(1-3): 167-174 (1993)

Gábor Galambos, Gerhard J. Woeginger: An On-Line Scheduling Heuristic With Better Worst Case Ratio Than Graham's List Scheduling. SIAM J. Comput. 22(2): 349-355 (1993)

Michael Formann, Torben Hagerup, James Haralambides, Michael Kaufmann, Frank Thomson Leighton, Antonios Symvonis, Emo Welzl, Gerhard J. Woeginger: Drawing Graphs in the Plane with High Resolution. SIAM J. Comput. 22(5): 1035-1052 (1993)

Gerhard J. Woeginger: Improved Space for Bounded-Space, On-Line Bin-Packing. SIAM J. Discrete Math. 6(4): 575-581 (1993)

Peter Auer, Philip M. Long, Wolfgang Maass, Gerhard J. Woeginger: On the Complexity of Function Learning. COLT 1993: 392-401

Bettina Klinz, Rüdiger Rudolf, Gerhard J. Woeginger: On the Recognition of Permuted Bottleneck Monge Matrices. ESA 1993: 248-259

Klaus Jansen, Petra Scheffler, Gerhard J. Woeginger: Maximum Covering with D Cliques. FCT 1993: 319-328

Hans Kellerer, Franz Rendl, Gerhard J. Woeginger: Computing the optimum stock size. IPCO 1993: 147-159

Gerhard J. Woeginger: Computing Maximum Valued Regions. Acta Cybern. 10(4): 303-316 (1992)

Joseph S. B. Mitchell, Günter Rote, Gerhard J. Woeginger: Minimum-Link Paths Among Obstacles in the Plan. Algorithmica 8(5&6): 431-459 (1992)

Hans Kellerer, Gerhard J. Woeginger: UET-scheduling with constrained processor allocations. Computers & OR 19(1): 1-8 (1992)

Wolfgang Gutjahr, Emo Welzl, Gerhard J. Woeginger: Polynomial graph-colorings. Discrete Applied Mathematics 35(1): 29-45 (1992)

David Eppstein, Mark H. Overmars, Günter Rote, Gerhard J. Woeginger: Finding Minimum Area k-gons. Discrete & Computational Geometry 7: 45-58 (1992)

János Komlós, János Pach, Gerhard J. Woeginger: Almost Tight Bounds for epsilon-Nets. Discrete & Computational Geometry 7: 163-173 (1992)

Günter Rote, Gerhard J. Woeginger: Counting Convex k-Gons in Planar Point Sets. Inf. Process. Lett. 41(4): 191-194 (1992)

Herbert Fleischner, Gerhard J. Woeginger: Detecting Cycles Through Three Fixed Vertices in a Graph. Inf. Process. Lett. 42(1): 29-33 (1992)

Gerhard J. Woeginger, Zhongliang Yu: On the Equal-Subset-Sum Problem. Inf. Process. Lett. 42(6): 299-302 (1992)

Gerhard J. Woeginger: Finding the Closest Extreme Vertex to a Fixed Point. Inf. Process. Lett. 43(3): 127-128 (1992)

Gerhard J. Woeginger: The Complexity of Finding Arborescences in Hypergraphs. Inf. Process. Lett. 44(3): 161-164 (1992)

Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger: Scheduling with Incompatible Jobs. WG 1992: 37-49

Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger: Scheduling with Incompatible Jobs. Universität Trier, Mathematik/Informatik, Forschungsbericht 92-09 (1992)

Klaus Jansen, Petra Scheffler, Gerhard J. Woeginger: The Disjoint Cliques Problem. Universität Trier, Mathematik/Informatik, Forschungsbericht 92-23 (1992)

Klaus Jansen, Gerhard J. Woeginger: The Complexity of Detecting Crossingfree Configurations in the Plane. Universität Trier, Mathematik/Informatik, Forschungsbericht 92-25 (1992)

Günter Rote, Gerhard J. Woeginger, Binhai Zhu, Zhengyan Wang: Counting k-Subsets and Convex k-gons in the Plane. Inf. Process. Lett. 38(3): 149-151 (1991)