( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Filling and slotting: analysis and algorithms.

, , , , и . ISPD, стр. 95-102. ACM, (1998)

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.

Alexander

Alexander Auch

A phylogenetic potpourri: computational methods for analysing genome scale data. Uni Tübingen, (2010)

Alexander Stadler

Messtechnische Bestimmung und Simulation der Kernverluste in weichmagnetischen Materialien. Uni Erlangen-Nürnberg, (2009)

Alexander Gocht

Methods in economic farm modelling. Uni Bonn, (2009)

Alexander Blecken

A reference task model for supply chain processes of humanitarian organisations. Uni Paderborn, (2009)
 

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

The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout., , , и . WADS, том 1663 из Lecture Notes in Computer Science, стр. 25-36. Springer, (1999)Engineering a scalable placement heuristic for DNA probe arrays., , , , и . RECOMB, стр. 148-156. ACM, (2003)Practical Approximation Algorithms for Separable Packing Linear Programs., , , , и . WADS, том 2125 из Lecture Notes in Computer Science, стр. 325-337. Springer, (2001)Improved Steiner tree approximation in graphs., и . SODA, стр. 770-779. ACM/SIAM, (2000)An approximation algorithm for weighted itk-polymatroids and the Steiner tree problem in graphs.. IPCO, стр. 89-98. CIACO, (1993)The moving-target traveling salesman problem., , и . J. Algorithms, 49 (1): 153-174 (2003)Bottleneck Steiner Tree Problems.. Encyclopedia of Optimization, Springer, (2009)Genotype Tagging with Limited Overfitting., и . BSB, том 5676 из Lecture Notes in Computer Science, стр. 1-12. Springer, (2009)Design and Validation of Methods Searching for Risk Factors in Genotype Case-Control Studies., и . J. Comput. Biol., 15 (1): 81-90 (2008)Tighter Bounds for Graph Steiner Tree Approximation., и . SIAM J. Discret. Math., 19 (1): 122-134 (2005)