The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gerhard J. Woeginger: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gerhard J. Woeginger
    On-Line Scheduling of Jobs with Fixed Start and End Times. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:130, n:1, pp:5-16 [Journal]
  2. Samir Khuller, Yoo Ah Kim, Gerhard J. Woeginger
    Approximation Schemes for Broadcasting in Heterogenous Networks. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:163-170 [Conf]
  3. Gerhard J. Woeginger
    Exact Algorithms for NP-Hard Problems: A Survey. [Citation Graph (0, 0)][DBLP]
    Combinatorial Optimization, 2001, pp:185-208 [Conf]
  4. Walter Kern, Gerhard J. Woeginger
    Quadratic Programming and Combinatorial Minimum Weight Product Problems. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:42-49 [Conf]
  5. József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger
    Worst-Case Analysis for On-Line Data Compression. [Citation Graph (0, 0)][DBLP]
    Combinatorics and Computer Science, 1995, pp:288-300 [Conf]
  6. Bettina Klinz, Gerhard J. Woeginger
    A New Efficiently Solvable Special Case of the Three-Dimensional Axial Bottleneck Assignment Problem. [Citation Graph (0, 0)][DBLP]
    Combinatorics and Computer Science, 1995, pp:150-162 [Conf]
  7. Mark Cieliebak, Stephan Eidenbenz, Gerhard J. Woeginger
    Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data. [Citation Graph (0, 0)][DBLP]
    COCOON, 2003, pp:519-527 [Conf]
  8. Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger
    The Traveling Salesman Problem with Few Inner Points. [Citation Graph (0, 0)][DBLP]
    COCOON, 2004, pp:268-277 [Conf]
  9. Peter Auer, Philip M. Long, Wolfgang Maass, Gerhard J. Woeginger
    On the Complexity of Function Learning. [Citation Graph (0, 0)][DBLP]
    COLT, 1993, pp:392-401 [Conf]
  10. Joseph S. B. Mitchell, Günter Rote, Gerhard J. Woeginger
    Minimum-Link Paths Among Obstacles in the Plane. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:63-72 [Conf]
  11. János Pach, Gerhard J. Woeginger
    Some New Bounds for Epsilon-Nets. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:10-15 [Conf]
  12. János Csirik, Gerhard J. Woeginger
    On-line Packing and Covering Problems. [Citation Graph (0, 0)][DBLP]
    Online Algorithms, 1996, pp:147-177 [Conf]
  13. Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger
    05301 Summary - Exact Algorithms and Fixed-Parameter Tractability. [Citation Graph (0, 0)][DBLP]
    Exact Algorithms and Fixed-Parameter Tractability, 2005, pp:- [Conf]
  14. Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger
    05301 Abstracts Collection - Exact Algorithms and Fixed-Parameter Tractability. [Citation Graph (0, 0)][DBLP]
    Exact Algorithms and Fixed-Parameter Tractability, 2005, pp:- [Conf]
  15. Amos Fiat, Gerhard J. Woeginger
    Competitive Analysis of Algorithms. [Citation Graph (0, 0)][DBLP]
    Online Algorithms, 1996, pp:1-12 [Conf]
  16. Amos Fiat, Gerhard J. Woeginger
    Competitive Odds and Ends. [Citation Graph (0, 0)][DBLP]
    Online Algorithms, 1996, pp:385-394 [Conf]
  17. Attila Kuba, Gerhard J. Woeginger
    Two Remarks on Reconstructing Binary Vectors from Their Absorbed Projections. [Citation Graph (0, 0)][DBLP]
    DGCI, 2005, pp:148-152 [Conf]
  18. Arianna Alfieri, Steef L. van de Velde, Gerhard J. Woeginger
    Roll Cutting in the Curtain Industry. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:283-292 [Conf]
  19. 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. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:406-418 [Conf]
  20. Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger
    Radio Labeling with Pre-assigned Frequencies. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:211-222 [Conf]
  21. Bo Chen, André van Vliet, Gerhard J. Woeginger
    An Optimal Algorithm for Preemptive On-line Scheduling. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:300-306 [Conf]
  22. János Csirik, Csanád Imreh, John Noga, Steven S. Seiden, Gerhard J. Woeginger
    Buying a Constant Competitive Ratio for Paging. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:98-108 [Conf]
  23. Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger
    Sometimes Travelling is Easy: The Master Tour Problem. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:128-141 [Conf]
  24. Leah Epstein, Asaf Levin, Gerhard J. Woeginger
    Graph Coloring with Rejection. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:364-375 [Conf]
  25. Han Hoogeveen, Martin Skutella, Gerhard J. Woeginger
    Preemptive Scheduling with Rejection. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:268-277 [Conf]
  26. Bettina Klinz, Rüdiger Rudolf, Gerhard J. Woeginger
    On the Recognition of Permuted Bottleneck Monge Matrices. [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:248-259 [Conf]
  27. Renaud Lepère, Denis Trystram, Gerhard J. Woeginger
    Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:146-157 [Conf]
  28. Jiri Sgall, Gerhard J. Woeginger
    A Lower Bound for Cake Cutting. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:459-469 [Conf]
  29. Hadas Shachnai, Tami Tamir, Gerhard J. Woeginger
    Minimizing Makespan and Preemption Costs on a System of Uniform Machines. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:859-871 [Conf]
  30. Gerhard J. Woeginger
    An Approximation Scheme for Cake Division with a Linear Number of Cuts. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:896-901 [Conf]
  31. Gerhard J. Woeginger
    Seventeen Lines and One-Hundred-and-One Points. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:527-531 [Conf]
  32. Klaus Jansen, Petra Scheffler, Gerhard J. Woeginger
    Maximum Covering with D Cliques. [Citation Graph (0, 0)][DBLP]
    FCT, 1993, pp:319-328 [Conf]
  33. 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 [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:86-95 [Conf]
  34. Maxim Sviridenko, Gerhard J. Woeginger
    Approximability and in-approximability results for no-wait shop scheduling. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:116-125 [Conf]
  35. Marek Chrobak, János Csirik, Csanád Imreh, John Noga, Jiri Sgall, Gerhard J. Woeginger
    The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:862-874 [Conf]
  36. János Csirik, Gerhard J. Woeginger
    Resource Augmentation for Online Bounded Space Bin Packing. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:296-304 [Conf]
  37. Gerhard J. Woeginger
    On the Approximability of Average Completion Time Scheduling under Precedence Constraints. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:887-897 [Conf]
  38. Gerhard J. Woeginger
    An FPTAS for Agreeably Weighted Variance on a Single Machine. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:707-716 [Conf]
  39. Alexander I. Barvinok, David S. Johnson, Gerhard J. Woeginger, Russell Woodroofe
    The Maximum Traveling Salesman Problem Under Polyhedral Norms. [Citation Graph (0, 0)][DBLP]
    IPCO, 1998, pp:195-201 [Conf]
  40. 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. [Citation Graph (0, 0)][DBLP]
    IPCO, 1996, pp:204-218 [Conf]
  41. Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger
    The Travelling Salesman and the PQ-Tree. [Citation Graph (0, 0)][DBLP]
    IPCO, 1996, pp:490-504 [Conf]
  42. Han Hoogeveen, Petra Schuurman, Gerhard J. Woeginger
    Non-approximability Results for Scheduling Problems with Minsum Criteria. [Citation Graph (0, 0)][DBLP]
    IPCO, 1998, pp:353-366 [Conf]
  43. Bettina Klinz, Gerhard J. Woeginger
    Minimum Cost Dynamic Flows: The Series-Parallel Case. [Citation Graph (0, 0)][DBLP]
    IPCO, 1995, pp:329-343 [Conf]
  44. Asaf Levin, Gerhard J. Woeginger
    The Constrained Minimum Weighted Sum of Job Completion Times Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:298-307 [Conf]
  45. Hans Kellerer, Franz Rendl, Gerhard J. Woeginger
    Computing the optimum stock size. [Citation Graph (0, 0)][DBLP]
    IPCO, 1993, pp:147-159 [Conf]
  46. Alexander Grigoriev, Gerhard J. Woeginger
    Project Scheduling with Irregular Costs: Complexity, Approximability, and Algorithms. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:381-390 [Conf]
  47. Gerhard J. Woeginger
    Space and Time Complexity of Exact Algorithms: Some Open Problems (Invited Talk). [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:281-290 [Conf]
  48. Kirk Pruhs, Gerhard J. Woeginger
    Approximation Schemes for a Class of Subset Selection Problems. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:203-211 [Conf]
  49. Paul S. Bonsma, Tobias Brüggemann, Gerhard J. Woeginger
    A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:259-268 [Conf]
  50. Hajo Broersma, Fedor V. Fomin, Gerhard J. Woeginger
    Parallel Knock-Out Schemes in Networks. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:204-214 [Conf]
  51. Noga Alon, Yossi Azar, Gerhard J. Woeginger, Tal Yadid
    Approximation Schemes for Scheduling. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:493-500 [Conf]
  52. Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
    Four point conditions and exponential neighborhoods for symmetric TSP. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:544-553 [Conf]
  53. Leah Epstein, John Noga, Steven S. Seiden, Jiri Sgall, Gerhard J. Woeginger
    Randomized Online Scheduling on Two Uniform Machines. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:317-326 [Conf]
  54. 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. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:263-264 [Conf]
  55. Giovanni Rinaldi, Ulrich Voigt, Gerhard J. Woeginger
    The mathematics of playing golf. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:265-266 [Conf]
  56. Petra Schuurman, Gerhard J. Woeginger
    Scheduling a pipelined operator graph. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:207-212 [Conf]
  57. Petra Schuurman, Gerhard J. Woeginger
    Preemptive Scheduling with Job-Dependent Setup Times. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:759-767 [Conf]
  58. Gerhard J. Woeginger
    Assigning chain-like tasks to a chain-like network. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:765-766 [Conf]
  59. Gerhard J. Woeginger
    When Does a Dynamic Programming Formulation Guarantee the Existence of an FPTAS? [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:820-829 [Conf]
  60. Wolfgang Gutjahr, Emo Welzl, Gerhard J. Woeginger
    Polynomial Graph-Colorings. [Citation Graph (0, 0)][DBLP]
    STACS, 1989, pp:108-119 [Conf]
  61. Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woeginger
    Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:418-426 [Conf]
  62. Martin Skutella, Gerhard J. Woeginger
    A PTAS for Minimizing the Weighted Sum of Job Completion Times on Parallel Machines. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:400-407 [Conf]
  63. Yossi Azar, Leah Epstein, Yossi Richter, Gerhard J. Woeginger
    All-Norm Approximation Algorithms. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:288-297 [Conf]
  64. Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger
    Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:160-169 [Conf]
  65. Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger
    Caching for Web Searching. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:150-163 [Conf]
  66. Kirk Pruhs, Patchrawat Uthaisombut, Gerhard J. Woeginger
    Getting the Best Response for Your Erg. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:14-25 [Conf]
  67. Tomás Ebenlendr, John Noga, Jiri Sgall, Gerhard J. Woeginger
    A Note on Semi-online Machine Covering. [Citation Graph (0, 0)][DBLP]
    WAOA, 2005, pp:110-118 [Conf]
  68. Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger
    Backbone Colorings for Networks. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:131-142 [Conf]
  69. Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger
    More about Subcolorings. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:68-79 [Conf]
  70. Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak, Petra Schuurman, Gerhard J. Woeginger
    DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:13-24 [Conf]
  71. Luitpold Babel, Gerhard J. Woeginger
    Pseudo-Hamiltonian Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:38-51 [Conf]
  72. Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger
    Scheduling with Incompatible Jobs. [Citation Graph (0, 0)][DBLP]
    WG, 1992, pp:37-49 [Conf]
  73. Hajo Broersma, Daniël Paulusma, Gerard J. M. Smit, Frank Vlaardingerbroek, Gerhard J. Woeginger
    The Computational Complexity of the Minimum Weight Processor Assignment Problem. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:189-200 [Conf]
  74. Fedor V. Fomin, Dieter Kratsch, Gerhard J. Woeginger
    Exact (Exponential) Algorithms for the Dominating Set Problem. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:245-256 [Conf]
  75. Bettina Klinz, Gerhard J. Woeginger
    One, Two, Three, Many, or: Complexity Aspects of Dynamic Network Flows with Dedicated Arcs. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:254-267 [Conf]
  76. Daniel Král, Jan Kratochvíl, Zsolt Tuza, Gerhard J. Woeginger
    Complexity of Coloring Graphs without Forbidden Induced Subgraphs. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:254-262 [Conf]
  77. Evangelos Kranakis, Danny Krizanc, Berthold Ruf, Jorge Urrutia, Gerhard J. Woeginger
    VC-Dimensions for Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:1-13 [Conf]
  78. Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger
    The Complexity of Graph Contractions. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:322-333 [Conf]
  79. Rudi Pendavingh, Petra Schuurman, Gerhard J. Woeginger
    De Bruijn Graphs and DNA Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:296-305 [Conf]
  80. Gerhard J. Woeginger
    Epsilon-Nets for Halfplanes. [Citation Graph (0, 0)][DBLP]
    WG, 1988, pp:243-252 [Conf]
  81. Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger
    On the Recognition of Permuted Supnick and Incomplete Monge Matrices. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1996, v:33, n:6, pp:559-569 [Journal]
  82. Amos Fiat, Gerhard J. Woeginger
    On-Line Scheduling on a Single Machine: Minimizing the Total Completion Time. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1999, v:36, n:4, pp:287-293 [Journal]
  83. Alexander Grigoriev, Gerhard J. Woeginger
    Project scheduling with irregular costs: complexity, approximability, and algorithms. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2004, v:41, n:2-3, pp:83-97 [Journal]
  84. Gerhard J. Woeginger
    Heuristics for Parallel Machine Scheduling with Delivery Times. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1994, v:31, n:6, pp:503-512 [Journal]
  85. Luitpold Babel, Gerhard J. Woeginger
    Pseudo-Hamiltonian Graphs. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 2000, v:14, n:4, pp:553-567 [Journal]
  86. Gábor Galambos, Hans Kellerer, Gerhard J. Woeginger
    A Lower Bound for On-Line Vector-Packing Algorithms. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1993, v:11, n:1-2, pp:23-34 [Journal]
  87. Ulrich Pferschy, Gerhard J. Woeginger, En-Yu Yao
    Partitioning Graphs into Two Trees. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1994, v:11, n:3, pp:233-240 [Journal]
  88. Günter Rote, Gerhard J. Woeginger
    Minimizing the Number of Tardy Jobs. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1998, v:13, n:4, pp:423-430 [Journal]
  89. Petra Schuurman, Gerhard J. Woeginger
    A PTAS for single machine scheduling with controllable processing times. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 2002, v:15, n:3, pp:369-378 [Journal]
  90. Gerhard J. Woeginger
    Computing Maximum Valued Regions. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1992, v:10, n:4, pp:303-316 [Journal]
  91. Gerhard J. Woeginger, Jiri Sgall
    The complexity of coloring graphs without long induced paths. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 2001, v:15, n:1, pp:107-0 [Journal]
  92. 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. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:21, n:1, pp:104-118 [Journal]
  93. Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger
    Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:44, n:4, pp:343-361 [Journal]
  94. Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger
    Caching for Web Searching. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:33, n:3, pp:353-370 [Journal]
  95. Joseph S. B. Mitchell, Günter Rote, Gerhard J. Woeginger
    Minimum-Link Paths Among Obstacles in the Plan. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:8, n:5&6, pp:431-459 [Journal]
  96. Hadas Shachnai, Tami Tamir, Gerhard J. Woeginger
    Minimizing Makespan and Preemption Costs on a System of Uniform Machines. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:42, n:3-4, pp:309-334 [Journal]
  97. Gerhard J. Woeginger
    Introduction. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:28, n:1, pp:1- [Journal]
  98. George A. Constantinides, Gerhard J. Woeginger
    The complexity of multiple wordlength assignment. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2002, v:15, n:2, pp:137-140 [Journal]
  99. Vladimir G. Deineko, Gerhard J. Woeginger
    Well-solvable instances for the partition problem. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2006, v:19, n:10, pp:1053-1056 [Journal]
  100. Piotr Rudnicki, Gerhard J. Woeginger
    The post correspondence problem over a unary alphabet. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2003, v:16, n:5, pp:723-727 [Journal]
  101. Klaus Jansen, Gerhard J. Woeginger
    The Complexity of Detecting Crossingfree Configurations in the Plane. [Citation Graph (0, 0)][DBLP]
    BIT, 1993, v:33, n:4, pp:580-595 [Journal]
  102. Sándor P. Fekete, Gerhard J. Woeginger
    Angle-Restricted Tours in the Plane. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:195-218 [Journal]
  103. József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger
    The Fractional Greedy Algorithm for Data Compression. [Citation Graph (0, 0)][DBLP]
    Computing, 1996, v:56, n:1, pp:29-46 [Journal]
  104. Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger
    More About Subcolorings. [Citation Graph (0, 0)][DBLP]
    Computing, 2002, v:69, n:3, pp:187-203 [Journal]
  105. Han Hoogeveen, Gerhard J. Woeginger
    Some Comments on Sequencing with Controllable Processing Times. [Citation Graph (0, 0)][DBLP]
    Computing, 2002, v:68, n:2, pp:181-192 [Journal]
  106. Thomas Tautenhahn, Gerhard J. Woeginger
    Unit-Time Scheduling Problems with Time Dependent Resources. [Citation Graph (0, 0)][DBLP]
    Computing, 1997, v:58, n:2, pp:97-112 [Journal]
  107. Sergey V. Sevastianov, Gerhard J. Woeginger
    Makespan Minimization in Preemptive Two Machine Job Shops. [Citation Graph (0, 0)][DBLP]
    Computing, 1998, v:60, n:1, pp:73-80 [Journal]
  108. Klaus Jansen, Gerhard J. Woeginger, Zhongliang Yu
    UET-scheduling with chain-type precedence constraints. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1995, v:22, n:9, pp:915-920 [Journal]
  109. Hans Kellerer, Gerhard J. Woeginger
    UET-scheduling with constrained processor allocations. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1992, v:19, n:1, pp:1-8 [Journal]
  110. Marek Chrobak, Peter Couperus, Christoph Dürr, Gerhard J. Woeginger
    A Note on Tiling under Tomographic Constraints [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  111. Alexander I. Barvinok, Sándor P. Fekete, David S. Johnson, Arie Tamir, Gerhard J. Woeginger, Russell Woodroofe
    The Geometric Maximum Traveling Salesman Problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  112. Davaatseren Baatar, Horst W. Hamacher, Matthias Ehrgott, Gerhard J. Woeginger
    Decomposition of integer matrices and multileaf collimator sequencing. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:152, n:1-3, pp:6-34 [Journal]
  113. Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger
    Scheduling with Incompatible Jobs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:55, n:3, pp:219-232 [Journal]
  114. Rainer E. Burkard, Rüdiger Rudolf, Gerhard J. Woeginger
    Three-dimensional Axial Assignment Problems with Decomposable Cost Coefficients. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:65, n:1-3, pp:123-139 [Journal]
  115. Vladimir G. Deineko, Gerhard J. Woeginger
    The Maximum Travelling Salesman Problem on Symmetric Demidenko Matrices. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:99, n:1-3, pp:413-425 [Journal]
  116. Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
    Which matrices are immune against the transportation paradox? [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:130, n:3, pp:495-501 [Journal]
  117. Bettina Klinz, Rüdiger Rudolf, Gerhard J. Woeginger
    Permuting Matrices to Avoid Forbidden Submatrices. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:60, n:1-3, pp:223-248 [Journal]
  118. Bettina Klinz, Rüdiger Rudolf, Gerhard J. Woeginger
    on the Recognition of Permuted Bottleneck Monge Matrices. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:63, n:1, pp:43-74 [Journal]
  119. Hans Kellerer, Gerhard J. Woeginger
    On the Euclidean two Paths Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:47, n:2, pp:165-173 [Journal]
  120. Hans Kellerer, Gerhard J. Woeginger
    A Tight Bound for 3-Partitioning. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:45, n:3, pp:249-259 [Journal]
  121. Evangelos Kranakis, Danny Krizanc, Berthold Ruf, Jorge Urrutia, Gerhard J. Woeginger
    The VC-dimension of Set Systems Defined by Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:77, n:3, pp:237-257 [Journal]
  122. Rudi Pendavingh, Petra Schuurman, Gerhard J. Woeginger
    Recognizing DNA graphs is difficult. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:127, n:1, pp:85-94 [Journal]
  123. Ulrich Pferschy, David Pisinger, Gerhard J. Woeginger
    Simple But Efficient Approaches for the Collapsing Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:77, n:3, pp:271-280 [Journal]
  124. Sergey V. Sevastianov, Gerhard J. Woeginger
    Linear time approximation scheme for the multiprocessor open shop problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:114, n:1-3, pp:273-288 [Journal]
  125. Gerhard J. Woeginger
    A note on the depth function of combinatorial optimization problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:108, n:3, pp:325-328 [Journal]
  126. Gerhard J. Woeginger
    On the approximability of average completion time scheduling under precedence constraints. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:1, pp:237-252 [Journal]
  127. Gerhard J. Woeginger
    Sensitivity Analysis for Knapsack Problems: Another Negative Result. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:92, n:2-3, pp:247-251 [Journal]
  128. Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic, Gerhard J. Woeginger
    Eliminating graphs by means of parallel knock-out schemes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:2, pp:92-102 [Journal]
  129. David Eppstein, Mark H. Overmars, Günter Rote, Gerhard J. Woeginger
    Finding Minimum Area k-gons. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:7, n:, pp:45-58 [Journal]
  130. János Komlós, János Pach, Gerhard J. Woeginger
    Almost Tight Bounds for epsilon-Nets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:7, n:, pp:163-173 [Journal]
  131. Michael Formann, Gerhard J. Woeginger
    On the reconstruction of simple polygons. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1990, v:40, n:, pp:225-230 [Journal]
  132. Gerhard J. Woeginger
    Open problems in the theory of scheduling. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2002, v:76, n:, pp:67-83 [Journal]
  133. Peter Auer, Philip M. Long, Wolfgang Maass, Gerhard J. Woeginger
    On the Complexity of Function Learning [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:50, pp:- [Journal]
  134. Gerhard J. Woeginger
    When does a dynamic programming formulation guarantee the existence of an FPTAS? [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:, n:084, pp:- [Journal]
  135. Gerhard J. Woeginger
    Resource augmentation for online bounded space bin packing [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:, n:085, pp:- [Journal]
  136. Renaud Lepère, Denis Trystram, Gerhard J. Woeginger
    Approximation Algorithms for Scheduling Malleable Tasks Under Precedence Constraints. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2002, v:13, n:4, pp:613-627 [Journal]
  137. Han Hoogeveen, Petra Schuurman, Gerhard J. Woeginger
    Non-Approximability Results for Scheduling Problems with Minsum Criteria. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2001, v:13, n:2, pp:157-168 [Journal]
  138. Gerhard J. Woeginger
    When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2000, v:12, n:1, pp:57-74 [Journal]
  139. Axel Born, Cor A. J. Hurkens, Gerhard J. Woeginger
    How to detect a counterfeit coin: Adaptive versus non-adaptive solutions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:86, n:3, pp:137-141 [Journal]
  140. Bo Chen, André van Vliet, Gerhard J. Woeginger
    A Lower Bound for Randomized On-Line Scheduling Algorithms. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:51, n:5, pp:219-222 [Journal]
  141. János Csirik, Gerhard J. Woeginger
    Shelf Algorithms for On-Line Strip Packing. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:63, n:4, pp:171-175 [Journal]
  142. Vladimir G. Deineko, Gerhard J. Woeginger
    The Convex-Hull-and-k-Line Travelling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:59, n:6, pp:295-301 [Journal]
  143. Sándor P. Fekete, Martin Skutella, Gerhard J. Woeginger
    The complexity of economic equilibria for house allocation markets. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:88, n:5, pp:219-223 [Journal]
  144. Herbert Fleischner, Gerhard J. Woeginger
    Detecting Cycles Through Three Fixed Vertices in a Graph. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:1, pp:29-33 [Journal]
  145. Joseph S. B. Mitchell, Günter Rote, Gopalakrishnan Sundaram, Gerhard J. Woeginger
    Counting Convex Polygons in Planar Point Sets. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:1, pp:45-49 [Journal]
  146. John Noga, Steven S. Seiden, Gerhard J. Woeginger
    A faster off-line algorithm for the TCP acknowledgement problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:81, n:2, pp:71-73 [Journal]
  147. Günter Rote, Gerhard J. Woeginger
    Counting Convex k-Gons in Planar Point Sets. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:41, n:4, pp:191-194 [Journal]
  148. Günter Rote, Gerhard J. Woeginger, Binhai Zhu, Zhengyan Wang
    Counting k-Subsets and Convex k-gons in the Plane. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:38, n:3, pp:149-151 [Journal]
  149. Gerhard J. Woeginger
    The reconstruction of polyominoes from their orthogonal projections. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:77, n:5-6, pp:225-229 [Journal]
  150. Gerhard J. Woeginger
    A Simple Solution to the Two Paths Problem in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:36, n:4, pp:191-192 [Journal]
  151. Gerhard J. Woeginger
    On Minimizing the Sum of k Tardinesses. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:38, n:5, pp:253-256 [Journal]
  152. Gerhard J. Woeginger
    Finding the Closest Extreme Vertex to a Fixed Point. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:43, n:3, pp:127-128 [Journal]
  153. Gerhard J. Woeginger
    The Complexity of Finding Arborescences in Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:3, pp:161-164 [Journal]
  154. Gerhard J. Woeginger
    Scheduling with Time-Dependent Execution Times. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:54, n:3, pp:155-156 [Journal]
  155. Gerhard J. Woeginger
    There is no Asymptotic PTAS for Two-Dimensional Vector Packing. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:64, n:6, pp:293-297 [Journal]
  156. Gerhard J. Woeginger, Zhongliang Yu
    On the Equal-Subset-Sum Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:6, pp:299-302 [Journal]
  157. Alexander I. Barvinok, Sándor P. Fekete, David S. Johnson, Arie Tamir, Gerhard J. Woeginger, Russell Woodroofe
    The geometric maximum traveling salesman problem. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2003, v:50, n:5, pp:641-664 [Journal]
  158. Yossi Azar, Leah Epstein, Yossi Richter, Gerhard J. Woeginger
    All-norm approximation algorithms. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:52, n:2, pp:120-133 [Journal]
  159. József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger
    Greedy Algorithms for On-Line Data Compression. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:25, n:2, pp:274-289 [Journal]
  160. Vasilis Capoyleas, Günter Rote, Gerhard J. Woeginger
    Geometric Clusterings. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1991, v:12, n:2, pp:341-356 [Journal]
  161. János Csirik, Gerhard J. Woeginger
    Resource augmentation for online bounded space bin packing. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:44, n:2, pp:308-320 [Journal]
  162. Mark Cieliebak, Stephan Eidenbenz, Gerhard J. Woeginger
    Complexity and Approximability of Double Digest. [Citation Graph (0, 0)][DBLP]
    J. Bioinformatics and Computational Biology, 2005, v:3, n:2, pp:207-224 [Journal]
  163. Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger
    The Travelling Salesman Problem on Permuted Monge Matrices. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1998, v:2, n:4, pp:333-350 [Journal]
  164. Bettina Klinz, Gerhard J. Woeginger
    The Steiner Tree Problem in Kalmanson Matrices and in Circulant Matrices. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1999, v:3, n:1, pp:51-58 [Journal]
  165. Bo Chen, Arjen P. A. Vestjens, Gerhard J. Woeginger
    On-Line Scheduling of Two-Machine Open Shops Where Jobs Arrive Over Time. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1998, v:1, n:4, pp:355-365 [Journal]
  166. Peter Auer, Philip M. Long, Wolfgang Maass, Gerhard J. Woeginger
    On the Complexity of Function Learning. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 1995, v:18, n:2-3, pp:187-230 [Journal]
  167. Martin Skutella, Gerhard J. Woeginger
    A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2000, v:25, n:1, pp:63-75 [Journal]
  168. 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. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:82, n:, pp:125-158 [Journal]
  169. Asaf Levin, Gerhard J. Woeginger
    The constrained minimum weighted sum of job completion times problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:108, n:1, pp:115-126 [Journal]
  170. Sergey V. Sevastianov, Gerhard J. Woeginger
    Makespan minimization in open shops: A polynomial time approximation scheme. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:82, n:, pp:191-198 [Journal]
  171. Steven S. Seiden, Gerhard J. Woeginger
    The two-dimensional cutting stock problem revisited. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2005, v:102, n:3, pp:519-530 [Journal]
  172. 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. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:82, n:, pp:235-254 [Journal]
  173. Rainer E. Burkard, Karin Feldbacher, Bettina Klinz, Gerhard J. Woeginger
    Minimum-cost strong network orientation problems: Classification, complexity, and algorithms. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:33, n:1, pp:57-70 [Journal]
  174. Bettina Klinz, Gerhard J. Woeginger
    Minimum-cost dynamic flows: The series-parallel case. [Citation Graph (0, 0)][DBLP]
    Networks, 2004, v:43, n:3, pp:153-162 [Journal]
  175. Bettina Klinz, Gerhard J. Woeginger
    A note on the bottleneck graph partition problem. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:33, n:3, pp:189-191 [Journal]
  176. Ulrich Pferschy, Rüdiger Rudolf, Gerhard J. Woeginger
    Some Geometric Clustering Problems. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1994, v:1, n:2, pp:246-263 [Journal]
  177. 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. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:219-224 [Journal]
  178. Tobias Brüggemann, Jérôme Monnot, Gerhard J. Woeginger
    Local search for the minimum label spanning tree problem with bounded color classes. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:195-201 [Journal]
  179. Satyaveer Singh Chauhan, Anton V. Eremeev, Anna A. Romanova, Vladimir V. Servakh, Gerhard J. Woeginger
    Approximation of the supply scheduling problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:3, pp:249-254 [Journal]
  180. T. C. Edwin Cheng, Yong He, Han Hoogeveen, Min Ji, Gerhard J. Woeginger
    Scheduling with step-improving processing times. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:1, pp:37-40 [Journal]
  181. Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger
    The traveling salesman problem with few inner points. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:1, pp:106-110 [Journal]
  182. Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
    Exact algorithms for the Hamiltonian cycle problem in planar graphs. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:3, pp:269-274 [Journal]
  183. Vladimir G. Deineko, Gerhard J. Woeginger
    Hardness of approximation of the discrete time-cost tradeoff problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2001, v:29, n:5, pp:207-210 [Journal]
  184. Vladimir G. Deineko, Gerhard J. Woeginger
    A comment on consecutive-2-out-of-n systems. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2001, v:28, n:4, pp:169-171 [Journal]
  185. Vladimir G. Deineko, Gerhard J. Woeginger
    On the robust assignment problem under a fixed number of cost scenarios. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:2, pp:175-179 [Journal]
  186. Vladimir G. Deineko, Gerhard J. Woeginger
    A solvable case of the quadratic assignment problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1998, v:22, n:1, pp:13-17 [Journal]
  187. Leah Epstein, John Noga, Gerhard J. Woeginger
    On-line scheduling of unit time jobs with rejection: minimizing the total completion time. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2002, v:30, n:6, pp:415-420 [Journal]
  188. Dorit S. Hochbaum, Gerhard J. Woeginger
    A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1999, v:24, n:1-2, pp:25-28 [Journal]
  189. Han Hoogeveen, Chris N. Potts, Gerhard J. Woeginger
    On-line scheduling on a single machine: maximizing the number of early jobs. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2000, v:27, n:5, pp:193-197 [Journal]
  190. Han Hoogeveen, Gerhard J. Woeginger
    A very difficult scheduling problem with communication delays. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2001, v:29, n:5, pp:241-245 [Journal]
  191. Cor A. J. Hurkens, Gerhard J. Woeginger
    On the nearest neighbor rule for the traveling salesman problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:1, pp:1-4 [Journal]
  192. Bettina Klinz, Gerhard J. Woeginger
    One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1998, v:22, n:4-5, pp:119-127 [Journal]
  193. Steven S. Seiden, Jiri Sgall, Gerhard J. Woeginger
    Semi-online scheduling with decreasing job sizes. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2000, v:27, n:5, pp:215-221 [Journal]
  194. Frits C. R. Spieksma, Gerhard J. Woeginger
    The no-wait flow-shop paradox. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:6, pp:603-608 [Journal]
  195. David J. Rader Jr., Gerhard J. Woeginger
    The quadratic 0-1 knapsack problem with series-parallel support. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2002, v:30, n:3, pp:159-166 [Journal]
  196. Petra Schuurman, Gerhard J. Woeginger
    Approximation algorithms for the multiprocessor open shop scheduling problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1999, v:24, n:4, pp:157-163 [Journal]
  197. Gerhard J. Woeginger
    Monge strikes again: optimal placement of web proxies in the internet. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2000, v:27, n:3, pp:93-96 [Journal]
  198. Gerhard J. Woeginger
    A comment on scheduling on uniform machines under chain-type precedence constraints. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2000, v:26, n:3, pp:107-109 [Journal]
  199. Gerhard J. Woeginger
    An efficient algorithm for a class of constraint satisfaction problems. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2002, v:30, n:1, pp:9-16 [Journal]
  200. Gerhard J. Woeginger
    Embeddings of planar graphs that minimize the number of long-face cycles. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2002, v:30, n:3, pp:167-168 [Journal]
  201. Gerhard J. Woeginger
    Inapproximability results for no-wait job shop scheduling. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:4, pp:320-325 [Journal]
  202. Gerhard J. Woeginger
    Combinatorial approximation algorithms: a comparative review. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:2, pp:210-215 [Journal]
  203. Gerhard J. Woeginger
    A comment on a minmax location problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1998, v:23, n:1-2, pp:41-43 [Journal]
  204. Gerhard J. Woeginger, Guochuan Zhang
    Optimal on-line algorithms for variable-sized bin covering. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1999, v:25, n:1, pp:47-50 [Journal]
  205. Moshe Zukerman, Long Jia, Timothy D. Neame, Gerhard J. Woeginger
    A polynomially solvable special case of the unbounded knapsack problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2001, v:29, n:1, pp:13-16 [Journal]
  206. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:5, pp:1035-1052 [Journal]
  207. Gábor Galambos, Gerhard J. Woeginger
    An On-Line Scheduling Heuristic With Better Worst Case Ratio Than Graham's List Scheduling. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:2, pp:349-355 [Journal]
  208. Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woeginger
    Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:4, pp:1155-1166 [Journal]
  209. Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger
    Sometimes Travelling is Easy: The Master Tour Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1998, v:11, n:1, pp:81-93 [Journal]
  210. Gerhard J. Woeginger
    Improved Space for Bounded-Space, On-Line Bin-Packing. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1993, v:6, n:4, pp:575-581 [Journal]
  211. 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. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2003, v:52, n:9, pp:1210-1214 [Journal]
  212. Eric Anderson, Marek Chrobak, John Noga, Jiri Sgall, Gerhard J. Woeginger
    Solution of a problem in DNA computing. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:287, n:2, pp:387-391 [Journal]
  213. Yossi Azar, Oded Regev, Jiri Sgall, Gerhard J. Woeginger
    Off-line temporary tasks assignment. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:287, n:2, pp:419-428 [Journal]
  214. Marek Chrobak, Peter Couperus, Christoph Dürr, Gerhard J. Woeginger
    On tiling under tomographic constraints. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:2125-2136 [Journal]
  215. Daniel Král, Vladan Majerech, Jiri Sgall, Tomás Tichý, Gerhard J. Woeginger
    It is tough to be a plumber. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:303, n:3, pp:473-484 [Journal]
  216. Jaroslav Nesetril, Gerhard J. Woeginger
    Graph colorings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:349, n:1, pp:1- [Journal]
  217. Petra Schuurman, Gerhard J. Woeginger
    A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:237, n:1-2, pp:105-122 [Journal]
  218. Gerhard J. Woeginger
    Seventeen lines and one-hundred-and-one points. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:321, n:2-3, pp:415-421 [Journal]
  219. Vladimir G. Deineko, Gerhard J. Woeginger
    On the dimension of simple monotonic games. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2006, v:170, n:1, pp:315-318 [Journal]
  220. Vladimir G. Deineko, Gerhard J. Woeginger
    Complexity and approximability results for slicing floorplan designs. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2003, v:149, n:3, pp:533-539 [Journal]
  221. Jiri Sgall, Gerhard J. Woeginger
    An Approximation Scheme For Cake Division With A Linear Number Of Cuts. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2007, v:27, n:2, pp:205-211 [Journal]
  222. Gerhard J. Woeginger
    The toughness of split graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:190, n:1-3, pp:295-297 [Journal]
  223. Qi Fan Yang, Rainer E. Burkard, Eranda Çela, Gerhard J. Woeginger
    Hamiltonian cycles in circulant digraphs with two stripes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:176, n:1-3, pp:233-254 [Journal]
  224. Franz Rendl, Gerhard J. Woeginger
    Reconstructing sets of orthogonal line segments in the plane. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:119, n:1-3, pp:167-174 [Journal]
  225. Walter Kern, Gerhard J. Woeginger
    Quadratic programming and combinatorial minimum weight product problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2007, v:110, n:3, pp:641-649 [Journal]
  226. Jos C. M. Baeten, Jan Karel Lenstra, Gerhard J. Woeginger
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:379, n:3, pp:305- [Journal]
  227. Kirk Pruhs, Gerhard J. Woeginger
    Approximation schemes for a class of subset selection problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:382, n:2, pp:151-156 [Journal]

  228. Partitioning Graphs into Connected Parts. [Citation Graph (, )][DBLP]


  229. The Alcuin Number of a Graph. [Citation Graph (, )][DBLP]


  230. Caching Is Hard - Even in the Fault Model. [Citation Graph (, )][DBLP]


  231. Timetabling Problems at the TU Eindhoven. [Citation Graph (, )][DBLP]


  232. The Focus of Attention Problem. [Citation Graph (, )][DBLP]


  233. The Traveling Salesman Problem under Squared Euclidean Distances. [Citation Graph (, )][DBLP]


  234. Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines. [Citation Graph (, )][DBLP]


  235. Between a Rock and a Hard Place: The Two-to-One Assignment Problem. [Citation Graph (, )][DBLP]


  236. An Algorithmic Study of Switch Graphs. [Citation Graph (, )][DBLP]


  237. How Hard Is It to Find Extreme Nash Equilibria in Network Congestion Games? [Citation Graph (, )][DBLP]


  238. An Algorithmic Analysis of the Honey-Bee Game. [Citation Graph (, )][DBLP]


  239. Combinatorial Optimization Problems with Conflict Graphs. [Citation Graph (, )][DBLP]


  240. Fully Decomposable Split Graphs. [Citation Graph (, )][DBLP]


  241. Polygons with inscribed circles and prescribed side lengths. [Citation Graph (, )][DBLP]


  242. A general approach to avoiding two by two submatrices. [Citation Graph (, )][DBLP]


  243. Uncapacitated single and multiple allocation p-hub center problems. [Citation Graph (, )][DBLP]


  244. The Traveling Salesman Problem Under Squared Euclidean Distances [Citation Graph (, )][DBLP]


  245. Open problems around exact algorithms. [Citation Graph (, )][DBLP]


  246. 2-piercings via graph theory. [Citation Graph (, )][DBLP]


  247. Polynomial graph-colorings. [Citation Graph (, )][DBLP]


Search in 0.112secs, Finished in 0.120secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002