The SCEAS System
| |||||||

## Search the dblp DataBase
Petra Schuurman:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Han Hoogeveen, Petra Schuurman, Gerhard J. Woeginger
**Non-approximability Results for Scheduling Problems with Minsum Criteria.**[Citation Graph (0, 0)][DBLP] IPCO, 1998, pp:353-366 [Conf] - Petra Schuurman, Tjark Vredeveld
**Performance Guarantees of Local Search for Multiprocessor Scheduling.**[Citation Graph (0, 0)][DBLP] IPCO, 2001, pp:370-382 [Conf] - Petra Schuurman, Gerhard J. Woeginger
**Scheduling a pipelined operator graph.**[Citation Graph (0, 0)][DBLP] SODA, 2000, pp:207-212 [Conf] - Petra Schuurman, Gerhard J. Woeginger
**Preemptive Scheduling with Job-Dependent Setup Times.**[Citation Graph (0, 0)][DBLP] SODA, 1999, pp:759-767 [Conf] - Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak, Petra Schuurman, Gerhard J. Woeginger
**DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem.**[Citation Graph (0, 0)][DBLP] WG, 2002, pp:13-24 [Conf] - Rudi Pendavingh, Petra Schuurman, Gerhard J. Woeginger
**De Bruijn Graphs and DNA Graphs.**[Citation Graph (0, 0)][DBLP] WG, 2001, pp:296-305 [Conf] - Petra Schuurman, Gerhard J. Woeginger
**A PTAS for single machine scheduling with controllable processing times.**[Citation Graph (0, 0)][DBLP] Acta Cybern., 2002, v:15, n:3, pp:369-378 [Journal] - Rudi Pendavingh, Petra Schuurman, Gerhard J. Woeginger
**Recognizing DNA graphs is difficult.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:127, n:1, pp:85-94 [Journal] - Han Hoogeveen, Petra Schuurman, Gerhard J. Woeginger
**Non-Approximability Results for Scheduling Problems with Minsum Criteria.**[Citation Graph (0, 0)][DBLP] INFORMS Journal on Computing, 2001, v:13, n:2, pp:157-168 [Journal] - Petra Schuurman
**A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 1998, v:23, n:1-2, pp:9-11 [Journal] - Petra Schuurman, Gerhard J. Woeginger
**Approximation algorithms for the multiprocessor open shop scheduling problem.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 1999, v:24, n:4, pp:157-163 [Journal] - Petra Schuurman, Gerhard J. Woeginger
**A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2000, v:237, n:1-2, pp:105-122 [Journal] **Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling.**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |