Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGerhard J. Woeginger
Gerhard Johannes Woeginger
Person information
- affiliation: RWTH Aachen University, Department of Computer Science, Germany
- affiliation: Eindhoven University of Technology, Department of Mathematics and Computer Science, The Netherlands
- award (2011): Humboldt Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j297]Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf
:
Non-Preemptive Tree Packing. Algorithmica 85(3): 783-804 (2023)- [c131]Eranda Çela, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf:
A Linear Time Algorithm for Linearizing Quadratic and Higher-Order Shortest Path Problems. IPCO 2023: 466-479 - [i41]Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger:
Recognising permuted Demidenko matrices. CoRR abs/2302.05191 (2023) - [i40]Eranda Çela, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf:
A linear time algorithm for linearizing quadratic and higher-order shortest path problems. CoRR abs/2303.00569 (2023) - 2022
- [j296]Dennis Fischer, Komal Muluk, Gerhard J. Woeginger:
A note on the complexity of the bilevel bottleneck assignment problem. 4OR 20(4): 713-718 (2022) - [j295]Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
Continuous facility location on graphs. Math. Program. 192(1): 207-227 (2022) - 2021
- [j294]Gerhard J. Woeginger:
The trouble with the second quantifier. 4OR 19(2): 157-181 (2021) - [j293]Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
Dispersing Obnoxious Facilities on a Graph. Algorithmica 83(6): 1734-1749 (2021) - [j292]Annette M. C. Ficker, Frits C. R. Spieksma, Gerhard J. Woeginger:
The transportation problem with conflicts. Ann. Oper. Res. 298(1): 207-227 (2021) - [j291]Thomas Lachmann, Stefan Lendl, Gerhard J. Woeginger:
A linear time algorithm for the robust recoverable selection problem. Discret. Appl. Math. 303: 94-107 (2021) - [j290]Astrid Pieterse, Gerhard J. Woeginger:
The subset sum game revisited. Theory Comput. Syst. 65(5): 884-900 (2021) - [j289]Mark de Berg, Kevin Buchin, Bart M. P. Jansen, Gerhard J. Woeginger:
Fine-grained Complexity Analysis of Two Classic TSP Variants. ACM Trans. Algorithms 17(1): 5:1-5:29 (2021) - [c130]Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf:
Non-preemptive Tree Packing. IWOCA 2021: 456-468 - [c129]Dennis Fischer, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
An Investigation of the Recoverable Robust Assignment Problem. IPEC 2021: 19:1-19:14 - [c128]Eranda Çela, Bettina Klinz, Stefan Lendl, James B. Orlin, Gerhard J. Woeginger, Lasse Wulf:
Linearizable Special Cases of the Quadratic Shortest Path Problem. WG 2021: 245-256 - 2020
- [j288]Boris Aronov, Mark de Berg, Aleksandar Markovic, Gerhard J. Woeginger:
Non-Monochromatic and Conflict-Free Colorings on Tree Spaces and Planar Network Spaces. Algorithmica 82(5): 1081-1100 (2020) - [j287]Dennis Fischer, Gerhard J. Woeginger:
A faster algorithm for the continuous bilevel knapsack problem. Oper. Res. Lett. 48(6): 784-786 (2020) - [j286]Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Gerhard J. Woeginger:
Timeline-based planning over dense temporal domains. Theor. Comput. Sci. 813: 305-326 (2020) - [c127]Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
Continuous Facility Location on Graphs. IPCO 2020: 171-181 - [i39]Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger:
Travelling salesman paths on Demidenko matrices. CoRR abs/2009.14746 (2020) - [i38]Dennis Fischer, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
An Investigation of the Recoverable Robust Assignment Problem. CoRR abs/2010.11456 (2020)
2010 – 2019
- 2019
- [j285]Mark de Berg, Tim Leijsen, Aleksandar Markovic, André van Renssen, Marcel Roeloffzen, Gerhard J. Woeginger:
Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. Int. J. Comput. Geom. Appl. 29(1): 49-72 (2019) - [j284]Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger:
Domination When the Stars Are Out. ACM Trans. Algorithms 15(2): 25:1-25:90 (2019) - [j283]Mark de Berg, Sándor Kisfaludi-Bak, Gerhard J. Woeginger:
The complexity of Dominating Set in geometric intersection graphs. Theor. Comput. Sci. 769: 18-31 (2019) - [c126]Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
Dispersing Obnoxious Facilities on a Graph. STACS 2019: 33:1-33:11 - [p1]Gerhard J. Woeginger:
Computation and Complexity. Computing and Software Science 2019: 3-8 - [e11]Bernhard Steffen, Gerhard J. Woeginger:
Computing and Software Science - State of the Art and Perspectives. Lecture Notes in Computer Science 10000, Springer 2019, ISBN 978-3-319-91907-2 [contents] - [i37]Matthias Bentert, Jiehua Chen, Vincent Froese, Gerhard J. Woeginger:
Good Things Come to Those Who Swap Objects on Paths. CoRR abs/1905.04219 (2019) - 2018
- [j282]Annette M. C. Ficker, Frits C. R. Spieksma, Gerhard J. Woeginger:
Robust balanced optimization. EURO J. Comput. Optim. 6(3): 239-266 (2018) - [j281]Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger:
New special cases of the Quadratic Assignment Problem with diagonally structured coefficient matrices. Eur. J. Oper. Res. 267(3): 818-834 (2018) - [j280]Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard J. Woeginger:
Group activity selection problem with approval preferences. Int. J. Game Theory 47(3): 767-796 (2018) - [j279]Alexander S. Kulikov, Gerhard J. Woeginger:
Preface to the Special Issue on Computer Science in Russia 2016. Theory Comput. Syst. 62(3): 465-466 (2018) - [j278]Christoph Dürr, Zdenek Hanzálek, Christian Konrad, Yasmina Seddik, René Sitters, Óscar C. Vásquez, Gerhard J. Woeginger:
The triangle scheduling problem. J. Sched. 21(3): 305-312 (2018) - [c125]Rani Izsak, Nimrod Talmon, Gerhard J. Woeginger:
Committee Selection with Intraclass and Interclass Synergies. AAAI 2018: 1071-1078 - [c124]Boris Aronov, Mark de Berg, Aleksandar Markovic, Gerhard J. Woeginger:
Non-monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces. COCOON 2018: 567-578 - [c123]Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Gerhard J. Woeginger:
Timeline-Based Planning over Dense Temporal Domains with Trigger-less Rules is NP-Complete. ICTCS 2018: 116-127 - [c122]Martin Grohe, Gaurav Rattan, Gerhard J. Woeginger:
Graph Similarity and Approximate Isomorphism. MFCS 2018: 20:1-20:16 - [c121]Gerhard J. Woeginger:
The Open Shop Scheduling Problem. STACS 2018: 4:1-4:12 - [c120]Gerhard J. Woeginger:
Some Easy and Some Not so Easy Geometric Optimization Problems. WAOA 2018: 3-18 - [i36]Martin Grohe, Gaurav Rattan, Gerhard J. Woeginger:
Graph Similarity and Approximate Isomorphism. CoRR abs/1802.08509 (2018) - [i35]Boris Aronov, Mark de Berg, Aleksandar Markovic, Gerhard J. Woeginger:
Non-Monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces. CoRR abs/1805.02538 (2018) - [i34]Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
Dispersing obnoxious facilities on a graph. CoRR abs/1811.08918 (2018) - 2017
- [j277]Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger:
The multi-stripe travelling salesman problem. Ann. Oper. Res. 259(1-2): 21-34 (2017) - [j276]René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Partitioning Perfect Graphs into Stars. J. Graph Theory 85(2): 297-335 (2017) - [j275]Jiehua Chen, Kirk Pruhs, Gerhard J. Woeginger:
The one-dimensional Euclidean domain: finitely many obstructions are not enough. Soc. Choice Welf. 48(2): 409-432 (2017) - [c119]Astrid Pieterse, Gerhard J. Woeginger:
The Subset Sum Game Revisited. ADT 2017: 228-240 - [c118]Mark de Berg, Tim Leijsen, Aleksandar Markovic, André van Renssen, Marcel Roeloffzen, Gerhard J. Woeginger:
Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. ISAAC 2017: 26:1-26:13 - [c117]Mark de Berg, Sándor Kisfaludi-Bak, Gerhard J. Woeginger:
The Dominating Set Problem in Geometric Intersection Graphs. IPEC 2017: 14:1-14:12 - [e10]Hans L. Bodlaender, Gerhard J. Woeginger:
Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers. Lecture Notes in Computer Science 10520, Springer 2017, ISBN 978-3-319-68704-9 [contents] - [i33]Mark de Berg, Tim Leijsen, André van Renssen, Marcel Roeloffzen, Aleksandar Markovic, Gerhard J. Woeginger:
Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. CoRR abs/1701.03388 (2017) - [i32]Danny Hermelin, Judith-Madeleine Kubitza, Dvir Shabtay, Nimrod Talmon, Gerhard J. Woeginger:
Scheduling Two Agents on a Single Machine: A Parameterized Analysis of NP-hard Problems. CoRR abs/1709.04161 (2017) - [i31]Mark de Berg, Sándor Kisfaludi-Bak, Gerhard J. Woeginger:
The Dominating Set Problem in Geometric Intersection Graphs. CoRR abs/1709.05182 (2017) - 2016
- [j274]Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger:
The Focus of Attention Problem. Algorithmica 74(2): 559-573 (2016) - [j273]Leah Epstein, Asaf Levin, Gerhard J. Woeginger:
Vertex Cover Meets Scheduling. Algorithmica 74(3): 1148-1173 (2016) - [j272]Alberto Caprara, Margarida Carvalho, Andrea Lodi, Gerhard J. Woeginger:
Bilevel Knapsack with Interdiction Constraints. INFORMS J. Comput. 28(2): 319-333 (2016) - [j271]Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger:
Linearizable special cases of the QAP. J. Comb. Optim. 31(3): 1269-1279 (2016) - [j270]Robert Bredereck, Jiehua Chen, Gerhard J. Woeginger:
Are there any nicely structured preference profiles nearby? Math. Soc. Sci. 79: 61-73 (2016) - [j269]Cristina Bazgan, Robert Bredereck, Sepp Hartung, André Nichterlein, Gerhard J. Woeginger:
Finding large degree-anonymous subgraphs is hard. Theor. Comput. Sci. 622: 90-110 (2016) - [c116]René van Bevern, Robert Bredereck, Laurent Bulteau, Christian Komusiewicz, Nimrod Talmon, Gerhard J. Woeginger:
Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width. DOOR 2016: 105-120 - [c115]Mark de Berg, Kevin Buchin, Bart M. P. Jansen, Gerhard J. Woeginger:
Fine-Grained Complexity Analysis of Two Classic TSP Variants. ICALP 2016: 5:1-5:14 - [c114]Annette M. C. Ficker, Frits C. R. Spieksma, Gerhard J. Woeginger:
Balanced Optimization with Vector Costs. WAOA 2016: 92-102 - [e9]Alexander S. Kulikov, Gerhard J. Woeginger:
Computer Science - Theory and Applications - 11th International Computer Science Symposium in Russia, CSR 2016, St. Petersburg, Russia, June 9-13, 2016, Proceedings. Lecture Notes in Computer Science 9691, Springer 2016, ISBN 978-3-319-34170-5 [contents] - [i30]Christoph Dürr, Zdenek Hanzálek, Christian Konrad, René Sitters, Óscar C. Vásquez, Gerhard J. Woeginger:
The triangle scheduling problem. CoRR abs/1602.04365 (2016) - [i29]René van Bevern, Robert Bredereck, Laurent Bulteau, Christian Komusiewicz, Nimrod Talmon, Gerhard J. Woeginger:
Precedence-constrained scheduling problems parameterized by partial order width. CoRR abs/1605.00901 (2016) - [i28]Mark de Berg, Kevin Buchin, Bart M. P. Jansen, Gerhard J. Woeginger:
Fine-Grained Complexity Analysis of Two Classic TSP Variants. CoRR abs/1607.02725 (2016) - [i27]Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger:
The multi-stripe travelling salesman problem. CoRR abs/1609.09796 (2016) - 2015
- [j268]Leah Epstein, Asaf Levin, Gerhard J. Woeginger:
The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases. Algorithmica 72(4): 1130-1171 (2015) - [j267]Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger:
Well-solvable cases of the QAP with block-structured matrices. Discret. Appl. Math. 186: 56-65 (2015) - [j266]Ante Custic, Bettina Klinz, Gerhard J. Woeginger:
Geometric versions of the three-dimensional assignment problem under general norms. Discret. Optim. 18: 38-55 (2015) - [j265]René van Bevern, Jiehua Chen, Falk Hüffner, Stefan Kratsch, Nimrod Talmon, Gerhard J. Woeginger:
Approximability and parameterized complexity of multicover by c-intervals. Inf. Process. Lett. 115(10): 744-749 (2015) - [j264]Ali Ridha Mahjoub, Giovanni Rinaldi, Gerhard J. Woeginger:
Preface. Math. Program. 150(1): 1-3 (2015) - [j263]Sebastian Bervoets, Vincent Merlin, Gerhard J. Woeginger:
Vote trading and subset sums. Oper. Res. Lett. 43(1): 99-102 (2015) - [j262]René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Network-Based Vertex Dissolution. SIAM J. Discret. Math. 29(2): 888-914 (2015) - [j261]Noga Alon, Robert Bredereck, Jiehua Chen, Stefan Kratsch, Rolf Niedermeier, Gerhard J. Woeginger:
How to Put Through Your Agenda in Collective Binary Decisions. ACM Trans. Economics and Comput. 4(1): 5:1-5:28 (2015) - [c113]Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger:
A New Tractable Case of the QAP with a Robinson Matrix. COCOA 2015: 709-720 - [c112]Danny Hermelin, Judith-Madeleine Kubitza, Dvir Shabtay, Nimrod Talmon, Gerhard J. Woeginger:
Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs. IPEC 2015: 55-65 - [i26]Jiehua Chen, Kirk Pruhs, Gerhard J. Woeginger:
The one-dimensional Euclidean domain: Finitely many obstructions are not enough. CoRR abs/1506.03838 (2015) - [i25]Robert Bredereck, Jiehua Chen, Gerhard J. Woeginger:
Are there any nicely structured preference~profiles~nearby? CoRR abs/1509.04595 (2015) - 2014
- [j260]Vladimir G. Deineko, Bettina Klinz, Alexander Tiskin, Gerhard J. Woeginger:
Four-point conditions for the TSP: The complete complexity classification. Discret. Optim. 14: 147-159 (2014) - [j259]Robert Bredereck, Jiehua Chen, Sepp Hartung, Stefan Kratsch, Rolf Niedermeier, Ondrej Suchý, Gerhard J. Woeginger:
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. J. Artif. Intell. Res. 50: 409-446 (2014) - [j258]Gerhard J. Woeginger:
Investigations on the step-based research indices of Chambers and Miller. J. Informetrics 8(3): 659-666 (2014) - [j257]Andrea Lodi, Ted K. Ralphs, Gerhard J. Woeginger:
Bilevel programming and the separation problem. Math. Program. 146(1-2): 437-458 (2014) - [j256]Vladimir G. Deineko, Gerhard J. Woeginger:
Two hardness results for Gamson's game. Soc. Choice Welf. 43(4): 963-972 (2014) - [j255]Alberto Caprara, Margarida Carvalho, Andrea Lodi, Gerhard J. Woeginger:
A Study on the Computational Complexity of the Bilevel Knapsack Problem. SIAM J. Optim. 24(2): 823-838 (2014) - [c111]Vladimir G. Deineko, Gerhard J. Woeginger:
Another Look at the Shoelace TSP: The Case of Very Old Shoes. FUN 2014: 125-136 - [c110]René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Star Partitions of Perfect Graphs. ICALP (1) 2014: 174-185 - [c109]René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Network-Based Dissolution. MFCS (2) 2014: 69-80 - [c108]Jirí Sgall, Gerhard J. Woeginger:
Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms. WAOA 2014: 236-247 - [i24]Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard J. Woeginger:
Group Activity Selection Problem. CoRR abs/1401.8151 (2014) - [i23]René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Star Partitions of Perfect Graphs. CoRR abs/1402.2589 (2014) - [i22]René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Network-Based Dissolution. CoRR abs/1402.2664 (2014) - [i21]Ante Custic, Bettina Klinz, Gerhard J. Woeginger:
Planar 3-dimensional assignment problems with Monge-like cost arrays. CoRR abs/1405.5210 (2014) - [i20]Robert Bredereck, Jiehua Chen, Piotr Faliszewski, Jiong Guo, Rolf Niedermeier, Gerhard J. Woeginger:
Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges. CoRR abs/1407.2143 (2014) - [i19]Ante Custic, Bettina Klinz, Gerhard J. Woeginger:
Geometric versions of the 3-dimensional assignment problem under general norms. CoRR abs/1409.0845 (2014) - [i18]Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger:
Linearizable special cases of the QAP. CoRR abs/1409.6510 (2014) - 2013
- [j254]Vladimir G. Deineko, Gerhard J. Woeginger:
Complexity and in-approximability of a selection problem in robust optimization. 4OR 11(3): 249-252 (2013) - [j253]Christian Eggermont, Cor A. J. Hurkens, Gerhard J. Woeginger:
Realizing Small Tournaments Through Few Permutations. Acta Cybern. 21(2): 267-271 (2013) - [j252]Vladimir G. Deineko, Gerhard J. Woeginger:
Two hardness results for core stability in hedonic coalition formation games. Discret. Appl. Math. 161(13-14): 1837-1842 (2013) - [j251]Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginger:
Fully decomposable split graphs. Eur. J. Comb. 34(3): 567-575 (2013) - [j250]Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger:
The three-dimensional matching problem in Kalmanson matrices. J. Comb. Optim. 26(1): 1-9 (2013) - [j249]Christian Eggermont, Alexander Schrijver, Gerhard J. Woeginger:
Analysis of multi-stage open shop processing systems. Math. Program. 142(1-2): 331-348 (2013) - [j248]Gerhard J. Woeginger:
A hardness result for core stability in additive hedonic games. Math. Soc. Sci. 65(2): 101-104 (2013) - [j247]Christian Eggermont, Gerhard J. Woeginger:
Motion Planning with Pulley, Rope, and Baskets. Theory Comput. Syst. 53(4): 569-582 (2013) - [j246]Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger:
Uniqueness in quadratic and hyperbolic 0-1 programming problems. Oper. Res. Lett. 41(6): 633-635 (2013) - [j245]Robert Bredereck, Jiehua Chen, Gerhard J. Woeginger:
A characterization of the single-crossing domain. Soc. Choice Welf. 41(4): 989-998 (2013) - [j244]Gerhard J. Woeginger:
Nothing New about Equiangular Polygons. Am. Math. Mon. 120(9): 849-850 (2013) - [c107]Noga Alon, Robert Bredereck, Jiehua Chen, Stefan Kratsch, Rolf Niedermeier, Gerhard J. Woeginger:
How to Put through Your Agenda in Collective Binary Decisions. ADT 2013: 30-44 - [c106]Robert Bredereck, Jiehua Chen, Gerhard J. Woeginger:
Are There Any Nicely Structured Preference Profiles Nearby? IJCAI 2013: 62-68 - [c105]Alberto Caprara, Margarida Carvalho, Andrea Lodi, Gerhard J. Woeginger:
A Complexity and Approximability Study of the Bilevel Knapsack Problem. IPCO 2013: 98-109 - [c104]Robert Bredereck, Sepp Hartung, André Nichterlein, Gerhard J. Woeginger:
The Complexity of Finding a Large Subgraph under Anonymity Constraints. ISAAC 2013: 152-162 - [c103]Gerhard J. Woeginger:
Core Stability in Hedonic Coalition Formation. SOFSEM 2013: 33-50 - [i17]Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger:
Uniqueness in quadratic and hyperbolic 0-1 programming problems. CoRR abs/1312.0903 (2013) - 2012
- [j243]Bastian Katz, Ignaz Rutter, Gerhard J. Woeginger:
An algorithmic study of switch graphs. Acta Informatica 49(5): 295-312 (2012) - [j242]Marek Chrobak, Gerhard J. Woeginger, Kazuhisa Makino, Haifeng Xu:
Caching Is Hard - Even in the Fault Model. Algorithmica 63(4): 781-794 (2012) - [j241]Christoph Dürr, Maurice Queyranne, Frits C. R. Spieksma, Fabrice Talla Nobibon, Gerhard J. Woeginger:
The interval ordering problem. Discret. Appl. Math. 160(7-8): 1094-1103 (2012) - [j240]Erwin Pesch, Gerhard J. Woeginger:
Guest Editorial to the special issue "Operations Research in Health Care" (EURO XXIII, July 5-8, 2009, Bonn). Eur. J. Oper. Res. 219(3): 489-490 (2012) - [j239]Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger:
The x-and-y-axes travelling salesman problem. Eur. J. Oper. Res. 223(2): 333-345 (2012) - [j238]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. Methods Oper. Res. 76(2): 223-237 (2012) - [j237]Cor A. J. Hurkens, Andrea Lodi, Silvano Martello, Michele Monaci, Gerhard J. Woeginger:
Complexity and approximation of an area packing problem. Optim. Lett. 6(1): 1-9 (2012) - [j236]