Woeginger, Gerhard.
Woeginger, G. J.
Woeginger, Gerhard J., 1964-2022
Woeginger, Gerhard (Gerhard J.), 1964-
Woeginger, Gerhard 1964-
Gerhard Woeginger österreichischer Mathematiker und Informatiker
Woeginger, Gerhard J.
VIAF ID: 44530468 (Personal)
Permalink: http://viaf.org/viaf/44530468
Preferred Forms
-
100 0 _ ‡a Gerhard Woeginger ‡c österreichischer Mathematiker und Informatiker
-
200 _ | ‡a Woeginger ‡b Gerhard J.
-
-
-
-
100 1 0 ‡a Woeginger, Gerhard
-
100 1 _ ‡a Woeginger, Gerhard (sparse)
-
-
100 1 _ ‡a Woeginger, Gerhard J. ‡d 1964-2022
-
100 1 _ ‡a Woeginger, Gerhard J., ‡d 1964-2022
-
100 1 _ ‡a Woeginger, Gerhard ‡d 1964-
-
-
4xx's: Alternate Name Forms (22)
5xx's: Related Names (2)
- 510 2 _
‡a
RWTH Aachen
‡4
affi
‡4
https://d-nb.info/standards/elementset/gnd#affiliation
‡e
Affiliation
- 510 2 _
‡a
Technische Hogeschool Eindhoven
‡4
affi
‡4
https://d-nb.info/standards/elementset/gnd#affiliation
‡e
Affiliation
Works
Title | Sources |
---|---|
Algorithms--ESA '97 : 5th annual European symposium, Graz, Austria, September 15-17, 1997 : proceedings |
![]() ![]() ![]() ![]() ![]() ![]() |
Ancrage de solutions en optimisation combinatoire robuste. |
![]() |
Approximability and nonapproximability results for minimizing total flow time on a single machine |
![]() |
Approximation algorithms for the multiprocessor open shop scheduling problem |
![]() |
Computing and Software Science : State of the Art and Perspectives |
![]() |
Dispersing Obnoxious Facilities on a Graph |
![]() |
Finding minimum area k-gons |
![]() ![]() |
Geometric clusterings |
![]() |
Geometric three-dimensional assignment problems |
![]() |
Information Technology Interfaces |
![]() |
Integer programming and combinatorial optimization : 7th International IPCO Conference, Graz, Austria, June 9-11, 1999 : proceedings |
![]() ![]() ![]() ![]() |
IPEC 2012 |
![]() |
Long-chord-free and fence-free tours for the travelling salesman problem |
![]() |
New lower and upper bounds for on-line scheduling |
![]() |
Non-approximability results for scheduling problems with minsum criteria |
![]() |
A note on the complexity of the bilevel bottleneck assignment problem |
![]() |
On the reconstruction of simple polygons |
![]() |
Online algorithms : the state of the art |
![]() ![]() ![]() ![]() ![]() ![]() |
An optimal algorithm for preemtive in-line scheduling |
![]() |
Parameterized and exact computation : 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings |
![]() |
Polynomial graph colorings |
![]() |
Resource augmentation for online bounded space bin packing |
![]() |
Scheduling of pipelined operator graphs |
![]() |
Scheduling with safety distances |
![]() |
Sequencing jobs that require common resources on a single machine : a solvable case of the TSP |
![]() |
Some new bounds for epsilon-nets |
![]() |
subset sum game revisited |
![]() |
trouble with the second quantifier |
![]() |