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