 | 2007 |
|---|
| 14 |       | Jacek 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) |
| 13 | | Petra Schuurman,
Tjark Vredeveld:
Performance Guarantees of Local Search for Multiprocessor Scheduling.
INFORMS Journal on Computing 19(1): 52-63 (2007) |
| 2003 |
|---|
| 12 |  | Rudi Pendavingh,
Petra Schuurman,
Gerhard J. Woeginger:
Recognizing DNA graphs is difficult.
Discrete Applied Mathematics 127(1): 85-94 (2003) |
| 2002 |
|---|
| 11 | | Jacek Blazewicz,
Piotr Formanowicz,
Marta Kasprzak,
Petra Schuurman,
Gerhard J. Woeginger:
DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem.
WG 2002: 13-24 |
| 10 | | Petra Schuurman,
Gerhard J. Woeginger:
A PTAS for single machine scheduling with controllable processing times.
Acta Cybern. 15(3): 369-378 (2002) |
| 2001 |
|---|
| 9 | | Petra Schuurman,
Tjark Vredeveld:
Performance Guarantees of Local Search for Multiprocessor Scheduling.
IPCO 2001: 370-382 |
| 8 | | Rudi Pendavingh,
Petra Schuurman,
Gerhard J. Woeginger:
De Bruijn Graphs and DNA Graphs.
WG 2001: 296-305 |
| 7 | | Han Hoogeveen,
Petra Schuurman,
Gerhard J. Woeginger:
Non-Approximability Results for Scheduling Problems with Minsum Criteria.
INFORMS Journal on Computing 13(2): 157-168 (2001) |
| 2000 |
|---|
| 6 | | Petra Schuurman,
Gerhard J. Woeginger:
Scheduling a pipelined operator graph.
SODA 2000: 207-212 |
| 5 | | Petra 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 |
|---|
| 4 | | Petra Schuurman,
Gerhard J. Woeginger:
Preemptive Scheduling with Job-Dependent Setup Times.
SODA 1999: 759-767 |
| 3 | | Petra Schuurman,
Gerhard J. Woeginger:
Approximation algorithms for the multiprocessor open shop scheduling problem.
Oper. Res. Lett. 24(4): 157-163 (1999) |
| 1998 |
|---|
| 2 | | Han Hoogeveen,
Petra Schuurman,
Gerhard J. Woeginger:
Non-approximability Results for Scheduling Problems with Minsum Criteria.
IPCO 1998: 353-366 |
| 1 | | Petra Schuurman:
A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays.
Oper. Res. Lett. 23(1-2): 9-11 (1998) |
