( en | de | ru )

 

Disambiguation of "Zelikovsky, Alexander"

Author of the publication

copydeleteadd this publication to your clipboard
Genotype Tagging with Limited Overfitting.

, and . BSB, volume 5676 of Lecture Notes in Computer Science, page 1-12. Springer, (2009)

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. You can also use the button next to the name to display some publications already assigned to the person.

Alexander

Alexander Stadler

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

Alexander Auch

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

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)
 

Other publications of authors with the same name

An approximation algorithm for weighted itk-polymatroids and the Steiner tree problem in graphs.. IPCO, page 89-98. CIACO, (1993)2SNP: Scalable Phasing Method for Trios and Unrelated Individuals, and . IEEE/ACM Transactions on Computational Biology and Bioinformatics, 5 (2): 313-318 (2008)Genotype Tagging with Limited Overfitting., and . BSB, volume 5676 of Lecture Notes in Computer Science, page 1-12. Springer, (2009)Improved Steiner tree approximation in graphs., and . SODA, page 770-779. ACM/SIAM, (2000)A Factor 3/2 Approximation for Generalized Steiner Tree Problem with Distances One and Two, , and . CoRR, (2008)Engineering a scalable placement heuristic for DNA probe arrays., , , , and . RECOMB, page 148-156. ACM, (2003)A New Approximation Algorithm for Finding Heavy Planar Subgraphs., , , and . Algorithmica, 36 (2): 179-205 (2003)The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout., , , and . WADS, volume 1663 of Lecture Notes in Computer Science, page 25-36. Springer, (1999)Practical Approximation Algorithms for Separable Packing Linear Programs., , , , and . WADS, volume 2125 of Lecture Notes in Computer Science, page 325-337. Springer, (2001)Optimal phase conflict removal for layout of dark field alternating phase shifting masks., , , , and . ISPD, page 121-126. ACM, (1999)