Gerhard J. Woeginger
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
104
Venues
24
Active years
1988–2023
Best venue rank
A*
Where they publish
- BWG17 papers
- AESA17 papers
- BIPCO10 papers
- A*SODA10 papers
- A*ICALP7 papers
- ASTACS6 papers
- BWAOA6 papers
- BMFCS5 papers
- NationalCOCOON3 papers
- BISAAC3 papers
- NationalFUN3 papers
- CIWOCA2 papers
- A*IJCAI2 papers
- A*FOCS2 papers
- A*STOC2 papers
- A*AAAI1 paper
- CCOCOA1 paper
- BSOFSEM1 paper
- NationalCSR1 paper
- CCIAC1 paper
- CPATAT1 paper
- BLATIN1 paper
- A*COLT1 paper
- BFCT1 paper
Papers
104 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2023 | IPCO | A Linear Time Algorithm for Linearizing Quadratic and Higher-Order Shortest Path Problems. | Eranda ela, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf |
| 2021 | IWOCA | Non-preemptive Tree Packing. | Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf |
| 2021 | WG | Linearizable Special Cases of the Quadratic Shortest Path Problem. | Eranda ela, Bettina Klinz, Stefan Lendl, James B. Orlin, Gerhard J. Woeginger, Lasse Wulf |
| 2020 | IPCO | Continuous Facility Location on Graphs. | Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger |
| 2019 | STACS | Dispersing Obnoxious Facilities on a Graph. | Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger |
| 2018 | AAAI | Committee Selection with Intraclass and Interclass Synergies. | Rani Izsak, Nimrod Talmon, Gerhard J. Woeginger |
| 2018 | COCOON | Non-monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces. | Boris Aronov, Mark de Berg, Aleksandar Markovic, Gerhard J. Woeginger |
| 2018 | MFCS | Graph Similarity and Approximate Isomorphism. | Martin Grohe, Gaurav Rattan, Gerhard J. Woeginger |
| 2018 | STACS | The Open Shop Scheduling Problem. | Gerhard J. Woeginger |
| 2018 | WAOA | Some Easy and Some Not so Easy Geometric Optimization Problems. | Gerhard J. Woeginger |
| 2017 | ISAAC | Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. | Mark de Berg, Tim Leijsen, Aleksandar Markovic, Andr van Renssen, Marcel Roeloffzen, Gerhard J. Woeginger |
| 2016 | ICALP | Fine-Grained Complexity Analysis of Two Classic TSP Variants. | Mark de Berg, Kevin Buchin, Bart M. P. Jansen, Gerhard J. Woeginger |
| 2016 | WAOA | Balanced Optimization with Vector Costs. | Annette M. C. Ficker, Frits C. R. Spieksma, Gerhard J. Woeginger |
| 2015 | COCOA | A New Tractable Case of the QAP with a Robinson Matrix. | Eranda ela, Vladimir G. Deineko, Gerhard J. Woeginger |
| 2014 | FUN | Another Look at the Shoelace TSP: The Case of Very Old Shoes. | Vladimir G. Deineko, Gerhard J. Woeginger |
| 2014 | ICALP | Star Partitions of Perfect Graphs. | Ren van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger |
| 2014 | MFCS | Network-Based Dissolution. | Ren van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger |
| 2014 | WAOA | Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms. | Jir Sgall, Gerhard J. Woeginger |
| 2013 | IJCAI | Are There Any Nicely Structured Preference Profiles Nearby? | Robert Bredereck, Jiehua Chen, Gerhard J. Woeginger |
| 2013 | IPCO | A Complexity and Approximability Study of the Bilevel Knapsack Problem. | Alberto Caprara, Margarida Carvalho, Andrea Lodi, Gerhard J. Woeginger |
| 2013 | ISAAC | The Complexity of Finding a Large Subgraph under Anonymity Constraints. | Robert Bredereck, Sepp Hartung, Andr Nichterlein, Gerhard J. Woeginger |
| 2013 | SOFSEM | Core Stability in Hedonic Coalition Formation. | Gerhard J. Woeginger |
| 2012 | FUN | Divorcing Made Easy. | Kirk Pruhs, Gerhard J. Woeginger |
| 2012 | MFCS | Transportation under Nasty Side Constraints. | Gerhard J. Woeginger |
| 2012 | STACS | Motion planning with pulley, rope, and baskets. | Christian Eggermont, Gerhard J. Woeginger |
| 2012 | WG | The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases. | Leah Epstein, Asaf Levin, Gerhard J. Woeginger |
| 2011 | ESA | Two-Bounded-Space Bin Packing Revisited. | Marek Chrobak, Jir Sgall, Gerhard J. Woeginger |
| 2011 | ICALP | Domination When the Stars Are Out. | Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger |
| 2011 | IJCAI | Unweighted Coalitional Manipulation under the Borda Rule Is NP-Hard. | Nadja Betzler, Rolf Niedermeier, Gerhard J. Woeginger |
| 2011 | STACS | Analysis of multi-stage open shop processing systems. | Christian Eggermont, Alexander Schrijver, Gerhard J. Woeginger |
| 2011 | WG | The Cinderella Game on Holes and Anti-holes. | Marijke H. L. Bodlaender, Cor A. J. Hurkens, Gerhard J. Woeginger |
| 2010 | ESA | Caching Is Hard - Even in the Fault Model. | Marek Chrobak, Gerhard J. Woeginger, Kazuhisa Makino, Haifeng Xu |
| 2010 | FUN | An Algorithmic Analysis of the Honey-Bee Game. | Rudolf Fleischer, Gerhard J. Woeginger |
| 2010 | SODA | The Focus of Attention Problem. | Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger |
| 2010 | STACS | The Traveling Salesman Problem under Squared Euclidean Distances. | Fred van Nijnatten, Ren Sitters, Gerhard J. Woeginger, Alexander Wolff, Mark de Berg |
| 2009 | CSR | Partitioning Graphs into Connected Parts. | Pim van 't Hof, Danil Paulusma, Gerhard J. Woeginger |
| 2009 | IWOCA | Fully Decomposable Split Graphs. | Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginger |
| 2009 | WAOA | Between a Rock and a Hard Place: The Two-to-One Assignment Problem. | Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger |
| 2009 | WG | An Algorithmic Study of Switch Graphs. | Bastian Katz, Ignaz Rutter, Gerhard J. Woeginger |
| 2008 | ESA | The Alcuin Number of a Graph. | Pter Csorba, Cor A. J. Hurkens, Gerhard J. Woeginger |
| 2007 | WAOA | Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines. | Tobias Brggemann, Johann L. Hurink, Tjark Vredeveld, Gerhard J. Woeginger |
| 2006 | CIAC | Quadratic Programming and Combinatorial Minimum Weight Product Problems. | Walter Kern, Gerhard J. Woeginger |
| 2006 | ESA | Graph Coloring with Rejection. | Leah Epstein, Asaf Levin, Gerhard J. Woeginger |
| 2006 | PATAT | Timetabling Problems at the TU Eindhoven. | John van den Broek, Cor A. J. Hurkens, Gerhard J. Woeginger |
| 2006 | SODA | Four point conditions and exponential neighborhoods for symmetric TSP. | Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger |
| 2005 | ESA | Roll Cutting in the Curtain Industry. | Arianna Alfieri, Steef L. van de Velde, Gerhard J. Woeginger |
| 2005 | WAOA | A Note on Semi-online Machine Covering. | Toms Ebenlendr, John Noga, Jir Sgall, Gerhard J. Woeginger |
| 2004 | COCOON | The Traveling Salesman Problem with Few Inner Points. | Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger |
| 2004 | IPCO | The Constrained Minimum Weighted Sum of Job Completion Times Problem. | Asaf Levin, Gerhard J. Woeginger |
| 2004 | LATIN | Approximation Schemes for a Class of Subset Selection Problems. | Kirk Pruhs, Gerhard J. Woeginger |
| 2004 | MFCS | Parallel Knock-Out Schemes in Networks. | Hajo Broersma, Fedor V. Fomin, Gerhard J. Woeginger |
| 2004 | WG | The Computational Complexity of the Minimum Weight Processor Assignment Problem. | Hajo Broersma, Danil Paulusma, Gerard J. M. Smit, Frank Vlaardingerbroek, Gerhard J. Woeginger |
| 2004 | WG | Exact (Exponential) Algorithms for the Dominating Set Problem. | Fedor V. Fomin, Dieter Kratsch, Gerhard J. Woeginger |
| 2003 | COCOON | Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data. | Mark Cieliebak, Stephan J. Eidenbenz, Gerhard J. Woeginger |
| 2003 | ESA | A Lower Bound for Cake Cutting. | Jir Sgall, Gerhard J. Woeginger |
| 2003 | ESA | Seventeen Lines and One-Hundred-and-One Points. | Gerhard J. Woeginger |
| 2003 | MFCS | A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves. | Paul S. Bonsma, Tobias Brggemann, Gerhard J. Woeginger |
| 2003 | WG | Backbone Colorings for Networks. | Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger |
| 2003 | WG | The Complexity of Graph Contractions. | Asaf Levin, Danil Paulusma, Gerhard J. Woeginger |
| 2002 | ESA | Radio Labeling with Pre-assigned Frequencies. | Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger |
| 2002 | ESA | Minimizing Makespan and Preemption Costs on a System of Uniform Machines. | Hadas Shachnai, Tami Tamir, Gerhard J. Woeginger |
| 2002 | ESA | An Approximation Scheme for Cake Division with a Linear Number of Cuts. | Gerhard J. Woeginger |
| 2002 | ISAAC | Project Scheduling with Irregular Costs: Complexity, Approximability, and Algorithms. | Alexander Grigoriev, Gerhard J. Woeginger |
| 2002 | SODA | How to cut a cake almost fairly. | Sven Oliver Krumke, Maarten Lipmann, Willem de Paepe, Diana Poensgen, Jrg Rambau, Leen Stougie, Gerhard J. Woeginger |
| 2002 | SODA | The mathematics of playing golf. | Giovanni Rinaldi, Ulrich Voigt, Gerhard J. Woeginger |
| 2002 | WG | DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem. | Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak, Petra Schuurman, Gerhard J. Woeginger |
| 2002 | WG | More about Subcolorings. | Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger |
| 2001 | ESA | Buying a Constant Competitive Ratio for Paging. | Jnos Csirik, Csand Imreh, John Noga, Steven S. Seiden, Gerhard J. Woeginger |
| 2001 | ESA | Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints. | Renaud Lepre, Denis Trystram, Gerhard J. Woeginger |
| 2001 | ICALP | The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts. | Marek Chrobak, Jnos Csirik, Csand Imreh, John Noga, Jir Sgall, Gerhard J. Woeginger |
| 2001 | ICALP | On the Approximability of Average Completion Time Scheduling under Precedence Constraints. | Gerhard J. Woeginger |
| 2001 | SODA | Assigning chain-like tasks to a chain-like network. | Gerhard J. Woeginger |
| 2001 | WG | Complexity of Coloring Graphs without Forbidden Induced Subgraphs. | Daniel Krl, Jan Kratochvl, Zsolt Tuza, Gerhard J. Woeginger |
| 2001 | WG | De Bruijn Graphs and DNA Graphs. | Rudi Pendavingh, Petra Schuurman, Gerhard J. Woeginger |
| 2000 | ESA | Preemptive Scheduling with Rejection. | Han Hoogeveen, Martin Skutella, Gerhard J. Woeginger |
| 2000 | FOCS | Approximability and in-approximability results for no-wait shop scheduling. | Maxim Sviridenko, Gerhard J. Woeginger |
| 2000 | ICALP | Resource Augmentation for Online Bounded Space Bin Packing. | Jnos Csirik, Gerhard J. Woeginger |
| 2000 | SODA | Scheduling a pipelined operator graph. | Petra Schuurman, Gerhard J. Woeginger |
| 1999 | ICALP | An FPTAS for Agreeably Weighted Variance on a Single Machine. | Gerhard J. Woeginger |
| 1999 | SODA | Randomized Online Scheduling on Two Uniform Machines. | Leah Epstein, John Noga, Steven S. Seiden, Jir Sgall, Gerhard J. Woeginger |
| 1999 | SODA | Preemptive Scheduling with Job-Dependent Setup Times. | Petra Schuurman, Gerhard J. Woeginger |
| 1999 | SODA | When Does a Dynamic Programming Formulation Guarantee the Existence of an FPTAS? | Gerhard J. Woeginger |
| 1999 | STOC | A PTAS for Minimizing the Weighted Sum of Job Completion Times on Parallel Machines. | Martin Skutella, Gerhard J. Woeginger |
| 1998 | IPCO | The Maximum Traveling Salesman Problem Under Polyhedral Norms. | Alexander I. Barvinok, David S. Johnson, Gerhard J. Woeginger, Russell Woodroofe |
| 1998 | IPCO | Non-approximability Results for Scheduling Problems with Minsum Criteria. | Han Hoogeveen, Petra Schuurman, Gerhard J. Woeginger |
| 1997 | SODA | Approximation Schemes for Scheduling. | Noga Alon, Yossi Azar, Gerhard J. Woeginger, Tal Yadid |
| 1997 | WG | Pseudo-Hamiltonian Graphs. | Luitpold Babel, Gerhard J. Woeginger |
| 1996 | ESA | On-line and Off-line Approximation Algorithms for Vector Covering Problems. | Noga Alon, Jnos Csirik, Sergey V. Sevastianov, Arjen P. A. Vestjens, Gerhard J. Woeginger |
| 1996 | IPCO | The Quadratic Assignment Problem with a Monotone Anti-Monge and a Symmetric Toeplitz Matrix: Easy and Hard Cases. | Rainer E. Burkard, Eranda ela, Gnter Rote, Gerhard J. Woeginger |
| 1996 | IPCO | The Travelling Salesman and the PQ-Tree. | Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger |
| 1996 | STOC | Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine. | Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woeginger |
| 1996 | WG | One, Two, Three, Many, or: Complexity Aspects of Dynamic Network Flows with Dedicated Arcs. | Bettina Klinz, Gerhard J. Woeginger |
| 1995 | ESA | Sometimes Travelling is Easy: The Master Tour Problem. | Vladimir G. Deineko, Rdiger Rudolf, Gerhard J. Woeginger |
| 1995 | IPCO | Minimum Cost Dynamic Flows: The Series-Parallel Case. | Bettina Klinz, Gerhard J. Woeginger |
| 1995 | WG | VC-Dimensions for Graphs (Extended Abstract). | Evangelos Kranakis, Danny Krizanc, Berthold Ruf, Jorge Urrutia, Gerhard J. Woeginger |
| 1994 | ESA | An Optimal Algorithm for Preemptive On-line Scheduling. | Bo Chen, Andr van Vliet, Gerhard J. Woeginger |
| 1993 | COLT | On the Complexity of Function Learning. | Peter Auer, Philip M. Long, Wolfgang Maass, Gerhard J. Woeginger |
| 1993 | ESA | On the Recognition of Permuted Bottleneck Monge Matrices. | Bettina Klinz, Rdiger Rudolf, Gerhard J. Woeginger |
| 1993 | FCT | Maximum Covering with D Cliques. | Klaus Jansen, Petra Scheffler, Gerhard J. Woeginger |
| 1993 | IPCO | Computing the optimum stock size. | Hans Kellerer, Franz Rendl, Gerhard J. Woeginger |
| 1992 | WG | Scheduling with Incompatible Jobs. | Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger |
| 1990 | FOCS | Drawing Graphs in the Plane with High Resolution | Michael Formann, Torben Hagerup, James Haralambides, Michael Kaufmann, Frank Thomson Leighton, Antonios Symvonis, Emo Welzl, Gerhard J. Woeginger |
| 1989 | STACS | Polynomial Graph-Colorings. | Wolfgang Gutjahr, Emo Welzl, Gerhard J. Woeginger |
| 1988 | WG | Epsilon-Nets for Halfplanes. | Gerhard J. Woeginger |