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
Journal Articles
- 2023
[j300]Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf
:
Non-Preemptive Tree Packing. Algorithmica 85(3): 783-804 (2023)- [j299]Dirk Briskorn, Gerhard J. Woeginger:
Hardness of flow time minimization in a crossdock with a single door and asymmetric handover relations. Oper. Res. Lett. 51(3): 285-288 (2023) - [j298]Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger:
Recognising permuted Demidenko matrices. Oper. Res. Lett. 51(5): 494-500 (2023) - [j297]Jirí Sgall, Gerhard J. Woeginger:
Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms. Oper. Res. Lett. 51(6): 583-590 (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) - 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) - 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) - 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) - 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) - 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) - 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) - 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) - 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) - 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]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) - [j235]Hans L. Bodlaender, Petra Schuurman, Gerhard J. Woeginger:
Scheduling of pipelined operator graphs. J. Sched. 15(3): 323-332 (2012) - [j234]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 Rev. 54(1): 141-154 (2012) - [j233]Rudolf Fleischer, Gerhard J. Woeginger:
An algorithmic analysis of the Honey-Bee game. Theor. Comput. Sci. 452: 75-87 (2012) - 2011
- [j232]Rong Su, Gerhard J. Woeginger:
String execution time for finite languages: Max is easy, min is hard. Autom. 47(10): 2326-2329 (2011) - [j231]Zdenek Ryjácek, Gerhard J. Woeginger, Liming Xiong:
Hamiltonian index is NP-complete. Discret. Appl. Math. 159(4): 246-250 (2011) - [j230]Bettina Klinz, Gerhard J. Woeginger:
The Northwest corner rule revisited. Discret. Appl. Math. 159(12): 1284-1289 (2011) - [j229]Andreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger:
Paths, trees and matchings under disjunctive constraints. Discret. Appl. Math. 159(16): 1726-1735 (2011) - [j228]Eranda Çela, Nina S. Schmuck, Shmuel Wimer, Gerhard J. Woeginger:
The Wiener maximum quadratic assignment problem. Discret. Optim. 8(3): 411-416 (2011) - [j227]Vladimir G. Deineko, Gerhard J. Woeginger:
Unbounded knapsack problems with arithmetic weight sequences. Eur. J. Oper. Res. 213(2): 384-387 (2011) - [j226]Sofie Coene, Frits C. R. Spieksma, Gerhard J. Woeginger:
Charlemagne's Challenge: The Periodic Latency Problem. Oper. Res. 59(3): 674-683 (2011) - [j225]Leah Epstein, Asaf Levin, Gerhard J. Woeginger:
Graph coloring with rejection. J. Comput. Syst. Sci. 77(2): 439-447 (2011) - [j224]Murat Firat, Gerhard J. Woeginger:
Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh. Oper. Res. Lett. 39(1): 32-35 (2011) - [j223]Vladimir G. Deineko, Gerhard J. Woeginger:
A well-solvable special case of the bounded knapsack problem. Oper. Res. Lett. 39(2): 118-120 (2011) - 2010
- [j222]Gerhard J. Woeginger:
An Algorithmic Comparison of Three Scientific Impact Indices. Acta Cybern. 19(3): 661-672 (2010) - [j221]Vladimir G. Deineko, Gerhard J. Woeginger:
Pinpointing the complexity of the interval min-max regret knapsack problem. Discret. Optim. 7(4): 191-196 (2010) - [j220]Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger:
The approximability of three-dimensional assignment problems with bottleneck objective. Optim. Lett. 4(1): 7-16 (2010) - [j219]Gabriella Muratore, Ulrich M. Schwarz, Gerhard J. Woeginger:
Parallel machine scheduling with nested job assignment restrictions. Oper. Res. Lett. 38(1): 47-50 (2010) - [j218]Adriana Felicia Gabor, Gerhard J. Woeginger:
How * not * to solve a Sudoku. Oper. Res. Lett. 38(6): 582-584 (2010) - [j217]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. Discret. Math. 24(3): 757-769 (2010) - 2009
- [j216]Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger:
Polygons with inscribed circles and prescribed side lengths. Appl. Math. Lett. 22(5): 704-706 (2009) - [j215]Andreas T. Ernst, Horst W. Hamacher, Houyuan Jiang, Mohan Krishnamoorthy, Gerhard J. Woeginger:
Uncapacitated single and multiple allocation p-hub center problems. Comput. Oper. Res. 36(7): 2230-2241 (2009) - [j214]John van den Broek, Cor A. J. Hurkens, Gerhard J. Woeginger:
Timetabling problems at the TU Eindhoven. Eur. J. Oper. Res. 196(3): 877-885 (2009) - [j213]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) - [j212]Gerhard J. Woeginger:
Generalizations of Egghe's g-index. J. Assoc. Inf. Sci. Technol. 60(6): 1267-1273 (2009) - [j211]Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger:
The complexity of computing the Muirhead-Dalton distance. Math. Soc. Sci. 57(2): 282-284 (2009) - [j210]Gerhard J. Woeginger:
Threshold aggregation of multi-graded rankings. Math. Soc. Sci. 58(1): 58-63 (2009) - [j209]Christian Eggermont, Cor A. J. Hurkens, Maciej Modelski, Gerhard J. Woeginger:
The hardness of train rearrangements. Oper. Res. Lett. 37(2): 80-82 (2009) - [j208]Vladimir G. Deineko, Gerhard J. Woeginger:
A new family of scientific impact measures: The generalized Kosmulski-indices. Scientometrics 80(3): 819-826 (2009) - [j207]Pim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger:
Partitioning graphs into connected parts. Theor. Comput. Sci. 410(47-49): 4834-4843 (2009) - [j206]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) - 2008
- [j205]Gerhard J. Woeginger:
Open problems around exact algorithms. Discret. Appl. Math. 156(3): 397-405 (2008) - [j204]Rudi Pendavingh, Quintijn Puite, Gerhard J. Woeginger:
2-piercings via graph theory. Discret. Appl. Math. 156(18): 3510-3512 (2008) - [j203]Gerhard J. Woeginger:
Four Non-Deterministic Programming Exercises. Bull. EATCS 94: 207-211 (2008) - [j202]Axel Born, Cor A. J. Hurkens, Gerhard J. Woeginger:
The Freudenthal Problem and its Ramifications (Part III). Bull. EATCS 95: 201-219 (2008) - [j201]Fokko J. van de Bult, Gerhard J. Woeginger:
The problem of the moody chess players. Inf. Process. Lett. 108(5): 336-337 (2008) - [j200]Cor A. J. Hurkens, Rudi Pendavingh, Gerhard J. Woeginger:
The Magnus-Derek game revisited. Inf. Process. Lett. 109(1): 38-40 (2008) - [j199]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) - [j198]Gerhard J. Woeginger:
A symmetry axiom for scientific impact indices. J. Informetrics 2(4): 298-303 (2008) - [j197]Gerhard J. Woeginger:
An axiomatic analysis of Egghe's g-index. J. Informetrics 2(4): 364-368 (2008) - [j196]Gerhard J. Woeginger:
An axiomatic characterization of the Hirsch-index. Math. Soc. Sci. 56(2): 224-232 (2008) - [j195]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) - [j194]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) - [j193]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) - [j192]Kirk Pruhs, Patchrawat Uthaisombut, Gerhard J. Woeginger:
Getting the best response for your erg. ACM Trans. Algorithms 4(3): 38:1-38:17 (2008) - 2007
- [j191]Jirí Sgall, Gerhard J. Woeginger:
An Approximation Scheme For Cake Division With A Linear Number Of Cuts. Comb. 27(2): 205-211 (2007) - [j190]Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic, Gerhard J. Woeginger:
Eliminating graphs by means of parallel knock-out schemes. Discret. Appl. Math. 155(2): 92-102 (2007) - [j189]Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak, Petra Schuurman, Gerhard J. Woeginger:
A polynomial time equivalence between DNA sequencing and the exact perfect matching problem. Discret. Optim. 4(2): 154-162 (2007) - [j188]Gerhard J. Woeginger, Jirí Sgall:
On the complexity of cake cutting. Discret. Optim. 4(2): 213-220 (2007) - [j187]Axel Born, Cor A. J. Hurkens, Gerhard J. Woeginger:
The Freudenthal Problem and its Ramifications (Part II). Bull. EATCS 91: 189-204 (2007) - [j186]Arianna Alfieri, Steef L. van de Velde, Gerhard J. Woeginger:
Roll cutting in the curtain industry, or: A well-solvable allocation problem. Eur. J. Oper. Res. 183(3): 1397-1404 (2007) - [j185]Ulrich Blasum, Winfried Hochstättler, Peter Oertel, Gerhard J. Woeginger:
Steiner diagrams and k-star hubs. J. Discrete Algorithms 5(3): 622-634 (2007) - [j184]Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger:
Backbone colorings for graphs: Tree and path backbones. J. Graph Theory 55(2): 137-152 (2007) - [j183]Walter Kern, Gerhard J. Woeginger:
Quadratic programming and combinatorial minimum weight product problems. Math. Program. 110(3): 641-649 (2007) - [j182]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) - [j181]Jos C. M. Baeten, Jan Karel Lenstra, Gerhard J. Woeginger:
Preface. Theor. Comput. Sci. 379(3): 305 (2007) - [j180]Kirk Pruhs, Gerhard J. Woeginger:
Approximation schemes for a class of subset selection problems. Theor. Comput. Sci. 382(2): 151-156 (2007) - 2006
- [j179]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) - [j178]Vladimir G. Deineko, Gerhard J. Woeginger:
Well-solvable instances for the partition problem. Appl. Math. Lett. 19(10): 1053-1056 (2006) - [j177]Gerhard F. Post, Gerhard J. Woeginger:
Sports tournaments, home-away assignments, and the break minimization problem. Discret. Optim. 3(2): 165-173 (2006) - [j176]Vladimir G. Deineko, Gerhard J. Woeginger:
Some Problems around Traveling Salesmen, Dart Boards, and Euro-coins. Bull. EATCS 90: 43-52 (2006) - [j175]Axel Born, Cor A. J. Hurkens, Gerhard J. Woeginger:
The Freudenthal Problem and its Ramifications (Part I). Bull. EATCS 90: 175-191 (2006) - [j174]John van den Broek, Cor A. J. Hurkens, Gerhard J. Woeginger:
Timetabling problems at the TU Eindhoven. Electron. Notes Discret. Math. 25: 27-28 (2006) - [j173]Tobias Brüggemann, Johann L. Hurink, Tjark Vredeveld, Gerhard J. Woeginger:
Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines. Electron. Notes Discret. Math. 25: 29-33 (2006) - [j172]Vladimir G. Deineko, Gerhard J. Woeginger:
On the dimension of simple monotonic games. Eur. J. Oper. Res. 170(1): 315-318 (2006) - [j171]Gerhard J. Woeginger:
A Note on Fair Division under Interval Uncertainty. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 14(6): 753-756 (2006) - [j170]Asaf Levin, Gerhard J. Woeginger:
The constrained minimum weighted sum of job completion times problem. Math. Program. 108(1): 115-126 (2006) - [j169]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) - [j168]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) - [j167]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) - [j166]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) - 2005
- [j165]Hajo Broersma, Xueliang Li, Gerhard J. Woeginger, Shenggui Zhang:
Paths and cycles in colored graphs. Australas. J Comb. 31: 299-312 (2005) - [j164]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) - [j163]Davaatseren Baatar, Horst W. Hamacher, Matthias Ehrgott, Gerhard J. Woeginger:
Decomposition of integer matrices and multileaf collimator sequencing. Discret. Appl. Math. 152(1-3): 6-34 (2005) - [j162]Gerhard J. Woeginger:
A comment on scheduling two parallel machines with capacity constraints. Discret. Optim. 2(3): 269-272 (2005) - [j161]Mark Cieliebak, Stephan J. Eidenbenz, Gerhard J. Woeginger:
Complexity and Approximability of Double Digest. J. Bioinform. Comput. Biol. 3(2): 207-224 (2005) - [j160]Steven S. Seiden, Gerhard J. Woeginger:
The two-dimensional cutting stock problem revisited. Math. Program. 102(3): 519-530 (2005) - [j159]Bettina Klinz, Gerhard J. Woeginger:
Faster algorithms for computing power indices in weighted voting games. Math. Soc. Sci. 49(1): 111-116 (2005) - [j158]Gerhard J. Woeginger:
Combinatorial approximation algorithms: a comparative review. Oper. Res. Lett. 33(2): 210-215 (2005) - [j157]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) - [j156]Frits C. R. Spieksma, Gerhard J. Woeginger:
The no-wait flow-shop paradox. Oper. Res. Lett. 33(6): 603-608 (2005) - [j155]Jaroslav Nesetril, Gerhard J. Woeginger:
Graph colorings. Theor. Comput. Sci. 349(1): 1 (2005) - 2004
- [j154]Alexander Grigoriev, Gerhard J. Woeginger:
Project scheduling with irregular costs: complexity, approximability, and algorithms. Acta Informatica 41(2-3): 83-97 (2004) - [j153]Yossi Azar, Leah Epstein, Yossi Richter, Gerhard J. Woeginger:
All-norm approximation algorithms. J. Algorithms 52(2): 120-133 (2004) - [j152]Bettina Klinz, Gerhard J. Woeginger:
Minimum-cost dynamic flows: The series-parallel case. Networks 43(3): 153-162 (2004) - [j151]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) - [j150]Gerhard J. Woeginger:
Inapproximability results for no-wait job shop scheduling. Oper. Res. Lett. 32(4): 320-325 (2004) - [j149]Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger:
Radio Labeling with Preassigned Frequencies. SIAM J. Optim. 15(1): 1-16 (2004) - [j148]Daniel Král, Vladan Majerech, Jirí Sgall, Tomás Tichý, Gerhard J. Woeginger:
It is tough to be a plumber. Theor. Comput. Sci. 313(3): 473-484 (2004) - [j147]Gerhard J. Woeginger:
Seventeen lines and one-hundred-and-one points. Theor. Comput. Sci. 321(2-3): 415-421 (2004) - 2003
- [j146]Piotr Rudnicki, Gerhard J. Woeginger:
The post correspondence problem over a unary alphabet. Appl. Math. Lett. 16(5): 723-727 (2003) - [j145]Rudi Pendavingh, Petra Schuurman, Gerhard J. Woeginger:
Recognizing DNA graphs is difficult. Discret. Appl. Math. 127(1): 85-94 (2003) - [j144]Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger:
Which matrices are immune against the transportation paradox? Discret. Appl. Math. 130(3): 495-501 (2003) - [j143]Gerhard J. Woeginger:
On the approximability of average completion time scheduling under precedence constraints. Discret. Appl. Math. 131(1): 237-252 (2003) - [j142]Hajo Broersma, Ulrich Faigle, Johann L. Hurink, Stefan Pickl, Gerhard J. Woeginger:
Preface: Volume 13. Electron. Notes Discret. Math. 13: 128 (2003) - [j141]Vladimir G. Deineko, Gerhard J. Woeginger:
Complexity and approximability results for slicing floorplan designs. Eur. J. Oper. Res. 149(3): 533-539 (2003) - [j140]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) - [j139]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) - [j138]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) - [j137]Gerhard J. Woeginger:
A note on the complexity of determining optimal strategies in games with common payoffs. Math. Methods Oper. Res. 58(2): 183-189 (2003) - [j136]Han Hoogeveen, Martin Skutella, Gerhard J. Woeginger:
Preemptive scheduling with rejection. Math. Program. 94(2-3): 361-374 (2003) - [j135]Gerhard J. Woeginger:
A note on scoring rules that respect majority in choice and elimination. Math. Soc. Sci. 46(3): 347-354 (2003) - [j134]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) - [j133]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) - [j132]Gerhard J. Woeginger:
Banks winners in tournaments are difficult to recognize. Soc. Choice Welf. 20(3): 523-528 (2003) - [j131]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) - [j130]Marek Chrobak, Peter Couperus, Christoph Dürr, Gerhard J. Woeginger:
On tiling under tomographic constraints. Theor. Comput. Sci. 290(3): 2125-2136 (2003) - 2002
- [j129]Petra Schuurman, Gerhard J. Woeginger:
A PTAS for single machine scheduling with controllable processing times. Acta Cybern. 15(3): 369-378 (2002) - [j128]Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger:
Caching for Web Searching. Algorithmica 33(3): 353-370 (2002) - [j127]George A. Constantinides, Gerhard J. Woeginger:
The complexity of multiple wordlength assignment. Appl. Math. Lett. 15(2): 137-140 (2002) - [j126]Han Hoogeveen, Gerhard J. Woeginger:
Some Comments on Sequencing with Controllable Processing Times. Computing 68(2): 181-192 (2002) - [j125]Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger:
More About Subcolorings. Computing 69(3): 187-203 (2002) - [j124]Gerhard J. Woeginger:
Open problems in the theory of scheduling. Bull. EATCS 76: 67-83 (2002) - [j123]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) - [j122]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) - [j121]János Csirik, Gerhard J. Woeginger:
Resource augmentation for online bounded space bin packing. J. Algorithms 44(2): 308-320 (2002) - [j120]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) - [j119]Gerhard J. Woeginger:
An efficient algorithm for a class of constraint satisfaction problems. Oper. Res. Lett. 30(1): 9-16 (2002) - [j118]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) - [j117]Gerhard J. Woeginger:
Embeddings of planar graphs that minimize the number of long-face cycles. Oper. Res. Lett. 30(3): 167-168 (2002) - [j116]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) - [j115]Alfred J. van der Poorten, Gerhard J. Woeginger:
Squares from Products of Consecutive Integers. Am. Math. Mon. 109(5): 459-462 (2002) - [j114]Eric Anderson, Marek Chrobak, John Noga, Jirí Sgall, Gerhard J. Woeginger:
Solution of a problem in DNA computing. Theor. Comput. Sci. 287(2): 387-391 (2002) - [j113]Yossi Azar, Oded Regev, Jirí Sgall, Gerhard J. Woeginger:
Off-line temporary tasks assignment. Theor. Comput. Sci. 287(2): 419-428 (2002) - 2001
- [j112]Gerhard J. Woeginger, Jirí Sgall:
The complexity of coloring graphs without long induced paths. Acta Cybern. 15(1): 107-117 (2001) - [j111]Gerhard J. Woeginger:
A note on the depth function of combinatorial optimization problems. Discret. Appl. Math. 108(3): 325-328 (2001) - [j110]Sergey V. Sevastianov, Gerhard J. Woeginger:
Linear time approximation scheme for the multiprocessor open shop problem. Discret. Appl. Math. 114(1-3): 273-288 (2001) - [j109]Han Hoogeveen, Petra Schuurman, Gerhard J. Woeginger:
Non-Approximability Results for Scheduling Problems with Minsum Criteria. INFORMS J. Comput. 13(2): 157-168 (2001) - [j108]Gerhard J. Woeginger:
The reconstruction of polyominoes from their orthogonal projections. Inf. Process. Lett. 77(5-6): 225-229 (2001) - [j107]Vladimir G. Deineko, Gerhard J. Woeginger:
A comment on consecutive-2-out-of-n systems. Oper. Res. Lett. 28(4): 169-171 (2001) - [j106]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) - [j105]Vladimir G. Deineko, Gerhard J. Woeginger:
Hardness of approximation of the discrete time-cost tradeoff problem. Oper. Res. Lett. 29(5): 207-210 (2001) - [j104]Han Hoogeveen, Gerhard J. Woeginger:
A very difficult scheduling problem with communication delays. Oper. Res. Lett. 29(5): 241-245 (2001) - 2000
- [j103]Luitpold Babel, Gerhard J. Woeginger:
Pseudo-Hamiltonian Graphs. Acta Cybern. 14(4): 553-567 (2000) - [j102]Gerhard J. Woeginger:
Introduction. Algorithmica 28(1): 1 (2000) - [j101]Vladimir G. Deineko, Gerhard J. Woeginger:
The Maximum Travelling Salesman Problem on Symmetric Demidenko Matrices. Discret. Appl. Math. 99(1-3): 413-425 (2000) - [j100]Gerhard J. Woeginger:
When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? INFORMS J. Comput. 12(1): 57-74 (2000) - [j99]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) - [j98]Vladimir G. Deineko, Gerhard J. Woeginger:
A study of exponential neighborhoods for the Travelling Salesman Problem and for the Quadratic Assignment Problem. Math. Program. 87(3): 519-542 (2000) - [j97]Gerhard J. Woeginger:
A comment on scheduling on uniform machines under chain-type precedence constraints. Oper. Res. Lett. 26(3): 107-109 (2000) - [j96]Gerhard J. Woeginger:
Monge strikes again: optimal placement of web proxies in the internet. Oper. Res. Lett. 27(3): 93-96 (2000) - [j95]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) - [j94]Steven S. Seiden, Jirí Sgall, Gerhard J. Woeginger:
Semi-online scheduling with decreasing job sizes. Oper. Res. Lett. 27(5): 215-221 (2000) - [j93]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) - 1999
- [j92]Amos Fiat, Gerhard J. Woeginger:
On-Line Scheduling on a Single Machine: Minimizing the Total Completion Time. Acta Informatica 36(4): 287-293 (1999) - [j91]Gerhard J. Woeginger:
Sensitivity Analysis for Knapsack Problems: Another Negative Result. Discret. Appl. Math. 92(2-3): 247-251 (1999) - [j90]Gerhard J. Woeginger:
An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine. INFORMS J. Comput. 11(2): 211-216 (1999) - [j89]Bettina Klinz, Gerhard J. Woeginger:
The Steiner Tree Problem in Kalmanson Matrices and in Circulant Matrices. J. Comb. Optim. 3(1): 51-58 (1999) - [j88]Mihály Hujter, Bettina Klinz, Gerhard J. Woeginger:
A note on the complexity of the transportation problem with a permutable demand vector. Math. Methods Oper. Res. 50(1): 9-16 (1999) - [j87]Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger:
Erratum: The Travelling Salesman and the PQ-Tree. Math. Oper. Res. 24(1): 262-272 (1999) - [j86]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) - [j85]Bettina Klinz, Gerhard J. Woeginger:
A note on the bottleneck graph partition problem. Networks 33(3): 189-191 (1999) - [j84]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) - [j83]Petra Schuurman, Gerhard J. Woeginger:
Approximation algorithms for the multiprocessor open shop scheduling problem. Oper. Res. Lett. 24(4): 157-163 (1999) - [j82]Gerhard J. Woeginger, Guochuan Zhang:
Optimal on-line algorithms for variable-sized bin covering. Oper. Res. Lett. 25(1): 47-50 (1999) - [j81]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) - 1998
- [j80]Günter Rote, Gerhard J. Woeginger:
Minimizing the Number of Tardy Jobs on a Single Machine with Batch Setup Times. Acta Cybern. 13(4): 423-430 (1998) - [j79]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) - [j78]Sergey V. Sevastianov, Gerhard J. Woeginger:
Makespan Minimization in Preemptive Two Machine Job Shops. Computing 60(1): 73-80 (1998) - [j77]Gerhard J. Woeginger:
The toughness of split graphs. Discret. Math. 190(1-3): 295-297 (1998) - [j76]Hans Kellerer, Vladimir Kotov, Franz Rendl, Gerhard J. Woeginger:
The Stock Size Problem. Oper. Res. 46(3-Supplement-3): S1-S12 (1998) - [j75]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) - [j74]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) - [j73]Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger:
The Travelling Salesman and the PQ-Tree. Math. Oper. Res. 23(3): 613-623 (1998) - [j72]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) - [j71]Sergey V. Sevastianov, Gerhard J. Woeginger:
Makespan minimization in open shops: A polynomial time approximation scheme. Math. Program. 82: 191-198 (1998) - [j70]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) - [j69]Vladimir G. Deineko, Gerhard J. Woeginger:
A solvable case of the quadratic assignment problem. Oper. Res. Lett. 22(1): 13-17 (1998) - [j68]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) - [j67]Gerhard J. Woeginger:
A comment on a minmax location problem. Oper. Res. Lett. 23(1-2): 41-43 (1998) - [j66]Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger:
Sometimes Travelling is Easy: The Master Tour Problem. SIAM J. Discret. Math. 11(1): 81-93 (1998) - [j65]Rainer E. Burkard, Vladimir G. Deineko, René van Dal, Jack A. A. van der Veen, Gerhard J. Woeginger:
Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey. SIAM Rev. 40(3): 496-546 (1998) - 1997
- [j64]Sándor P. Fekete, Gerhard J. Woeginger:
Angle-Restricted Tours in the Plane. Comput. Geom. 8: 195-218 (1997) - [j63]Thomas Tautenhahn, Gerhard J. Woeginger:
Unit-Time Scheduling Problems with Time Dependent Resources. Computing 58(2): 97-112 (1997) - [j62]Evangelos Kranakis, Danny Krizanc, Berthold Ruf, Jorge Urrutia, Gerhard J. Woeginger:
The VC-dimension of Set Systems Defined by Graphs. Discret. Appl. Math. 77(3): 237-257 (1997) - [j61]Ulrich Pferschy, David Pisinger, Gerhard J. Woeginger:
Simple But Efficient Approaches for the Collapsing Knapsack Problem. Discret. Appl. Math. 77(3): 271-280 (1997) - [j60]Qi Fan Yang, Rainer E. Burkard, Eranda Çela, Gerhard J. Woeginger:
Hamiltonian cycles in circulant digraphs with two stripes. Discret. Math. 176(1-3): 233-254 (1997) - [j59]János Csirik, Gerhard J. Woeginger:
Shelf Algorithms for On-Line Strip Packing. Inf. Process. Lett. 63(4): 171-175 (1997) - [j58]Gerhard J. Woeginger:
There is no Asymptotic PTAS for Two-Dimensional Vector Packing. Inf. Process. Lett. 64(6): 293-297 (1997) - [j57]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) - [j56]Gerhard J. Woeginger:
A polynomial-time approximation scheme for maximizing the minimum machine completion time. Oper. Res. Lett. 20(4): 149-154 (1997) - [j55]Thomas Tautenhahn, Gerhard J. Woeginger:
Minimizing the total completion time in a unit-time open shop with release times. Oper. Res. Lett. 20(5): 207-212 (1997) - 1996
- [j54]Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger:
On the Recognition of Permuted Supnick and Incomplete Monge Matrices. Acta Informatica 33(6): 559-569 (1996) - [j53]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) - [j52]Rainer E. Burkard, Rüdiger Rudolf, Gerhard J. Woeginger:
Three-dimensional Axial Assignment Problems with Decomposable Cost Coefficients. Discret. Appl. Math. 65(1-3): 123-139 (1996) - [j51]Vladimir G. Deineko, Gerhard J. Woeginger:
The Convex-Hull-and-k-Line Travelling Salesman Problem. Inf. Process. Lett. 59(6): 295-301 (1996) - 1995
- [j50]Frits C. R. Spieksma, Gerhard J. Woeginger, Zhongliang Yu:
Scheduling with safety distances. Ann. Oper. Res. 57(1): 251-264 (1995) - [j49]Klaus Jansen, Gerhard J. Woeginger, Zhongliang Yu:
UET-scheduling with chain-type precedence constraints. Comput. Oper. Res. 22(9): 915-920 (1995) - [j48]Bettina Klinz, Rüdiger Rudolf, Gerhard J. Woeginger:
Permuting Matrices to Avoid Forbidden Submatrices. Discret. Appl. Math. 60(1-3): 223-248 (1995) - [j47]Bettina Klinz, Rüdiger Rudolf, Gerhard J. Woeginger:
on the Recognition of Permuted Bottleneck Monge Matrices. Discret. Appl. Math. 63(1): 43-74 (1995) - [j46]Gerhard J. Woeginger:
Scheduling with Time-Dependent Execution Times. Inf. Process. Lett. 54(3): 155-156 (1995) - [j45]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) - [j44]Peter Auer, Philip M. Long, Wolfgang Maass, Gerhard J. Woeginger:
On the Complexity of Function Learning. Mach. Learn. 18(2-3): 187-230 (1995) - [j43]Gábor Galambos, Gerhard J. Woeginger:
Minimizing the weighted number of late jobs in UET open shops. Math. Methods Oper. Res. 41(1): 109-114 (1995) - [j42]Gábor Galambos, Gerhard J. Woeginger:
On-line bin packing - A restricted survey. Math. Methods Oper. Res. 42(1): 25-45 (1995) - [j41]Rüdiger Rudolf, Gerhard J. Woeginger:
The cone of Monge matrices: Extremal rays and applications. Math. Methods Oper. Res. 42(2): 161-168 (1995) - [j40]Gerhard J. Woeginger:
On the rate of taxation in a cooperative bin packing game. Math. Methods Oper. Res. 42(3): 313-324 (1995) - [j39]Bo Chen, André van Vliet, Gerhard J. Woeginger:
An optimal algorithm for preemptive on-line scheduling. Oper. Res. Lett. 18(3): 127-131 (1995) - 1994
- [j38]Gerhard J. Woeginger:
Heuristics for Parallel Machine Scheduling with Delivery Times. Acta Informatica 31(6): 503-512 (1994) - [j37]Ulrich Pferschy, Gerhard J. Woeginger, En-Yu Yao:
Partitioning Graphs into Two Trees. Acta Cybern. 11(3): 233-240 (1994) - [j36]Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger:
A general approach to avoiding two by two submatrices. Computing 52(4): 371-388 (1994) - [j35]Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger:
Scheduling with Incompatible Jobs. Discret. Appl. Math. 55(3): 219-232 (1994) - [j34]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) - [j33]Ulrich Pferschy, Rüdiger Rudolf, Gerhard J. Woeginger:
Some Geometric Clustering Problems. Nord. J. Comput. 1(2): 246-263 (1994) - [j32]Michael R. Bussieck, Hannes Hassler, Gerhard J. Woeginger, Uwe T. Zimmermann:
Fast algorithms for the maximum convolution problem. Oper. Res. Lett. 15(3): 133-141 (1994) - [j31]Bo Chen, André van Vliet, Gerhard J. Woeginger:
New lower and upper bounds for on-line scheduling. Oper. Res. Lett. 16(4): 221-230 (1994) - [j30]Ulrich Pferschy, Rüdiger Rudolf, Gerhard J. Woeginger:
Monge matrices make maximization manageable. Oper. Res. Lett. 16(5): 245-254 (1994) - [j29]Gerhard J. Woeginger:
On-Line Scheduling of Jobs with Fixed Start and End Times. Theor. Comput. Sci. 130(1): 5-16 (1994) - 1993
- [j28]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) - [j27]Klaus Jansen, Gerhard J. Woeginger:
The Complexity of Detecting Crossingfree Configurations in the Plane. BIT 33(4): 580-595 (1993) - [j26]Gábor Galambos, Gerhard Johannes Woeginger:
Repacking helps in bounded space on-line bind-packing. Computing 49(4): 329-338 (1993) - [j25]Hans Kellerer, Gerhard J. Woeginger:
A Greedy-heuristic for 3-partitioning with similar elements. Computing 50(3): 271-278 (1993) - [j24]Hans Kellerer, Gerhard J. Woeginger:
A Tight Bound for 3-Partitioning. Discret. Appl. Math. 45(3): 249-259 (1993) - [j23]Hans Kellerer, Gerhard J. Woeginger:
On the Euclidean two Paths Problem. Discret. Appl. Math. 47(2): 165-173 (1993) - [j22]Franz Rendl, Gerhard J. Woeginger:
Reconstructing sets of orthogonal line segments in the plane. Discret. Math. 119(1-3): 167-174 (1993) - [j21]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) - [j20]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) - [j19]Gerhard J. Woeginger:
Improved Space for Bounded-Space, On-Line Bin-Packing. SIAM J. Discret. Math. 6(4): 575-581 (1993) - 1992
- [j18]Gerhard J. Woeginger:
Computing Maximum Valued Regions. Acta Cybern. 10(4): 303-315 (1992) - [j17]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) - [j16]Gerhard Johannes Woeginger, Zhongliang Yu:
A heuristic for preemptive scheduling with set-up times. Computing 49(2): 151-158 (1992) - [j15]Hans Kellerer, Gerhard J. Woeginger:
UET-scheduling with constrained processor allocations. Comput. Oper. Res. 19(1): 1-8 (1992) - [j14]Wolfgang Gutjahr, Emo Welzl, Gerhard J. Woeginger:
Polynomial graph-colorings. Discret. Appl. Math. 35(1): 29-45 (1992) - [j13]David Eppstein, Mark H. Overmars, Günter Rote, Gerhard J. Woeginger:
Finding Minimum Area k-gons. Discret. Comput. Geom. 7: 45-58 (1992) - [j12]János Komlós, János Pach, Gerhard J. Woeginger:
Almost Tight Bounds for epsilon-Nets. Discret. Comput. Geom. 7: 163-173 (1992) - [j11]Günter Rote, Gerhard J. Woeginger:
Counting Convex k-Gons in Planar Point Sets. Inf. Process. Lett. 41(4): 191-194 (1992) - [j10]Herbert Fleischner, Gerhard J. Woeginger:
Detecting Cycles Through Three Fixed Vertices in a Graph. Inf. Process. Lett. 42(1): 29-33 (1992) - [j9]Gerhard J. Woeginger, Zhongliang Yu:
On the Equal-Subset-Sum Problem. Inf. Process. Lett. 42(6): 299-302 (1992) - [j8]Gerhard J. Woeginger:
Finding the Closest Extreme Vertex to a Fixed Point. Inf. Process. Lett. 43(3): 127-128 (1992) - [j7]Gerhard J. Woeginger:
The Complexity of Finding Arborescences in Hypergraphs. Inf. Process. Lett. 44(3): 161-164 (1992) - [j6]János Csirik, Hans Kellerer, Gerhard J. Woeginger:
The exact LPT-bound for maximizing the minimum completion time. Oper. Res. Lett. 11(5): 281-287 (1992) - 1991
- [j5]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) - [j4]Gerhard J. Woeginger:
On Minimizing the Sum of k Tardinesses. Inf. Process. Lett. 38(5): 253-256 (1991) - [j3]Vasilis Capoyleas, Günter Rote, Gerhard J. Woeginger:
Geometric Clusterings. J. Algorithms 12(2): 341-356 (1991) - 1990
- [j2]Michael Formann, Gerhard J. Woeginger:
On the reconstruction of simple polygons. Bull. EATCS 40: 225-230 (1990) - [j1]Gerhard J. Woeginger:
A Simple Solution to the Two Paths Problem in Planar Graphs. Inf. Process. Lett. 36(4): 191-192 (1990)
Conference and Workshop Papers
- 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 - 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
- [c127]Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
Continuous Facility Location on Graphs. IPCO 2020: 171-181 - 2019
- [c126]Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
Dispersing Obnoxious Facilities on a Graph. STACS 2019: 33:1-33:11 - 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 - 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 - 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 - 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 - 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 - 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 - 2012
- [c102]Kirk Pruhs, Gerhard J. Woeginger:
Divorcing Made Easy. FUN 2012: 305-314 - [c101]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 - [c100]Gerhard J. Woeginger:
Transportation under Nasty Side Constraints. MFCS 2012: 61-62 - [c99]Christian Eggermont, Gerhard J. Woeginger:
Motion planning with pulley, rope, and baskets. STACS 2012: 374-383 - [c98]Leah Epstein, Asaf Levin, Gerhard J. Woeginger:
The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases. WG 2012: 114-125 - [c97]Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard J. Woeginger:
Group Activity Selection Problem. WINE 2012: 156-169 - 2011
- [c96]Marek Chrobak, Jirí Sgall, Gerhard J. Woeginger:
Two-Bounded-Space Bin Packing Revisited. ESA 2011: 263-274 - [c95]Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger:
Domination When the Stars Are Out. ICALP (1) 2011: 462-473 - [c94]Nadja Betzler, Rolf Niedermeier, Gerhard J. Woeginger:
Unweighted Coalitional Manipulation under the Borda Rule Is NP-Hard. IJCAI 2011: 55-60 - [c93]Christian Eggermont, Gerhard J. Woeginger:
Reachability and Deadlocking Problems in Multi-stage Scheduling. RP 2011: 153-164 - [c92]Christian Eggermont, Alexander Schrijver, Gerhard J. Woeginger:
Analysis of multi-stage open shop processing systems. STACS 2011: 484-494 - [c91]Marijke H. L. Bodlaender, Cor A. J. Hurkens, Gerhard J. Woeginger:
The Cinderella Game on Holes and Anti-holes. WG 2011: 71-82 - 2010
- [c90]Marek Chrobak, Gerhard J. Woeginger, Kazuhisa Makino, Haifeng Xu:
Caching Is Hard - Even in the Fault Model. ESA (1) 2010: 195-206 - [c89]Rudolf Fleischer, Gerhard J. Woeginger:
An Algorithmic Analysis of the Honey-Bee Game. FUN 2010: 178-189 - [c88]Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger:
The Focus of Attention Problem. SODA 2010: 312-317 - [c87]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 - 2009
- [c86]Andreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger:
Combinatorial Optimization Problems with Conflict Graphs. CTW 2009: 293-296 - [c85]Pim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger:
Partitioning Graphs into Connected Parts. CSR 2009: 143-154 - [c84]Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginger:
Fully Decomposable Split Graphs. IWOCA 2009: 105-112 - [c83]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 - [c82]Bastian Katz, Ignaz Rutter, Gerhard J. Woeginger:
An Algorithmic Study of Switch Graphs. WG 2009: 226-237 - 2008
- [c81]Péter Csorba, Cor A. J. Hurkens, Gerhard J. Woeginger:
The Alcuin Number of a Graph. ESA 2008: 320-331 - [c80]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 - 2007
- [c79]Tobias Brüggemann, Johann L. Hurink, Tjark Vredeveld, Gerhard J. Woeginger:
Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines. WAOA 2007: 41-54 - 2006
- [c78]Walter Kern, Gerhard J. Woeginger:
Quadratic Programming and Combinatorial Minimum Weight Product Problems. CIAC 2006: 42-49 - [c77]Leah Epstein, Asaf Levin, Gerhard J. Woeginger:
Graph Coloring with Rejection. ESA 2006: 364-375 - [c76]John van den Broek, Cor A. J. Hurkens, Gerhard J. Woeginger:
Timetabling Problems at the TU Eindhoven. PATAT 2006: 210-227 - [c75]Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger:
Four point conditions and exponential neighborhoods for symmetric TSP. SODA 2006: 544-553 - 2005
- [c74]Attila Kuba, Gerhard J. Woeginger:
Two Remarks on Reconstructing Binary Vectors from Their Absorbed Projections. DGCI 2005: 148-152 - [c73]Arianna Alfieri, Steef L. van de Velde, Gerhard J. Woeginger:
Roll Cutting in the Curtain Industry. ESA 2005: 283-292 - [c72]Tomás Ebenlendr, John Noga, Jirí Sgall, Gerhard J. Woeginger:
A Note on Semi-online Machine Covering. WAOA 2005: 110-118 - 2004
- [c71]Samir Khuller, Yoo Ah Kim, Gerhard J. Woeginger:
Approximation Schemes for Broadcasting in Heterogenous Networks. APPROX-RANDOM 2004: 163-170 - [c70]Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger:
The Traveling Salesman Problem with Few Inner Points. COCOON 2004: 268-277 - [c69]Asaf Levin, Gerhard J. Woeginger:
The Constrained Minimum Weighted Sum of Job Completion Times Problem. IPCO 2004: 298-307 - [c68]Gerhard J. Woeginger:
Space and Time Complexity of Exact Algorithms: Some Open Problems (Invited Talk). IWPEC 2004: 281-290 - [c67]Kirk Pruhs, Gerhard J. Woeginger:
Approximation Schemes for a Class of Subset Selection Problems. LATIN 2004: 203-211 - [c66]Hajo Broersma, Fedor V. Fomin, Gerhard J. Woeginger:
Parallel Knock-Out Schemes in Networks. MFCS 2004: 204-214 - [c65]Kirk Pruhs, Patchrawat Uthaisombut, Gerhard J. Woeginger:
Getting the Best Response for Your Erg. SWAT 2004: 14-25 - [c64]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 - [c63]Fedor V. Fomin, Dieter Kratsch, Gerhard J. Woeginger:
Exact (Exponential) Algorithms for the Dominating Set Problem. WG 2004: 245-256 - 2003
- [c62]Mark Cieliebak, Stephan J. Eidenbenz, Gerhard J. Woeginger:
Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data. COCOON 2003: 519-527 - [c61]Jirí Sgall, Gerhard J. Woeginger:
A Lower Bound for Cake Cutting. ESA 2003: 459-469 - [c60]Gerhard J. Woeginger:
Seventeen Lines and One-Hundred-and-One Points. ESA 2003: 527-531 - [c59]Paul S. Bonsma, Tobias Brüggemann, Gerhard J. Woeginger:
A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves. MFCS 2003: 259-268 - [c58]Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger:
Backbone Colorings for Networks. WG 2003: 131-142 - [c57]Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger:
The Complexity of Graph Contractions. WG 2003: 322-333 - 2002
- [c56]Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger:
Radio Labeling with Pre-assigned Frequencies. ESA 2002: 211-222 - [c55]Hadas Shachnai, Tami Tamir, Gerhard J. Woeginger:
Minimizing Makespan and Preemption Costs on a System of Uniform Machines. ESA 2002: 859-871 - [c54]Gerhard J. Woeginger:
An Approximation Scheme for Cake Division with a Linear Number of Cuts. ESA 2002: 896-901 - [c53]Alexander Grigoriev, Gerhard J. Woeginger:
Project Scheduling with Irregular Costs: Complexity, Approximability, and Algorithms. ISAAC 2002: 381-390 - [c52]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 - [c51]Giovanni Rinaldi, Ulrich Voigt, Gerhard J. Woeginger:
The mathematics of playing golf. SODA 2002: 265-266 - [c50]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 - [c49]Yossi Azar, Leah Epstein, Yossi Richter, Gerhard J. Woeginger:
All-Norm Approximation Algorithms. SWAT 2002: 288-297 - [c48]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 - [c47]Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger:
More about Subcolorings. WG 2002: 68-79 - 2001
- [c46]Gerhard J. Woeginger:
Exact Algorithms for NP-Hard Problems: A Survey. Combinatorial Optimization 2001: 185-208 - [c45]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 - [c44]Renaud Lepère, Denis Trystram, Gerhard J. Woeginger:
Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints. ESA 2001: 146-157 - [c43]Marek Chrobak, János Csirik, Csanád Imreh, John Noga, Jirí Sgall, Gerhard J. Woeginger:
The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts. ICALP 2001: 862-874 - [c42]Gerhard J. Woeginger:
On the Approximability of Average Completion Time Scheduling under Precedence Constraints. ICALP 2001: 887-897 - [c41]Gerhard J. Woeginger:
Assigning chain-like tasks to a chain-like network. SODA 2001: 765-766 - [c40]Daniel Král, Jan Kratochvíl, Zsolt Tuza, Gerhard J. Woeginger:
Complexity of Coloring Graphs without Forbidden Induced Subgraphs. WG 2001: 254-262 - [c39]Rudi Pendavingh, Petra Schuurman, Gerhard J. Woeginger:
De Bruijn Graphs and DNA Graphs. WG 2001: 296-305 - 2000
- [c38]Han Hoogeveen, Martin Skutella, Gerhard J. Woeginger:
Preemptive Scheduling with Rejection. ESA 2000: 268-277 - [c37]Maxim Sviridenko, Gerhard J. Woeginger:
Approximability and in-approximability results for no-wait shop scheduling. FOCS 2000: 116-125 - [c36]János Csirik, Gerhard J. Woeginger:
Resource Augmentation for Online Bounded Space Bin Packing. ICALP 2000: 296-304 - [c35]Petra Schuurman, Gerhard J. Woeginger:
Scheduling a pipelined operator graph. SODA 2000: 207-212 - [c34]Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger:
Caching for Web Searching. SWAT 2000: 150-163 - 1999
- [c33]Gerhard J. Woeginger:
An FPTAS for Agreeably Weighted Variance on a Single Machine. ICALP 1999: 707-716 - [c32]Leah Epstein, John Noga, Steven S. Seiden, Jirí Sgall, Gerhard J. Woeginger:
Randomized Online Scheduling on Two Uniform Machines. SODA 1999: 317-326 - [c31]Petra Schuurman, Gerhard J. Woeginger:
Preemptive Scheduling with Job-Dependent Setup Times. SODA 1999: 759-767 - [c30]Gerhard J. Woeginger:
When Does a Dynamic Programming Formulation Guarantee the Existence of an FPTAS? SODA 1999: 820-829 - [c29]Martin Skutella, Gerhard J. Woeginger:
A PTAS for Minimizing the Weighted Sum of Job Completion Times on Parallel Machines. STOC 1999: 400-407 - 1998
- [c28]Alexander I. Barvinok, David S. Johnson, Gerhard J. Woeginger, Russell Woodroofe:
The Maximum Traveling Salesman Problem Under Polyhedral Norms. IPCO 1998: 195-201 - [c27]Han Hoogeveen, Petra Schuurman, Gerhard J. Woeginger:
Non-approximability Results for Scheduling Problems with Minsum Criteria. IPCO 1998: 353-366 - 1997
- [c26]Noga Alon, Yossi Azar, Gerhard J. Woeginger, Tal Yadid:
Approximation Schemes for Scheduling. SODA 1997: 493-500 - [c25]Luitpold Babel, Gerhard J. Woeginger:
Pseudo-Hamiltonian Graphs. WG 1997: 38-51 - 1996
- [c24]Amos Fiat, Gerhard J. Woeginger:
Competitive Analysis of Algorithms. Online Algorithms 1996: 1-12 - [c23]János Csirik, Gerhard J. Woeginger:
On-line Packing and Covering Problems. Online Algorithms 1996: 147-177 - [c22]Amos Fiat, Gerhard J. Woeginger:
Competitive Odds and Ends. Online Algorithms 1996: 385-394 - [c21]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 - [c20]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 - [c19]Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger:
The Travelling Salesman and the PQ-Tree. IPCO 1996: 490-504 - [c18]Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woeginger:
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine. STOC 1996: 418-426 - [c17]Bettina Klinz, Gerhard J. Woeginger:
One, Two, Three, Many, or: Complexity Aspects of Dynamic Network Flows with Dedicated Arcs. WG 1996: 254-267 - 1995
- [c16]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 - [c15]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 - [c14]Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger:
Sometimes Travelling is Easy: The Master Tour Problem. ESA 1995: 128-141 - [c13]Bettina Klinz, Gerhard J. Woeginger:
Minimum Cost Dynamic Flows: The Series-Parallel Case. IPCO 1995: 329-343 - [c12]Evangelos Kranakis, Danny Krizanc, Berthold Ruf, Jorge Urrutia, Gerhard J. Woeginger:
VC-Dimensions for Graphs (Extended Abstract). WG 1995: 1-13 - 1994
- [c11]Bo Chen, André van Vliet, Gerhard J. Woeginger:
An Optimal Algorithm for Preemptive On-line Scheduling. ESA 1994: 300-306 - 1993
- [c10]Peter Auer, Philip M. Long, Wolfgang Maass, Gerhard J. Woeginger:
On the Complexity of Function Learning. COLT 1993: 392-401 - [c9]Bettina Klinz, Rüdiger Rudolf, Gerhard J. Woeginger:
On the Recognition of Permuted Bottleneck Monge Matrices. ESA 1993: 248-259 - [c8]Klaus Jansen, Petra Scheffler, Gerhard J. Woeginger:
Maximum Covering with D Cliques. FCT 1993: 319-328 - [c7]Hans Kellerer, Franz Rendl, Gerhard J. Woeginger:
Computing the optimum stock size. IPCO 1993: 147-159 - 1992
- [c6]Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger:
Scheduling with Incompatible Jobs. WG 1992: 37-49 - 1990
- [c5]János Pach, Gerhard J. Woeginger:
Some New Bounds for Epsilon-Nets. SCG 1990: 10-15 - [c4]Joseph S. B. Mitchell, Günter Rote, Gerhard J. Woeginger:
Minimum-Link Paths Among Obstacles in the Plane. SCG 1990: 63-72 - [c3]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. FOCS 1990: 86-95 - 1989
- [c2]Wolfgang Gutjahr, Emo Welzl, Gerhard J. Woeginger:
Polynomial Graph-Colorings. STACS 1989: 108-119 - 1988
- [c1]Gerhard J. Woeginger:
Epsilon-Nets for Halfplanes. WG 1988: 243-252
Parts in Books or Collections
- 2019
- [p1]Gerhard J. Woeginger:
Computation and Complexity. Computing and Software Science 2019: 3-8
Editorship
- 2019
- [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] - 2017
- [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] - 2016
- [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] - 2012
- [e8]Dimitrios M. Thilikos, Gerhard J. Woeginger:
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 [contents] - 2011
- [e7]Oktay Günlük, Gerhard J. Woeginger:
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 [contents] - 2007
- [e6]Steven J. Brams, Kirk Pruhs, Gerhard J. Woeginger:
Fair Division, 24.06. - 29.06.2007. Dagstuhl Seminar Proceedings 07261, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 [contents] - 2006
- [e5]Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger:
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 [contents] - 2003
- [e4]Jos C. M. Baeten, Jan Karel Lenstra, Joachim Parrow, Gerhard J. Woeginger:
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 [contents] - 1999
- [e3]Gérard Cornuéjols, Rainer E. Burkard, Gerhard J. Woeginger:
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 [contents] - 1998
- [e2]Amos Fiat, Gerhard J. Woeginger:
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 [contents] - 1997
- [e1]Rainer E. Burkard, Gerhard J. Woeginger:
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 [contents]
Informal and Other Publications
- 2023
- [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) - 2020
- [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) - 2019
- [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
- [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
- [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
- [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
- [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
- [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
- [i17]Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger:
Uniqueness in quadratic and hyperbolic 0-1 programming problems. CoRR abs/1312.0903 (2013) - 2012
- [i16]Gerhard J. Woeginger:
Core stability in hedonic coalition formation. CoRR abs/1212.2236 (2012) - 2011
- [i15]Rudolf Fleischer, Gerhard J. Woeginger:
An Algorithmic Analysis of the Honey-Bee Game. CoRR abs/1102.3025 (2011) - [i14]Christian Eggermont, Alexander Schrijver, Gerhard J. Woeginger:
Analysis of multi-stage open shop processing systems. CoRR abs/1102.3029 (2011) - [i13]Christoph Dürr, Maurice Queyranne, Frits C. R. Spieksma, Fabrice Talla Nobibon, Gerhard J. Woeginger:
The interval ordering problem. CoRR abs/1112.0534 (2011) - 2010
- [i12]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) - [i11]Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger:
Domination When the Stars Are Out. CoRR abs/1012.0012 (2010) - 2005
- [i10]Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger:
05301 Summary - Exact Algorithms and Fixed-Parameter Tractability. Exact Algorithms and Fixed-Parameter Tractability 2005 - [i9]Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger:
05301 Abstracts Collection - Exact Algorithms and Fixed-Parameter Tractability. Exact Algorithms and Fixed-Parameter Tractability 2005 - 2002
- [i8]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) - 2001
- [i7]Marek Chrobak, Peter Couperus, Christoph Dürr, Gerhard J. Woeginger:
A Note on Tiling under Tomographic Constraints. CoRR cs.CC/0108010 (2001) - [i6]Gerhard J. Woeginger:
When does a dynamic programming formulation guarantee the existence of an FPTAS? Electron. Colloquium Comput. Complex. TR01 (2001) - [i5]Gerhard J. Woeginger:
Resource augmentation for online bounded space bin packing. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [i4]Peter Auer, Philip M. Long, Wolfgang Maass, Gerhard J. Woeginger:
On the Complexity of Function Learning. Electron. Colloquium Comput. Complex. TR00 (2000) - 1992
- [i3]Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger:
Scheduling with Incompatible Jobs. Universität Trier, Mathematik/Informatik, Forschungsbericht 92-09 (1992) - [i2]Klaus Jansen, Petra Scheffler, Gerhard J. Woeginger:
The Disjoint Cliques Problem. Universität Trier, Mathematik/Informatik, Forschungsbericht 92-23 (1992) - [i1]Klaus Jansen, Gerhard J. Woeginger:
The Complexity of Detecting Crossingfree Configurations in the Plane. Universität Trier, Mathematik/Informatik, Forschungsbericht 92-25 (1992)
Coauthor Index
[j298] [j281] [j277] [j271] [j267] [j260] [j256] [j254] [j252] [j246] [j239] [j236] [j227] [j223] [j221] [j216] [j211] [j208] [j178] [j176] [j172] [j168] [j167] [j166] [j144] [j141] [j107] [j105] [j101] [j98] [j87] [j74] [j73] [j69] [j66] [j65] [j54] [j51] [j36] [c113] [c111] [c75] [c70] [c19] [c14] [i41] [i39] [i27] [i18] [i17]
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-11 22:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
