Travelled to:1 × Czech Republic
1 × Denmark
1 × Greece
2 × Switzerland
2 × USA
Collaborated with:∅ J.Csirik M.Skutella H.Kellerer T.Tautenhahn D.Hermelin M.Mnich E.J.v.Leeuwen M.Chrobak C.Imreh J.Noga J.Sgall R.v.Bevern R.Bredereck L.Bulteau J.Chen V.Froese R.Niedermeier
Talks about:machin (3) minim (3) time (3) approxim (2) schedul (2) complet (2) weight (2) singl (2) star (2) multiprocessor (1)
Person: Gerhard J. Woeginger
DBLP: Woeginger:Gerhard_J=
Facilitated 1 volumes:
EdContributed to:
20142011200120001999
19991996Wrote 8 papers:
- ICALP-v1-2014-BevernBBCFNW #graph
- Star Partitions of Perfect Graphs (RvB, RB, LB, JC, VF, RN, GJW), pp. 174–185.
- ICALP-v1-2011-HermelinMLW
- Domination When the Stars Are Out (DH, MM, EJvL, GJW), pp. 462–473.
- ICALP-2001-ChrobakCINSW #multi #problem #scheduling
- The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts (MC, JC, CI, JN, JS, GJW), pp. 862–874.
- ICALP-2001-Woeginger #constraints #on the #precedence #scheduling
- On the Approximability of Average Completion Time Scheduling under Precedence Constraints (GJW), pp. 887–897.
- ICALP-2000-CsirikW #bound #online
- Resource Augmentation for Online Bounded Space Bin Packing (JC, GJW), pp. 296–304.
- ICALP-1999-Woeginger
- An FPTAS for Agreeably Weighted Variance on a Single Machine (GJW), pp. 707–716.
- STOC-1999-SkutellaW #parallel
- A PTAS for Minimizing the Weighted Sum of Job Completion Times on Parallel Machines (MS, GJW), pp. 400–407.
- STOC-1996-KellererTW
- Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine (HK, TT, GJW), pp. 418–426.