Citations

Online Publications and Presentations of Alex Zelikovsky

Notice: The documents contained in this directory are included by contributing authors as a means of ensuring timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that these works are offered here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

 

Topics in colors: Bioinformatics, VLSI CAD, Networks, Theory, other.

           

To Appear

 

  1. I. Astrovskaya and A. Zelikovsky, “Genotype Tagging with Limitted Overfitting,” Proc. of Brazilian Symposium on Bioinformatics, July 2009, to appear.
  2. P. Berman, M. Karpinski and A. Zelikovsky, “1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2,” Workshop on Algorithms and Data Structures (WADS), August 2009, to appear.

 

2009

  1. S. Gremalschi, G. Altun, I. Astrovskaya and A. Zelikovsky, “Mean Square Residue Biclustering with Missing Data and Row Inversions,” Proc. of International Symposium on Bioinformatics Research  & Applications (ISBRA 2009),  May 2009, Lecture Notes in Bioinformatics (LNBI)  5542, pp. 28-40, (.pdf).
  2. I.I. Mandoiu, Yi Pan, R. Sunderraman and A. Zelikovsky, “Guest Editors' Introduction to the Special Section on Bioinformatics Research and Applications,” IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), 6(2), 2009, pp. 178-179. (.pdf).    
  3. Q. Cheng,  R. Harrison and A. Zelikovsky, “MetNetAligner: a web service tool for metabolic network alignments,” Bioinformatics, Advanced Access published May 4, 2009.
  4. G. Robins and A. Zelikovsky, “Minimum Steiner Tree Construction,” in The Handbook of Algorithms for VLSI Physical Design Automation, C.J. Alpert, D.P. Mehta, and S.S. Sapatnekar (editors), CRC Press, 2009, pp. 487-508.
  5. Q. Cheng and A. Zelikovsky, “Network Mapping of Metabolic Pathways,” Analysis of Complex Networks: From Biology to Linguistics, M. Dehmer and F. Emmert-Streibto (eds.), WILEY-VCH Verlag GmbH & Co., 2009, pp. 271-293.
  6. A. Zelikovsky: “Bottleneck Steiner Tree Problems.” In Encyclopedia of Optimization, 2nd edition,C. A. Floudas and P. M. Pardalos (eds.), Springer 2009, pp. 311-313.

2008

  1. Q. Cheng, P. Berman, R. Harrison and A. Zelikovsky, “Fast Alignments of Metabolic Networks,” Proc. of IEEE International conference on Bioinformatics and Biomedicine (BIBM 20008), pp.147-152, (.pdf)
  2. I.I. Mandoiu, Yi Pan, and A. Zelikovsky, “Guest Editors' Introduction to the Special Section on Bioinformatics Research and Applications,” IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), 5(3), 2008, pp. 321-322. (.pdf)
  3. I. Mandoiu, R. Sunderraman and A. Zelikovsky, “Preface,” in Proceedings of International Symposium on Bioinformatics Research and Applications (ISBRA 2008), I. Mandoiu and A. Zelikovsky (eds.), Lecture Notes in Bioinformatics, LNBI 4983, Springer 2008, pp. vi-x. (.pdf)
  4. K. Wesbrooks, I. Astrovskaya, D. C. Rendon, Y. Khudyakov, P. Berman and A. Zelikovsky, “HCV Quasispecies Assembly using Network Flows,” Proc. of International Symposium on Bioinformatics Research  & Applications, May 2008,  LNBI 4983, pp. 159-170.  (.pdf)
  5. D. Brinza and A. Zelikovsky, “2SNP: Scalable Phasing Method for Trios and Unrelated Individuals,” IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), 6(1), pp. 313-318  (.pdf)  
  6. I. I. Mandoiu and A.Zelikovsky, “Preface,” in  Bioinformatics Algorithms: Techniques and Applications, I.I. Mandoiu and A. Zelikovsky (editors), Wiley Book Series on Bioinformatics, 2008, pp. ix-x.
  7. D. Brinza, J. He and A. Zelikovsky,  “Optimization Methods for Genotype Data Analysis in Epidemiological Studies,” in  Bioinformatics Algorithms: Techniques and Applications, I.I. Mandoiu and A. Zelikovsky (editors), Wiley Book Series on Bioinformatics, 2008, pp. 395- 415.
  8. D. Brinza and A. Zelikovsky, “Design and Validation of Methods Searching for Risk Factors in Genotype Case-Control Studies,” RECOMB Satellite Workshop, SNPHAP 2007, January 27, 2007, (.ppt), Journal of Computational Biology, 15(1), 2008, pp. 81-90,  (.pdf)

2007

  1. Q. Cheng, R. Harrison and A. Zelikovsky, “Mapping and Filling Metabolic Pathways,” Proc. RECOMB Satellite Conference on System Biology (RECOMB SCSB 2007).
  2. I.M. Nolte, A.R. de Vries, G.T. Spijker, R.C. Jansen, D. Brinza, A. Zelikovsky, and G.J. te Meerman, “Association testing by haplotype-sharing methods applicable to whole-genome analysis,” BMC Proceedings  1(Suppl 1):S129, 2007, (.pdf)  
  3. I.I. Mandoiu, Yi Pan, and A. Zelikovsky, “Guest Editors' Introduction to the Special Section on Bioinformatics Research and Applications,” IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), 4(4), 2007, pp. 513-514. (.pdf)  
  4. D. Brinza and A. Zelikovsky, “Risk Factor Searching Heuristics for SNP Case-Control Studies,” Proc. of IEEE International conference on Bioinformatics and Biomedicine (BIBM 2007), pp. 282 – 287. (.pdf) 
  5. D. Brinza and A. Zelikovsky, “Discrete Methods for Association Search and Status Prediction in Genotype Case-Control Studies,” Proc. of IEEE 7-th International Symposium on BioInformatics and BioEngineering (BIBE'07), pp. 270-277. (.pdf)
  6. Q. Cheng, R. Harrison, and A. Zelikovsky, “Homomorphisms of Multisource Trees into Networks with Applications to Metabolic Pathways,” Proc. of IEEE 7-th International Symposium on BioInformatics and BioEngineering (BIBE'07), pp. 350-357. (.pdf)
  7. R. Albert, B. DasGupta, R. Dondi, E. Sontag, A. Zelikovsky and K. Westbrooks, “Signal Transduction Network Inference from Indirect Experimental Evidence,” Journal of Computational Biology, 14(7), 2007, pp. 927-949. (.pdf)
  8. R. Albert, B. DasGupta, R. Dondi, E. Sontag, A. Zelikovsky and K. Westbrooks, “Signal Transduction Network Inference from Indirect Experimental Evidence,” Proc. Workshop on Algorithms in Bioinformatics (WABI'07), September 2007, Lecture Notes in Bioinformatics (LNBI)  4645, pp. 407-419.  (.pdf)
  9. A.B. Kahng, I.I. Mandoiu, and A.Z. Zelikovsky, "Practical approximations of Steiner trees in uniform orientation metrics," in Handbook of Approximation Algorithms and Metaheuristics, T.E. Gonzalez, editor, Chapma&Hall/CRC Press, 2007, pp. 43-1 - 43-13. (.pdf)
  10. I.I. Mandoiu, A. Olshevsky, and A.Z. Zelikovsky, "QoS multimedia multicast routing," in Handbook of Approximation Algorithms and Metaheuristics, T.E. Gonzalez, editor, Chapma&Hall/CRC Press, 2007, pp. 71-1 - 71-16. (.pdf)
  11. C. Albrecht, A.B. Kahng, I.I. Mandoiu and A.Z. Zelikovsky, "Multicommodity flow algorithms for buffered global routing," in Handbook of Approximation Algorithms and Metaheuristics, T.E. Gonzalez, editor, Chapma&Hall/CRC Press, 2007, pp. 80-1 - 80-18. (.pdf)
  12. I. Mandoiu and A. Zelikovsky, “Preface,” in Proceedings of International Symposium on Bioinformatics Research and Applications (ISBRA 2007), I. Mandoiu and A. Zelikovsky (eds.), Lecture Notes in Bioinformatics, LNBI 4463, Springer 2007, pp. v-x. (.pdf)
  13. N. Hundewale, S. Jung and A. Zelikovsky, “Energy Efficiency of Load Balancing in MANET Routing Protocols,” Journal of Universal Computer Science, 13(1), 2007, pp. 110-132. (.pdf)
  14. G. Călinescu, I.I. Măndoiu, A. Zelikovsky and M. Zimand, “Selected Papers from the 1st ACIS International Workshop on Self-Assembling Wireless Networks,” Journal of Universal Computer Science, 13(1), 2007, pp. 1-3. (.pdf)
  15. J. He and A. Zelikovsky, “Informative SNP Selection Based on SNP Prediction,” IEEE Transactions on NanoBioscience, 6(1), 2007, pp. 60-67. (.pdf)
  16. I.I. Mandoiu, Yi Pan, and A. Zelikovsky, “Introduction to the Special Section on Computational Nanobioscience,” IEEE Transactions on NanoBioscience, 6(1), 2007, pp. 1-3. (.pdf)
  17. A. B. Kahng, I. I. Mandoiu, X. Xu and A. Zelikovsky, “Enhanced Design Flow and Optimizations for Multi-Project Wafers,” IEEE Transactions on CAD, 26(2), 2007, pp. 301-311.  (.pdf)
  18. C. Chiang, A.B. Kahng, S. Sinha, X. Xu and A. Zelikovsky, "Fast and Efficient Bright-Field AAPSM Conflict Detection and Correction," IEEE Transactions on CAD, 26(1), 2007, pp.115-126. (.pdf) 

2006

  1. A.B. Kahng, I.I. Mandoiu, S. Reda, X. Xu, and A.Z. Zelikovsky, “Computer-aided optimization of dna array design and manufacturing,” In K. Chakrabarty and J. Zeng, editors, Design Automation Methods and Tools for Microfluidics-Based Biochips. Springer Verlag, 2006, pp. 235-269. (.pdf)
  2. D. Brinza and A. Zelikovsky, A. “Combinatorial Analysis of Disease Association and Susceptibility for Rheumatoid Arthritis SNP Data,” Proc. of Genetic Analysis Workshop (GAW15), November 2006 (.pdf)
  3. A. R. de Vries, I. M. Nolte, Geert T. Spijker, D. Brinza, A. Zelikovsky, and G.J. te Meerman, “Cross Haplotype Sharing Statistic: Haplotype length based method for whole genome association testing,” Proc. Genetic Analysis Workshop (GAW15), November 2006 (.pdf)
  4. A. B. Kahng, P. Sharma, and A. Zelikovsky, “Fill for Shallow Trench Isolation CMP,” Proc. IEEE/ACM Intl Conf on Computer-Aided Design (ICCAD'06) November 2006, pp. 661-668 (.pdf)
  5. D. Brinza  and A. Zelikovsky, “Combinatorial Methods for Disease Association Search and Susceptibility Prediction,” Proc. Workshop on Algorithms in Bioinformatics (WABI'06), September 2006, Lecture Notes in Bioinformatics (LNBI)  4175, pp. 286-297.  (.pdf) (.ppt)
  6. D. Brinza, J. He, and A. Zelikovsky, “Combinatorial Search Methods for Multi-SNP Disease Association,” Proc. Intl Conf of the IEEE Engineering in Medicine and Biology (EMBC'06), September 2006, 5802-5805. (.pdf) (.ppt)
  7. J.He and A. Zelikovsky, “Multiple Linear Regression for Index SNP Selection on Unphased Genotypes,” Proc. Intl Conf of the IEEE Engineering in Medicine and Biology (EMBC'06), September 2006, pp. 5759-5762. (.pdf)
  8. J. He and A. Zelikovsky, “MLR-Tagging: Informative SNP Selection for Unphased Genotypes Based on Multiple Linear Regression,” Bioinformatics, 22(20), 2006, pp. 2558–2561, (.pdf) .
  9. Q. Cheng, Y. Zhang, X. Hu, N. Hundewale and A. Zelikovsky , “Routing Using Messengers in Sparse and Disconnected Mobile Sensor Networks,” Studies in Computational Intelligence, Volume 23 (2006), pp. 31-40
  10. C. Albrecht, A.B. Kahng, I.I. Mandoiu, and A.Z. Zelikovsky, “Floorplan evaluation, global routing, and buffer insertion for integrated circuits,” United States Patent #7,062,743, June 2006. (.pdf)
  11. D. Brinza, A. Perelygin, M. Brinton, A. Zelikovsky, “Search for multi-SNP Disease Association,” Proc. of the 5th Intl Conf on Bioinformatics of Genome Regulation and Structure (BGRS'2006), pp. 122-125. (.pdf) (.ppt)
  12. D. Brinza and A. Zelikovsky, “DEEPS: Deterministic Energy-Efficient Protocol for Sensor networks,” Proc. 2nd ACIS Intl Workshop on Self-assembling Wireless Networks, (SAWN 2006), June 2006, pp. 261-266. (.pdf) (.ppt)
  13. A. Dhawan, C. T. Vu, A. Zelikovsky, Y. Li, S. K. Prasad, “Maximum Lifetime of Sensor Networks with Adjustable Sensing Range,” Proc. 2nd  ACIS Intl Workshop on Self-assembling Wireless Networks, (SAWN 2006), June 2006, 285-289. (.pdf) (.ppt)
  14. E. Althaus, G. Calinescu, I. Mandoiu, S. Prasad, N. Tchervenski and A. Zelikovsky, "Power Efficient Range Assignment for Symmetric Connectivity in Ad-hoc Wireless Networks," Wireless Networks, 12(3), pp. 287-299, 2006  (.ps), (.pdf)
  15. D. Brinza and A. Zelikovsky, “Phasing of 2-SNP Genotypes based on Non-Random Mating Model,” Proc. of Intl Conf on Computational Science (ICCS 2006), May 2006, LNCS 3992, pp. 767-774. (.pdf) (.ppt)
  16. J. He and A. Zelikovsky, “Tag SNP Selection Based on Multivariate Linear Regression,” Proc. of Intl Conf on Computational Science (ICCS 2006), May 2006, LNCS 3992, pp. 750-757. (.pdf) (.ppt)
  17. W. Mao, D. Brinza, N. Hundewale, S. Gremalschi and A. Zelikovsky, “Genotype Susceptibility and Integrated Risk Factors for Complex Diseases,” Proc. IEEE Intl Conf on Granular Computing (GRC 2006), May 2006, pp. 754-757. (.pdf)  (.ppt)
  18. J. He, J. Zhang, G. Altun, A. Zelikovsky and Y. Zhang, “Haplotype Tagging using Support Vector Machines,” Proc. IEEE Intl Conf on Granular Computing (GRC 2006), May 2006, pp. 758-761. (.pdf)
  19. G. Altun, H.-J. Hu, D. Brinza, R.W. Harrison, A. Zelikovsky and Y. Pan, “Hybrid SVM kernels for protein secondary structure prediction,” Proc. IEEE Intl Conf on Granular Computing (GRC 2006), May 2006, pp. 762-765. (.pdf)
  20. P. Berman, M. Furer and A. Zelikovsky, “Applications of the Matroid Parity Problem to Approximating Steiner Trees,” Proc. of Intl Computer Science Symp in Russia (CSR 2006), June 2006, LNCS 3967, pp. 70-79.  (.pdf)
  21. A. B. Kahng, X. Xu and A. Zelikovsky, " Fast Yield-Driven Fracture for Variable Shaped-Beam Mask Writing," Proc. SPIE Symposium on Photomask and NGL Mask Technology XIII (Photomask Japan), April  2006, (Morihisa Hoga  ed.) Vol. 6283, 62832R, (2006), pp. 2R-1 - 2R-10.  (.pdf)
  22. N. Hundewale, Q. Cheng, X. Hu, A. Bourgeois and A. Zelikovsky,  "Autonomous Messenger Based Routing in Disjoint Clusters of Mobile Sensor Networks,"  Proc. Spring Simulation Multiconf (SpringSim’06), April 2006, pp. 57-64. (.pdf)
  23. A. B. Kahng, I. I. Mandoiu, S. Reda, X. Xu and A. Zelikovsky, “Computer-Aided Optimization of DNA Array Design and Manufacturing,” IEEE Transactions on CAD, 25(2), February 2006, pp.305-320. (.pdf)
  24. D. Brinza and A. Zelikovsky, "2SNP: Scalable Phasing Based on 2-SNP Haplotypes," Bioinformatics, 22(3), 2006, pp. 371-373. (.pdf) Best Poster Award at the Fifth Georgia Tech International Conference on Bioinformatics, November 2005.
  25. A.B. Kahng, I.I. Mandoiu, X. Xu, and A. Zelikovsky, “Multi-project reticle design and wafer dicing under uncertain demand,” Proc. 22nd European Mask and Lithography Conf (EMLC 2006), January 2006, pp. 45-54. Invited (.pdf)

2005

  1. A. Zelikovsky, “Preface,” in Transactions on Computational Systems Biology II, C. Priami and A. Zelikovsky (eds.), LNBI 3680, Springer 2005, pp. v-vi.
  2. D. Brinza, G. Calinescu, S. Tongngam and A. Zelikovsky, "Energy-Efficient Continuous and Event-Driven Monitoring," Proc. 2nd IEEE Intl Conf on Mobile Ad-Hoc and Sensor Systems (MASS 2005), pp. 167-169. (.pdf)
  3. A. B. Kahng, I. I. Mandoiu, X. Xu and A. Zelikovsky, "Yield-driven multi-project reticle design and wafer dicing", Proc. 25th BACUS Intl Symp on Photomask Technology, October 2005, Proceedings of SPIE 5992, pp. 1247-1257. Best Poster Award. (.pdf)
  4. W. Mao, J.He, D. Brinza and A. Zelikovsky, "A Combinatorial Method for Predicting Genetic Susceptibility to Complex Diseases " Proc. Intl Conf of the IEEE Engineering in Medicine and Biology (EMBC'05), September 2005, pp. 224 - 227. (.pdf)
  5. J. He, K. Westbrooks and A. Zelikovsky, "Linear Reduction Methods for Tag SNP Selection," International Journal on Bioinformatics Research and Applications 1(3), 2005, pp. 249-260. (.pdf)
  6. D. Brinza, J. He, W. Mao and A. Zelikovsky, "Family Trio Phasing and Missing Data Recovery," International Journal on Bioinformatics Research and Applications, 1(2), 2005, pp. 221-229. (.pdf)
  7. Y. Chen, A. B. Kahng, G. Robins, A. Zelikovsky and Y. Zheng, "Compressible Area Fill Synthesis," IEEE Transactions on CAD, 24(8), August 2005, pp. 1169- 1187. (.ps), (.pdf)
  8. S. Jung, N. Hundewale and A. Zelikovsky, "Energy Efficiency of Load Balancing in MANET Routing Protocols," Proc. 1 ACIS Intl Workshop on Self-assembling Wireless Networks, (SAWN 2005), pp. 476-483. (.pdf)
  9. D. Brinza, J. He, W. Mao and A. Zelikovsky, "Phasing and Missing data recovery in Family Trios," Proc. of Intl Conf on Computational Science (ICCS 2006), LNCS 3515, pp. 1011-1019.  (.pdf)
  10. G. Calinescu and A. Zelikovsky, "The Polymatroid Steiner Problems," Journal of Combinatorial Optimization 9(3), May 2005, pp. 281-294. (.pdf)
  11. G. Robins and A. Zelikovsky, "Tighter Bounds for Graph Steiner Tree Approximation," SIAM Journal on Discrete Mathematics, 19(1), March 2005, pp. 122-134. (.pdf), SIAM Outstanding Paper Prize Awarded in 2007
  12. C. Chiang, A. B. Kahng, S. Sinha, X. Xu, and A. Zelikovsky, "Bright-Field AAPSM Conflict Detection and Correction," Proc. IEEE Conf on Design Automation and Test in Europe (DATE'05), Volume 2. March 2005, pp. 908-913. (.pdf)
  13. S. Jung, N. Hundewale and A. Zelikovsky, "Node Caching Enhancement of Reactive Ad Hoc Routing Protocols," Proc. IEEE Wireless Communication and Networking Conference (WCNC'05), March 2005, Volume 4, 1970- 1975. (.pdf)
  14. M. Karpinski, I. Mandoiu, A. Olshevsky and A. Zelikovsky, "Improved Approximation Algorithms for the Quality of Service Steiner Tree Problem," Algorithmica, 42(2) , April 2005, pp. 109-120. (.pdf)
  15. P. Berman, G. Calinescu, C. Shah and A. Zelikovsky, "Efficient Energy Management in Sensor Networks," In Ad Hoc and Sensor Networks, Wireless Networks and Mobile Computing, Volume 2, Y. Xiao and Y. Pan (Eds.), Nova Science Publishers. 2005. (.pdf)
  16. D. D. Lozovanu, D. Solomon and A Zelikovsky, " Multiobjective Games and Determining Pareto-Nash Equilibria," Buletinul Academiei de Stiinte a Republicii Moldova, Math, N 3(49), 2005, pp. 115- 122.

2004

  1. Y. Chen, A. B. Kahng, G. Robins, A. Zelikovsky and Y. Zheng, "Evaluation of the New OASIS Format for Layout Fill Compression," Proc. 11th IEEE Intl Conf on Electronics, Circuits and Systems (ICECS 2004), December 2004, 377-382. (.pdf), (.ppt)
  2. A. B. Kahng, X. Xu and A. Zelikovsky, "Yield and cost-driven fracturing for variable shaped beam mask writing," Proc. 24th BACUS Intl Symp on Photomask Technology, September 2004, Proceedings of  SPIE 5567, pp. 360-371. (.pdf)
  3. G. Calinescu and A. Zelikovsky, "The Polymatroid Steiner Problems," Proc. of 15th Intl Symp on Algorithms and Computation, ISAAC 2004, December 2004, LNCS 3341, 234-245 (.pdf)
  4. S. K. Prasad, V. Madisetti, S. Navathe, R. Sunderraman, E. Dogdu, A. G. Bourgeois, M. Weeks, A. Zelikovsky, Y.-Q. Zhang, Y. Pan, S. Belkasim, R. Sivakumar, B. Liu, J. Balasooriya, A. Hariharan, W. Xie, P. Madiraju, S. Malladi, G. Johnson and J. He, "System on Mobile Devices (SyD): A Middleware Testbed for Collaborative Applications over Small Heterogeneous Devices and Data Stores," Proc. of the ACM/IFIP/USENIX 5th Intl Middleware Conf, 2004, 352-371. (.pdf)
  5. J. He and A. Zelikovsky, "Linear Reduction for Haplotype Inference," Proc. Workshop on Algorithms in Bioinformatics (WABI'04), September 2004, Lecture Notes in Bioinformatics (LNBI) 3240, 242-253. (.pdf), (presentation)
  6. M. Atlas, N. Hundewale, L. Perelygina and A. Zelikovsky, "Consolidating Software Tools for DNA Microarray Design and Manufacturing," Proc. Intl Conf of the IEEE Engineering in Medicine and Biology (EMBC'04), September 2004, 172-175. (.pdf), (presentation)
  7. J. He and A. Zelikovsky, "Linear Reduction Methods for Tag SNP Selection," Proc. Intl Conf of the IEEE Engineering in Medicine and Biology (EMBC'04), September 2004, 2840-2843. (.pdf), (presentation) Regional Finalist for the Best Student Paper Award.
  8. A. B. Kahng, I. Mandoiu, P. Pevzner, S. Reda and A. Zelikovsky, "Scalable Heuristics for Design of DNA Probe Arrays," Journal of Computational Biology, 11(2-3) March 2004, pp. 429-448. (.ps), (.pdf)
  9. A. B. Kahng, I. Mandoiu, X. Xu and A. Zelikovsky, "Multi-Project Reticle Floorplanning and Wafer Dicing," Proc. IEEE/ACM Intl Symp on Physical Design, April 2004, pp. 70-77. (.pdf), (.ppt)
  10. P. Berman, G. Calinescu, C. Shah and A. Zelikovsky, "Power Efficient Monitoring Management in Sensor Networks," IEEE Wireless Communication and Networking Conf (WCNC'04), Atlanta, March 2004, pp. 2329-2334. (.pdf), (presentation)
  11. G. Calinescu, I. Mandoiu, P.-J. Wan and A. Zelikovsky, "Selecting Forwarding neighbors in Wireless Ad Hoc Networks," ACM Mobile Networks and Applications, 9(2), April 2004, pp. 101-111. (.ps), (.pdf)

2003

  1. G. Calinescu, C. Fernandes, I. Mandoiu, A. Olshevsky, K. Yang and A. Zelikovsky, "Primal-Dual Algorithms for QoS Multimedia Multicast," Proc. of IEEE GLOBECOM 2003, December 2003, pp. 3631-3635. (.ps), (.pdf), (.ppt)
  2. S. K. Prasad, M. Weeks, Y. Zhang, A. Zelikovsky, S. Belkasim, R. Sunderraman, and V. Madisetti, "Toward an Easy Programming Environment for Implementing Mobile Applications: A Fleet Application Case Study using SyD Middleware," IEEE Intl Workshop on Web Based Systems and Applications (WEBSA), in conjunction with the 27th Annual International Computer Software and Applications Conference (COMPSAC 2003), Dallas, Texas, November 3 - 6, 2003, pages 696-701. (.pdf)
  3. A. B. Kahng, I. Mandoiu, S. Reda, X. Xu and A. Zelikovsky, "Evaluation of Placement Techniques for DNA Probe Array Layout," Proc. IEEE/ACM Intl Conf on Computer-Aided Design (ICCAD'03) November 2003, pp. 262-269. (.ps), (.pdf), (.ppt)
  4. A. B. Kahng, I. Mandoiu, S. Reda, X. Xu and A. Zelikovsky, "Design Flow Enhancements for DNA Arrays," Proc. of IEEE Intl Conf on Computer Design (ICCD2003), October 2003, pp. 116-123. (.ps), (.pdf), (.ppt)
  5. C. H. Helvig, G. Robins and A. Zelikovsky, "Moving-Target TSP and Related Problems," Journal of Algorithms, 49 (2003) pp. 153-174. (.ps), (.pdf), (citations)
  6. G. Calinescu, S. Kapoor, A. Olshevsky and A. Zelikovsky, "Network Lifetime and Power Assignment in Ad-Hoc Wireless Networks," Proc. of European Symp on Algorithms (ESA'03), September 2003, LNCS 2832, pp. 114-126. (.ps), (.pdf), (citations)
  7. M. Karpinski, I. Mandoiu, A. Olshevsky and A. Zelikovsky, "Improved Approximation Algorithms for the Quality of Service Steiner Tree Problem," Workshop on Algorithms and Data Structures (WADS), August 2003, LNCS 2748, pp. 401-411. (.ppt), (.ps), (.pdf)
  8. C. Albrecht, A. B. Kahng, B. Liu, I. I . Mandoiu and A. Zelikovsky, "On the Skew-Bounded Minimum-Buffer Routing Tree Problem," IEEE Transactions on CAD, 22(7), 2003, pp. 937-944. (.ps), (.pdf)
  9. G. Calinescu, C. G. Fernandes, H. Karloff and A. Zelikovsky, "A new approximation algorithm for finding heavy planar subgraphs," Algorithmica, 36 (2003) pp. 179-205. (.ps), (.pdf)
  10. A. B. Kahng, I. Mandoiu, P. Pevzner, S. Reda and A. Zelikovsky, "Engineering a scalable placement heuristic for DNA probe arrays," Proc. the 7th Annual Intl Conf on Research in Computational Molecular Biology (RECOMB'03), Berlin, Germany, April 2003, pp. 148-156. (.ps), (.pdf), (.ppt)
  11. Y. Chen, A. B. Kahng, G. Robins, A. Zelikovsky and Y. Zheng, "Data Volume Reduction in Dummy Fill Generation," Proc. Conf. on Design Automation and Test in Europe (DATE'03), Munich, Germany, March 2003, pp. 868-873. (.ps), (.pdf)
  12. E. Althaus, G. Calinescu, I. Mandoiu, S. Prasad, N. Tchervenski and A. Zelikovsky, "Power Efficient Range Assignment in Ad-hoc Wireless Networks," IEEE Wireless Communication and Networking Conf (WCNC'03), New Orleans, March 2003, pp. 1889-1894. (.ps), (.pdf), (.ppt), (cumberland-presentation), (poster)
  13. C. Alpert, A. B. Kahng, B. Liu, I. I . Mandoiu and A. Zelikovsky, "Minimum Buffered Routing with Bounded Capacitive Load for Slew Rate and Reliability Control," IEEE Transactions on CAD, 22(3), 2003, pp. 241-253. (.ps), (.pdf)
  14. A. B. Kahng, I. Mandoiu and A. Zelikovsky, "Highly Scalable Algorithms for Rectilinear and Octilinear Steiner Trees," Proc. Asia and South Pacific Design Automation Conf (ASPDAC'03), January 2003, pp. 827-833 (.ps), (.pdf)

2002

  1. S.K. Prasad, M. Weeks, Y.-Q. Zhang, A. Zelikovsky, S. Belkasim and R. Sunderraman, "Mobile Fleet Application Using SOAP and System on Devices (SyD) Middleware Technologies," Proc. IASTED Communications, Internet and Info Tech (CIIT) Conf, November, 2002, 426-431.
  2. Y. Chen, A. B. Kahng, G. Robins and A. Zelikovsky, "Dummy Fill Synthesis for Uniform Layout Density," IEEE Transactions on CAD, 21(10), 2002, pp. 1132-1147. (.ps), (.pdf)
  3. A. B. Kahng, I. Mandoiu, P. Pevzner, S. Reda and A. Zelikovsky, "Border Length Minimization in DNA Array Design," Proc. Workshop on Algorithms in Bioinformatics (WABI'02), September 2002, LNCS 2452, pp. 435-448. (.ps), (.pdf), (presentation)
  4. G. Calinescu, I. Mandoiu and A. Zelikovsky, "Symmetric Connectivity with Minimum Power Consumption in Radio Networks," Proc. 17th IFIP World Computer Congress, Stream TC1/ 2nd IFIP Intl Conf on Theoretical Computer Science (TCS 2002), R. Baeza-Yates and U. Montaniri and N. Santoro (eds.), Kluwer Academic Publ., August 2002, pp. 119-130. (citations) (citations) (.ps), (.pdf), (presentation), (poster)
  5. C. Bandela, Y. Chen, A. B. Kahng, I. Mandoiu and A. Zelikovsky, "Auctions with buyer preferences," Information Systems: the E-BUsiness Challenge -- Proc. 17th IFIP World Computer Congress, Stream TC8, R. Traunmuller (ed.), Kluwer Academic Publ., August 2002, 223-238. (.pdf), (presentation)
  6. Y. Chen, A. B. Kahng, G. Robins and A. Zelikovsky, "Smoothness and Uniformity of Filled Layout for VDSM Manufacturability," Proc. ACM/IEEE Intl Symp on Physical Design, April 2002, pp. 137-142. (.pdf), (presentation), (poster)
  7. Y. Chen, A. B. Kahng, G. Robins and A. Zelikovsky, "Monte-Carlo Methods for Chemical-Mechanical Planarization on Multiple-Layer and Dual-Material Models," Proc. Intl Symp on Microlithography, March 2002, Proceedings of SPIE 4962, pp. 421-432. (.ps)
  8. F. F. Dragan, A. B. Kahng, I. I. Mandoiu, S. Muddu and A. Zelikovsky, "Provably Good Global Buffering by Generalized Multiterminal Multicommodity Flow Approximation," IEEE Transactions on CAD, 21(3), (2002), pp. 263-274. (.ps), (.pdf)
  9. D. Lozovanu, V. Voloshin and A. Zelikovsky, "A note on the colorability of a mixed hypergraph using k colors," Comput. Sci. J. Moldova, 10, N.1(28), 2002, pp. 92-95.
  10. A. Zelikovsky and I. Mandoiu, "Practical Approximation Algorithms for Zero- and Bounded-Skew Trees," SIAM Journal on Discrete Mathematics, 15(1) (2002), pp. 97-111. (.ps), (.pdf)
  11. D. D. Lozovanu, E. Tataru and A Zelikovsky, "A generalization of the knapsack problem and finding the k-optimal tree in a weighted digraph," Buletinul Academiei de Stiinte a Republicii Moldova, Math, N 1(38), 2002, pp. 111-117.
  12. C. Albrecht, A. B. Kahng, I. Mandoiu and A. Zelikovsky, "Floorplan Evaluation with Timing-Driven Global Wireplanning, Pin Assignment and Buffer/Wire Sizing," Proc. VLSI Design/Asia and South Pacific Design Automation Conf, January 2002, pp. 580-587. Best Paper Award. .ps, .pdf, Poster, .ppt

2001

  1. C. Alpert, A. B. Kahng, B. Liu, I. Mandoiu and A. Zelikovsky, "Minimum-Buffered Routing of Non-Critical Nets for Slew Rate and Reliability Control," Proc. IEEE/ACM Intl Conf on Computer-Aided Design (ICCAD'01) November 2001, pp. 408-415. .ps, .pdf, Poster, .ppt 
  2. C. Albrecht, A. B. Kahng, B. Liu, I. Mandoiu and A. Zelikovsky, "On the Skew Bounded Minimum-Buffer Routing Tree Problem," Proc. Workshop on Synthesis And System Integration of Mixed Technologies (SASIMI'01) October 2001, pp. 250-256. .ps, .pdf
  3. F. Dragan, A. B. Kahng, I. Mandoiu, S. Muddu and A. Zelikovsky, "Practical Approximation Algorithms for Separable Packing Linear Programs," Workshop on Algorithms and Data Structures (WADS), August 2001, LNCS 2125, pp. 325-337. (.ps), (.pdf)
  4. G. Calinescu, I. Mandoiu, P.-J. Wan and A. Zelikovsky, "Selecting Forwarding neighbors in Wireless Ad Hoc Networks," Proc. of 5th Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications July 2001, ACM Press, pp. 34-43. (citations) .ps, .pdf, .ppt
  5. A. Zelikovsky, "Bottleneck Steiner Tree Problems," in Encyclopedia of Optimization, C. A. Floudas and P. M. Pardalos eds., Volume 1, June 2001, Kluwer Academic Publishers, pp. 203-205. (.ps)
  6. Y. Chen, A. B. Kahng, G. Robins and A. Zelikovsky, "Hierarchical Dummy Fill Synthesis for Process Uniformity," Proc. Asia and South Pacific Design Automation Conf, January 2001, pp. 139-144. (citations) (.ps), (.pdf), (ppt)
  7. F. Dragan, A. B. Kahng, I. Mandoiu, S. Muddu and A. Zelikovsky, "Provably good global buffering by multiterminal multicommodity flow approximation," Proc. Asia and South Pacific Design Automation Conf., January 2001, pp. 120-125. (citations) (.ps), (.pdf)
  8. A. B. Kahng, S. Vaya and A. Zelikovsky, "New Graph Bipartizations for Double-Exposure, Bright Field Alternating Phase-Shift Mask Layout," Proc. Asia and South Pacific Design Automation Conf, January 2001, pp. 133-138. (citations) (.ps), (.pdf), (ppt)
  9. A. Zelikovsky and I. Mandoiu, "Practical Approximation Algorithms for Zero- and Bounded-Skew Trees," Proc. of ACM/SIAM Simposium on Discrete Algorithms, January 2001, pp. 407-416. (.ps), (.pdf), (ppt)
  10. C. H. Helvig, G. Robins and A. Zelikovsky, "Improved Approximation Scheme for the Group Steiner Problem," Networks 37(1) (2001) pp. 8-20. (.ps), (.pdf), (citations)

2000

  1. F. Dragan, A. B. Kahng, S. Muddu, I. Mandoiu and A. Zelikovsky, "Provably Good Global Buffering Using an Available Buffer Block Plan," Proc. IEEE/ACM Intl Conf on Computer-Aided Design (ICCAD'00), November 2000, pp. 104-109. (.ps), (.pdf), (ppt) (citations)
  2. C. H. Helvig, G. Robins and A. Zelikovsky, "New Approximation Algorithms for Routing with Multi-port Treminals," IEEE Trans. on CAD 19(10), (2000) pp. 1118-1128. (.ps), (.pdf), (citations)
  3. I. Mandoiu and A. Zelikovsky, "A Note on the MST Heuristic for Bounded Edge-Length Steiner Trees with Minimum Number of Steiner Points," Information Processing Letters 75(4) (2000), pp. 165-167. (.ps), (.pdf)
  4. Y. Chen, A. B. Kahng, G. Robins and A. Zelikovsky, "Practical Iterated Fill Synthesis for CMP Uniformity," Proc. Design Automation Conf(DAC’00), June 2000, pp. 671-674. (citations) (.ps), (.pdf), (.ppt)
  5. P. Berman, A. B. Kahng, D. Vidhani, H. Wang and A. Zelikovsky, "Optimal Phase Conflict Removal for Layout of Dark Field Alternating Phase Shifting Masks," IEEE Trans. on CAD 19(2), (2000), pp. 175-187. (citations) (.ps), (.pdf)
  6. Y. Chen, A. B. Kahng, G. Robins, and A. Zelikovsky, "Monte-Carlo Algorithms for Layout Density Control," Proc. Asia and South Pacific Design Automation Conf, Jan. 2000, pp. 523-528. (.ps), (.pdf)
  7. G. Robins and A. Zelikovsky, "Improved Steiner Tree Approximation in Graphs," Proc. of ACM/SIAM Simposium on Discrete Algorithms (SODA'2000), January 2000, pp. 770-779. (.ps), (ppt), (citations)
  8. P. Berman and A. Zelikovsky, "On the Approximation of Power-p and Bottleneck Steiner Trees," in: Advances in Steiner Trees, D-Z. Du, J.H. Rubinstein and J.M. Smith eds., Kluwer Academic Publishers, January, 2000, pp. 117-135. (.ps)

1999

  1. Y. Chen, A. B. Kahng, G. Qu and A. Zelikovsky, "On the Associative-Skew Clock Routing Problem," Proc. IEEE/ACM Intl Conf on Computer-Aided Design (ICCAD'99) November 1999, pp. 168-172. (.ps), (.pdf)
  2. A. E. Caldwell, A. B. Kahng, S. Mantik, I. L. Markov and A. Zelikovsky, "On Wirelength Estimations for Row-Based Placement," IEEE Trans. on CAD 18(9), (1999), pp. 1265-1278. (.ps), (.pdf), (citations)
  3. P.Berman, A. B. Kahng, D. Vidhani, and A. Zelikovsky, "The T-Join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout," Workshop on Algorithms and Data Structures (WADS), August 1999, LNCS 1663, pp. 25-36. (.ps), (.pdf)
  4. P. Berman, A. B. Kahng, D. Vidhani, H. Wang and A. Zelikovsky, "Optimal Phase Conflict Removal for Layout of Dark Field Alternating Phase Shifting Masks," Proc. ACM Intl Symp on Physical Design (ISPD), April 1999, pp. 121-126. (.ps), (.pdf), (slides)
  5. A. B. Kahng, G. Robins, A. Singh and A. Zelikovsky, "Filling Algorithms and Analyses for Layout Density Control," IEEE Trans. on CAD 18(4), (1999), pp. 445-462. (citations) (.ps), (.pdf)
  6. A. B. Kahng, G. Robins, A. Singh and A. Zelikovsky, "New and Exact Filling Algorithms for Layout Density Control," Proc. IEEE Intl Conf on VLSI Design, January 1999, pp. 106-110. (.ps), (.pdf), (.ppt)
  7. A. B. Kahng, G. Robins, A. Singh and A. Zelikovsky, "New Multilevel and Hierarchical Algorithms for Layout Density Control," Proc. Asia and South Pacific Design Automation Conf, January 1999, pp. 221-224.Nominated for Best Paper Award. (.ps), (.pdf)
  8. A. B. Kahng, P. Tucker and A. Zelikovsky, "Optimization of Linear Placements for Wirelength Minimization with Free Sites," Proc. Asia and South Pacific Design Automation Conf, January 1999, pp. 241-244. Nominated for Best Paper Award. (.ps), (.pdf), (.ppt)
  9. M. Mani, A Zelikovsky, G. Bhatia and A. B. Kahng, "Traversing probabilistic Graphs," Tech. Rep. CS-990010, UCLA, CA, 18 pp. (.pdf)

1998

  1. A. B. Kahng, H. Wang and A. Zelikovsky, "Automated Layout and Phase Assignment Techniques for Dark Field Alternating PSM," Proc. 18th BACUS Symp on Photomask Technology and Management, September 1998, pp. 222-231. (.ps), (.pdf), (.ppt)
  2. A. B. Kahng, G. Robins, A. Singh, H. Wang and A. Zelikovsky, "Filling and Slotting: Analysis and Algorithms," Proc. ACM/IEEE Intl Symp on Physical Design, April 1998, pp. 95-102. (.ps), (.pdf), (.ppt)
  3. A. E. Caldwell, A. B. Kahng, S. Mantik, I. L. Markov and A. Zelikovsky, "On Wirelength Estimations for Row-Based Placement," Proc. ACM/IEEE Intl. Symp. on Physical Design, April 1998, pp. 4-11. (.ps), (.pdf), (.ppt)
  4. C. H. Helvig, G. Robins and A. Zelikovsky, "Improved Approximation Bounds for the Group Steiner Problem," Proc. Conf on Design Automation and Test in Europe, Paris, France, February, 1998, pp. 406-413. (.ps)
  5. C. H. Helvig, G. Robins and A. Zelikovsky, "Moving-Target TSP and Related Problems," Proc. of European Symp on Algorithms (ESA'98), In Algorithms-ESA'98, G. Bilardi, G. F. Italiano, A. Pietracaprina and G. Pucci (eds.) LNCS 1461, pp. 453-464 (.ps)
  6. M. Karpinski and A. Zelikovsky, "Approximating Dense Cases of Covering Problems," Proc. of the DIMACS Workshop on Network Design: Connectivity and Facilites Location, Princeton University, NJ, April, 1997. DIMACS series in Disc. Math. and Theor. Comp. Sci. 40, 1998, pp. 169-178. (.ps), (citations)
  7. P. Berman, M. Furer and A. Zelikovsky, "Applications of the Matroid Parity Problem to Approximating Steiner Trees," Tech. Rep. 980021, Computer Science Dept., UCLA, Los Angeles 1998, 12 pp. (.ps)

1997

  1. M. Karpinski, G. Wirtgen and A. Zelikovsky, "An Approximation Algorithm for the Bandwidth Problem on Dense Graphs," Proc. of RALCOM'97, Santorini , 1997, pp. 1-14. (.ps), (.pdf), (citations) (more citations)
  2. C. D. Bateman, C. H. Helvig, G. Robins and A. Zelikovsky, "Provably-Good Routing Tree Construction with Multi-Port Terminals," Proc. ACM/IEEE Intl Symp on Physical Design, April 1997, pp. 96-102. (.ps)
  3. M. Karpinski and A. Zelikovsky, "New approximation algorithms for the Steiner tree problems," Journal of Combinatorial Optimization 1(1), 1997, pp. 47-65. (.ps), (citations) (more citations)
  4. A. Zelikovsky, "A series of Approximation Algorithms for the Acyclic Directed Steiner Tree Problem," Algorithmica 18, 1997, pp. 99-110. (.ps), (citations)
  5. U. Fossmeier, M. Kaufmann and A. Zelikovsky, "Faster approximation algorithms for the rectilinear Steiner tree problem," Discrete & Computational Geometry 18, 1997, pp. 93-109. (.pdf), (citations)

1994-1996

  1. A. Zelikovsky, "Better approximation bounds for the network and Euclidean Steiner tree problems,"(.ps), Tech. Rep. CS-96-06, University of Virginia, Charlottesville, VA, 5 pp. (citations)
  2. A. Zelikovsky, "Improved approximation of maximum planar subgraph," Tech. Rep. CS-96-09, University of Virginia, Charlottesville, VA, 8 pp. (.ps)
  3. Hwan-Gue Cho and A. Zelikovsky, "Spanning closed trail and Hamiltonian cycle in grid graphs," Proc. of 6th Intl Symp on Algorithms and Computation, ISAAC '95 , LNCS 1002, 1995, pp. 342-351. (.ps), (citations)
  4. P. Berman, U. Fossmeier, M. Kaufmann, M. Karpinski and A. Zelikovsky, "Approaching the 5/4-Approximations for Rectilinear Steiner Trees," (.ps), Proc. of European Symp on Algorithms (ESA'94), In Algorithms and Computation. K. W. Ng et al (eds.) LNCS 762, 1994, pp. 533-542. (.pdf) (citations) (more citations)

1993

  1. A. Zelikovsky, "Later achievements in the Steiner tree approximations," Journal of Computer Science of Moldova 1 , (1993), pp. 32-41.
  2. A. Zelikovsky, "A faster approximation algorithm for the Steiner tree problem in graphs," Information Processing Letters 46 , (1993), pp. 79-83. (.pdf) (more citations)
  3. A. Zelikovsky, "An 11/6-approximation algorithm for the network Steiner problem," Algorithmica 9 , (1993), pp. 463-470. (.pdf) (citations)
  4. U. Fφίmeier, M. Kaufmann, and A. Zelikovsky, "Fast approximation algorithms for the rectilinear Steiner tree problem," Proc. of 4th International Symposium on Algorithms and Computation, ISAAC '93, LNCS 762, (1993), pp. 533-542. (.pdf) (citations) (more citations)
  5. D. D. Lozovanu, and A. Zelikovsky, "Minimal and bounded trees," Tezele Congresului XVIII al Academiei Romano-Americane, Kishinev, (1993), pp. 25-26. (citations) (more citations)
  6. A. Zelikovsky, "A minimum base of weighted k-polymatroids and the Steiner tree problem," In Integer Programming and Combinatorial Optimization. G. Rinaldi and L. A. Wolsey (eds.) Proceedings of Conf. (IPCO-3), April 1993, pp. 89-98.