Gerhard J. Woeginger

485 papers A* 24A 23B 50C 6Misc 8Journal 340Unranked 29

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	A linear time algorithm for linearizing quadratic and higher-order shortest path problems. Math. Program. Eranda Çela, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf
2024	J	`jnl`	The bipartite travelling salesman problem: A pyramidally solvable case. Oper. Res. Lett. Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
2024	J	`jnl`	Travelling salesman paths on Demidenko matrices. Discret. Appl. Math. Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2023	B	`conf`	A Linear Time Algorithm for Linearizing Quadratic and Higher-Order Shortest Path Problems. IPCO Eranda Çela, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf
2023	J	`jnl`	A linear time algorithm for linearizing quadratic and higher-order shortest path problems. CoRR Eranda Çela, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf
2023	J	`jnl`	Hardness of flow time minimization in a crossdock with a single door and asymmetric handover relations. Oper. Res. Lett. Dirk Briskorn, Gerhard J. Woeginger
2023	J	`jnl`	Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms. Oper. Res. Lett. Jirí Sgall, Gerhard J. Woeginger
2023	J	`jnl`	Non-Preemptive Tree Packing. Algorithmica Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf
2023	J	`jnl`	Recognising permuted Demidenko matrices. CoRR Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2023	J	`jnl`	Recognising permuted Demidenko matrices. Oper. Res. Lett. Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2022	J	`jnl`	A note on the complexity of the bilevel bottleneck assignment problem. 4OR Dennis Fischer, Komal Muluk, Gerhard J. Woeginger
2022	J	`jnl`	Continuous facility location on graphs. Math. Program. Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
2021	J	`jnl`	A linear time algorithm for the robust recoverable selection problem. Discret. Appl. Math. Thomas Lachmann, Stefan Lendl, Gerhard J. Woeginger
2021	B	`conf`	An Investigation of the Recoverable Robust Assignment Problem. IPEC Dennis Fischer, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
2021	J	`jnl`	Dispersing Obnoxious Facilities on a Graph. Algorithmica Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
2021	J	`jnl`	Fine-grained Complexity Analysis of Two Classic TSP Variants. ACM Trans. Algorithms Mark de Berg, Kevin Buchin, Bart M. P. Jansen, Gerhard J. Woeginger
2021	B	`conf`	Linearizable Special Cases of the Quadratic Shortest Path Problem. WG Eranda Çela, Bettina Klinz, Stefan Lendl, James B. Orlin, Gerhard J. Woeginger, Lasse Wulf
2021	C	`conf`	Non-preemptive Tree Packing. IWOCA Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf
2021	J	`jnl`	The subset sum game revisited. Theory Comput. Syst. Astrid Pieterse, Gerhard J. Woeginger
2021	J	`jnl`	The transportation problem with conflicts. Ann. Oper. Res. Annette M. C. Ficker, Frits C. R. Spieksma, Gerhard J. Woeginger
2021	J	`jnl`	The trouble with the second quantifier. 4OR Gerhard J. Woeginger
2020	J	`jnl`	A faster algorithm for the continuous bilevel knapsack problem. Oper. Res. Lett. Dennis Fischer, Gerhard J. Woeginger
2020	J	`jnl`	An Investigation of the Recoverable Robust Assignment Problem. CoRR Dennis Fischer, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
2020	B	`conf`	Continuous Facility Location on Graphs. IPCO Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
2020	J	`jnl`	Non-Monochromatic and Conflict-Free Colorings on Tree Spaces and Planar Network Spaces. Algorithmica Boris Aronov, Mark de Berg, Aleksandar Markovic, Gerhard J. Woeginger
2020	J	`jnl`	Timeline-based planning over dense temporal domains. Theor. Comput. Sci. Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Gerhard J. Woeginger
2020	J	`jnl`	Travelling salesman paths on Demidenko matrices. CoRR Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2019	—	`ch.`	Computation and Complexity. Computing and Software Science Gerhard J. Woeginger
2019	—	`book`	Computing and Software Science - State of the Art and Perspectives Computing and Software Science Bernhard Steffen, Gerhard J. Woeginger
2019	A	`conf`	Dispersing Obnoxious Facilities on a Graph. STACS Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
2019	J	`jnl`	Domination When the Stars Are Out. ACM Trans. Algorithms Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger
2019	J	`jnl`	Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. Int. J. Comput. Geom. Appl. Mark de Berg, Tim Leijsen, Aleksandar Markovic, André van Renssen, Marcel Roeloffzen, Gerhard J. Woeginger
2019	J	`jnl`	Good Things Come to Those Who Swap Objects on Paths. CoRR Matthias Bentert, Jiehua Chen, Vincent Froese, Gerhard J. Woeginger
2019	J	`jnl`	The complexity of Dominating Set in geometric intersection graphs. Theor. Comput. Sci. Mark de Berg, Sándor Kisfaludi-Bak, Gerhard J. Woeginger
2018	A*	`conf`	Committee Selection with Intraclass and Interclass Synergies. AAAI Rani Izsak, Nimrod Talmon, Gerhard J. Woeginger
2018	J	`jnl`	Dispersing obnoxious facilities on a graph. CoRR Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
2018	B	`conf`	Graph Similarity and Approximate Isomorphism. MFCS Martin Grohe, Gaurav Rattan, Gerhard J. Woeginger
2018	J	`jnl`	Graph Similarity and Approximate Isomorphism. CoRR Martin Grohe, Gaurav Rattan, Gerhard J. Woeginger
2018	J	`jnl`	Group activity selection problem with approval preferences. Int. J. Game Theory Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard J. Woeginger
2018	J	`jnl`	New special cases of the Quadratic Assignment Problem with diagonally structured coefficient matrices. Eur. J. Oper. Res. Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2018	J	`jnl`	Non-Monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces. CoRR Boris Aronov, Mark de Berg, Aleksandar Markovic, Gerhard J. Woeginger
2018	Misc	`conf`	Non-monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces. COCOON Boris Aronov, Mark de Berg, Aleksandar Markovic, Gerhard J. Woeginger
2018	J	`jnl`	Preface to the Special Issue on Computer Science in Russia 2016. Theory Comput. Syst. Alexander S. Kulikov, Gerhard J. Woeginger
2018	J	`jnl`	Robust balanced optimization. EURO J. Comput. Optim. Annette M. C. Ficker, Frits C. R. Spieksma, Gerhard J. Woeginger
2018	B	`conf`	Some Easy and Some Not so Easy Geometric Optimization Problems. WAOA Gerhard J. Woeginger
2018	A	`conf`	The Open Shop Scheduling Problem. STACS Gerhard J. Woeginger
2018	J	`jnl`	The triangle scheduling problem. J. Sched. Christoph Dürr, Zdenek Hanzálek, Christian Konrad, Yasmina Seddik, René Sitters, Óscar C. Vásquez, Gerhard J. Woeginger
2018	—	`conf`	Timeline-Based Planning over Dense Temporal Domains with Trigger-less Rules is NP-Complete. ICTCS Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Gerhard J. Woeginger
2017	J	`jnl`	Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. CoRR Mark de Berg, Tim Leijsen, André van Renssen, Marcel Roeloffzen, Aleksandar Markovic, Gerhard J. Woeginger
2017	B	`conf`	Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. ISAAC Mark de Berg, Tim Leijsen, Aleksandar Markovic, André van Renssen, Marcel Roeloffzen, Gerhard J. Woeginger
2017	B	`ed.`	Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers WG Hans L. Bodlaender, Gerhard J. Woeginger
2017	J	`jnl`	Partitioning Perfect Graphs into Stars. J. Graph Theory René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
2017	J	`jnl`	Scheduling Two Agents on a Single Machine: A Parameterized Analysis of NP-hard Problems. CoRR Danny Hermelin, Judith-Madeleine Kubitza, Dvir Shabtay, Nimrod Talmon, Gerhard J. Woeginger
2017	B	`conf`	The Dominating Set Problem in Geometric Intersection Graphs. IPEC Mark de Berg, Sándor Kisfaludi-Bak, Gerhard J. Woeginger
2017	J	`jnl`	The Dominating Set Problem in Geometric Intersection Graphs. CoRR Mark de Berg, Sándor Kisfaludi-Bak, Gerhard J. Woeginger
2017	—	`conf`	The Subset Sum Game Revisited. ADT Astrid Pieterse, Gerhard J. Woeginger
2017	J	`jnl`	The multi-stripe travelling salesman problem. Ann. Oper. Res. Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2017	J	`jnl`	The one-dimensional Euclidean domain: finitely many obstructions are not enough. Soc. Choice Welf. Jiehua Chen, Kirk Pruhs, Gerhard J. Woeginger
2016	J	`jnl`	Are there any nicely structured preference profiles nearby? Math. Soc. Sci. Robert Bredereck, Jiehua Chen, Gerhard J. Woeginger
2016	B	`conf`	Balanced Optimization with Vector Costs. WAOA Annette M. C. Ficker, Frits C. R. Spieksma, Gerhard J. Woeginger
2016	J	`jnl`	Bilevel Knapsack with Interdiction Constraints. INFORMS J. Comput. Alberto Caprara, Margarida Carvalho, Andrea Lodi, Gerhard J. Woeginger
2016	Misc	`ed.`	Computer Science - Theory and Applications - 11th International Computer Science Symposium in Russia, CSR 2016, St. Petersburg, Russia, June 9-13, 2016, Proceedings CSR Alexander S. Kulikov, Gerhard J. Woeginger
2016	J	`jnl`	Finding large degree-anonymous subgraphs is hard. Theor. Comput. Sci. Cristina Bazgan, Robert Bredereck, Sepp Hartung, André Nichterlein, Gerhard J. Woeginger
2016	A*	`conf`	Fine-Grained Complexity Analysis of Two Classic TSP Variants. ICALP Mark de Berg, Kevin Buchin, Bart M. P. Jansen, Gerhard J. Woeginger
2016	J	`jnl`	Fine-Grained Complexity Analysis of Two Classic TSP Variants. CoRR Mark de Berg, Kevin Buchin, Bart M. P. Jansen, Gerhard J. Woeginger
2016	J	`jnl`	Linearizable special cases of the QAP. J. Comb. Optim. Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2016	—	`conf`	Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width. DOOR René van Bevern, Robert Bredereck, Laurent Bulteau, Christian Komusiewicz, Nimrod Talmon, Gerhard J. Woeginger
2016	J	`jnl`	Precedence-constrained scheduling problems parameterized by partial order width. CoRR René van Bevern, Robert Bredereck, Laurent Bulteau, Christian Komusiewicz, Nimrod Talmon, Gerhard J. Woeginger
2016	J	`jnl`	The Focus of Attention Problem. Algorithmica Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger
2016	J	`jnl`	The multi-stripe travelling salesman problem. CoRR Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2016	J	`jnl`	The triangle scheduling problem. CoRR Christoph Dürr, Zdenek Hanzálek, Christian Konrad, René Sitters, Óscar C. Vásquez, Gerhard J. Woeginger
2016	J	`jnl`	Vertex Cover Meets Scheduling. Algorithmica Leah Epstein, Asaf Levin, Gerhard J. Woeginger
2015	C	`conf`	A New Tractable Case of the QAP with a Robinson Matrix. COCOA Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2015	J	`jnl`	Approximability and parameterized complexity of multicover by c-intervals. Inf. Process. Lett. René van Bevern, Jiehua Chen, Falk Hüffner, Stefan Kratsch, Nimrod Talmon, Gerhard J. Woeginger
2015	J	`jnl`	Are there any nicely structured preference~profiles~nearby? CoRR Robert Bredereck, Jiehua Chen, Gerhard J. Woeginger
2015	J	`jnl`	Geometric versions of the three-dimensional assignment problem under general norms. Discret. Optim. Ante Custic, Bettina Klinz, Gerhard J. Woeginger
2015	J	`jnl`	How to Put Through Your Agenda in Collective Binary Decisions. ACM Trans. Economics and Comput. Noga Alon, Robert Bredereck, Jiehua Chen, Stefan Kratsch, Rolf Niedermeier, Gerhard J. Woeginger
2015	J	`jnl`	Network-Based Vertex Dissolution. SIAM J. Discret. Math. René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
2015	J	`jnl`	Preface. Math. Program. Ali Ridha Mahjoub, Giovanni Rinaldi, Gerhard J. Woeginger
2015	B	`conf`	Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs. IPEC Danny Hermelin, Judith-Madeleine Kubitza, Dvir Shabtay, Nimrod Talmon, Gerhard J. Woeginger
2015	J	`jnl`	The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases. Algorithmica Leah Epstein, Asaf Levin, Gerhard J. Woeginger
2015	J	`jnl`	The one-dimensional Euclidean domain: Finitely many obstructions are not enough. CoRR Jiehua Chen, Kirk Pruhs, Gerhard J. Woeginger
2015	J	`jnl`	Vote trading and subset sums. Oper. Res. Lett. Sebastian Bervoets, Vincent Merlin, Gerhard J. Woeginger
2015	J	`jnl`	Well-solvable cases of the QAP with block-structured matrices. Discret. Appl. Math. Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2014	J	`jnl`	A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. J. Artif. Intell. Res. Robert Bredereck, Jiehua Chen, Sepp Hartung, Stefan Kratsch, Rolf Niedermeier, Ondrej Suchý, Gerhard J. Woeginger
2014	J	`jnl`	A Study on the Computational Complexity of the Bilevel Knapsack Problem. SIAM J. Optim. Alberto Caprara, Margarida Carvalho, Andrea Lodi, Gerhard J. Woeginger
2014	Misc	`conf`	Another Look at the Shoelace TSP: The Case of Very Old Shoes. FUN Vladimir G. Deineko, Gerhard J. Woeginger
2014	J	`jnl`	Bilevel programming and the separation problem. Math. Program. Andrea Lodi, Ted K. Ralphs, Gerhard J. Woeginger
2014	J	`jnl`	Four-point conditions for the TSP: The complete complexity classification. Discret. Optim. Vladimir G. Deineko, Bettina Klinz, Alexander Tiskin, Gerhard J. Woeginger
2014	J	`jnl`	Geometric versions of the 3-dimensional assignment problem under general norms. CoRR Ante Custic, Bettina Klinz, Gerhard J. Woeginger
2014	J	`jnl`	Group Activity Selection Problem. CoRR Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard J. Woeginger
2014	J	`jnl`	Investigations on the step-based research indices of Chambers and Miller. J. Informetrics Gerhard J. Woeginger
2014	J	`jnl`	Linearizable special cases of the QAP. CoRR Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2014	B	`conf`	Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms. WAOA Jirí Sgall, Gerhard J. Woeginger
2014	—	`conf`	Network-Based Dissolution. MFCS (2) René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
2014	J	`jnl`	Network-Based Dissolution. CoRR René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
2014	J	`jnl`	Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges. CoRR Robert Bredereck, Jiehua Chen, Piotr Faliszewski, Jiong Guo, Rolf Niedermeier, Gerhard J. Woeginger
2014	J	`jnl`	Planar 3-dimensional assignment problems with Monge-like cost arrays. CoRR Ante Custic, Bettina Klinz, Gerhard J. Woeginger
2014	—	`conf`	Star Partitions of Perfect Graphs. ICALP (1) René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
2014	J	`jnl`	Star Partitions of Perfect Graphs. CoRR René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
2014	J	`jnl`	Two hardness results for Gamson's game. Soc. Choice Welf. Vladimir G. Deineko, Gerhard J. Woeginger
2013	B	`conf`	A Complexity and Approximability Study of the Bilevel Knapsack Problem. IPCO Alberto Caprara, Margarida Carvalho, Andrea Lodi, Gerhard J. Woeginger
2013	J	`jnl`	A characterization of the single-crossing domain. Soc. Choice Welf. Robert Bredereck, Jiehua Chen, Gerhard J. Woeginger
2013	J	`jnl`	A hardness result for core stability in additive hedonic games. Math. Soc. Sci. Gerhard J. Woeginger
2013	J	`jnl`	Analysis of multi-stage open shop processing systems. Math. Program. Christian Eggermont, Alexander Schrijver, Gerhard J. Woeginger
2013	A*	`conf`	Are There Any Nicely Structured Preference Profiles Nearby? IJCAI Robert Bredereck, Jiehua Chen, Gerhard J. Woeginger
2013	J	`jnl`	Complexity and in-approximability of a selection problem in robust optimization. 4OR Vladimir G. Deineko, Gerhard J. Woeginger
2013	B	`conf`	Core Stability in Hedonic Coalition Formation. SOFSEM Gerhard J. Woeginger
2013	J	`jnl`	Fully decomposable split graphs. Eur. J. Comb. Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginger
2013	—	`conf`	How to Put through Your Agenda in Collective Binary Decisions. ADT Noga Alon, Robert Bredereck, Jiehua Chen, Stefan Kratsch, Rolf Niedermeier, Gerhard J. Woeginger
2013	J	`jnl`	Motion Planning with Pulley, Rope, and Baskets. Theory Comput. Syst. Christian Eggermont, Gerhard J. Woeginger
2013	J	`jnl`	Nothing New about Equiangular Polygons. Am. Math. Mon. Gerhard J. Woeginger
2013	J	`jnl`	Realizing Small Tournaments Through Few Permutations. Acta Cybern. Christian Eggermont, Cor A. J. Hurkens, Gerhard J. Woeginger
2013	B	`conf`	The Complexity of Finding a Large Subgraph under Anonymity Constraints. ISAAC Robert Bredereck, Sepp Hartung, André Nichterlein, Gerhard J. Woeginger
2013	J	`jnl`	The three-dimensional matching problem in Kalmanson matrices. J. Comb. Optim. Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger
2013	J	`jnl`	Two hardness results for core stability in hedonic coalition formation games. Discret. Appl. Math. Vladimir G. Deineko, Gerhard J. Woeginger
2013	J	`jnl`	Uniqueness in quadratic and hyperbolic 0-1 programming problems. CoRR Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
2013	J	`jnl`	Uniqueness in quadratic and hyperbolic 0-1 programming problems. Oper. Res. Lett. Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
2012	J	`jnl`	An algorithmic analysis of the Honey-Bee game. Theor. Comput. Sci. Rudolf Fleischer, Gerhard J. Woeginger
2012	J	`jnl`	An algorithmic study of switch graphs. Acta Informatica Bastian Katz, Ignaz Rutter, Gerhard J. Woeginger
2012	J	`jnl`	Another well-solvable case of the QAP: Maximizing the job completion time variance. Oper. Res. Lett. Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2012	J	`jnl`	Between a rock and a hard place: the two-to-one assignment problem. Math. Methods Oper. Res. Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger
2012	J	`jnl`	Caching Is Hard - Even in the Fault Model. Algorithmica Marek Chrobak, Gerhard J. Woeginger, Kazuhisa Makino, Haifeng Xu
2012	—	`conf`	Cinderella versus the Wicked Stepmother. IFIP TCS Marijke H. L. Bodlaender, Cor A. J. Hurkens, Vincent J. J. Kusters, Frank Staals, Gerhard J. Woeginger, Hans Zantema
2012	J	`jnl`	Complexity and approximation of an area packing problem. Optim. Lett. Cor A. J. Hurkens, Andrea Lodi, Silvano Martello, Michele Monaci, Gerhard J. Woeginger
2012	J	`jnl`	Core stability in hedonic coalition formation CoRR Gerhard J. Woeginger
2012	Misc	`conf`	Divorcing Made Easy. FUN Kirk Pruhs, Gerhard J. Woeginger
2012	—	`conf`	Group Activity Selection Problem. WINE Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard J. Woeginger
2012	J	`jnl`	Guest Editorial to the special issue "Operations Research in Health Care" (EURO XXIII, July 5-8, 2009, Bonn). Eur. J. Oper. Res. Erwin Pesch, Gerhard J. Woeginger
2012	A	`conf`	Motion planning with pulley, rope, and baskets. STACS Christian Eggermont, Gerhard J. Woeginger
2012	B	`ed.`	Parameterized and Exact Computation - 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings IPEC Dimitrios M. Thilikos, Gerhard J. Woeginger
2012	J	`jnl`	Scheduling of pipelined operator graphs. J. Sched. Hans L. Bodlaender, Petra Schuurman, Gerhard J. Woeginger
2012	B	`conf`	The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases. WG Leah Epstein, Asaf Levin, Gerhard J. Woeginger
2012	J	`jnl`	The Alcuin Number of a Graph and Its Connections to the Vertex Cover Number. SIAM Rev. Péter Csorba, Cor A. J. Hurkens, Gerhard J. Woeginger
2012	J	`jnl`	The interval ordering problem. Discret. Appl. Math. Christoph Dürr, Maurice Queyranne, Frits C. R. Spieksma, Fabrice Talla Nobibon, Gerhard J. Woeginger
2012	J	`jnl`	The x-and-y-axes travelling salesman problem. Eur. J. Oper. Res. Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2012	B	`conf`	Transportation under Nasty Side Constraints. MFCS Gerhard J. Woeginger
2011	J	`jnl`	A well-solvable special case of the bounded knapsack problem. Oper. Res. Lett. Vladimir G. Deineko, Gerhard J. Woeginger
2011	J	`jnl`	An Algorithmic Analysis of the Honey-Bee Game CoRR Rudolf Fleischer, Gerhard J. Woeginger
2011	J	`jnl`	Analysis of multi-stage open shop processing systems CoRR Christian Eggermont, Alexander Schrijver, Gerhard J. Woeginger
2011	A	`conf`	Analysis of multi-stage open shop processing systems. STACS Christian Eggermont, Alexander Schrijver, Gerhard J. Woeginger
2011	J	`jnl`	Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh. Oper. Res. Lett. Murat Firat, Gerhard J. Woeginger
2011	J	`jnl`	Charlemagne's Challenge: The Periodic Latency Problem. Oper. Res. Sofie Coene, Frits C. R. Spieksma, Gerhard J. Woeginger
2011	—	`conf`	Domination When the Stars Are Out. ICALP (1) Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger
2011	J	`jnl`	Graph coloring with rejection. J. Comput. Syst. Sci. Leah Epstein, Asaf Levin, Gerhard J. Woeginger
2011	J	`jnl`	Hamiltonian index is NP-complete. Discret. Appl. Math. Zdenek Ryjácek, Gerhard J. Woeginger, Liming Xiong
2011	B	`ed.`	Integer Programming and Combinatoral Optimization - 15th International Conference, IPCO 2011, New York, NY, USA, June 15-17, 2011. Proceedings IPCO Oktay Günlük, Gerhard J. Woeginger
2011	J	`jnl`	Paths, trees and matchings under disjunctive constraints. Discret. Appl. Math. Andreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger
2011	—	`conf`	Reachability and Deadlocking Problems in Multi-stage Scheduling. RP Christian Eggermont, Gerhard J. Woeginger
2011	J	`jnl`	String execution time for finite languages: Max is easy, min is hard. Autom. Rong Su, Gerhard J. Woeginger
2011	B	`conf`	The Cinderella Game on Holes and Anti-holes. WG Marijke H. L. Bodlaender, Cor A. J. Hurkens, Gerhard J. Woeginger
2011	J	`jnl`	The Northwest corner rule revisited. Discret. Appl. Math. Bettina Klinz, Gerhard J. Woeginger
2011	J	`jnl`	The Wiener maximum quadratic assignment problem. Discret. Optim. Eranda Çela, Nina S. Schmuck, Shmuel Wimer, Gerhard J. Woeginger
2011	J	`jnl`	The interval ordering problem CoRR Christoph Dürr, Maurice Queyranne, Frits C. R. Spieksma, Fabrice Talla Nobibon, Gerhard J. Woeginger
2011	A	`conf`	Two-Bounded-Space Bin Packing Revisited. ESA Marek Chrobak, Jirí Sgall, Gerhard J. Woeginger
2011	J	`jnl`	Unbounded knapsack problems with arithmetic weight sequences. Eur. J. Oper. Res. Vladimir G. Deineko, Gerhard J. Woeginger
2011	A*	`conf`	Unweighted Coalitional Manipulation under the Borda Rule Is NP-Hard. IJCAI Nadja Betzler, Rolf Niedermeier, Gerhard J. Woeginger
2010	Misc	`conf`	An Algorithmic Analysis of the Honey-Bee Game. FUN Rudolf Fleischer, Gerhard J. Woeginger
2010	J	`jnl`	An Algorithmic Comparison of Three Scientific Impact Indices. Acta Cybern. Gerhard J. Woeginger
2010	—	`conf`	Caching Is Hard - Even in the Fault Model. ESA (1) Marek Chrobak, Gerhard J. Woeginger, Kazuhisa Makino, Haifeng Xu
2010	J	`jnl`	Domination When the Stars Are Out CoRR Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger
2010	J	`jnl`	How * not * to solve a Sudoku. Oper. Res. Lett. Adriana Felicia Gabor, Gerhard J. Woeginger
2010	J	`jnl`	Parallel machine scheduling with nested job assignment restrictions. Oper. Res. Lett. Gabriella Muratore, Ulrich M. Schwarz, Gerhard J. Woeginger
2010	J	`jnl`	Pinpointing the complexity of the interval min-max regret knapsack problem. Discret. Optim. Vladimir G. Deineko, Gerhard J. Woeginger
2010	J	`jnl`	The Alcuin Number of a Graph and Its Connections to the Vertex Cover Number. SIAM J. Discret. Math. Péter Csorba, Cor A. J. Hurkens, Gerhard J. Woeginger
2010	A*	`conf`	The Focus of Attention Problem. SODA Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger
2010	J	`jnl`	The Traveling Salesman Problem Under Squared Euclidean Distances CoRR Mark de Berg, Fred van Nijnatten, René Sitters, Gerhard J. Woeginger, Alexander Wolff
2010	A	`conf`	The Traveling Salesman Problem under Squared Euclidean Distances. STACS Fred van Nijnatten, René Sitters, Gerhard J. Woeginger, Alexander Wolff, Mark de Berg
2010	J	`jnl`	The approximability of three-dimensional assignment problems with bottleneck objective. Optim. Lett. Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger
2009	J	`jnl`	A comment on parallel-machine scheduling under a grade of service provision to minimize makespan. Inf. Process. Lett. Gerhard J. Woeginger
2009	J	`jnl`	A new family of scientific impact measures: The generalized Kosmulski-indices. Scientometrics Vladimir G. Deineko, Gerhard J. Woeginger
2009	B	`conf`	An Algorithmic Study of Switch Graphs. WG Bastian Katz, Ignaz Rutter, Gerhard J. Woeginger
2009	B	`conf`	Between a Rock and a Hard Place: The Two-to-One Assignment Problem. WAOA Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger
2009	C	`conf`	Combinatorial Optimization Problems with Conflict Graphs. CTW Andreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger
2009	C	`conf`	Fully Decomposable Split Graphs. IWOCA Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginger
2009	J	`jnl`	Generalizations of Egghe's g-index. J. Assoc. Inf. Sci. Technol. Gerhard J. Woeginger
2009	J	`jnl`	How hard is it to find extreme Nash equilibria in network congestion games? Theor. Comput. Sci. Elisabeth Gassner, Johannes Hatzl, Sven Oliver Krumke, Heike Sperber, Gerhard J. Woeginger
2009	Misc	`conf`	Partitioning Graphs into Connected Parts. CSR Pim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger
2009	J	`jnl`	Partitioning graphs into connected parts. Theor. Comput. Sci. Pim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger
2009	J	`jnl`	Polygons with inscribed circles and prescribed side lengths. Appl. Math. Lett. Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
2009	J	`jnl`	The complexity of computing the Muirhead-Dalton distance. Math. Soc. Sci. Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
2009	J	`jnl`	The hardness of train rearrangements. Oper. Res. Lett. Christian Eggermont, Cor A. J. Hurkens, Maciej Modelski, Gerhard J. Woeginger
2009	J	`jnl`	Threshold aggregation of multi-graded rankings. Math. Soc. Sci. Gerhard J. Woeginger
2009	J	`jnl`	Timetabling problems at the TU Eindhoven. Eur. J. Oper. Res. John van den Broek, Cor A. J. Hurkens, Gerhard J. Woeginger
2009	J	`jnl`	Uncapacitated single and multiple allocation p-hub center problems. Comput. Oper. Res. Andreas T. Ernst, Horst W. Hamacher, Houyuan Jiang, Mohan Krishnamoorthy, Gerhard J. Woeginger
2008	J	`jnl`	2-piercings via graph theory. Discret. Appl. Math. Rudi Pendavingh, Quintijn Puite, Gerhard J. Woeginger
2008	J	`jnl`	A symmetry axiom for scientific impact indices. J. Informetrics Gerhard J. Woeginger
2008	J	`jnl`	An axiomatic analysis of Egghe's g-index. J. Informetrics Gerhard J. Woeginger
2008	J	`jnl`	An axiomatic characterization of the Hirsch-index. Math. Soc. Sci. Gerhard J. Woeginger
2008	J	`jnl`	Four Non-Deterministic Programming Exercises. Bull. EATCS Gerhard J. Woeginger
2008	J	`jnl`	Getting the best response for your erg. ACM Trans. Algorithms Kirk Pruhs, Patchrawat Uthaisombut, Gerhard J. Woeginger
2008	—	`conf`	How Hard Is It to Find Extreme Nash Equilibria in Network Congestion Games? WINE Elisabeth Gassner, Johannes Hatzl, Sven Oliver Krumke, Heike Sperber, Gerhard J. Woeginger
2008	J	`jnl`	Multigraph realizations of degree sequences: Maximization is easy, minimization is hard. Oper. Res. Lett. Heather Hulett, Todd G. Will, Gerhard J. Woeginger
2008	J	`jnl`	Open problems around exact algorithms. Discret. Appl. Math. Gerhard J. Woeginger
2008	A	`conf`	The Alcuin Number of a Graph. ESA Péter Csorba, Cor A. J. Hurkens, Gerhard J. Woeginger
2008	J	`jnl`	The Freudenthal Problem and its Ramifications (Part III). Bull. EATCS Axel Born, Cor A. J. Hurkens, Gerhard J. Woeginger
2008	J	`jnl`	The Magnus-Derek game revisited. Inf. Process. Lett. Cor A. J. Hurkens, Rudi Pendavingh, Gerhard J. Woeginger
2008	J	`jnl`	The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases. Networks Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger
2008	J	`jnl`	The computational complexity of graph contractions II: Two tough polynomially solvable cases. Networks Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger
2008	J	`jnl`	The problem of the moody chess players. Inf. Process. Lett. Fokko J. van de Bult, Gerhard J. Woeginger
2008	J	`jnl`	Tight bounds for break minimization in tournament scheduling. J. Comb. Theory A Andries E. Brouwer, Gerhard F. Post, Gerhard J. Woeginger
2007	J	`jnl`	A polynomial time equivalence between DNA sequencing and the exact perfect matching problem. Discret. Optim. Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak, Petra Schuurman, Gerhard J. Woeginger
2007	J	`jnl`	An Approximation Scheme For Cake Division With A Linear Number Of Cuts. Comb. Jirí Sgall, Gerhard J. Woeginger
2007	J	`jnl`	Approximation schemes for a class of subset selection problems. Theor. Comput. Sci. Kirk Pruhs, Gerhard J. Woeginger
2007	J	`jnl`	Backbone colorings for graphs: Tree and path backbones. J. Graph Theory Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger
2007	J	`jnl`	Complexity of the job insertion problem in multi-stage scheduling. Oper. Res. Lett. Arjen P. A. Vestjens, Marc Wennink, Gerhard J. Woeginger
2007	J	`jnl`	Eliminating graphs by means of parallel knock-out schemes. Discret. Appl. Math. Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic, Gerhard J. Woeginger
2007	—	`ed.`	Fair Division, 24.06. - 29.06.2007 Fair Division Steven J. Brams, Kirk Pruhs, Gerhard J. Woeginger
2007	J	`jnl`	On the complexity of cake cutting. Discret. Optim. Gerhard J. Woeginger, Jirí Sgall
2007	J	`jnl`	Preface. Theor. Comput. Sci. Jos C. M. Baeten, Jan Karel Lenstra, Gerhard J. Woeginger
2007	J	`jnl`	Quadratic programming and combinatorial minimum weight product problems. Math. Program. Walter Kern, Gerhard J. Woeginger
2007	J	`jnl`	Roll cutting in the curtain industry, or: A well-solvable allocation problem. Eur. J. Oper. Res. Arianna Alfieri, Steef L. van de Velde, Gerhard J. Woeginger
2007	J	`jnl`	Steiner diagrams and k-star hubs. J. Discrete Algorithms Ulrich Blasum, Winfried Hochstättler, Peter Oertel, Gerhard J. Woeginger
2007	J	`jnl`	The Freudenthal Problem and its Ramifications (Part II). Bull. EATCS Axel Born, Cor A. J. Hurkens, Gerhard J. Woeginger
2007	B	`conf`	Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines. WAOA Tobias Brüggemann, Johann L. Hurink, Tjark Vredeveld, Gerhard J. Woeginger
2006	J	`jnl`	A Note on Fair Division under Interval Uncertainty. Int. J. Uncertain. Fuzziness Knowl. Based Syst. Gerhard J. Woeginger
2006	—	`ed.`	Exact Algorithms and Fixed-Parameter Tractability, 24.-27. July 2005 Exact Algorithms and Fixed-Parameter Tractability Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger
2006	J	`jnl`	Exact algorithms for the Hamiltonian cycle problem in planar graphs. Oper. Res. Lett. Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
2006	A*	`conf`	Four point conditions and exponential neighborhoods for symmetric TSP. SODA Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
2006	A	`conf`	Graph Coloring with Rejection. ESA Leah Epstein, Asaf Levin, Gerhard J. Woeginger
2006	J	`jnl`	On the dimension of simple monotonic games. Eur. J. Oper. Res. Vladimir G. Deineko, Gerhard J. Woeginger
2006	J	`jnl`	On the robust assignment problem under a fixed number of cost scenarios. Oper. Res. Lett. Vladimir G. Deineko, Gerhard J. Woeginger
2006	J	`jnl`	Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines. Electron. Notes Discret. Math. Tobias Brüggemann, Johann L. Hurink, Tjark Vredeveld, Gerhard J. Woeginger
2006	J	`jnl`	Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult. Algorithmica Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger
2006	C	`conf`	Quadratic Programming and Combinatorial Minimum Weight Product Problems. CIAC Walter Kern, Gerhard J. Woeginger
2006	J	`jnl`	Scheduling with step-improving processing times. Oper. Res. Lett. T. C. Edwin Cheng, Yong He, Han Hoogeveen, Min Ji, Gerhard J. Woeginger
2006	J	`jnl`	Some Problems around Traveling Salesmen, Dart Boards, and Euro-coins. Bull. EATCS Vladimir G. Deineko, Gerhard J. Woeginger
2006	J	`jnl`	Sports tournaments, home-away assignments, and the break minimization problem. Discret. Optim. Gerhard F. Post, Gerhard J. Woeginger
2006	J	`jnl`	The Freudenthal Problem and its Ramifications (Part I). Bull. EATCS Axel Born, Cor A. J. Hurkens, Gerhard J. Woeginger
2006	J	`jnl`	The constrained minimum weighted sum of job completion times problem. Math. Program. Asaf Levin, Gerhard J. Woeginger
2006	J	`jnl`	The traveling salesman problem with few inner points. Oper. Res. Lett. Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger
2006	C	`conf`	Timetabling Problems at the TU Eindhoven. PATAT John van den Broek, Cor A. J. Hurkens, Gerhard J. Woeginger
2006	J	`jnl`	Timetabling problems at the TU Eindhoven. Electron. Notes Discret. Math. John van den Broek, Cor A. J. Hurkens, Gerhard J. Woeginger
2006	J	`jnl`	Well-solvable instances for the partition problem. Appl. Math. Lett. Vladimir G. Deineko, Gerhard J. Woeginger
2005	—	`conf`	05301 Abstracts Collection - Exact Algorithms and Fixed-Parameter Tractability. Exact Algorithms and Fixed-Parameter Tractability Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger
2005	—	`conf`	05301 Summary - Exact Algorithms and Fixed-Parameter Tractability. Exact Algorithms and Fixed-Parameter Tractability Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger
2005	B	`conf`	A Note on Semi-online Machine Covering. WAOA Tomás Ebenlendr, John Noga, Jirí Sgall, Gerhard J. Woeginger
2005	J	`jnl`	A comment on scheduling two parallel machines with capacity constraints. Discret. Optim. Gerhard J. Woeginger
2005	J	`jnl`	Approximation of the supply scheduling problem. Oper. Res. Lett. Satyaveer Singh Chauhan, Anton V. Eremeev, Anna A. Romanova, Vladimir V. Servakh, Gerhard J. Woeginger
2005	J	`jnl`	Combinatorial approximation algorithms: a comparative review. Oper. Res. Lett. Gerhard J. Woeginger
2005	J	`jnl`	Complexity and Approximability of Double Digest. J. Bioinform. Comput. Biol. Mark Cieliebak, Stephan J. Eidenbenz, Gerhard J. Woeginger
2005	J	`jnl`	Decomposition of integer matrices and multileaf collimator sequencing. Discret. Appl. Math. Davaatseren Baatar, Horst W. Hamacher, Matthias Ehrgott, Gerhard J. Woeginger
2005	J	`jnl`	Faster algorithms for computing power indices in weighted voting games. Math. Soc. Sci. Bettina Klinz, Gerhard J. Woeginger
2005	J	`jnl`	Graph colorings. Theor. Comput. Sci. Jaroslav Nesetril, Gerhard J. Woeginger
2005	J	`jnl`	Minimizing Makespan and Preemption Costs on a System of Uniform Machines. Algorithmica Hadas Shachnai, Tami Tamir, Gerhard J. Woeginger
2005	J	`jnl`	Paths and cycles in colored graphs. Australas. J Comb. Hajo Broersma, Xueliang Li, Gerhard J. Woeginger, Shenggui Zhang
2005	A	`conf`	Roll Cutting in the Curtain Industry. ESA Arianna Alfieri, Steef L. van de Velde, Gerhard J. Woeginger
2005	J	`jnl`	The no-wait flow-shop paradox. Oper. Res. Lett. Frits C. R. Spieksma, Gerhard J. Woeginger
2005	J	`jnl`	The two-dimensional cutting stock problem revisited. Math. Program. Steven S. Seiden, Gerhard J. Woeginger
2005	—	`conf`	Two Remarks on Reconstructing Binary Vectors from Their Absorbed Projections. DGCI Attila Kuba, Gerhard J. Woeginger
2004	J	`jnl`	All-norm approximation algorithms. J. Algorithms Yossi Azar, Leah Epstein, Yossi Richter, Gerhard J. Woeginger
2004	—	`conf`	Approximation Schemes for Broadcasting in Heterogenous Networks. APPROX-RANDOM Samir Khuller, Yoo Ah Kim, Gerhard J. Woeginger
2004	B	`conf`	Approximation Schemes for a Class of Subset Selection Problems. LATIN Kirk Pruhs, Gerhard J. Woeginger
2004	B	`conf`	Exact (Exponential) Algorithms for the Dominating Set Problem. WG Fedor V. Fomin, Dieter Kratsch, Gerhard J. Woeginger
2004	—	`conf`	Getting the Best Response for Your Erg. SWAT Kirk Pruhs, Patchrawat Uthaisombut, Gerhard J. Woeginger
2004	J	`jnl`	Inapproximability results for no-wait job shop scheduling. Oper. Res. Lett. Gerhard J. Woeginger
2004	J	`jnl`	It is tough to be a plumber. Theor. Comput. Sci. Daniel Král, Vladan Majerech, Jirí Sgall, Tomás Tichý, Gerhard J. Woeginger
2004	J	`jnl`	Minimum-cost dynamic flows: The series-parallel case. Networks Bettina Klinz, Gerhard J. Woeginger
2004	J	`jnl`	On the nearest neighbor rule for the traveling salesman problem. Oper. Res. Lett. Cor A. J. Hurkens, Gerhard J. Woeginger
2004	B	`conf`	Parallel Knock-Out Schemes in Networks. MFCS Hajo Broersma, Fedor V. Fomin, Gerhard J. Woeginger
2004	J	`jnl`	Project scheduling with irregular costs: complexity, approximability, and algorithms. Acta Informatica Alexander Grigoriev, Gerhard J. Woeginger
2004	J	`jnl`	Radio Labeling with Preassigned Frequencies. SIAM J. Optim. Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger
2004	J	`jnl`	Seventeen lines and one-hundred-and-one points. Theor. Comput. Sci. Gerhard J. Woeginger
2004	—	`conf`	Space and Time Complexity of Exact Algorithms: Some Open Problems (Invited Talk). IWPEC Gerhard J. Woeginger
2004	B	`conf`	The Computational Complexity of the Minimum Weight Processor Assignment Problem. WG Hajo Broersma, Daniël Paulusma, Gerard J. M. Smit, Frank Vlaardingerbroek, Gerhard J. Woeginger
2004	B	`conf`	The Constrained Minimum Weighted Sum of Job Completion Times Problem. IPCO Asaf Levin, Gerhard J. Woeginger
2004	Misc	`conf`	The Traveling Salesman Problem with Few Inner Points. COCOON Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger
2003	B	`conf`	A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves. MFCS Paul S. Bonsma, Tobias Brüggemann, Gerhard J. Woeginger
2003	A	`conf`	A Lower Bound for Cake Cutting. ESA Jirí Sgall, Gerhard J. Woeginger
2003	J	`jnl`	A note on scoring rules that respect majority in choice and elimination. Math. Soc. Sci. Gerhard J. Woeginger
2003	J	`jnl`	A note on the complexity of determining optimal strategies in games with common payoffs. Math. Methods Oper. Res. Gerhard J. Woeginger
2003	A*	`ed.`	Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings ICALP Jos C. M. Baeten, Jan Karel Lenstra, Joachim Parrow, Gerhard J. Woeginger
2003	B	`conf`	Backbone Colorings for Networks. WG Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger
2003	J	`jnl`	Banks winners in tournaments are difficult to recognize. Soc. Choice Welf. Gerhard J. Woeginger
2003	J	`jnl`	Complexity and approximability results for slicing floorplan designs. Eur. J. Oper. Res. Vladimir G. Deineko, Gerhard J. Woeginger
2003	Misc	`conf`	Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data. COCOON Mark Cieliebak, Stephan J. Eidenbenz, Gerhard J. Woeginger
2003	J	`jnl`	How to detect a counterfeit coin: Adaptive versus non-adaptive solutions. Inf. Process. Lett. Axel Born, Cor A. J. Hurkens, Gerhard J. Woeginger
2003	J	`jnl`	Local search for the minimum label spanning tree problem with bounded color classes. Oper. Res. Lett. Tobias Brüggemann, Jérôme Monnot, Gerhard J. Woeginger
2003	J	`jnl`	On the approximability of average completion time scheduling under precedence constraints. Discret. Appl. Math. Gerhard J. Woeginger
2003	J	`jnl`	On tiling under tomographic constraints. Theor. Comput. Sci. Marek Chrobak, Peter Couperus, Christoph Dürr, Gerhard J. Woeginger
2003	J	`jnl`	Preemptive scheduling with rejection. Math. Program. Han Hoogeveen, Martin Skutella, Gerhard J. Woeginger
2003	J	`jnl`	Preface: Volume 13. Electron. Notes Discret. Math. Hajo Broersma, Ulrich Faigle, Johann L. Hurink, Stefan Pickl, Gerhard J. Woeginger
2003	J	`jnl`	Random Redundant Storage in Disk Arrays: Complexity of Retrieval Problems. IEEE Trans. Computers Joep Aerts, Jan H. M. Korst, Frits C. R. Spieksma, Wim F. J. Verhaegh, Gerhard J. Woeginger
2003	J	`jnl`	Recognizing DNA graphs is difficult. Discret. Appl. Math. Rudi Pendavingh, Petra Schuurman, Gerhard J. Woeginger
2003	A	`conf`	Seventeen Lines and One-Hundred-and-One Points. ESA Gerhard J. Woeginger
2003	B	`conf`	The Complexity of Graph Contractions. WG Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger
2003	J	`jnl`	The complexity of economic equilibria for house allocation markets. Inf. Process. Lett. Sándor P. Fekete, Martin Skutella, Gerhard J. Woeginger
2003	J	`jnl`	The geometric maximum traveling salesman problem. J. ACM Alexander I. Barvinok, Sándor P. Fekete, David S. Johnson, Arie Tamir, Gerhard J. Woeginger, Russell Woodroofe
2003	J	`jnl`	The post correspondence problem over a unary alphabet. Appl. Math. Lett. Piotr Rudnicki, Gerhard J. Woeginger
2003	J	`jnl`	The two-machine open shop problem: To fit or not to fit, that is the question. Oper. Res. Lett. Marjan van den Akker, Han Hoogeveen, Gerhard J. Woeginger
2003	J	`jnl`	Which matrices are immune against the transportation paradox? Discret. Appl. Math. Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
2002	J	`jnl`	A PTAS for single machine scheduling with controllable processing times. Acta Cybern. Petra Schuurman, Gerhard J. Woeginger
2002	J	`jnl`	A faster off-line algorithm for the TCP acknowledgement problem. Inf. Process. Lett. John Noga, Steven Seiden, Gerhard J. Woeginger
2002	—	`conf`	All-Norm Approximation Algorithms. SWAT Yossi Azar, Leah Epstein, Yossi Richter, Gerhard J. Woeginger
2002	A	`conf`	An Approximation Scheme for Cake Division with a Linear Number of Cuts. ESA Gerhard J. Woeginger
2002	J	`jnl`	An efficient algorithm for a class of constraint satisfaction problems. Oper. Res. Lett. Gerhard J. Woeginger
2002	J	`jnl`	Approximation Algorithms for Scheduling Malleable Tasks Under Precedence Constraints. Int. J. Found. Comput. Sci. Renaud Lepère, Denis Trystram, Gerhard J. Woeginger
2002	J	`jnl`	Caching for Web Searching. Algorithmica Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger
2002	B	`conf`	DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem. WG Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak, Petra Schuurman, Gerhard J. Woeginger
2002	J	`jnl`	Embeddings of planar graphs that minimize the number of long-face cycles. Oper. Res. Lett. Gerhard J. Woeginger
2002	A*	`conf`	How to cut a cake almost fairly. SODA Sven Oliver Krumke, Maarten Lipmann, Willem de Paepe, Diana Poensgen, Jörg Rambau, Leen Stougie, Gerhard J. Woeginger
2002	A	`conf`	Minimizing Makespan and Preemption Costs on a System of Uniform Machines. ESA Hadas Shachnai, Tami Tamir, Gerhard J. Woeginger
2002	J	`jnl`	More About Subcolorings. Computing Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger
2002	B	`conf`	More about Subcolorings. WG Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger
2002	J	`jnl`	Off-line temporary tasks assignment. Theor. Comput. Sci. Yossi Azar, Oded Regev, Jirí Sgall, Gerhard J. Woeginger
2002	J	`jnl`	On-line scheduling of unit time jobs with rejection: minimizing the total completion time. Oper. Res. Lett. Leah Epstein, John Noga, Gerhard J. Woeginger
2002	J	`jnl`	Open problems in the theory of scheduling. Bull. EATCS Gerhard J. Woeginger
2002	—	`conf`	Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous. SWAT Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger
2002	B	`conf`	Project Scheduling with Irregular Costs: Complexity, Approximability, and Algorithms. ISAAC Alexander Grigoriev, Gerhard J. Woeginger
2002	A	`conf`	Radio Labeling with Pre-assigned Frequencies. ESA Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger
2002	J	`jnl`	Resource augmentation for online bounded space bin packing. J. Algorithms János Csirik, Gerhard J. Woeginger
2002	J	`jnl`	Solution of a problem in DNA computing. Theor. Comput. Sci. Eric Anderson, Marek Chrobak, John Noga, Jirí Sgall, Gerhard J. Woeginger
2002	J	`jnl`	Some Comments on Sequencing with Controllable Processing Times. Computing Han Hoogeveen, Gerhard J. Woeginger
2002	J	`jnl`	Squares from Products of Consecutive Integers. Am. Math. Mon. Alfred J. van der Poorten, Gerhard J. Woeginger
2002	J	`jnl`	The Geometric Maximum Traveling Salesman Problem CoRR Alexander I. Barvinok, Sándor P. Fekete, David S. Johnson, Arie Tamir, Gerhard J. Woeginger, Russell Woodroofe
2002	J	`jnl`	The complexity of multiple wordlength assignment. Appl. Math. Lett. George A. Constantinides, Gerhard J. Woeginger
2002	J	`jnl`	The mathematics of playing golf, or: a new class of difficult non-linear mixed integer programs. Math. Program. Giovanni Rinaldi, Ulrich Voigt, Gerhard J. Woeginger
2002	A*	`conf`	The mathematics of playing golf. SODA Giovanni Rinaldi, Ulrich Voigt, Gerhard J. Woeginger
2002	J	`jnl`	The quadratic 0-1 knapsack problem with series-parallel support. Oper. Res. Lett. David J. Rader Jr., Gerhard J. Woeginger
2001	J	`jnl`	A Note on Tiling under Tomographic Constraints CoRR Marek Chrobak, Peter Couperus, Christoph Dürr, Gerhard J. Woeginger
2001	J	`jnl`	A comment on consecutive-2-out-of- Oper. Res. Lett. Vladimir G. Deineko, Gerhard J. Woeginger
2001	J	`jnl`	A note on the depth function of combinatorial optimization problems. Discret. Appl. Math. Gerhard J. Woeginger
2001	J	`jnl`	A polynomially solvable special case of the unbounded knapsack problem. Oper. Res. Lett. Moshe Zukerman, Long Jia, Timothy D. Neame, Gerhard J. Woeginger
2001	J	`jnl`	A very difficult scheduling problem with communication delays. Oper. Res. Lett. Han Hoogeveen, Gerhard J. Woeginger
2001	A	`conf`	Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints. ESA Renaud Lepère, Denis Trystram, Gerhard J. Woeginger
2001	A*	`conf`	Assigning chain-like tasks to a chain-like network. SODA Gerhard J. Woeginger
2001	A	`conf`	Buying a Constant Competitive Ratio for Paging. ESA János Csirik, Csanád Imreh, John Noga, Steven S. Seiden, Gerhard J. Woeginger
2001	B	`conf`	Complexity of Coloring Graphs without Forbidden Induced Subgraphs. WG Daniel Král, Jan Kratochvíl, Zsolt Tuza, Gerhard J. Woeginger
2001	B	`conf`	De Bruijn Graphs and DNA Graphs. WG Rudi Pendavingh, Petra Schuurman, Gerhard J. Woeginger
2001	—	`conf`	Exact Algorithms for NP-Hard Problems: A Survey. Combinatorial Optimization Gerhard J. Woeginger
2001	J	`jnl`	Hardness of approximation of the discrete time-cost tradeoff problem. Oper. Res. Lett. Vladimir G. Deineko, Gerhard J. Woeginger
2001	J	`jnl`	Linear time approximation scheme for the multiprocessor open shop problem. Discret. Appl. Math. Sergey V. Sevastianov, Gerhard J. Woeginger
2001	J	`jnl`	Non-Approximability Results for Scheduling Problems with Minsum Criteria. INFORMS J. Comput. Han Hoogeveen, Petra Schuurman, Gerhard J. Woeginger
2001	A*	`conf`	On the Approximability of Average Completion Time Scheduling under Precedence Constraints. ICALP Gerhard J. Woeginger
2001	J	`jnl`	Resource augmentation for online bounded space bin packing Electron. Colloquium Comput. Complex. Gerhard J. Woeginger
2001	A*	`conf`	The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts. ICALP Marek Chrobak, János Csirik, Csanád Imreh, John Noga, Jirí Sgall, Gerhard J. Woeginger
2001	J	`jnl`	The complexity of coloring graphs without long induced paths. Acta Cybern. Gerhard J. Woeginger, Jirí Sgall
2001	J	`jnl`	The reconstruction of polyominoes from their orthogonal projections. Inf. Process. Lett. Gerhard J. Woeginger
2001	J	`jnl`	When does a dynamic programming formulation guarantee the existence of an FPTAS? Electron. Colloquium Comput. Complex. Gerhard J. Woeginger
2000	J	`jnl`	A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines. Math. Oper. Res. Martin Skutella, Gerhard J. Woeginger
2000	J	`jnl`	A comment on scheduling on uniform machines under chain-type precedence constraints. Oper. Res. Lett. Gerhard J. Woeginger
2000	J	`jnl`	A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem. Theor. Comput. Sci. Petra Schuurman, Gerhard J. Woeginger
2000	J	`jnl`	A study of exponential neighborhoods for the Travelling Salesman Problem and for the Quadratic Assignment Problem. Math. Program. Vladimir G. Deineko, Gerhard J. Woeginger
2000	A*	`conf`	Approximability and in-approximability results for no-wait shop scheduling. FOCS Maxim Sviridenko, Gerhard J. Woeginger
2000	—	`conf`	Caching for Web Searching. SWAT Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger
2000	J	`jnl`	Introduction. Algorithmica Gerhard J. Woeginger
2000	J	`jnl`	Monge strikes again: optimal placement of web proxies in the internet. Oper. Res. Lett. Gerhard J. Woeginger
2000	J	`jnl`	On the Complexity of Function Learning Electron. Colloquium Comput. Complex. Peter Auer, Philip M. Long, Wolfgang Maass, Gerhard J. Woeginger
2000	J	`jnl`	On-line scheduling on a single machine: maximizing the number of early jobs. Oper. Res. Lett. Han Hoogeveen, Chris N. Potts, Gerhard J. Woeginger
2000	A	`conf`	Preemptive Scheduling with Rejection. ESA Han Hoogeveen, Martin Skutella, Gerhard J. Woeginger
2000	J	`jnl`	Pseudo-Hamiltonian Graphs. Acta Cybern. Luitpold Babel, Gerhard J. Woeginger
2000	A*	`conf`	Resource Augmentation for Online Bounded Space Bin Packing. ICALP János Csirik, Gerhard J. Woeginger
2000	A*	`conf`	Scheduling a pipelined operator graph. SODA Petra Schuurman, Gerhard J. Woeginger
2000	J	`jnl`	Semi-online scheduling with decreasing job sizes. Oper. Res. Lett. Steven S. Seiden, Jirí Sgall, Gerhard J. Woeginger
2000	J	`jnl`	The Maximum Travelling Salesman Problem on Symmetric Demidenko Matrices. Discret. Appl. Math. Vladimir G. Deineko, Gerhard J. Woeginger
2000	J	`jnl`	When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? INFORMS J. Comput. Gerhard J. Woeginger
1999	A*	`conf`	A PTAS for Minimizing the Weighted Sum of Job Completion Times on Parallel Machines. STOC Martin Skutella, Gerhard J. Woeginger
1999	J	`jnl`	A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources. Oper. Res. Lett. Dorit S. Hochbaum, Gerhard J. Woeginger
1999	J	`jnl`	A note on the bottleneck graph partition problem. Networks Bettina Klinz, Gerhard J. Woeginger
1999	J	`jnl`	A note on the complexity of the transportation problem with a permutable demand vector. Math. Methods Oper. Res. Mihály Hujter, Bettina Klinz, Gerhard J. Woeginger
1999	J	`jnl`	An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine. INFORMS J. Comput. Gerhard J. Woeginger
1999	A*	`conf`	An FPTAS for Agreeably Weighted Variance on a Single Machine. ICALP Gerhard J. Woeginger
1999	J	`jnl`	Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine. SIAM J. Comput. Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woeginger
1999	J	`jnl`	Approximation algorithms for the multiprocessor open shop scheduling problem. Oper. Res. Lett. Petra Schuurman, Gerhard J. Woeginger
1999	J	`jnl`	Erratum: The Travelling Salesman and the PQ-Tree. Math. Oper. Res. Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger
1999	B	`ed.`	Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings IPCO Gérard Cornuéjols, Rainer E. Burkard, Gerhard J. Woeginger
1999	J	`jnl`	Minimum-cost strong network orientation problems: Classification, complexity, and algorithms. Networks Rainer E. Burkard, Karin Feldbacher, Bettina Klinz, Gerhard J. Woeginger
1999	J	`jnl`	On-Line Scheduling on a Single Machine: Minimizing the Total Completion Time. Acta Informatica Amos Fiat, Gerhard J. Woeginger
1999	J	`jnl`	Optimal on-line algorithms for variable-sized bin covering. Oper. Res. Lett. Gerhard J. Woeginger, Guochuan Zhang
1999	A*	`conf`	Preemptive Scheduling with Job-Dependent Setup Times. SODA Petra Schuurman, Gerhard J. Woeginger
1999	A*	`conf`	Randomized Online Scheduling on Two Uniform Machines. SODA Leah Epstein, John Noga, Steven S. Seiden, Jirí Sgall, Gerhard J. Woeginger
1999	J	`jnl`	Sensitivity Analysis for Knapsack Problems: Another Negative Result. Discret. Appl. Math. Gerhard J. Woeginger
1999	J	`jnl`	The Steiner Tree Problem in Kalmanson Matrices and in Circulant Matrices. J. Comb. Optim. Bettina Klinz, Gerhard J. Woeginger
1999	A*	`conf`	When Does a Dynamic Programming Formulation Guarantee the Existence of an FPTAS? SODA Gerhard J. Woeginger
1998	J	`jnl`	A comment on a minmax location problem. Oper. Res. Lett. Gerhard J. Woeginger
1998	J	`jnl`	A solvable case of the quadratic assignment problem. Oper. Res. Lett. Vladimir G. Deineko, Gerhard J. Woeginger
1998	J	`jnl`	Makespan Minimization in Preemptive Two Machine Job Shops. Computing Sergey V. Sevastianov, Gerhard J. Woeginger
1998	J	`jnl`	Makespan minimization in open shops: A polynomial time approximation scheme. Math. Program. Sergey V. Sevastianov, Gerhard J. Woeginger
1998	J	`jnl`	Minimizing the Number of Tardy Jobs on a Single Machine with Batch Setup Times. Acta Cybern. Günter Rote, Gerhard J. Woeginger
1998	B	`conf`	Non-approximability Results for Scheduling Problems with Minsum Criteria. IPCO Han Hoogeveen, Petra Schuurman, Gerhard J. Woeginger
1998	J	`jnl`	On-Line Scheduling of Two-Machine Open Shops Where Jobs Arrive Over Time. J. Comb. Optim. Bo Chen, Arjen P. A. Vestjens, Gerhard J. Woeginger
1998	J	`jnl`	On-Line and Off-Line Approximation Algorithms for Vector Covering Problems. Algorithmica Noga Alon, Yossi Azar, János Csirik, Leah Epstein, Sergey V. Sevastianov, Arjen P. A. Vestjens, Gerhard J. Woeginger
1998	J	`jnl`	One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs. Oper. Res. Lett. Bettina Klinz, Gerhard J. Woeginger
1998	—	`ed.`	Online Algorithms, The State of the Art (the book grow out of a Dagstuhl Seminar, June 1996) Online Algorithms Amos Fiat, Gerhard J. Woeginger
1998	J	`jnl`	Sequencing jobs that require common resources on a single machine: A solvable case of the TSP. Math. Program. Jack A. A. van der Veen, Gerhard J. Woeginger, Shuzhong Zhang
1998	J	`jnl`	Sometimes Travelling is Easy: The Master Tour Problem. SIAM J. Discret. Math. Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger
1998	B	`conf`	The Maximum Traveling Salesman Problem Under Polyhedral Norms. IPCO Alexander I. Barvinok, David S. Johnson, Gerhard J. Woeginger, Russell Woodroofe
1998	J	`jnl`	The Stock Size Problem. Oper. Res. Hans Kellerer, Vladimir Kotov, Franz Rendl, Gerhard J. Woeginger
1998	J	`jnl`	The Travelling Salesman Problem on Permuted Monge Matrices. J. Comb. Optim. Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger
1998	J	`jnl`	The Travelling Salesman and the PQ-Tree. Math. Oper. Res. Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger
1998	J	`jnl`	The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases. Math. Program. Rainer E. Burkard, Eranda Çela, Günter Rote, Gerhard J. Woeginger
1998	J	`jnl`	The toughness of split graphs. Discret. Math. Gerhard J. Woeginger
1998	J	`jnl`	Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey. SIAM Rev. Rainer E. Burkard, Vladimir G. Deineko, René van Dal, Jack A. A. van der Veen, Gerhard J. Woeginger
1997	J	`jnl`	A polynomial-time approximation scheme for maximizing the minimum machine completion time. Oper. Res. Lett. Gerhard J. Woeginger
1997	A	`ed.`	Algorithms - ESA '97, 5th Annual European Symposium, Graz, Austria, September 15-17, 1997, Proceedings ESA Rainer E. Burkard, Gerhard J. Woeginger
1997	J	`jnl`	Angle-Restricted Tours in the Plane. Comput. Geom. Sándor P. Fekete, Gerhard J. Woeginger
1997	A*	`conf`	Approximation Schemes for Scheduling. SODA Noga Alon, Yossi Azar, Gerhard J. Woeginger, Tal Yadid
1997	J	`jnl`	Greedy Algorithms for On-Line Data Compression. J. Algorithms József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger
1997	J	`jnl`	Hamiltonian cycles in circulant digraphs with two stripes. Discret. Math. Qi Fan Yang, Rainer E. Burkard, Eranda Çela, Gerhard J. Woeginger
1997	J	`jnl`	Minimizing the total completion time in a unit-time open shop with release times. Oper. Res. Lett. Thomas Tautenhahn, Gerhard J. Woeginger
1997	B	`conf`	Pseudo-Hamiltonian Graphs. WG Luitpold Babel, Gerhard J. Woeginger
1997	J	`jnl`	Shelf Algorithms for On-Line Strip Packing. Inf. Process. Lett. János Csirik, Gerhard J. Woeginger
1997	J	`jnl`	Simple But Efficient Approaches for the Collapsing Knapsack Problem. Discret. Appl. Math. Ulrich Pferschy, David Pisinger, Gerhard J. Woeginger
1997	J	`jnl`	The VC-dimension of Set Systems Defined by Graphs. Discret. Appl. Math. Evangelos Kranakis, Danny Krizanc, Berthold Ruf, Jorge Urrutia, Gerhard J. Woeginger
1997	J	`jnl`	There is no Asymptotic PTAS for Two-Dimensional Vector Packing. Inf. Process. Lett. Gerhard J. Woeginger
1997	J	`jnl`	Unit-Time Scheduling Problems with Time Dependent Resources. Computing Thomas Tautenhahn, Gerhard J. Woeginger
1996	A*	`conf`	Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine. STOC Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woeginger
1996	—	`conf`	Competitive Analysis of Algorithms. Online Algorithms Amos Fiat, Gerhard J. Woeginger
1996	—	`conf`	Competitive Odds and Ends. Online Algorithms Amos Fiat, Gerhard J. Woeginger
1996	J	`jnl`	On the Recognition of Permuted Supnick and Incomplete Monge Matrices. Acta Informatica Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger
1996	—	`conf`	On-line Packing and Covering Problems. Online Algorithms János Csirik, Gerhard J. Woeginger
1996	A	`conf`	On-line and Off-line Approximation Algorithms for Vector Covering Problems. ESA Noga Alon, János Csirik, Sergey V. Sevastianov, Arjen P. A. Vestjens, Gerhard J. Woeginger
1996	B	`conf`	One, Two, Three, Many, or: Complexity Aspects of Dynamic Network Flows with Dedicated Arcs. WG Bettina Klinz, Gerhard J. Woeginger
1996	J	`jnl`	The Convex-Hull-and-k-Line Travelling Salesman Problem. Inf. Process. Lett. Vladimir G. Deineko, Gerhard J. Woeginger
1996	J	`jnl`	The Fractional Greedy Algorithm for Data Compression. Computing József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger
1996	B	`conf`	The Quadratic Assignment Problem with a Monotone Anti-Monge and a Symmetric Toeplitz Matrix: Easy and Hard Cases. IPCO Rainer E. Burkard, Eranda Çela, Günter Rote, Gerhard J. Woeginger
1996	B	`conf`	The Travelling Salesman and the PQ-Tree. IPCO Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger
1996	J	`jnl`	Three-dimensional Axial Assignment Problems with Decomposable Cost Coefficients. Discret. Appl. Math. Rainer E. Burkard, Rüdiger Rudolf, Gerhard J. Woeginger
1995	—	`conf`	A New Efficiently Solvable Special Case of the Three-Dimensional Axial Bottleneck Assignment Problem. Combinatorics and Computer Science Bettina Klinz, Gerhard J. Woeginger
1995	J	`jnl`	An optimal algorithm for preemptive on-line scheduling. Oper. Res. Lett. Bo Chen, André van Vliet, Gerhard J. Woeginger
1995	J	`jnl`	Counting Convex Polygons in Planar Point Sets. Inf. Process. Lett. Joseph S. B. Mitchell, Günter Rote, Gopalakrishnan Sundaram, Gerhard J. Woeginger
1995	J	`jnl`	Minimizing the weighted number of late jobs in UET open shops. Math. Methods Oper. Res. Gábor Galambos, Gerhard J. Woeginger
1995	B	`conf`	Minimum Cost Dynamic Flows: The Series-Parallel Case. IPCO Bettina Klinz, Gerhard J. Woeginger
1995	J	`jnl`	On the Complexity of Function Learning. Mach. Learn. Peter Auer, Philip M. Long, Wolfgang Maass, Gerhard J. Woeginger
1995	J	`jnl`	On the rate of taxation in a cooperative bin packing game. Math. Methods Oper. Res. Gerhard J. Woeginger
1995	J	`jnl`	On-line bin packing - A restricted survey. Math. Methods Oper. Res. Gábor Galambos, Gerhard J. Woeginger
1995	J	`jnl`	Permuting Matrices to Avoid Forbidden Submatrices. Discret. Appl. Math. Bettina Klinz, Rüdiger Rudolf, Gerhard J. Woeginger
1995	J	`jnl`	Scheduling with Time-Dependent Execution Times. Inf. Process. Lett. Gerhard J. Woeginger
1995	J	`jnl`	Scheduling with safety distances. Ann. Oper. Res. Frits C. R. Spieksma, Gerhard J. Woeginger, Zhongliang Yu
1995	A	`conf`	Sometimes Travelling is Easy: The Master Tour Problem. ESA Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger
1995	J	`jnl`	The cone of Monge matrices: Extremal rays and applications. Math. Methods Oper. Res. Rüdiger Rudolf, Gerhard J. Woeginger
1995	J	`jnl`	UET-scheduling with chain-type precedence constraints. Comput. Oper. Res. Klaus Jansen, Gerhard J. Woeginger, Zhongliang Yu
1995	B	`conf`	VC-Dimensions for Graphs (Extended Abstract). WG Evangelos Kranakis, Danny Krizanc, Berthold Ruf, Jorge Urrutia, Gerhard J. Woeginger
1995	—	`conf`	Worst-Case Analysis for On-Line Data Compression. Combinatorics and Computer Science József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger
1995	J	`jnl`	on the Recognition of Permuted Bottleneck Monge Matrices. Discret. Appl. Math. Bettina Klinz, Rüdiger Rudolf, Gerhard J. Woeginger
1994	J	`jnl`	A Lower Bound for Randomized On-Line Scheduling Algorithms. Inf. Process. Lett. Bo Chen, André van Vliet, Gerhard J. Woeginger
1994	J	`jnl`	A general approach to avoiding two by two submatrices. Computing Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger
1994	A	`conf`	An Optimal Algorithm for Preemptive On-line Scheduling. ESA Bo Chen, André van Vliet, Gerhard J. Woeginger
1994	J	`jnl`	Fast algorithms for the maximum convolution problem. Oper. Res. Lett. Michael R. Bussieck, Hannes Hassler, Gerhard J. Woeginger, Uwe T. Zimmermann
1994	J	`jnl`	Heuristics for Parallel Machine Scheduling with Delivery Times. Acta Informatica Gerhard J. Woeginger
1994	J	`jnl`	Monge matrices make maximization manageable. Oper. Res. Lett. Ulrich Pferschy, Rüdiger Rudolf, Gerhard J. Woeginger
1994	J	`jnl`	New lower and upper bounds for on-line scheduling. Oper. Res. Lett. Bo Chen, André van Vliet, Gerhard J. Woeginger
1994	J	`jnl`	On-Line Scheduling of Jobs with Fixed Start and End Times. Theor. Comput. Sci. Gerhard J. Woeginger
1994	J	`jnl`	Partitioning Graphs into Two Trees. Acta Cybern. Ulrich Pferschy, Gerhard J. Woeginger, En-Yu Yao
1994	J	`jnl`	Scheduling with Incompatible Jobs. Discret. Appl. Math. Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger
1994	J	`jnl`	Some Geometric Clustering Problems. Nord. J. Comput. Ulrich Pferschy, Rüdiger Rudolf, Gerhard J. Woeginger
1993	J	`jnl`	A Greedy-heuristic for 3-partitioning with similar elements. Computing Hans Kellerer, Gerhard J. Woeginger
1993	J	`jnl`	A Lower Bound for On-Line Vector-Packing Algorithms. Acta Cybern. Gábor Galambos, Hans Kellerer, Gerhard J. Woeginger
1993	J	`jnl`	A Tight Bound for 3-Partitioning. Discret. Appl. Math. Hans Kellerer, Gerhard J. Woeginger
1993	J	`jnl`	An On-Line Scheduling Heuristic With Better Worst Case Ratio Than Graham's List Scheduling. SIAM J. Comput. Gábor Galambos, Gerhard J. Woeginger
1993	B	`conf`	Computing the optimum stock size. IPCO Hans Kellerer, Franz Rendl, Gerhard J. Woeginger
1993	J	`jnl`	Drawing Graphs in the Plane with High Resolution. SIAM J. Comput. Michael Formann, Torben Hagerup, James Haralambides, Michael Kaufmann, Frank Thomson Leighton, Antonios Symvonis, Emo Welzl, Gerhard J. Woeginger
1993	J	`jnl`	Improved Space for Bounded-Space, On-Line Bin-Packing. SIAM J. Discret. Math. Gerhard J. Woeginger
1993	B	`conf`	Maximum Covering with D Cliques. FCT Klaus Jansen, Petra Scheffler, Gerhard J. Woeginger
1993	A*	`conf`	On the Complexity of Function Learning. COLT Peter Auer, Philip M. Long, Wolfgang Maass, Gerhard J. Woeginger
1993	J	`jnl`	On the Euclidean two Paths Problem. Discret. Appl. Math. Hans Kellerer, Gerhard J. Woeginger
1993	A	`conf`	On the Recognition of Permuted Bottleneck Monge Matrices. ESA Bettina Klinz, Rüdiger Rudolf, Gerhard J. Woeginger
1993	J	`jnl`	Reconstructing sets of orthogonal line segments in the plane. Discret. Math. Franz Rendl, Gerhard J. Woeginger
1993	J	`jnl`	The Complexity of Detecting Crossingfree Configurations in the Plane. BIT Klaus Jansen, Gerhard J. Woeginger
1992	J	`jnl`	Almost Tight Bounds for epsilon-Nets. Discret. Comput. Geom. János Komlós, János Pach, Gerhard J. Woeginger
1992	J	`jnl`	Computing Maximum Valued Regions. Acta Cybern. Gerhard J. Woeginger
1992	J	`jnl`	Counting Convex k-Gons in Planar Point Sets. Inf. Process. Lett. Günter Rote, Gerhard J. Woeginger
1992	J	`jnl`	Detecting Cycles Through Three Fixed Vertices in a Graph. Inf. Process. Lett. Herbert Fleischner, Gerhard J. Woeginger
1992	J	`jnl`	Finding Minimum Area k-gons. Discret. Comput. Geom. David Eppstein, Mark H. Overmars, Günter Rote, Gerhard J. Woeginger
1992	J	`jnl`	Finding the Closest Extreme Vertex to a Fixed Point. Inf. Process. Lett. Gerhard J. Woeginger
1992	J	`jnl`	Minimum-Link Paths Among Obstacles in the Plan. Algorithmica Joseph S. B. Mitchell, Günter Rote, Gerhard J. Woeginger
1992	J	`jnl`	On the Equal-Subset-Sum Problem. Inf. Process. Lett. Gerhard J. Woeginger, Zhongliang Yu
1992	J	`jnl`	Polynomial graph-colorings. Discret. Appl. Math. Wolfgang Gutjahr, Emo Welzl, Gerhard J. Woeginger
1992	J	`jnl`	Scheduling with Incompatible Jobs Universität Trier, Mathematik/Informatik, Forschungsbericht Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger
1992	B	`conf`	Scheduling with Incompatible Jobs. WG Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger
1992	J	`jnl`	The Complexity of Detecting Crossingfree Configurations in the Plane Universität Trier, Mathematik/Informatik, Forschungsbericht Klaus Jansen, Gerhard J. Woeginger
1992	J	`jnl`	The Complexity of Finding Arborescences in Hypergraphs. Inf. Process. Lett. Gerhard J. Woeginger
1992	J	`jnl`	The Disjoint Cliques Problem Universität Trier, Mathematik/Informatik, Forschungsbericht Klaus Jansen, Petra Scheffler, Gerhard J. Woeginger
1992	J	`jnl`	The exact LPT-bound for maximizing the minimum completion time. Oper. Res. Lett. János Csirik, Hans Kellerer, Gerhard J. Woeginger
1992	J	`jnl`	UET-scheduling with constrained processor allocations. Comput. Oper. Res. Hans Kellerer, Gerhard J. Woeginger
1991	J	`jnl`	Counting k-Subsets and Convex k-gons in the Plane. Inf. Process. Lett. Günter Rote, Gerhard J. Woeginger, Binhai Zhu, Zhengyan Wang
1991	J	`jnl`	Geometric Clusterings. J. Algorithms Vasilis Capoyleas, Günter Rote, Gerhard J. Woeginger
1991	J	`jnl`	On Minimizing the Sum of k Tardinesses. Inf. Process. Lett. Gerhard J. Woeginger
1990	J	`jnl`	A Simple Solution to the Two Paths Problem in Planar Graphs. Inf. Process. Lett. Gerhard J. Woeginger
1990	A*	`conf`	Drawing Graphs in the Plane with High Resolution FOCS Michael Formann, Torben Hagerup, James Haralambides, Michael Kaufmann, Frank Thomson Leighton, Antonios Symvonis, Emo Welzl, Gerhard J. Woeginger
1990	—	`conf`	Minimum-Link Paths Among Obstacles in the Plane. SCG Joseph S. B. Mitchell, Günter Rote, Gerhard J. Woeginger
1990	J	`jnl`	On the reconstruction of simple polygons. Bull. EATCS Michael Formann, Gerhard J. Woeginger
1990	—	`conf`	Some New Bounds for Epsilon-Nets. SCG János Pach, Gerhard J. Woeginger
1989	A	`conf`	Polynomial Graph-Colorings. STACS Wolfgang Gutjahr, Emo Welzl, Gerhard J. Woeginger
1988	B	`conf`	Epsilon-Nets for Halfplanes. WG Gerhard J. Woeginger