Introduction von Woeginger, G.J.

Volltext

The complexity of multiple wordlength assignment von Constantinides, G.A., Woeginger, G.J.

Volltext

The approximability of three-dimensional assignment problems with bottleneck objective von Goossens, Dries, Polyakovskiy, S, Spieksma, Frederik, Woeginger, G.J

Volltext

Linear time approximation scheme for the multiprocessor open shop problem von Sevastianov, S.V., Woeginger, G.J.

Volltext

The post correspondence problem over a unary alphabet von Rudnicki, P, Woeginger, G.J

Volltext

Charlemagne's challenge: The periodic latency problem von Coene, S., Woeginger, G.J., Spieksma, F.C.R.

Volltext

The computational complexity of the κ-minimum spanning tree problem in graded matrices von Dudás, T., Klinz, B., Woeginger, G.J.

Volltext

Vehicle scheduling in two-cycle flexible manufacturing systems von Blazewicz, J., Burkard, R.E., Finke, G., Woeginger, G.J.

Volltext

The computational complexity of Steiner tree problems in graded matrices von Dudás, T., Klinz, B., Woeginger, G.J.

Volltext

Associativity of recurrence multiplication von Grabner, P.J., Pethő, A., Tichy, R.F., Woeginger, G.J.

Volltext

Approximability and in-approximability results for no-wait shop scheduling von Sviridenko, M., Woeginger, G.J.

Volltext