Alexander Zelikovsky

Alexander Zelikovsky received the Ph.D. degree in computer science from the Institute of Mathematics of the Belorussian Academy of Sciences in Minsk, Belarus, in 1989, and worked at the Institute of Mathematics in Kishinev, Moldova, 1989–1995. Between 1992 and 1995, he visited Bonn University and the Institut fur Informatik in Saarbruken, Germany. Dr. Zelikovsky was a Research Scientist at the University of Virginia, in 1995–1997, and a postdoctoral scholar at the University of California at Los Angeles, 1997–1998. He is an Associate Professor in the Computer Science Department at Georgia State University, which he joined in 1999. He is the author of more than 140 refereed publications. Dr. Zelikovsky’s research interests include bioinformatics, discrete and approximation algorithms, combinatorial optimization, VLSI physical layout design, and ad hoc wireless networks. He is a founding cochair of the ACIS International Workshop on Self-Assembling Wireless Networks and the International Workshop on Bioinformatics Research and Applications. He is Program Committee Cochair of the 2007 and 2008 International Symposium on Bioinformatics Research and Applications. He also serves on the editorial board of the International Journal of Bioinformatics Research and Applications and is a Guest Editor for the LNCS Transactions on Computational Systems Biology, the IEEE Transactions on Nanobiotechnology, the IEEE/ACM Transactions on Computational Biology and Bioinformatics and the Journal of Universal Computer Science. Dr. Zelikovsky received the SIAM Outstanding Paper Prize in 2007, the best paper award at the joint Asia-South Pacific Design Automation/VLSI Design Conferences in 2003, the best poster awards at the Annual BACUS Symposium on Photomask Technology, and the Fifth Georgia Tech International Conference on Bioinformatics in 2005.

Biography Updated on 4 January 2008

Personal Home Page

http://www.cs.gsu.edu/~cscazz/

Articles in Scholarly Journals [Incomplete List]

  1. A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence
    Journal of Computational Biology, vol. 14, no. 7, pp. 927–949, 2007
  2. Fast and Efficient Bright-Field AAPSM Conflict Detection and Correction
    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 26, no. 1, pp. 115–126, 2007
  3. Enhanced Design Flow and Optimizations for Multiproject Wafers
    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 26, no. 2, pp. 301–311, 2007
  4. Informative SNP Selection Methods Based on SNP Prediction
    IEEE Transactions on Nanobioscience, vol. 6, no. 1, pp. 60–67, 2007
  5. MLR-tagging: informative SNP selection for unphased genotypes based on multiple linear regression
    Bioinformatics, vol. 22, no. 20, pp. 2558–2561, 2006
  6. Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem
    Algorithmica , vol. 42, no. 2, pp. 109–120, 2005
  7. The Polymatroid Steiner Problems
    Journal of Combinatorial Optimization, vol. 9, no. 3, pp. 281–294, 2005
  8. Power Efficient Range Assignment for Symmetric Connectivity in Static Ad Hoc Wireless Networks
    Wireless Networks, vol. 12, no. 3, pp. 287–299, 2005
  9. 2SNP: scalable phasing based on 2-SNP haplotypes
    Bioinformatics, vol. 22, no. 3, pp. 371–373, 2005
  10. Tighter Bounds for Graph Steiner Tree Approximation
    SIAM Journal on Discrete Mathematics, vol. 19, no. 1, p. 122, 2005
  11. Compressible Area Fill Synthesis
    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 24, no. 8, pp. 1169–1187, 2005
  12. Selecting Forwarding Neighbors in Wireless Ad Hoc Networks
    Mobile Networks and Applications, vol. 9, no. 2, pp. 101–111, 2004
  13. The moving-target traveling salesman problem
    Journal of Algorithms, vol. 49, no. 1, pp. 153–174, 2003
  14. A New Approximation Algorithm for Finding Heavy Planar Subgraphs
    Algorithmica, vol. 36, no. 2, pp. 179–205, 2003
  15. Minimum buffered routing with bounded capacitive load for slew rate and reliability control
    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 22, no. 3, pp. 241–253, 2003
  16. On the skew-bounded minimum-buffer routing tree problem
    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 22, no. 7, pp. 937–945, 2003
  17. Practical Approximation Algorithms for Zero- and Bounded-Skew Trees
    SIAM Journal on Discrete Mathematics, vol. 15, no. 1, p. 97, 2002
  18. Provably good global buffering by generalized multiterminal multicommodity flow approximation
    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 21, no. 3, pp. 263–274, 2002
  19. Area fill synthesis for uniform layout density
    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 21, no. 10, pp. 1132–1147, 2002
  20. Optimal phase conflict removal for layout of dark field alternating phase shifting masks
    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 19, no. 2, pp. 175–187, 2000
  21. An improved approximation scheme for the Group Steiner Problem
    Networks, vol. 37, no. 1, pp. 8–20, 2000
  22. A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points
    Information Processing Letters, vol. 75, no. 4, pp. 165–167, 2000
  23. Filling algorithms and analyses for layout density control
    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 18, no. 4, pp. 445–462, 1999
  24. On wirelength estimations for row-based placement
    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 18, no. 9, pp. 1265–1278, 1999
  25. Journal of Combinatorial Optimization, vol. 1, no. 1, pp. 47–65, 1997
  26. A series of approximation algorithms for the acyclic directed steiner tree problem
    Algorithmica, vol. 18, no. 1, pp. 99–110, 1997
  27. Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem
    Discrete & Computational Geometry, vol. 18, no. 1, pp. 93–109, 1997
  28. An 11/6-approximation algorithm for the network steiner problem
    Algorithmica, vol. 9, no. 5, pp. 463–470, 1993
  29. A faster approximation algorithm for the steiner tree problem in graphs
    Information Processing Letters, vol. 46, no. 2, pp. 79–83, 1993