Gerhard J. Woeginger

ORCID

Publication Activity (10 Years)

Years Active: 1988-2023
Publications (10 Years): 77

Top Venues

Publications

Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
Recognising permuted Demidenko matrices. CoRR (2023)
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
Recognising permuted Demidenko matrices. Oper. Res. Lett. 51 (5) (2023)
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) (2023)
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 (2023)
Jirí Sgall, Gerhard J. Woeginger
Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms. Oper. Res. Lett. 51 (6) (2023)
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)
Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf
Non-Preemptive Tree Packing. Algorithmica 85 (3) (2023)
Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
Continuous facility location on graphs. Math. Program. 192 (1) (2022)
Dennis Fischer, Komal Muluk, Gerhard J. Woeginger
A note on the complexity of the bilevel bottleneck assignment problem. 4OR 20 (4) (2022)
Gerhard J. Woeginger
The trouble with the second quantifier. 4OR 19 (2) (2021)
Dennis Fischer, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
An Investigation of the Recoverable Robust Assignment Problem. IPEC (2021)
Annette M. C. Ficker, Frits C. R. Spieksma, Gerhard J. Woeginger
The transportation problem with conflicts. Ann. Oper. Res. 298 (1) (2021)
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) (2021)
Thomas Lachmann, Stefan Lendl, Gerhard J. Woeginger
A linear time algorithm for the robust recoverable selection problem. Discret. Appl. Math. 303 (2021)
Astrid Pieterse, Gerhard J. Woeginger
The subset sum game revisited. Theory Comput. Syst. 65 (5) (2021)
Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
Dispersing Obnoxious Facilities on a Graph. Algorithmica 83 (6) (2021)
Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf
Non-preemptive Tree Packing. IWOCA (2021)
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)
Dennis Fischer, Gerhard J. Woeginger
A faster algorithm for the continuous bilevel knapsack problem. Oper. Res. Lett. 48 (6) (2020)
Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
Continuous Facility Location on Graphs. IPCO (2020)
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) (2020)
Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Gerhard J. Woeginger
Timeline-based planning over dense temporal domains. Theor. Comput. Sci. 813 (2020)
Dennis Fischer, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
An Investigation of the Recoverable Robust Assignment Problem. CoRR (2020)
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
Travelling salesman paths on Demidenko matrices. CoRR (2020)
Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger
Domination When the Stars Are Out. ACM Trans. Algorithms 15 (2) (2019)
Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
Dispersing Obnoxious Facilities on a Graph. STACS (2019)
Mark de Berg, Sándor Kisfaludi-Bak, Gerhard J. Woeginger
The complexity of Dominating Set in geometric intersection graphs. Theor. Comput. Sci. 769 (2019)
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) (2019)
Matthias Bentert, Jiehua Chen, Vincent Froese, Gerhard J. Woeginger
Good Things Come to Those Who Swap Objects on Paths. CoRR (2019)
Boris Aronov, Mark de Berg, Aleksandar Markovic, Gerhard J. Woeginger
Non-Monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces. CoRR (2018)
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) (2018)
Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
Dispersing obnoxious facilities on a graph. CoRR (2018)
Martin Grohe, Gaurav Rattan, Gerhard J. Woeginger
Graph Similarity and Approximate Isomorphism. CoRR (2018)
Martin Grohe, Gaurav Rattan, Gerhard J. Woeginger
Graph Similarity and Approximate Isomorphism. MFCS (2018)
Alexander S. Kulikov, Gerhard J. Woeginger
Preface to the Special Issue on Computer Science in Russia 2016. Theory Comput. Syst. 62 (3) (2018)
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)
Rani Izsak, Nimrod Talmon, Gerhard J. Woeginger
Committee Selection with Intraclass and Interclass Synergies. AAAI (2018)
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) (2018)
Annette M. C. Ficker, Frits C. R. Spieksma, Gerhard J. Woeginger
Robust balanced optimization. EURO J. Comput. Optim. 6 (3) (2018)
Gerhard J. Woeginger
The Open Shop Scheduling Problem. STACS (2018)
Gerhard J. Woeginger
Some Easy and Some Not so Easy Geometric Optimization Problems. WAOA (2018)
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)
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) (2018)
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
The multi-stripe travelling salesman problem. Ann. Oper. Res. 259 (1-2) (2017)
Mark de Berg, Sándor Kisfaludi-Bak, Gerhard J. Woeginger
The Dominating Set Problem in Geometric Intersection Graphs. IPEC (2017)
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 (2017)
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) (2017)
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)
Mark de Berg, Sándor Kisfaludi-Bak, Gerhard J. Woeginger
The Dominating Set Problem in Geometric Intersection Graphs. CoRR (2017)
Astrid Pieterse, Gerhard J. Woeginger
The Subset Sum Game Revisited. ADT (2017)
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 (2017)
Jiehua Chen, Kirk Pruhs, Gerhard J. Woeginger
The one-dimensional Euclidean domain: finitely many obstructions are not enough. Soc. Choice Welf. 48 (2) (2017)
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
Linearizable special cases of the QAP. J. Comb. Optim. 31 (3) (2016)
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)
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
The multi-stripe travelling salesman problem. CoRR (2016)
Mark de Berg, Kevin Buchin, Bart M. P. Jansen, Gerhard J. Woeginger
Fine-Grained Complexity Analysis of Two Classic TSP Variants. ICALP (2016)
René van Bevern, Robert Bredereck, Laurent Bulteau, Christian Komusiewicz, Nimrod Talmon, Gerhard J. Woeginger
Precedence-constrained scheduling problems parameterized by partial order width. CoRR (2016)
Cristina Bazgan, Robert Bredereck, Sepp Hartung, André Nichterlein, Gerhard J. Woeginger
Finding large degree-anonymous subgraphs is hard. Theor. Comput. Sci. 622 (2016)
Christoph Dürr, Zdenek Hanzálek, Christian Konrad, René Sitters, Óscar C. Vásquez, Gerhard J. Woeginger
The triangle scheduling problem. CoRR (2016)
Mark de Berg, Kevin Buchin, Bart M. P. Jansen, Gerhard J. Woeginger
Fine-Grained Complexity Analysis of Two Classic TSP Variants. CoRR (2016)
Annette M. C. Ficker, Frits C. R. Spieksma, Gerhard J. Woeginger
Balanced Optimization with Vector Costs. WAOA (2016)
Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger
The Focus of Attention Problem. Algorithmica 74 (2) (2016)
Alberto Caprara, Margarida Carvalho, Andrea Lodi, Gerhard J. Woeginger
Bilevel Knapsack with Interdiction Constraints. INFORMS J. Comput. 28 (2) (2016)
Robert Bredereck, Jiehua Chen, Gerhard J. Woeginger
Are there any nicely structured preference profiles nearby? Math. Soc. Sci. 79 (2016)
Leah Epstein, Asaf Levin, Gerhard J. Woeginger
Vertex Cover Meets Scheduling. Algorithmica 74 (3) (2016)
Ante Custic, Bettina Klinz, Gerhard J. Woeginger
Geometric versions of the three-dimensional assignment problem under general norms. Discret. Optim. 18 (2015)
Sebastian Bervoets, Vincent Merlin, Gerhard J. Woeginger
Vote trading and subset sums. Oper. Res. Lett. 43 (1) (2015)
Leah Epstein, Asaf Levin, Gerhard J. Woeginger
The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases. Algorithmica 72 (4) (2015)
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) (2015)
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
A New Tractable Case of the QAP with a Robinson Matrix. COCOA (2015)
Ali Ridha Mahjoub, Giovanni Rinaldi, Gerhard J. Woeginger
Preface. Math. Program. 150 (1) (2015)
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) (2015)
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
Well-solvable cases of the QAP with block-structured matrices. Discret. Appl. Math. 186 (2015)
Jiehua Chen, Kirk Pruhs, Gerhard J. Woeginger
The one-dimensional Euclidean domain: Finitely many obstructions are not enough. CoRR (2015)
René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
Network-Based Vertex Dissolution. SIAM J. Discret. Math. 29 (2) (2015)
Robert Bredereck, Jiehua Chen, Gerhard J. Woeginger
Are there any nicely structured preference~profiles~nearby? CoRR (2015)
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)
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 (2014)
Vladimir G. Deineko, Gerhard J. Woeginger
Another Look at the Shoelace TSP: The Case of Very Old Shoes. FUN (2014)
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) (2014)
René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
Network-Based Dissolution. MFCS (2) (2014)
Andrea Lodi, Ted K. Ralphs, Gerhard J. Woeginger
Bilevel programming and the separation problem. Math. Program. 146 (1-2) (2014)
Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard J. Woeginger
Group Activity Selection Problem. CoRR (2014)
Vladimir G. Deineko, Bettina Klinz, Alexander Tiskin, Gerhard J. Woeginger
Four-point conditions for the TSP: The complete complexity classification. Discret. Optim. 14 (2014)
Ante Custic, Bettina Klinz, Gerhard J. Woeginger
Geometric versions of the 3-dimensional assignment problem under general norms. CoRR (2014)
Vladimir G. Deineko, Gerhard J. Woeginger
Two hardness results for Gamson's game. Soc. Choice Welf. 43 (4) (2014)
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
Linearizable special cases of the QAP. CoRR (2014)
Gerhard J. Woeginger
Investigations on the step-based research indices of Chambers and Miller. J. Informetrics 8 (3) (2014)
Ante Custic, Bettina Klinz, Gerhard J. Woeginger
Planar 3-dimensional assignment problems with Monge-like cost arrays. CoRR (2014)
René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
Network-Based Dissolution. CoRR (2014)
René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
Star Partitions of Perfect Graphs. ICALP (1) (2014)
René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
Star Partitions of Perfect Graphs. CoRR (2014)
Jirí Sgall, Gerhard J. Woeginger
Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms. WAOA (2014)
Robert Bredereck, Jiehua Chen, Piotr Faliszewski, Jiong Guo, Rolf Niedermeier, Gerhard J. Woeginger
Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges. CoRR (2014)
Vladimir G. Deineko, Gerhard J. Woeginger
Complexity and in-approximability of a selection problem in robust optimization. 4OR 11 (3) (2013)
Gerhard J. Woeginger
Nothing New about Equiangular Polygons. Am. Math. Mon. 120 (9) (2013)
Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
Uniqueness in quadratic and hyperbolic 0-1 programming problems. CoRR (2013)
Robert Bredereck, Sepp Hartung, André Nichterlein, Gerhard J. Woeginger
The Complexity of Finding a Large Subgraph under Anonymity Constraints. ISAAC (2013)
Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger
The three-dimensional matching problem in Kalmanson matrices. J. Comb. Optim. 26 (1) (2013)
Gerhard J. Woeginger
A hardness result for core stability in additive hedonic games. Math. Soc. Sci. 65 (2) (2013)

Gerhard J. Woeginger.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Gerhard J. Woeginger