Szerző: " Woeginger Gerhard J."

Vissza
Export [RSS feed] RSS 1.0 [RSS2 feed] RSS 2.0
csoportosítás: Mű típusa | csoportosítás nélkül
Találatok száma: 9.

Eggermont Christian; Hurkens Cor; Woeginger Gerhard J.: Realizing small tournaments through few permutations. In: Acta cybernetica, (21) 2. pp. 267-271. (2013)

Woeginger Gerhard J.: An algorithmic comparison of three scientific impact indices. In: Acta cybernetica, (19) 3. pp. 661-672. (2010)

Schuur Petra; Woeginger Gerhard J.: A PTAS for single machine scheduling with controllable processing times. In: Acta cybernetica, (15) 3. pp. 369-378. (2002)

Woeginger Gerhard J.; Sgall Jiří: The complexity of coloring graphs without long induced paths. In: Acta cybernetica, (15) 1. pp. 107-117. (2001)

Babel Luitpold; Woeginger Gerhard J.: Pseudo-hamiltonian graphs. In: Acta cybernetica, (14) 4. pp. 553-567. (2000)

Rote Günter; Woeginger Gerhard J.: Minimizing the number of tardy jobs on a single machine with batch setup times. In: Acta cybernetica, (13) 4. pp. 423-429. (1998)

Pferschy Ulrich; Woeginger Gerhard J.; Yao En-Yu: Partitioning graphs into two trees. In: Acta cybernetica, (11) 3. pp. 233-240. (1994)

Galambos Gábor; Kellerer Hans; Woeginger Gerhard J.: A lower bound for on-line vector-packing algorithms. In: Acta cybernetica, (11) 1-2. pp. 23-34. (1993)

Woeginger Gerhard J.: Computing maximum valued regions. In: Acta cybernetica, (10) 4. pp. 303-315. (1992)

A lista elkészítésének dátuma 2024. március 28. 21:06:12 CET.