| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | 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 Review  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Cor A. J. Hurkens, Andrea Lodi, Silvano Martello, Michele Monaci, Gerhard J. Woeginger |
Complexity and approximation of an area packing problem. |
Optimization Letters |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Gerhard J. Woeginger, Kazuhisa Makino, Haifeng Xu |
Caching Is Hard - Even in the Fault Model. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Erwin Pesch, Gerhard J. Woeginger |
Guest Editorial to the special issue "Operations Research in Health Care" (EURO XXIII, July 5-8, 2009, Bonn). |
European Journal of Operational Research |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Petra Schuurman, Gerhard J. Woeginger |
Scheduling of pipelined operator graphs. |
J. Scheduling |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Dürr, Maurice Queyranne, Frits C. R. Spieksma, Fabrice Talla Nobibon, Gerhard J. Woeginger |
The interval ordering problem. |
Discrete Applied Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Eggermont, Gerhard J. Woeginger |
Motion planning with pulley, rope, and baskets. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Gerhard J. Woeginger |
A well-solvable special case of the bounded knapsack problem. |
Oper. Res. Lett. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Murat Firat, Gerhard J. Woeginger |
Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh. |
Oper. Res. Lett. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eranda Çela, Nina S. Schmuck, Shmuel Wimer, Gerhard J. Woeginger |
The Wiener maximum quadratic assignment problem. |
Discrete Optimization |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Rong Su, Gerhard J. Woeginger |
String execution time for finite languages: Max is easy, min is hard. |
Automatica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sofie Coene, Frits C. R. Spieksma, Gerhard J. Woeginger |
Charlemagne's Challenge: The Periodic Latency Problem. |
Operations Research |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Gerhard J. Woeginger |
Unbounded knapsack problems with arithmetic weight sequences. |
European Journal of Operational Research |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Fleischer, Gerhard J. Woeginger |
An Algorithmic Analysis of the Honey-Bee Game |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Christoph Dürr, Maurice Queyranne, Frits C. R. Spieksma, Fabrice Talla Nobibon, Gerhard J. Woeginger |
The interval ordering problem |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Christian Eggermont, Alexander Schrijver, Gerhard J. Woeginger |
Analysis of multi-stage open shop processing systems |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Zdenek Ryjácek, Gerhard J. Woeginger, Liming Xiong |
Hamiltonian index is NP-complete. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger |
Paths, trees and matchings under disjunctive constraints. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bettina Klinz, Gerhard J. Woeginger |
The Northwest corner rule revisited. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin, Gerhard J. Woeginger |
Graph coloring with rejection. |
J. Comput. Syst. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marijke H. L. Bodlaender, Cor A. J. Hurkens, Gerhard J. Woeginger |
The Cinderella Game on Holes and Anti-holes. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Jiri Sgall, Gerhard J. Woeginger |
Two-Bounded-Space Bin Packing Revisited. |
ESA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadja Betzler, Rolf Niedermeier, Gerhard J. Woeginger |
Unweighted Coalitional Manipulation under the Borda Rule Is NP-Hard. |
IJCAI |
2011 |
DBLP BibTeX RDF |
|
| 1 | Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger |
Domination When the Stars Are Out. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Eggermont, Alexander Schrijver, Gerhard J. Woeginger |
Analysis of multi-stage open shop processing systems. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Eggermont, Gerhard J. Woeginger |
Reachability and Deadlocking Problems in Multi-stage Scheduling. |
RP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oktay Günlük, Gerhard J. Woeginger (eds.) |
Integer Programming and Combinatoral Optimization - 15th International Conference, IPCO 2011, New York, NY, USA, June 15-17, 2011. Proceedings |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gabriella Muratore, Ulrich M. Schwarz, Gerhard J. Woeginger |
Parallel machine scheduling with nested job assignment restrictions. |
Oper. Res. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Adriana Felicia Gabor, Gerhard J. Woeginger |
How * not * to solve a Sudoku. |
Oper. Res. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Gerhard J. Woeginger |
Pinpointing the complexity of the interval min-max regret knapsack problem. |
Discrete Optimization |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerhard J. Woeginger |
An Algorithmic Comparison of Three Scientific Impact Indices. |
Acta Cybern. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger |
The approximability of three-dimensional assignment problems with bottleneck objective. |
Optimization Letters |
2010 |
DBLP DOI BibTeX RDF |
Bottleneck problem, Multidimensional assignment, Computational complexity, Approximation, Efficient algorithm |
| 1 | Mark de Berg, Fred van Nijnatten, René Sitters, Gerhard J. Woeginger, Alexander Wolff |
The Traveling Salesman Problem Under Squared Euclidean Distances |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger |
Domination When the Stars Are Out |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | 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. Discrete Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Gerhard J. Woeginger, Kazuhisa Makino, Haifeng Xu |
Caching Is Hard - Even in the Fault Model. |
ESA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger |
The Focus of Attention Problem. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Fred van Nijnatten, René Sitters, Gerhard J. Woeginger, Alexander Wolff, Mark de Berg |
The Traveling Salesman Problem under Squared Euclidean Distances. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Fleischer, Gerhard J. Woeginger |
An Algorithmic Analysis of the Honey-Bee Game. |
FUN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Eggermont, Cor A. J. Hurkens, Maciej Modelski, Gerhard J. Woeginger |
The hardness of train rearrangements. |
Oper. Res. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerhard J. Woeginger |
A comment on parallel-machine scheduling under a grade of service provision to minimize makespan. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Pim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger |
Partitioning graphs into connected parts. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | John van den Broek, Cor A. J. Hurkens, Gerhard J. Woeginger |
Timetabling problems at the TU Eindhoven. |
European Journal of Operational Research |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger |
Polygons with inscribed circles and prescribed side lengths. |
Appl. Math. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Gerhard J. Woeginger |
A new family of scientific impact measures: The generalized Kosmulski-indices. |
Scientometrics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerhard J. Woeginger |
Generalizations of Egghe's g-index. |
JASIST |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas T. Ernst, Horst W. Hamacher, Houyuan Jiang, Mohan Krishnamoorthy, Gerhard J. Woeginger |
Uncapacitated single and multiple allocation p-hub center problems. |
Computers & OR |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerhard J. Woeginger |
Threshold aggregation of multi-graded rankings. |
Mathematical Social Sciences |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger |
The complexity of computing the Muirhead-Dalton distance. |
Mathematical Social Sciences |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Pim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger |
Partitioning Graphs into Connected Parts. |
CSR |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Bastian Katz, Ignaz Rutter, Gerhard J. Woeginger |
An Algorithmic Study of Switch Graphs. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger |
Combinatorial Optimization Problems with Conflict Graphs. |
CTW |
2009 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginger |
Fully Decomposable Split Graphs. |
IWOCA |
2009 |
DBLP DOI BibTeX RDF |
computational complexity, graph decomposition, integer partition |
| 1 | Heather Hulett, Todd G. Will, Gerhard J. Woeginger |
Multigraph realizations of degree sequences: Maximization is easy, minimization is hard. |
Oper. Res. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerhard J. Woeginger |
A symmetry axiom for scientific impact indices. |
J. Informetrics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerhard J. Woeginger |
An axiomatic analysis of Egghe's g-index. |
J. Informetrics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andries E. Brouwer, Gerhard F. Post, Gerhard J. Woeginger |
Tight bounds for break minimization in tournament scheduling. |
J. Comb. Theory, Ser. A |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Cor A. J. Hurkens, Rudi Pendavingh, Gerhard J. Woeginger |
The Magnus-Derek game revisited. |
Inf. Process. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Fokko J. van de Bult, Gerhard J. Woeginger |
The problem of the moody chess players. |
Inf. Process. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger |
The computational complexity of graph contractions II: Two tough polynomially solvable cases. |
Networks |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger |
The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases. |
Networks |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Kirk Pruhs, Patchrawat Uthaisombut, Gerhard J. Woeginger |
Getting the best response for your erg. |
ACM Transactions on Algorithms |
2008 |
DBLP DOI BibTeX RDF |
scheduling, power management, voltage scaling, frequency scaling, Speed scaling |
| 1 | Gerhard J. Woeginger |
An axiomatic characterization of the Hirsch-index. |
Mathematical Social Sciences |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerhard J. Woeginger |
Four Non-Deterministic Programming Exercises. |
Bulletin of the EATCS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Axel Born, Cor A. J. Hurkens, Gerhard J. Woeginger |
The Freudenthal Problem and its Ramifications (Part III). |
Bulletin of the EATCS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Gerhard J. Woeginger |
Open problems around exact algorithms. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudi Pendavingh, Quintijn Puite, Gerhard J. Woeginger |
2-piercings via graph theory. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Péter Csorba, Cor A. J. Hurkens, Gerhard J. Woeginger |
The Alcuin Number of a Graph. |
ESA |
2008 |
DBLP DOI BibTeX RDF |
scheduling, graph theory, Transportation problem |
| 1 | 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 |
DBLP DOI BibTeX RDF |
Network congestion game, makespan objective, extreme equilibria, complexity, unsplittable flow |
| 1 | Arjen P. A. Vestjens, Marc Wennink, Gerhard J. Woeginger |
Complexity of the job insertion problem in multi-stage scheduling. |
Oper. Res. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerhard J. Woeginger, Jiri Sgall |
On the complexity of cake cutting. |
Discrete Optimization |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak, Petra Schuurman, Gerhard J. Woeginger |
A polynomial time equivalence between DNA sequencing and the exact perfect matching problem. |
Discrete Optimization |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Kirk Pruhs, Gerhard J. Woeginger |
Approximation schemes for a class of subset selection problems. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jos C. M. Baeten, Jan Karel Lenstra, Gerhard J. Woeginger |
Preface. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Arianna Alfieri, Steef L. van de Velde, Gerhard J. Woeginger |
Roll cutting in the curtain industry, or: A well-solvable allocation problem. |
European Journal of Operational Research |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiri Sgall, Gerhard J. Woeginger |
An Approximation Scheme For Cake Division With A Linear Number Of Cuts. |
Combinatorica |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 68W25, 90C27 |
| 1 | Axel Born, Cor A. J. Hurkens, Gerhard J. Woeginger |
The Freudenthal Problem and its Ramifications (Part II). |
Bulletin of the EATCS |
2007 |
DBLP BibTeX RDF |
|
| 1 | Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger |
Backbone colorings for graphs: Tree and path backbones. |
Journal of Graph Theory |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic, Gerhard J. Woeginger |
Eliminating graphs by means of parallel knock-out schemes. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Walter Kern, Gerhard J. Woeginger |
Quadratic programming and combinatorial minimum weight product problems. |
Math. Program. |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 90C20, 90C27, 90C26 |
| 1 | Ulrich Blasum, Winfried Hochstättler, Peter Oertel, Gerhard J. Woeginger |
Steiner diagrams and k-star hubs. |
J. Discrete Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Steven J. Brams, Kirk Pruhs, Gerhard J. Woeginger (eds.) |
Fair Division, 24.06. - 29.06.2007 |
Fair Division |
2007 |
DBLP BibTeX RDF |
|
| 1 | Tobias Brüggemann, Johann Hurink, Tjark Vredeveld, Gerhard J. Woeginger |
Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines. |
WAOA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | T. C. Edwin Cheng, Yong He, Han Hoogeveen, Min Ji, Gerhard J. Woeginger |
Scheduling with step-improving processing times. |
Oper. Res. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger |
Exact algorithms for the Hamiltonian cycle problem in planar graphs. |
Oper. Res. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger |
The traveling salesman problem with few inner points. |
Oper. Res. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Gerhard J. Woeginger |
On the robust assignment problem under a fixed number of cost scenarios. |
Oper. Res. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Brüggemann, Johann Hurink, Tjark Vredeveld, Gerhard J. Woeginger |
Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines. |
Electronic Notes in Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | John van den Broek, Cor A. J. Hurkens, Gerhard J. Woeginger |
Timetabling problems at the TU Eindhoven. |
Electronic Notes in Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerhard F. Post, Gerhard J. Woeginger |
Sports tournaments, home-away assignments, and the break minimization problem. |
Discrete Optimization |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger |
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult. |
Algorithmica |
2006 |
DBLP DOI BibTeX RDF |
Computational complexity, Graph coloring, Planar graph, Graph partitioning, Forbidden subgraph |
| 1 | Vladimir G. Deineko, Gerhard J. Woeginger |
On the dimension of simple monotonic games. |
European Journal of Operational Research |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Gerhard J. Woeginger |
Well-solvable instances for the partition problem. |
Appl. Math. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerhard J. Woeginger |
A Note on Fair Division under Interval Uncertainty. |
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Gerhard J. Woeginger |
Some Problems around Traveling Salesmen, Dart Boards, and Euro-coins. |
Bulletin of the EATCS |
2006 |
DBLP BibTeX RDF |
|
| 1 | Axel Born, Cor A. J. Hurkens, Gerhard J. Woeginger |
The Freudenthal Problem and its Ramifications (Part I). |
Bulletin of the EATCS |
2006 |
DBLP BibTeX RDF |
|
| 1 | Asaf Levin, Gerhard J. Woeginger |
The constrained minimum weighted sum of job completion times problem. |
Math. Program. |
2006 |
DBLP DOI BibTeX RDF |
Scheduling, Combinatorial optimization, Approximation scheme |
| 1 | Leah Epstein, Asaf Levin, Gerhard J. Woeginger |
Graph Coloring with Rejection. |
ESA |
2006 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")