( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Scheduling a pipelined operator graph.

, и . SODA, стр. 207-212. ACM/SIAM, (2000)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Heinrich Petram

Matthias Petran

Oskar Peter Petrasch

Fontina Petrakopoulou

Pantelis Petrakakis

 

Другие публикации лиц с тем же именем

Performance Guarantees of Local Search for Multiprocessor Scheduling., и . IPCO, том 2081 из Lecture Notes in Computer Science, стр. 370-382. Springer, (2001)Scheduling a pipelined operator graph., и . SODA, стр. 207-212. ACM/SIAM, (2000)Performance guarantees of jump neighborhoods on restricted related parallel machines., , , и . Oper. Res. Lett., 40 (4): 287-291 (2012)Preemptive Scheduling with Job-Dependent Setup Times., и . SODA, стр. 759-767. ACM/SIAM, (1999)De Bruijn Graphs and DNA Graphs., , и . WG, том 2204 из Lecture Notes in Computer Science, стр. 296-305. Springer, (2001)Non-approximability Results for Scheduling Problems with Minsum Criteria., , и . IPCO, том 1412 из Lecture Notes in Computer Science, стр. 353-366. Springer, (1998)Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling., , , и . LATIN, том 6034 из Lecture Notes in Computer Science, стр. 108-119. Springer, (2010)Recognizing DNA graphs is difficult., , и . Discret. Appl. Math., 127 (1): 85-94 (2003)DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem., , , , и . WG, том 2573 из Lecture Notes in Computer Science, стр. 13-24. Springer, (2002)A polynomial time equivalence between DNA sequencing and the exact perfect matching problem., , , , и . Discret. Optim., 4 (2): 154-162 (2007)