( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
An approximation algorithm for weighted itk-polymatroids and the Steiner tree problem in graphs.

. IPCO, стр. 89-98. CIACO, (1993)

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 Blecken

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

Alexander Gocht

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

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

Genotype Tagging with Limited Overfitting., и . BSB, том 5676 из Lecture Notes in Computer Science, стр. 1-12. Springer, (2009)A Factor 3/2 Approximation for Generalized Steiner Tree Problem with Distances One and Two, , и . CoRR, (2008)A New Approximation Algorithm for Finding Heavy Planar Subgraphs., , , и . Algorithmica, 36 (2): 179-205 (2003)ACM-BCB 2018 Computational Advances in Molecular Epidemiology (CAME) Chairs' Welcome., , , и . BCB, стр. 574. ACM, (2018)2SNP: Scalable Phasing Method for Trios and Unrelated Individuals., и . IEEE ACM Trans. Comput. Biol. Bioinform., 5 (2): 313-318 (2008)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)Practical Approximation Algorithms for Separable Packing Linear Programs., , , , и . WADS, том 2125 из Lecture Notes in Computer Science, стр. 325-337. Springer, (2001)Engineering a scalable placement heuristic for DNA probe arrays., , , , и . RECOMB, стр. 148-156. ACM, (2003)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)