dblp.uni-trier.dewww.uni-trier.de

Gerhard J. Woeginger Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
275EEPim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger: Partitioning Graphs into Connected Parts. CSR 2009: 143-154
274EEAndreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger: Combinatorial Optimization Problems with Conflict Graphs. CTW 2009: 293-296
273EEVladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger: Polygons with inscribed circles and prescribed side lengths. Appl. Math. Lett. 22(5): 704-706 (2009)
272EEAndreas 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)
271EEJohn van den Broek, Cor A. J. Hurkens, Gerhard J. Woeginger: Timetabling problems at the TU Eindhoven. European Journal of Operational Research 196(3): 877-885 (2009)
270EEGerhard J. Woeginger: A comment on parallel-machine scheduling under a grade of service provision to minimize makespan. Inf. Process. Lett. 109(7): 341-342 (2009)
269EEGerhard J. Woeginger: Generalizations of Egghe's g-index. JASIST 60(6): 1267-1273 (2009)
268EEVladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger: The complexity of computing the Muirhead-Dalton distance. Mathematical Social Sciences 57(2): 282-284 (2009)
267EEChristian Eggermont, Cor A. J. Hurkens, Maciej Modelski, Gerhard J. Woeginger: The hardness of train rearrangements. Oper. Res. Lett. 37(2): 80-82 (2009)
2008
266EEPéter Csorba, Cor A. J. Hurkens, Gerhard J. Woeginger: The Alcuin Number of a Graph. ESA 2008: 320-331
265EEElisabeth 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
264EEKirk Pruhs, Patchrawat Uthaisombut, Gerhard J. Woeginger: Getting the best response for your erg. ACM Transactions on Algorithms 4(3): (2008)
263EERudi Pendavingh, Quintijn Puite, Gerhard J. Woeginger: 2-piercings via graph theory. Discrete Applied Mathematics 156(18): 3510-3512 (2008)
262EEGerhard J. Woeginger: Open problems around exact algorithms. Discrete Applied Mathematics 156(3): 397-405 (2008)
261EEFokko J. van de Bult, Gerhard J. Woeginger: The problem of the moody chess players. Inf. Process. Lett. 108(5): 336-337 (2008)
260EECor A. J. Hurkens, Rudi Pendavingh, Gerhard J. Woeginger: The Magnus-Derek game revisited. Inf. Process. Lett. 109(1): 38-40 (2008)
259EEAndries 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)
258EEGerhard J. Woeginger: A symmetry axiom for scientific impact indices. J. Informetrics 2(4): 298-303 (2008)
257EEGerhard J. Woeginger: An axiomatic analysis of Egghe's g-index. J. Informetrics 2(4): 364-368 (2008)
256EEGerhard J. Woeginger: An axiomatic characterization of the Hirsch-index. Mathematical Social Sciences 56(2): 224-232 (2008)
255EEAsaf 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)
254EEAsaf 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)
253EEHeather 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
252 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
251EETobias 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
250EEJiri Sgall, Gerhard J. Woeginger: An Approximation Scheme For Cake Division With A Linear Number Of Cuts. Combinatorica 27(2): 205-211 (2007)
249EEHajo 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)
248EEJacek 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)
247EEGerhard J. Woeginger, Jiri Sgall: On the complexity of cake cutting. Discrete Optimization 4(2): 213-220 (2007)
246EEArianna 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)
245EEUlrich Blasum, Winfried Hochstättler, Peter Oertel, Gerhard J. Woeginger: Steiner diagrams and k-star hubs. J. Discrete Algorithms 5(3): 622-634 (2007)
244EEHajo 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)
243EEWalter Kern, Gerhard J. Woeginger: Quadratic programming and combinatorial minimum weight product problems. Math. Program. 110(3): 641-649 (2007)
242EEArjen 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)
241EEJos C. M. Baeten, Jan Karel Lenstra, Gerhard J. Woeginger: Preface. Theor. Comput. Sci. 379(3): 305 (2007)
240EEKirk Pruhs, Gerhard J. Woeginger: Approximation schemes for a class of subset selection problems. Theor. Comput. Sci. 382(2): 151-156 (2007)
2006
239 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
238EEWalter Kern, Gerhard J. Woeginger: Quadratic Programming and Combinatorial Minimum Weight Product Problems. CIAC 2006: 42-49
237EELeah Epstein, Asaf Levin, Gerhard J. Woeginger: Graph Coloring with Rejection. ESA 2006: 364-375
236EEJohn van den Broek, Cor A. J. Hurkens, Gerhard J. Woeginger: Timetabling Problems at the TU Eindhoven. PATAT 2006: 210-227
235EEVladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger: Four point conditions and exponential neighborhoods for symmetric TSP. SODA 2006: 544-553
234EEHajo 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)
233EEVladimir G. Deineko, Gerhard J. Woeginger: Well-solvable instances for the partition problem. Appl. Math. Lett. 19(10): 1053-1056 (2006)
232EEGerhard F. Post, Gerhard J. Woeginger: Sports tournaments, home-away assignments, and the break minimization problem. Discrete Optimization 3(2): 165-173 (2006)
231EEJohn 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)
230EETobias 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)
229EEVladimir G. Deineko, Gerhard J. Woeginger: On the dimension of simple monotonic games. European Journal of Operational Research 170(1): 315-318 (2006)
228EEGerhard J. Woeginger: A Note on Fair Division under Interval Uncertainty. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 14(6): 753-756 (2006)
227EEAsaf Levin, Gerhard J. Woeginger: The constrained minimum weighted sum of job completion times problem. Math. Program. 108(1): 115-126 (2006)
226EEVladimir 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)
225EET. 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)
224EEVladimir 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)
223EEVladimir 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
222EEAttila Kuba, Gerhard J. Woeginger: Two Remarks on Reconstructing Binary Vectors from Their Absorbed Projections. DGCI 2005: 148-152
221EEArianna Alfieri, Steef L. van de Velde, Gerhard J. Woeginger: Roll Cutting in the Curtain Industry. ESA 2005: 283-292
220EERodney G. Downey, Martin Grohe, Gerhard J. Woeginger: 05301 Abstracts Collection - Exact Algorithms and Fixed-Parameter Tractability. Exact Algorithms and Fixed-Parameter Tractability 2005
219EERodney G. Downey, Martin Grohe, Gerhard J. Woeginger: 05301 Summary - Exact Algorithms and Fixed-Parameter Tractability. Exact Algorithms and Fixed-Parameter Tractability 2005
218EETomás Ebenlendr, John Noga, Jiri Sgall, Gerhard J. Woeginger: A Note on Semi-online Machine Covering. WAOA 2005: 110-118
217EEHadas Shachnai, Tami Tamir, Gerhard J. Woeginger: Minimizing Makespan and Preemption Costs on a System of Uniform Machines. Algorithmica 42(3-4): 309-334 (2005)
216EEDavaatseren 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)
215EEGerhard J. Woeginger: A comment on scheduling two parallel machines with capacity constraints. Discrete Optimization 2(3): 269-272 (2005)
214EEMark Cieliebak, Stephan Eidenbenz, Gerhard J. Woeginger: Complexity and Approximability of Double Digest. J. Bioinformatics and Computational Biology 3(2): 207-224 (2005)
213EESteven S. Seiden, Gerhard J. Woeginger: The two-dimensional cutting stock problem revisited. Math. Program. 102(3): 519-530 (2005)
212EEGerhard J. Woeginger: Combinatorial approximation algorithms: a comparative review. Oper. Res. Lett. 33(2): 210-215 (2005)
211EESatyaveer 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)
210EEFrits C. R. Spieksma, Gerhard J. Woeginger: The no-wait flow-shop paradox. Oper. Res. Lett. 33(6): 603-608 (2005)
209EEJaroslav Nesetril, Gerhard J. Woeginger: Graph colorings. Theor. Comput. Sci. 349(1): 1 (2005)
2004
208EESamir Khuller, Yoo Ah Kim, Gerhard J. Woeginger: Approximation Schemes for Broadcasting in Heterogenous Networks. APPROX-RANDOM 2004: 163-170
207EEVladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger: The Traveling Salesman Problem with Few Inner Points. COCOON 2004: 268-277
206EEAsaf Levin, Gerhard J. Woeginger: The Constrained Minimum Weighted Sum of Job Completion Times Problem. IPCO 2004: 298-307
205EEGerhard J. Woeginger: Space and Time Complexity of Exact Algorithms: Some Open Problems (Invited Talk). IWPEC 2004: 281-290
204EEKirk Pruhs, Gerhard J. Woeginger: Approximation Schemes for a Class of Subset Selection Problems. LATIN 2004: 203-211
203EEHajo Broersma, Fedor V. Fomin, Gerhard J. Woeginger: Parallel Knock-Out Schemes in Networks. MFCS 2004: 204-214
202EEKirk Pruhs, Patchrawat Uthaisombut, Gerhard J. Woeginger: Getting the Best Response for Your Erg. SWAT 2004: 14-25
201EEHajo 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
200EEFedor V. Fomin, Dieter Kratsch, Gerhard J. Woeginger: Exact (Exponential) Algorithms for the Dominating Set Problem. WG 2004: 245-256
199EEAlexander Grigoriev, Gerhard J. Woeginger: Project scheduling with irregular costs: complexity, approximability, and algorithms. Acta Inf. 41(2-3): 83-97 (2004)
198EEYossi Azar, Leah Epstein, Yossi Richter, Gerhard J. Woeginger: All-norm approximation algorithms. J. Algorithms 52(2): 120-133 (2004)
197EEBettina Klinz, Gerhard J. Woeginger: Minimum-cost dynamic flows: The series-parallel case. Networks 43(3): 153-162 (2004)
196EECor A. J. Hurkens, Gerhard J. Woeginger: On the nearest neighbor rule for the traveling salesman problem. Oper. Res. Lett. 32(1): 1-4 (2004)
195EEGerhard J. Woeginger: Inapproximability results for no-wait job shop scheduling. Oper. Res. Lett. 32(4): 320-325 (2004)
194EEDaniel 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)
193EEGerhard J. Woeginger: Seventeen lines and one-hundred-and-one points. Theor. Comput. Sci. 321(2-3): 415-421 (2004)
2003
192 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
191EEMark Cieliebak, Stephan Eidenbenz, Gerhard J. Woeginger: Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data. COCOON 2003: 519-527
190EEJiri Sgall, Gerhard J. Woeginger: A Lower Bound for Cake Cutting. ESA 2003: 459-469
189EEGerhard J. Woeginger: Seventeen Lines and One-Hundred-and-One Points. ESA 2003: 527-531
188EEPaul S. Bonsma, Tobias Brüggemann, Gerhard J. Woeginger: A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves. MFCS 2003: 259-268
187EEHajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger: Backbone Colorings for Networks. WG 2003: 131-142
186EEAsaf Levin, Daniël Paulusma, Gerhard J. Woeginger: The Complexity of Graph Contractions. WG 2003: 322-333
185EEPiotr Rudnicki, Gerhard J. Woeginger: The post correspondence problem over a unary alphabet. Appl. Math. Lett. 16(5): 723-727 (2003)
184 Rudi Pendavingh, Petra Schuurman, Gerhard J. Woeginger: Recognizing DNA graphs is difficult. Discrete Applied Mathematics 127(1): 85-94 (2003)
183EEVladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger: Which matrices are immune against the transportation paradox? Discrete Applied Mathematics 130(3): 495-501 (2003)
182EEGerhard J. Woeginger: On the approximability of average completion time scheduling under precedence constraints. Discrete Applied Mathematics 131(1): 237-252 (2003)
181EEHajo Broersma, Ulrich Faigle, Johann Hurink, Stefan Pickl, Gerhard J. Woeginger: Preface: Volume 13. Electronic Notes in Discrete Mathematics 13: 128 (2003)
180EEVladimir G. Deineko, Gerhard J. Woeginger: Complexity and approximability results for slicing floorplan designs. European Journal of Operational Research 149(3): 533-539 (2003)
179EEJoep 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)
178EEAxel 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)
177EESá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)
176EEAlexander 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)
175EETobias 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)
174EEMarjan 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)
173 Marek Chrobak, Peter Couperus, Christoph Dürr, Gerhard J. Woeginger: On tiling under tomographic constraints. Theor. Comput. Sci. 290(3): 2125-2136 (2003)
2002
172EEHans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger: Radio Labeling with Pre-assigned Frequencies. ESA 2002: 211-222
171EEHadas Shachnai, Tami Tamir, Gerhard J. Woeginger: Minimizing Makespan and Preemption Costs on a System of Uniform Machines. ESA 2002: 859-871
170EEGerhard J. Woeginger: An Approximation Scheme for Cake Division with a Linear Number of Cuts. ESA 2002: 896-901
169EEAlexander Grigoriev, Gerhard J. Woeginger: Project Scheduling with Irregular Costs: Complexity, Approximability, and Algorithms. ISAAC 2002: 381-390
168EESven 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
167EEGiovanni Rinaldi, Ulrich Voigt, Gerhard J. Woeginger: The mathematics of playing golf. SODA 2002: 265-266
166EEHajo 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
165EEYossi Azar, Leah Epstein, Yossi Richter, Gerhard J. Woeginger: All-Norm Approximation Algorithms. SWAT 2002: 288-297
164EEJacek Blazewicz, Piotr Formanowicz, Marta Kasprzak, Petra Schuurman, Gerhard J. Woeginger: DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem. WG 2002: 13-24
163EEHajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger: More about Subcolorings. WG 2002: 68-79
162EEPetra Schuurman, Gerhard J. Woeginger: A PTAS for single machine scheduling with controllable processing times. Acta Cybern. 15(3): 369-378 (2002)
161EEBala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger: Caching for Web Searching. Algorithmica 33(3): 353-370 (2002)
160EEGeorge A. Constantinides, Gerhard J. Woeginger: The complexity of multiple wordlength assignment. Appl. Math. Lett. 15(2): 137-140 (2002)
159 Gerhard J. Woeginger: Open problems in the theory of scheduling. Bulletin of the EATCS 76: 67-83 (2002)
158EEAlexander 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)
157EEHan Hoogeveen, Gerhard J. Woeginger: Some Comments on Sequencing with Controllable Processing Times. Computing 68(2): 181-192 (2002)
156EEHajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger: More About Subcolorings. Computing 69(3): 187-203 (2002)
155EEJohn 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)
154EERenaud 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)
153EEJános Csirik, Gerhard J. Woeginger: Resource augmentation for online bounded space bin packing. J. Algorithms 44(2): 308-320 (2002)
152EEGerhard J. Woeginger: An efficient algorithm for a class of constraint satisfaction problems. Oper. Res. Lett. 30(1): 9-16 (2002)
151EEDavid J. Rader Jr., Gerhard J. Woeginger: The quadratic 0-1 knapsack problem with series-parallel support. Oper. Res. Lett. 30(3): 159-166 (2002)
150EEGerhard J. Woeginger: Embeddings of planar graphs that minimize the number of long-face cycles. Oper. Res. Lett. 30(3): 167-168 (2002)
149EELeah 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)
148 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)
147 Yossi Azar, Oded Regev, Jiri Sgall, Gerhard J. Woeginger: Off-line temporary tasks assignment. Theor. Comput. Sci. 287(2): 419-428 (2002)
2001
146EEGerhard J. Woeginger: Exact Algorithms for NP-Hard Problems: A Survey. Combinatorial Optimization 2001: 185-208
145EERenaud Lepère, Denis Trystram, Gerhard J. Woeginger: Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints. ESA 2001: 146-157
144EEJános Csirik, Csanád Imreh, John Noga, Steven S. Seiden, Gerhard J. Woeginger: Buying a Constant Competitive Ratio for Paging. ESA 2001: 98-108
143EEMarek 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
142EEGerhard J. Woeginger: On the Approximability of Average Completion Time Scheduling under Precedence Constraints. ICALP 2001: 887-897
141EEGerhard J. Woeginger: Assigning chain-like tasks to a chain-like network. SODA 2001: 765-766
140EEDaniel Král, Jan Kratochvíl, Zsolt Tuza, Gerhard J. Woeginger: Complexity of Coloring Graphs without Forbidden Induced Subgraphs. WG 2001: 254-262
139EERudi Pendavingh, Petra Schuurman, Gerhard J. Woeginger: De Bruijn Graphs and DNA Graphs. WG 2001: 296-305
138EEGerhard J. Woeginger, Jiri Sgall: The complexity of coloring graphs without long induced paths. Acta Cybern. 15(1): 107- (2001)
137EEMarek Chrobak, Peter Couperus, Christoph Dürr, Gerhard J. Woeginger: A Note on Tiling under Tomographic Constraints CoRR cs.CC/0108010: (2001)
136 Gerhard J. Woeginger: A note on the depth function of combinatorial optimization problems. Discrete Applied Mathematics 108(3): 325-328 (2001)
135 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)
134EEGerhard J. Woeginger: When does a dynamic programming formulation guarantee the existence of an FPTAS? Electronic Colloquium on Computational Complexity (ECCC)(084): (2001)
133EEGerhard J. Woeginger: Resource augmentation for online bounded space bin packing Electronic Colloquium on Computational Complexity (ECCC)(085): (2001)
132EEHan Hoogeveen, Petra Schuurman, Gerhard J. Woeginger: Non-Approximability Results for Scheduling Problems with Minsum Criteria. INFORMS Journal on Computing 13(2): 157-168 (2001)
131EEGerhard J. Woeginger: The reconstruction of polyominoes from their orthogonal projections. Inf. Process. Lett. 77(5-6): 225-229 (2001)
130EEVladimir G. Deineko, Gerhard J. Woeginger: A comment on consecutive-2-out-of-n systems. Oper. Res. Lett. 28(4): 169-171 (2001)
129EEMoshe 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)
128EEVladimir G. Deineko, Gerhard J. Woeginger: Hardness of approximation of the discrete time-cost tradeoff problem. Oper. Res. Lett. 29(5): 207-210 (2001)
127EEHan Hoogeveen, Gerhard J. Woeginger: A very difficult scheduling problem with communication delays. Oper. Res. Lett. 29(5): 241-245 (2001)
2000
126EEHan Hoogeveen, Martin Skutella, Gerhard J. Woeginger: Preemptive Scheduling with Rejection. ESA 2000: 268-277
125 Maxim Sviridenko, Gerhard J. Woeginger: Approximability and in-approximability results for no-wait shop scheduling. FOCS 2000: 116-125
124EEJános Csirik, Gerhard J. Woeginger: Resource Augmentation for Online Bounded Space Bin Packing. ICALP 2000: 296-304
123EEPetra Schuurman, Gerhard J. Woeginger: Scheduling a pipelined operator graph. SODA 2000: 207-212
122EEBala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger: Caching for Web Searching. SWAT 2000: 150-163
121EELuitpold Babel, Gerhard J. Woeginger: Pseudo-Hamiltonian Graphs. Acta Cybern. 14(4): 553-567 (2000)
120EEGerhard J. Woeginger: Introduction. Algorithmica 28(1): 1 (2000)
119EEVladimir G. Deineko, Gerhard J. Woeginger: The Maximum Travelling Salesman Problem on Symmetric Demidenko Matrices. Discrete Applied Mathematics 99(1-3): 413-425 (2000)
118EEPeter Auer, Philip M. Long, Wolfgang Maass, Gerhard J. Woeginger: On the Complexity of Function Learning Electronic Colloquium on Computational Complexity (ECCC) 7(50): (2000)
117EEGerhard 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)
116EEMartin 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)
115EEGerhard J. Woeginger: A comment on scheduling on uniform machines under chain-type precedence constraints. Oper. Res. Lett. 26(3): 107-109 (2000)
114EEGerhard J. Woeginger: Monge strikes again: optimal placement of web proxies in the internet. Oper. Res. Lett. 27(3): 93-96 (2000)
113EEHan 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)
112EESteven S. Seiden, Jiri Sgall, Gerhard J. Woeginger: Semi-online scheduling with decreasing job sizes. Oper. Res. Lett. 27(5): 215-221 (2000)
111EEPetra 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
110 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
109EEGerhard J. Woeginger: An FPTAS for Agreeably Weighted Variance on a Single Machine. ICALP 1999: 707-716
108EELeah Epstein, John Noga, Steven S. Seiden, Jiri Sgall, Gerhard J. Woeginger: Randomized Online Scheduling on Two Uniform Machines. SODA 1999: 317-326
107EEPetra Schuurman, Gerhard J. Woeginger: Preemptive Scheduling with Job-Dependent Setup Times. SODA 1999: 759-767
106EEGerhard J. Woeginger: When Does a Dynamic Programming Formulation Guarantee the Existence of an FPTAS? SODA 1999: 820-829
105EEMartin Skutella, Gerhard J. Woeginger: A PTAS for Minimizing the Weighted Sum of Job Completion Times on Parallel Machines. STOC 1999: 400-407
104EEAmos Fiat, Gerhard J. Woeginger: On-Line Scheduling on a Single Machine: Minimizing the Total Completion Time. Acta Inf. 36(4): 287-293 (1999)
103EEGerhard J. Woeginger: Sensitivity Analysis for Knapsack Problems: Another Negative Result. Discrete Applied Mathematics 92(2-3): 247-251 (1999)
102EEGerhard J. Woeginger: An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine. INFORMS Journal on Computing 11(2): 211-216 (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)
100EERainer 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)
99EEBettina Klinz, Gerhard J. Woeginger: A note on the bottleneck graph partition problem. Networks 33(3): 189-191 (1999)
98EEDorit 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)
97EEPetra Schuurman, Gerhard J. Woeginger: Approximation algorithms for the multiprocessor open shop scheduling problem. Oper. Res. Lett. 24(4): 157-163 (1999)
96EEGerhard 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
93EEAlexander I. Barvinok, David S. Johnson, Gerhard J. Woeginger, Russell Woodroofe: The Maximum Traveling Salesman Problem Under Polyhedral Norms. IPCO 1998: 195-201
92EEHan Hoogeveen, Petra Schuurman, Gerhard J. Woeginger: Non-approximability Results for Scheduling Problems with Minsum Criteria. IPCO 1998: 353-366
91EEGü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)
89EESergey V. Sevastianov, Gerhard J. Woeginger: Makespan Minimization in Preemptive Two Machine Job Shops. Computing 60(1): 73-80 (1998)
88EEGerhard 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)
82EEVladimir G. Deineko, Gerhard J. Woeginger: A solvable case of the quadratic assignment problem. Oper. Res. Lett. 22(1): 13-17 (1998)
81EEBettina 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)
80EEGerhard J. Woeginger: A comment on a minmax location problem. Oper. Res. Lett. 23(1-2): 41-43 (1998)
79EEVladimir 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
76EELuitpold 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)
74EEThomas Tautenhahn, Gerhard J. Woeginger: Unit-Time Scheduling Problems with Time Dependent Resources. Computing 58(2): 97-112 (1997)
73EEEvangelos 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)
72EEUlrich Pferschy, David Pisinger, Gerhard J. Woeginger: Simple But Efficient Approaches for the Collapsing Knapsack Problem. Discrete Applied Mathematics 77(3): 271-280 (1997)
71EEQi 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)
70EEJános Csirik, Gerhard J. Woeginger: Shelf Algorithms for On-Line Strip Packing. Inf. Process. Lett. 63(4): 171-175 (1997)
69EEGerhard 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
67EENoga 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
66EERainer 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
65EERainer 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
61EEHans Kellerer, Thomas Tautenhahn, Gerhard J. Woeginger: Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine. STOC 1996: 418-426
60EEBettina 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)
58EEJó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)
57EERainer 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)
56EEVladimir 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
53EEVladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger: Sometimes Travelling is Easy: The Master Tour Problem. ESA 1995: 128-141
52EEBettina Klinz, Gerhard J. Woeginger: Minimum Cost Dynamic Flows: The Series-Parallel Case. IPCO 1995: 329-343
51EEEvangelos Kranakis, Danny Krizanc, Berthold Ruf, Jorge Urrutia, Gerhard J. Woeginger: VC-Dimensions for Graphs (Extended Abstract). WG 1995: 1-13
50EEKlaus Jansen, Gerhard J. Woeginger, Zhongliang Yu: UET-scheduling with chain-type precedence constraints. Computers & OR 22(9): 915-920 (1995)
49EEBettina Klinz, Rüdiger Rudolf, Gerhard J. Woeginger: Permuting Matrices to Avoid Forbidden Submatrices. Discrete Applied Mathematics 60(1-3): 223-248 (1995)
48EEBettina Klinz, Rüdiger Rudolf, Gerhard J. Woeginger: on the Recognition of Permuted Bottleneck Monge Matrices. Discrete Applied Mathematics 63(1): 43-74 (1995)
47EEGerhard J. Woeginger: Scheduling with Time-Dependent Execution Times. Inf. Process. Lett. 54(3): 155-156 (1995)
46EEJoseph 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
44EEBo Chen, André van Vliet, Gerhard J. Woeginger: An Optimal Algorithm for Preemptive On-line Scheduling. ESA 1994: 300-306
43EEUlrich 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)
41EEHans 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
37EEPeter Auer, Philip M. Long, Wolfgang Maass, Gerhard J. Woeginger: On the Complexity of Function Learning. COLT 1993: 392-401
36EEBettina 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
33EEGá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)
31EEHans Kellerer, Gerhard J. Woeginger: A Tight Bound for 3-Partitioning. Discrete Applied Mathematics 45(3): 249-259 (1993)
30EEHans Kellerer, Gerhard J. Woeginger: On the Euclidean two Paths Problem. Discrete Applied Mathematics 47(2): 165-173 (1993)
29EEFranz 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
25EEHans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger: Scheduling with Incompatible Jobs. WG 1992: 37-49
24EEGerhard 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)
22EEHans 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)
19EEWolfgang 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
6EEJános Pach, Gerhard J. Woeginger: Some New Bounds for Epsilon-Nets. Symposium on Computational Geometry 1990: 10-15
5EEJoseph 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
2EEWolfgang Gutjahr, Emo Welzl, Gerhard J. Woeginger: Polynomial Graph-Colorings. STACS 1989: 108-119
1988
1EEGerhard J. Woeginger: Epsilon-Nets for Halfplanes. WG 1988: 243-252

Coauthor Index

1Joep Aerts [179]
2J. M. van den Akker (Marjan van den Akker) [174]
3Arianna Alfieri [221] [246]
4Noga Alon [67] [77] [90]
5Eric Anderson [148]
6Peter Auer [37] [45] [118]
7Yossi Azar [77] [90] [147] [165] [198]
8Davaatseren Baatar [216]
9Luitpold Babel [76] [121]
10Jos C. M. Baeten [192] [241]
11Alexander I. Barvinok [93] [158] [176]
12József Békési [54] [58] [68]
13Ulrich Blasum [245]
14Jacek Blazewicz [164] [248]
15Hans L. Bodlaender [13] [25] [41] [172]
16Paul S. Bonsma [188]
17Axel Born [178]
18Steven J. Brams [252]
19John van den Broek [231] [236] [271]
20Hajo Broersma (H. J. Broersma) [156] [163] [166] [172] [181] [187] [201] [203] [234] [244] [249]
21Andries E. Brouwer [259]
22Tobias Brüggemann [175] [188] [230] [251]
23Fokko J. van de Bult [261]
24Rainer E. Burkard [57] [65] [66] [71] [78] [85] [86] [100] [110]
25Vasilis Capoyleas [8]
26Eranda Çela [66] [71] [85]
27Satyaveer Singh Chauhan [211]
28Bo Chen [40] [44] [87]
29T. C. Edwin Cheng [225]
30Marek Chrobak [137] [143] [148] [173]
31Mark Cieliebak [191] [214]
32George A. Constantinides [160]
33Gérard Cornuéjols [110]
34Peter Couperus [137] [173]
35János Csirik [63] [67] [70] [90] [124] [143] [144] [153]
36Péter Csorba [266]
37Andreas Darmann [274]
38Vladimir G. Deineko [53] [56] [59] [65] [79] [82] [86] [119] [128] [130] [180] [183] [207] [223] [224] [226] [229] [233] [235] [268] [273]
39Rodney G. Downey (Rod Downey) [219] [220] [239]
40Christoph Dürr [137] [173]
41Tomás Ebenlendr [218]
42Christian Eggermont [267]
43Matthias Ehrgott [216]
44Stephan Eidenbenz [191] [214]
45David Eppstein [20]
46Leah Epstein [90] [108] [149] [165] [198] [237]
47Anton V. Eremeev [211]
48Andreas T. Ernst [272]
49Ulrich Faigle [181]
50Sándor P. Fekete [75] [158] [176] [177]
51Karin Feldbacher [100]
52Amos Fiat [62] [64] [94] [104]
53Herbert Fleischner [17]
54Fedor V. Fomin [156] [163] [166] [172] [187] [200] [203] [234] [244] [249]
55Michael Formann [4] [7] [27]
56Piotr Formanowicz [164] [248]
57Gábor Galambos [28] [33] [54] [58] [68]
58Elisabeth Gassner [265]
59Petr A. Golovach [187] [244]
60Alexander Grigoriev [169] [199]
61Martin Grohe [219] [220] [239]
62Wolfgang Gutjahr [2] [19]
63Torben Hagerup [7] [27]
64Horst W. Hamacher [216] [272]
65James Haralambides [7] [27]
66Johannes Hatzl [265]
67Yong He [225]
68Dorit S. Hochbaum [98]
69Winfried Hochstättler [245]
70Pim van 't Hof [275]
71Michael Hoffmann [207] [226]
72Han Hoogeveen (J. A. Hoogeveen) [92] [113] [126] [127] [132] [157] [174] [225]
73Heather Hulett [253]
74Johann Hurink [181] [230] [251]
75Cor A. J. Hurkens [178] [196] [231] [236] [260] [266] [267] [271]
76Csanád Imreh [143] [144]
77Klaus Jansen [11] [12] [13] [25] [32] [35] [41] [50]
78Min Ji [225]
79Long Jia [129]
80Houyuan Jiang [272]
81David S. Johnson [93] [158] [176]
82Bala Kalyanasundaram [122] [161]
83Marta Kasprzak [164] [248]
84Michael Kaufmann [7] [27]
85Hans Kellerer [22] [30] [31] [33] [34] [61] [95]
86Walter Kern [238] [243]
87Samir Khuller [208]
88Yoo-Ah Kim (Yoo Ah Kim) [208]
89Bettina Klinz [36] [48] [49] [52] [55] [60] [81] [99] [100] [101] [183] [197] [223] [235] [268] [273]
90János Komlós [21]
91Jan H. M. Korst [179]
92Daniel Král [140] [194]
93Rastislav Kralovic [249]
94Evangelos Kranakis [51] [73]
95Jan Kratochvíl [140] [166] [234]
96Dieter Kratsch [200]
97Mohan Krishnamoorthy [272]
98Danny Krizanc [51] [73]
99Sven Oliver Krumke [168] [265]
100Attila Kuba [222]
101Frank Thomson Leighton (Tom Leighton) [7] [27]
102Jan Karel Lenstra [192] [241]
103Renaud Lepère [145] [154]
104Asaf Levin [186] [206] [227] [237] [254] [255]
105Maarten Lipmann [168]
106Philip M. Long [37] [45] [118]
107Wolfgang Maass [37] [45] [118]
108Vladan Majerech [194]
109Joseph S. B. Mitchell [5] [23] [46]
110Maciej Modelski [267]
111Jérôme Monnot [175]
112Timothy D. Neame [129]
113Jaroslav Nesetril (Jarik Nesetril) [156] [163] [209]
114John Noga [108] [122] [143] [144] [148] [149] [155] [161] [218]
115Peter Oertel [245]
116Yoshio Okamoto [207] [226]
117Mark H. Overmars [20]
118János Pach [6] [21]
119Willem de Paepe [168]
120Joachim Parrow [192]
121Daniël Paulusma [186] [201] [254] [255] [275]
122Rudi Pendavingh [139] [184] [260] [263]
123Ulrich Pferschy [39] [43] [54] [58] [68] [72] [274]
124Stefan Pickl (Stefan Wolfgang Pickl) [181]
125David Pisinger [72]
126Diana Poensgen [168]
127Gerhard F. Post [232] [259]
128Chris N. Potts [113]
129Kirk Pruhs [122] [161] [202] [204] [240] [252] [264]
130Quintijn Puite [263]
131Artem V. Pyatkin [172]
132David J. Rader Jr. [151]
133Jörg Rambau [168]
134Oded Regev [147]
135Franz Rendl [29] [34]
136Yossi Richter [165] [198]
137Giovanni Rinaldi [167]
138Anna A. Romanova [211]
139Günter Rote [5] [8] [10] [18] [20] [23] [46] [66] [85] [91]
140Piotr Rudnicki [185]
141Rüdiger Rudolf [36] [39] [48] [49] [53] [57] [59] [79]
142Berthold Ruf [51] [73]
143Joachim Schauer [274]
144Petra Scheffler [12] [35]
145Petra Schuurman [92] [97] [107] [111] [123] [132] [139] [162] [164] [184] [248]
146Steven S. Seiden [108] [112] [144] [155] [213]
147Vladimir V. Servakh [211]
148Sergey V. Sevastianov [67] [84] [89] [90] [135]
149Jiri Sgall [108] [112] [138] [143] [147] [148] [190] [194] [218] [247] [250]
150Hadas Shachnai [171] [217]
151Martin Skutella [105] [116] [126] [177]
152Gerard J. M. Smit [201]
153Heike Sperber [265]
154Frits C. R. Spieksma [179] [210]
155Leen Stougie [168]
156Gopalakrishnan Sundaram [46]
157Maxim Sviridenko [125]
158Antonios Symvonis [7] [27]
159Arie Tamir [158] [176]
160Tami Tamir [171] [217]
161Thomas Tautenhahn [61] [74] [95]
162Tomás Tichý [194]
163Denis Trystram [145] [154]
164Zsolt Tuza [140]
165Jorge Urrutia [51] [73]
166Patchrawat Uthaisombut [202] [264]
167Jack A. A. van der Veen [83]
168Steef L. van de Velde [221] [246]
169Wim F. J. Verhaegh [179]
170Arjen P. A. Vestjens [67] [87] [90] [242]
171Frank Vlaardingerbroek [201]
172André van Vliet [40] [44]
173Ulrich Voigt [167]
174Tjark Vredeveld [230] [251]
175Zhengyan Wang [10]
176Emo Welzl [2] [7] [19] [27]
177Marc Wennink [242]
178Todd G. Will [253]
179Russell Woodroofe [93] [158] [176]
180Tal Yadid [77]
181Qi Fan Yang [71]
182En-Yu Yao [43]
183Zhongliang Yu [16] [50]
184Guochuan Zhang [96]
185Shuzhong Zhang [83]
186Binhai Zhu [10]
187Moshe Zukerman [129]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)