The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Alexander Zelikovsky: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Alexander Zelikovsky
    A Series of Approximation Algorithms for the Acyclic Directed Steiner Tree Problem. [Citation Graph (1, 0)][DBLP]
    Algorithmica, 1997, v:18, n:1, pp:99-110 [Journal]
  2. Yu Chen, Andrew B. Kahng, Gabriel Robins, Alexander Zelikovsky
    Monte-Carlo algorithms for layout density control. [Citation Graph (0, 0)][DBLP]
    ASP-DAC, 2000, pp:523-528 [Conf]
  3. Yu Chen, Andrew B. Kahng, Gabriel Robins, Alexander Zelikovsky
    Hierarchical dummy fill for process uniformity. [Citation Graph (0, 0)][DBLP]
    ASP-DAC, 2001, pp:139-144 [Conf]
  4. Christoph Albrecht, Andrew B. Kahng, Ion I. Mandoiu, Alexander Zelikovsky
    Floorplan Evaluation with Timing-Driven Global Wireplanning, Pin Assignment and Buffer/Wire Sizing. [Citation Graph (0, 0)][DBLP]
    ASP-DAC, 2002, pp:580-591 [Conf]
  5. Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu, Sudhakar Muddu, Alexander Zelikovsky
    Provably good global buffering by multi-terminal multicommodity flow approximation. [Citation Graph (0, 0)][DBLP]
    ASP-DAC, 2001, pp:120-125 [Conf]
  6. Andrew B. Kahng, Gabriel Robins, Anish Singh, Alexander Zelikovsky
    New Multilevel and Hierarchical Algorithms for Layout Density Control. [Citation Graph (0, 0)][DBLP]
    ASP-DAC, 1999, pp:221-224 [Conf]
  7. Andrew B. Kahng, Paul Tucker, Alexander Zelikovsky
    Optimization of Linear Placements for Wirelength Minimization with Free Sites. [Citation Graph (0, 0)][DBLP]
    ASP-DAC, 1999, pp:241-244 [Conf]
  8. Andrew B. Kahng, Shailesh Vaya, Alexander Zelikovsky
    New graph bipartizations for double-exposure, bright field alternating phase-shift mask layout. [Citation Graph (0, 0)][DBLP]
    ASP-DAC, 2001, pp:133-138 [Conf]
  9. Sushil K. Prasad, Michael Weeks, Yanqing Zhang, Alexander Zelikovsky, Saeid Belkasim, Raj Sunderraman, Vijay K. Madisetti
    Toward an Easy Programming Environment for Implementing Mobile Applications: A Fleet Application Case Study using SyD Middleware. [Citation Graph (0, 0)][DBLP]
    COMPSAC, 2003, pp:696-701 [Conf]
  10. Piotr Berman, Martin Fürer, Alexander Zelikovsky
    Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees. [Citation Graph (0, 0)][DBLP]
    CSR, 2006, pp:70-79 [Conf]
  11. Yu Chen, Andrew B. Kahng, Gabriel Robins, Alexander Zelikovsky
    Practical iterated fill synthesis for CMP uniformity. [Citation Graph (0, 0)][DBLP]
    DAC, 2000, pp:671-674 [Conf]
  12. Charles Chiang, Andrew B. Kahng, Subarna Sinha, Xu Xu, Alexander Zelikovsky
    Bright-Field AAPSM Conflict Detection and Correction. [Citation Graph (0, 0)][DBLP]
    DATE, 2005, pp:908-913 [Conf]
  13. Yu Chen, Andrew B. Kahng, Gabriel Robins, Alexander Zelikovsky, Yuhong Zheng
    Area Fill Generation With Inherent Data Volume Reduction. [Citation Graph (0, 0)][DBLP]
    DATE, 2003, pp:10868-10875 [Conf]
  14. Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky
    Improved Approximation Bounds for the Group Steiner Problem. [Citation Graph (0, 0)][DBLP]
    DATE, 1998, pp:406-413 [Conf]
  15. Gruia Calinescu, Ion I. Mandoiu, Peng-Jun Wan, Alexander Zelikovsky
    Selecting forwarding neighbors in wireless Ad Hoc networks. [Citation Graph (0, 0)][DBLP]
    DIAL-M, 2001, pp:34-43 [Conf]
  16. Piotr Berman, Ulrich Fößmeier, Marek Karpinski, Michael Kaufmann, Alexander Zelikovsky
    Approaching the 5/4-Approximation for Rectilinear Steiner Trees. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:60-71 [Conf]
  17. Gruia Calinescu, Sanjiv Kapoor, Alexander Olshevsky, Alexander Zelikovsky
    Network Lifetime and Power Assignment in ad hoc Wireless Networks. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:114-126 [Conf]
  18. Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky
    Moving-Target TSP and Related Problems. [Citation Graph (0, 0)][DBLP]
    ESA, 1998, pp:453-464 [Conf]
  19. Jingwu He, Alexander Zelikovsky
    Tag SNP Selection Based on Multivariate Linear Regression. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (2), 2006, pp:750-757 [Conf]
  20. Dumitru Brinza, Jingwu He, Weidong Mao, Alexander Zelikovsky
    Phasing and Missing Data Recovery in Family Trios. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (2), 2005, pp:1011-1019 [Conf]
  21. Dumitru Brinza, Alexander Zelikovsky
    Phasing of 2-SNP Genotypes Based on Non-random Mating Model. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (2), 2006, pp:767-774 [Conf]
  22. Charles J. Alpert, Andrew B. Kahng, Bao Liu, Ion I. Mandoiu, Alexander Zelikovsky
    Minimum-Buffered Routing of Non-Critical Nets for Slew Rate and Reliability Control. [Citation Graph (0, 0)][DBLP]
    ICCAD, 2001, pp:408-0 [Conf]
  23. Yu Chen, Andrew B. Kahng, Gang Qu, Alexander Zelikovsky
    The associative-skew clock routing problem. [Citation Graph (0, 0)][DBLP]
    ICCAD, 1999, pp:168-172 [Conf]
  24. Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu, Sudhakar Muddu, Alexander Zelikovsky
    Provably Good Global Buffering Using an Available Buffer Block Plan. [Citation Graph (0, 0)][DBLP]
    ICCAD, 2000, pp:104-109 [Conf]
  25. Andrew B. Kahng, Ion I. Mandoiu, Sherief Reda, Xu Xu, Alexander Zelikovsky
    Evaluation of Placement Techniques for DNA Probe Array Layout. [Citation Graph (0, 0)][DBLP]
    ICCAD, 2003, pp:262-269 [Conf]
  26. Andrew B. Kahng, Puneet Sharma, Alexander Zelikovsky
    Fill for shallow trench isolation CMP. [Citation Graph (0, 0)][DBLP]
    ICCAD, 2006, pp:661-668 [Conf]
  27. Andrew B. Kahng, Ion I. Mandoiu, Sherief Reda, Xu Xu, Alexander Zelikovsky
    Design Flow Enhancements for DNA Arrays. [Citation Graph (0, 0)][DBLP]
    ICCD, 2003, pp:116-0 [Conf]
  28. C. Bandela, Yu Chen, Andrew B. Kahng, Ion I. Mandoiu, Alexander Zelikovsky
    Auctions with Buyer Preferences. [Citation Graph (0, 0)][DBLP]
    Information Systems: The e-Business Challenge, 2002, pp:223-238 [Conf]
  29. Gruia Calinescu, Ion I. Mandoiu, Alexander Zelikovsky
    Symmetric Connectivity with Minimum Power Consumption in Radio Networks. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:119-130 [Conf]
  30. Alexander Zelikovsky
    An approximation algorithm for weighted itk-polymatroids and the Steiner tree problem in graphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 1993, pp:89-98 [Conf]
  31. Gruia Calinescu, Alexander Zelikovsky
    The Polymatroid Steiner Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:234-245 [Conf]
  32. Ulrich Fößmeier, Michael Kaufmann, Alexander Zelikovsky
    Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:533-542 [Conf]
  33. Cho Hwan-Gue, Alexander Zelikovsky
    Spanning Closed Trail and Hamiltonian Cycle in Grid Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:342-351 [Conf]
  34. C. Douglass Bateman, Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky
    Provably good routing tree construction with multi-port terminals. [Citation Graph (0, 0)][DBLP]
    ISPD, 1997, pp:96-102 [Conf]
  35. Piotr Berman, Andrew B. Kahng, Devendra Vidhani, Huijuan Wang, Alexander Zelikovsky
    Optimal phase conflict removal for layout of dark field alternating phase shifting masks. [Citation Graph (0, 0)][DBLP]
    ISPD, 1999, pp:121-126 [Conf]
  36. Andrew E. Caldwell, Andrew B. Kahng, Stefanus Mantik, Igor L. Markov, Alexander Zelikovsky
    On wirelength estimations for row-based placement. [Citation Graph (0, 0)][DBLP]
    ISPD, 1998, pp:4-11 [Conf]
  37. Yu Chen, Andrew B. Kahng, Gabriel Robins, Alexander Zelikovsky
    Closing the smoothness and uniformity gap in area fill synthesis. [Citation Graph (0, 0)][DBLP]
    ISPD, 2002, pp:137-142 [Conf]
  38. Andrew B. Kahng, Ion I. Mandoiu, Qinke Wang, Xu Xu, Alexander Zelikovsky
    Multi-project reticle floorplanning and wafer dicing. [Citation Graph (0, 0)][DBLP]
    ISPD, 2004, pp:70-77 [Conf]
  39. Andrew B. Kahng, Gabriel Robins, Anish Singh, Huijuan Wang, Alexander Zelikovsky
    Filling and slotting: analysis and algorithms. [Citation Graph (0, 0)][DBLP]
    ISPD, 1998, pp:95-102 [Conf]
  40. Sushil K. Prasad, Vijay K. Madisetti, Shamkant B. Navathe, Raj Sunderraman, Erdogan Dogdu, Anu G. Bourgeois, Michael Weeks, Bing Liu, Janaka Balasooriya, Arthi Hariharan, Wanxia Xie, Praveen Madiraju, Srilaxmi Malladi, Raghupathy Sivakumar, Alexander Zelikovsky, Yanqing Zhang, Yi Pan, Saeid Belkasim
    SyD: A Middleware Testbed for Collaborative Applications over Small Heterogeneous Devices and Data Stores. [Citation Graph (0, 0)][DBLP]
    Middleware, 2004, pp:352-371 [Conf]
  41. Andrew B. Kahng, Ion I. Mandoiu, Pavel A. Pevzner, Sherief Reda, Alexander Zelikovsky
    Engineering a scalable placement heuristic for DNA probe arrays. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2003, pp:148-156 [Conf]
  42. Dumitru Brinza, Alexander Zelikovsky
    DEEPS: Deterministic Energy-Efficient Protocol for Sensor networks. [Citation Graph (0, 0)][DBLP]
    SNPD, 2006, pp:261-266 [Conf]
  43. Sunsook Jung, Nisar Hundewale, Alexander Zelikovsky
    GKM over large MANET. [Citation Graph (0, 0)][DBLP]
    SNPD, 2005, pp:484-490 [Conf]
  44. Akshaye Dhawan, Chinh T. Vu, Alexander Zelikovsky, Yingshu Li, Sushil K. Prasad
    Maximum Lifetime of Sensor Networks with Adjustable Sensing Range. [Citation Graph (0, 0)][DBLP]
    SNPD, 2006, pp:285-289 [Conf]
  45. Gabriel Robins, Alexander Zelikovsky
    Improved Steiner tree approximation in graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:770-779 [Conf]
  46. Alexander Zelikovsky, Ion I. Mandoiu
    Practical approximation algorithms for zero- and bounded-skew trees. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:407-416 [Conf]
  47. Christoph Albrecht, Andrew B. Kahng, Ion I. Mandoiu, Alexander Zelikovsky
    Floorplan Evaluation with Timing-Driven Global Wireplanning, Pin Assignment and Buffer/Wire Sizing. [Citation Graph (0, 0)][DBLP]
    VLSI Design, 2002, pp:580-0 [Conf]
  48. Andrew B. Kahng, Gabriel Robins, Anish Singh, Alexander Zelikovsky
    New and Exact Filling Algorithms for Layout Density Control. [Citation Graph (0, 0)][DBLP]
    VLSI Design, 1999, pp:106-110 [Conf]
  49. Jingwu He, Alexander Zelikovsky
    Linear Reduction for Haplotype Inference. [Citation Graph (0, 0)][DBLP]
    WABI, 2004, pp:242-253 [Conf]
  50. Andrew B. Kahng, Ion I. Mandoiu, Pavel A. Pevzner, Sherief Reda, Alexander Zelikovsky
    Border Length Minimization in DNA Array Design. [Citation Graph (0, 0)][DBLP]
    WABI, 2002, pp:435-448 [Conf]
  51. Dumitru Brinza, Alexander Zelikovsky
    Combinatorial Methods for Disease Association Search and Susceptibility Prediction. [Citation Graph (0, 0)][DBLP]
    WABI, 2006, pp:286-297 [Conf]
  52. Piotr Berman, Andrew B. Kahng, Devendra Vidhani, Alexander Zelikovsky
    The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:25-36 [Conf]
  53. Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu, Sudhakar Muddu, Alexander Zelikovsky
    Practical Approximation Algorithms for Separable Packing Linear Programs. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:325-337 [Conf]
  54. Marek Karpinski, Ion I. Mandoiu, Alexander Olshevsky, Alexander Zelikovsky
    Improved Approximation Algorithms for the Quality of Service Steiner Tree Problem. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:401-411 [Conf]
  55. Sushil K. Prasad, Michael Weeks, Yanqing Zhang, Alexander Zelikovsky, Saeid Belkasim, Rajshekhar Sunderraman, Vijay K. Madisetti
    Mobile Fleet Application using Soap and System on Devices (SYD) Middleware Technologies. [Citation Graph (0, 0)][DBLP]
    Communications, Internet, and Information Technology, 2002, pp:426-431 [Conf]
  56. Gruia Calinescu, Cristina G. Fernandes, Howard J. Karloff, Alexander Zelikovsky
    A New Approximation Algorithm for Finding Heavy Planar Subgraphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:36, n:2, pp:179-205 [Journal]
  57. Marek Karpinski, Ion I. Mandoiu, Alexander Olshevsky, Alexander Zelikovsky
    Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:42, n:2, pp:109-120 [Journal]
  58. Alexander Zelikovsky
    An 11/6-Approximation Algorithm for the Network Steiner Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:9, n:5, pp:463-470 [Journal]
  59. Dumitru Brinza, Alexander Zelikovsky
    2SNP: scalable phasing based on 2-SNP haplotypes. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2006, v:22, n:3, pp:371-373 [Journal]
  60. Jingwu He, Alexander Zelikovsky
    MLR-tagging: informative SNP selection for unphased genotypes based on multiple linear regression. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2006, v:22, n:20, pp:2558-2561 [Journal]
  61. Ulrich Fößmeier, Michael Kaufmann, Alexander Zelikovsky
    Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1997, v:18, n:1, pp:93-109 [Journal]
  62. Marek Karpinski, Alexander Zelikovsky
    1.757 and 1.267 - Approximation Algorithms for the Network and Rectilinear Steiner Tree Problems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:3, pp:- [Journal]
  63. Marek Karpinski, Alexander Zelikovsky
    Approximating Dense Cases of Covering Problems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:4, pp:- [Journal]
  64. Marek Karpinski, Juergen Wirtgen, Alexander Zelikovsky
    An Approximation Algorithm for the Bandwidth Problem on Dense Graphs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:17, pp:- [Journal]
  65. Ion I. Mandoiu, Alexander Zelikovsky
    A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:75, n:4, pp:165-167 [Journal]
  66. Alexander Zelikovsky
    A Faster Approximation Algorithm for the Steiner Tree Problem in Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:46, n:2, pp:79-83 [Journal]
  67. Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky
    The moving-target traveling salesman problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:49, n:1, pp:153-174 [Journal]
  68. Andrew B. Kahng, Ion I. Mandoiu, Pavel A. Pevzner, Sherief Reda, Alexander Zelikovsky
    Scalable Heuristics for Design of DNA Probe Arrays. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2004, v:11, n:2/3, pp:429-447 [Journal]
  69. Gruia Calinescu, Alexander Zelikovsky
    The Polymatroid Steiner Problems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2005, v:9, n:3, pp:281-294 [Journal]
  70. Marek Karpinski, Alexander Zelikovsky
    New Approximation Algorithms for the Steiner Tree Problems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1997, v:1, n:1, pp:47-65 [Journal]
  71. Gruia Calinescu, Ion I. Mandoiu, Peng-Jun Wan, Alexander Zelikovsky
    Selecting Forwarding Neighbors in Wireless Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    MONET, 2004, v:9, n:2, pp:101-111 [Journal]
  72. Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky
    An improved approximation scheme for the Group Steiner Problem. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:37, n:1, pp:8-20 [Journal]
  73. Gabriel Robins, Alexander Zelikovsky
    Tighter Bounds for Graph Steiner Tree Approximation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:1, pp:122-134 [Journal]
  74. Alexander Zelikovsky, Ion I. Mandoiu
    Practical Approximation Algorithms for Zero- and Bounded-Skew Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:15, n:1, pp:97-111 [Journal]
  75. Charles J. Alpert, Andrew B. Kahng, Bao Liu, Ion I. Mandoiu, Alexander Zelikovsky
    Minimum buffered routing with bounded capacitive load for slew rate and reliability control. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 2003, v:22, n:3, pp:241-253 [Journal]
  76. Christoph Albrecht, Andrew B. Kahng, Bao Liu, Ion I. Mandoiu, Alexander Zelikovsky
    On the skew-bounded minimum-buffer routing tree problem. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 2003, v:22, n:7, pp:937-945 [Journal]
  77. Piotr Berman, Andrew B. Kahng, Devendra Vidhani, Huijuan Wang, Alexander Zelikovsky
    Optimal phase conflict removal for layout of dark field alternatingphase shifting masks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 2000, v:19, n:2, pp:175-187 [Journal]
  78. Andrew E. Caldwell, Andrew B. Kahng, Stefanus Mantik, Igor L. Markov, Alexander Zelikovsky
    On wirelength estimations for row-based placement. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1999, v:18, n:9, pp:1265-1278 [Journal]
  79. Yu Chen, Andrew B. Kahng, Gabriel Robins, Alexander Zelikovsky
    Area fill synthesis for uniform layout density. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 2002, v:21, n:10, pp:1132-1147 [Journal]
  80. Yu Chen, Andrew B. Kahng, Gabriel Robins, Alexander Zelikovsky, Yuhong Zheng
    Compressible area fill synthesis. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 2005, v:24, n:8, pp:1169-1187 [Journal]
  81. Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu, Sudhakar Muddu, Alexander Zelikovsky
    Provably good global buffering by generalized multiterminalmulticommodity flow approximation. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 2002, v:21, n:3, pp:263-274 [Journal]
  82. Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky
    New approximation algorithms for routing with multiport terminals. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 2000, v:19, n:10, pp:1118-1128 [Journal]
  83. Andrew B. Kahng, Ion I. Mandoiu, Sherief Reda, Xu Xu, Alexander Zelikovsky
    Computer-Aided Optimization of DNA Array Design and Manufacturing. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 2006, v:25, n:2, pp:305-320 [Journal]
  84. Andrew B. Kahng, Gabriel Robins, Anish Singh, Alexander Zelikovsky
    Filling algorithms and analyses for layout density control. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1999, v:18, n:4, pp:445-462 [Journal]
  85. Ernst Althaus, Gruia Calinescu, Ion I. Mandoiu, Sushil K. Prasad, N. Tchervenski, Alexander Zelikovsky
    Power Efficient Range Assignment for Symmetric Connectivity in Static Ad Hoc Wireless Networks. [Citation Graph (0, 0)][DBLP]
    Wireless Networks, 2006, v:12, n:3, pp:287-299 [Journal]
  86. Réka Albert, Bhaskar DasGupta, Riccardo Dondi, Sema Kachalo, Eduardo D. Sontag, Alexander Zelikovsky, Kelly Westbrooks
    A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence. [Citation Graph (0, 0)][DBLP]
    WABI, 2007, pp:407-419 [Conf]
  87. Charles Chiang, Andrew B. Kahng, Subarna Sinha, Xu Xu, Alexander Zelikovsky
    Bright-Field AAPSM Conflict Detection and Correction [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  88. Homomorphisms of Multisource Trees into Networks with Applications to Metabolic Pathways. [Citation Graph (, )][DBLP]


  89. Discrete Methods for Association Search and Status Prediction in Genotype Case-Control Studies. [Citation Graph (, )][DBLP]


  90. Estimation of Alternative Splicing isoform Frequencies from RNA-Seq Data. [Citation Graph (, )][DBLP]


  91. 1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2. [Citation Graph (, )][DBLP]


  92. Genotype Tagging with Limited Overfitting. [Citation Graph (, )][DBLP]


  93. HCV Quasispecies Assembly Using Network Flows. [Citation Graph (, )][DBLP]


  94. Mean Square Residue Biclustering with Missing Data and Row Inversions. [Citation Graph (, )][DBLP]


  95. Risk Factor Searching Heuristics for SNP Case-Control Studies. [Citation Graph (, )][DBLP]


  96. Fast Alignments of Metabolic Networks. [Citation Graph (, )][DBLP]


  97. MetNetAligner: a web service tool for metabolic network alignments. [Citation Graph (, )][DBLP]


  98. Multicommodity Flow Algorithms for Buffered Global Routing [Citation Graph (, )][DBLP]


  99. 1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two [Citation Graph (, )][DBLP]


  100. A Factor 3/2 Approximation for Generalized Steiner Tree Problem with Distances One and Two [Citation Graph (, )][DBLP]


  101. 1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two. [Citation Graph (, )][DBLP]


Search in 0.069secs, Finished in 0.072secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002