( en | de | ru )

 

Disambiguation of "Zelikovsky, Alexander"

Author of the publication

copydeleteadd this publication to your clipboard
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)

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 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)
 

Other publications of authors with the same name

Design and Validation of Methods Searching for Risk Factors in Genotype Case-Control Studies., and . J. Comput. Biol., 15 (1): 81-90 (2008)Tighter Bounds for Graph Steiner Tree Approximation., and . SIAM J. Discret. Math., 19 (1): 122-134 (2005)Computer-Aided Optimization of DNA Array Design and Manufacturing., , , , and . IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 25 (2): 305-320 (2006)ACM-BCB 2018 Computational Advances in Molecular Epidemiology (CAME) Chairs' Welcome., , , and . BCB, page 574. ACM, (2018)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)Engineering a scalable placement heuristic for DNA probe arrays., , , , and . RECOMB, page 148-156. ACM, (2003)An approximation algorithm for weighted itk-polymatroids and the Steiner tree problem in graphs.. IPCO, page 89-98. CIACO, (1993)The moving-target traveling salesman problem., , and . J. Algorithms, 49 (1): 153-174 (2003)