| 2008 |
|---|
| 105 | | Ion I. Mandoiu,
Raj Sunderraman,
Alexander Zelikovsky:
Bioinformatics Research and Applications, Fourth International Symposium, ISBRA 2008, Atlanta, GA, USA, May 6-9, 2008. Proceedings
Springer 2008 |
| 104 | EE | Kelly Westbrooks,
Irina Astrovskaya,
David Campo,
Yuri Khudyakov,
Piotr Berman,
Alexander Zelikovsky:
HCV Quasispecies Assembly Using Network Flows.
ISBRA 2008: 159-170 |
| 103 | EE | Dumitru Brinza,
Alexander Zelikovsky:
2SNP: Scalable Phasing Method for Trios and Unrelated Individuals.
IEEE/ACM Trans. Comput. Biology Bioinform. 5(2): 313-318 (2008) |
| 2007 |
|---|
| 102 | | Ion I. Mandoiu,
Alexander Zelikovsky:
Bioinformatics Research and Applications, Third International Symposium, ISBRA 2007, Atlanta, GA, USA, May 7-10, 2007, Proceedings
Springer 2007 |
| 101 | EE | Dumitru Brinza,
Alexander Zelikovsky:
Discrete Methods for Association Search and Status Prediction in Genotype Case-Control Studies.
BIBE 2007: 270-277 |
| 100 | EE | Qiong Cheng,
Robert W. Harrison,
Alexander Zelikovsky:
Homomorphisms of Multisource Trees into Networks with Applications to Metabolic Pathways.
BIBE 2007: 350-357 |
| 99 | EE | Dumitru Brinza,
Alexander Zelikovsky:
Risk Factor Searching Heuristics for SNP Case-Control Studies.
BIBM 2007: 282-287 |
| 98 | EE | 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.
WABI 2007: 407-419 |
| 97 | EE | Charles Chiang,
Andrew B. Kahng,
Subarna Sinha,
Xu Xu,
Alexander Zelikovsky:
Bright-Field AAPSM Conflict Detection and Correction
CoRR abs/0710.4661: (2007) |
| 96 | EE | Charles Chiang,
Andrew B. Kahng,
Subarna Sinha,
Xu Xu,
Alexander Zelikovsky:
Fast and Efficient Bright-Field AAPSM Conflict Detection and Correction.
IEEE Trans. on CAD of Integrated Circuits and Systems 26(1): 115-126 (2007) |
| 95 | EE | Andrew B. Kahng,
Ion I. Mandoiu,
Xu Xu,
Alexander Zelikovsky:
Enhanced Design Flow and Optimizations for Multiproject Wafers.
IEEE Trans. on CAD of Integrated Circuits and Systems 26(2): 301-311 (2007) |
| 94 | EE | Ion I. Mandoiu,
Yi Pan,
Alexander Zelikovsky:
Guest Editors' Introduction to the Special Section on Bioinformatics Research and Applications.
IEEE/ACM Trans. Comput. Biology Bioinform. 4(4): 513-514 (2007) |
| 93 | EE | Gruia Calinescu,
Ion I. Mandoiu,
Alexander Zelikovsky,
Marius Zimand:
Selected Papers from the 1st ACIS International Workshop on Self-Assembling Wireless Networks.
J. UCS 13(1): 1-3 (2007) |
| 92 | EE | Nisar Hundewale,
Sunsook Jung,
Alexander Zelikovsky:
Energy Efficient Node Caching and Load Balancing Enhancement of Reactive Ad Hoc Routing Protocols.
J. UCS 13(1): 110-132 (2007) |
| 2006 |
|---|
| 91 | EE | Piotr Berman,
Martin Fürer,
Alexander Zelikovsky:
Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees.
CSR 2006: 70-79 |
| 90 | EE | Andrew B. Kahng,
Puneet Sharma,
Alexander Zelikovsky:
Fill for shallow trench isolation CMP.
ICCAD 2006: 661-668 |
| 89 | EE | Jingwu He,
Alexander Zelikovsky:
Tag SNP Selection Based on Multivariate Linear Regression.
International Conference on Computational Science (2) 2006: 750-757 |
| 88 | EE | Dumitru Brinza,
Alexander Zelikovsky:
Phasing of 2-SNP Genotypes Based on Non-random Mating Model.
International Conference on Computational Science (2) 2006: 767-774 |
| 87 | EE | Dumitru Brinza,
Alexander Zelikovsky:
DEEPS: Deterministic Energy-Efficient Protocol for Sensor networks.
SNPD 2006: 261-266 |
| 86 | EE | Akshaye Dhawan,
Chinh T. Vu,
Alexander Zelikovsky,
Yingshu Li,
Sushil K. Prasad:
Maximum Lifetime of Sensor Networks with Adjustable Sensing Range.
SNPD 2006: 285-289 |
| 85 | EE | Dumitru Brinza,
Alexander Zelikovsky:
Combinatorial Methods for Disease Association Search and Susceptibility Prediction.
WABI 2006: 286-297 |
| 84 | EE | Qiong Cheng,
Yanqing Zhang,
Xiaolin Hu,
Nisar Hundewale,
Alexander Zelikovsky:
Routing Using Messengers in Sparse and Disconnected Mobile Sensor Networks.
Advances in Web Intelligence and Data Mining 2006: 31-40 |
| 83 | EE | Jingwu He,
Alexander Zelikovsky:
MLR-tagging: informative SNP selection for unphased genotypes based on multiple linear regression.
Bioinformatics 22(20): 2558-2561 (2006) |
| 82 | EE | Dumitru Brinza,
Alexander Zelikovsky:
2SNP: scalable phasing based on 2-SNP haplotypes.
Bioinformatics 22(3): 371-373 (2006) |
| 81 | EE | Andrew B. Kahng,
Ion I. Mandoiu,
Sherief Reda,
Xu Xu,
Alexander Zelikovsky:
Computer-Aided Optimization of DNA Array Design and Manufacturing.
IEEE Trans. on CAD of Integrated Circuits and Systems 25(2): 305-320 (2006) |
| 80 | EE | 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.
Wireless Networks 12(3): 287-299 (2006) |
| 2005 |
|---|
| 79 | | Corrado Priami,
Alexander Zelikovsky:
Transactions on Computational Systems Biology II
Springer 2005 |
| 78 | EE | Charles Chiang,
Andrew B. Kahng,
Subarna Sinha,
Xu Xu,
Alexander Zelikovsky:
Bright-Field AAPSM Conflict Detection and Correction.
DATE 2005: 908-913 |
| 77 | EE | Dumitru Brinza,
Jingwu He,
Weidong Mao,
Alexander Zelikovsky:
Phasing and Missing Data Recovery in Family Trios.
International Conference on Computational Science (2) 2005: 1011-1019 |
| 76 | EE | Sunsook Jung,
Nisar Hundewale,
Alexander Zelikovsky:
GKM over large MANET.
SNPD 2005: 484-490 |
| 75 | EE | Marek Karpinski,
Ion I. Mandoiu,
Alexander Olshevsky,
Alexander Zelikovsky:
Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem.
Algorithmica 42(2): 109-120 (2005) |
| 74 | EE | Christoph Albrecht,
Andrew B. Kahng,
Ion I. Mandoiu,
Alexander Zelikovsky:
Multicommodity Flow Algorithms for Buffered Global Routing
CoRR abs/cs/0508045: (2005) |
| 73 | EE | Yu Chen,
Andrew B. Kahng,
Gabriel Robins,
Alexander Zelikovsky,
Yuhong Zheng:
Compressible area fill synthesis.
IEEE Trans. on CAD of Integrated Circuits and Systems 24(8): 1169-1187 (2005) |
| 72 | EE | Dumitru Brinza,
Jingwu He,
Weidong Mao,
Alexander Zelikovsky:
Family trio phasing and missing data recovery.
IJBRA 1(2): 221-229 (2005) |
| 71 | EE | Jingwu He,
Kelly Westbrooks,
Alexander Zelikovsky:
Linear reduction method for predictive and informative tag SNP selection.
IJBRA 1(3): 249-260 (2005) |
| 70 | EE | Gruia Calinescu,
Alexander Zelikovsky:
The Polymatroid Steiner Problems.
J. Comb. Optim. 9(3): 281-294 (2005) |
| 69 | EE | Gabriel Robins,
Alexander Zelikovsky:
Tighter Bounds for Graph Steiner Tree Approximation.
SIAM J. Discrete Math. 19(1): 122-134 (2005) |
| 2004 |
|---|
| 68 | EE | Gruia Calinescu,
Alexander Zelikovsky:
The Polymatroid Steiner Problems.
ISAAC 2004: 234-245 |
| 67 | EE | Andrew B. Kahng,
Ion I. Mandoiu,
Qinke Wang,
Xu Xu,
Alexander Zelikovsky:
Multi-project reticle floorplanning and wafer dicing.
ISPD 2004: 70-77 |
| 66 | EE | 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.
Middleware 2004: 352-371 |
| 65 | EE | Jingwu He,
Alexander Zelikovsky:
Linear Reduction for Haplotype Inference.
WABI 2004: 242-253 |
| 64 | EE | Andrew B. Kahng,
Ion I. Mandoiu,
Pavel A. Pevzner,
Sherief Reda,
Alexander Zelikovsky:
Scalable Heuristics for Design of DNA Probe Arrays.
Journal of Computational Biology 11(2/3): 429-447 (2004) |
| 63 | EE | Gruia Calinescu,
Ion I. Mandoiu,
Peng-Jun Wan,
Alexander Zelikovsky:
Selecting Forwarding Neighbors in Wireless Ad Hoc Networks.
MONET 9(2): 101-111 (2004) |
| 2003 |
|---|
| 62 | EE | 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.
COMPSAC 2003: 696-701 |
| 61 | EE | Yu Chen,
Andrew B. Kahng,
Gabriel Robins,
Alexander Zelikovsky,
Yuhong Zheng:
Area Fill Generation With Inherent Data Volume Reduction.
DATE 2003: 10868-10875 |
| 60 | EE | Gruia Calinescu,
Sanjiv Kapoor,
Alexander Olshevsky,
Alexander Zelikovsky:
Network Lifetime and Power Assignment in ad hoc Wireless Networks.
ESA 2003: 114-126 |
| 59 | EE | Andrew B. Kahng,
Ion I. Mandoiu,
Sherief Reda,
Xu Xu,
Alexander Zelikovsky:
Evaluation of Placement Techniques for DNA Probe Array Layout.
ICCAD 2003: 262-269 |
| 58 | EE | Andrew B. Kahng,
Ion I. Mandoiu,
Sherief Reda,
Xu Xu,
Alexander Zelikovsky:
Design Flow Enhancements for DNA Arrays.
ICCD 2003: 116- |
| 57 | EE | Andrew B. Kahng,
Ion I. Mandoiu,
Pavel A. Pevzner,
Sherief Reda,
Alexander Zelikovsky:
Engineering a scalable placement heuristic for DNA probe arrays.
RECOMB 2003: 148-156 |
| 56 | EE | Marek Karpinski,
Ion I. Mandoiu,
Alexander Olshevsky,
Alexander Zelikovsky:
Improved Approximation Algorithms for the Quality of Service Steiner Tree Problem.
WADS 2003: 401-411 |
| 55 | EE | Gruia Calinescu,
Cristina G. Fernandes,
Howard J. Karloff,
Alexander Zelikovsky:
A New Approximation Algorithm for Finding Heavy Planar Subgraphs.
Algorithmica 36(2): 179-205 (2003) |
| 54 | EE | 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.
IEEE Trans. on CAD of Integrated Circuits and Systems 22(3): 241-253 (2003) |
| 53 | EE | Christoph Albrecht,
Andrew B. Kahng,
Bao Liu,
Ion I. Mandoiu,
Alexander Zelikovsky:
On the skew-bounded minimum-buffer routing tree problem.
IEEE Trans. on CAD of Integrated Circuits and Systems 22(7): 937-945 (2003) |
| 52 | EE | Christopher S. Helvig,
Gabriel Robins,
Alexander Zelikovsky:
The moving-target traveling salesman problem.
J. Algorithms 49(1): 153-174 (2003) |
| 2002 |
|---|
| 51 | EE | Christoph Albrecht,
Andrew B. Kahng,
Ion I. Mandoiu,
Alexander Zelikovsky:
Floorplan Evaluation with Timing-Driven Global Wireplanning, Pin Assignment and Buffer/Wire Sizing.
ASP-DAC 2002: 580-591 |
| 50 | | 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.
Communications, Internet, and Information Technology 2002: 426-431 |
| 49 | | Gruia Calinescu,
Ion I. Mandoiu,
Alexander Zelikovsky:
Symmetric Connectivity with Minimum Power Consumption in Radio Networks.
IFIP TCS 2002: 119-130 |
| 48 | EE | Yu Chen,
Andrew B. Kahng,
Gabriel Robins,
Alexander Zelikovsky:
Closing the smoothness and uniformity gap in area fill synthesis.
ISPD 2002: 137-142 |
| 47 | | C. Bandela,
Yu Chen,
Andrew B. Kahng,
Ion I. Mandoiu,
Alexander Zelikovsky:
Auctions with Buyer Preferences.
Information Systems: The e-Business Challenge 2002: 223-238 |
| 46 | EE | Christoph Albrecht,
Andrew B. Kahng,
Ion I. Mandoiu,
Alexander Zelikovsky:
Floorplan Evaluation with Timing-Driven Global Wireplanning, Pin Assignment and Buffer/Wire Sizing.
VLSI Design 2002: 580- |
| 45 | EE | Andrew B. Kahng,
Ion I. Mandoiu,
Pavel A. Pevzner,
Sherief Reda,
Alexander Zelikovsky:
Border Length Minimization in DNA Array Design.
WABI 2002: 435-448 |
| 44 | EE | Yu Chen,
Andrew B. Kahng,
Gabriel Robins,
Alexander Zelikovsky:
Area fill synthesis for uniform layout density.
IEEE Trans. on CAD of Integrated Circuits and Systems 21(10): 1132-1147 (2002) |
| 43 | EE | Feodor F. Dragan,
Andrew B. Kahng,
Ion I. Mandoiu,
Sudhakar Muddu,
Alexander Zelikovsky:
Provably good global buffering by generalized multiterminalmulticommodity flow approximation.
IEEE Trans. on CAD of Integrated Circuits and Systems 21(3): 263-274 (2002) |
| 2001 |
|---|
| 42 | EE | Feodor F. Dragan,
Andrew B. Kahng,
Ion I. Mandoiu,
Sudhakar Muddu,
Alexander Zelikovsky:
Provably good global buffering by multi-terminal multicommodity flow approximation.
ASP-DAC 2001: 120-125 |
| 41 | EE | Andrew B. Kahng,
Shailesh Vaya,
Alexander Zelikovsky:
New graph bipartizations for double-exposure, bright field alternating phase-shift mask layout.
ASP-DAC 2001: 133-138 |
| 40 | EE | Yu Chen,
Andrew B. Kahng,
Gabriel Robins,
Alexander Zelikovsky:
Hierarchical dummy fill for process uniformity.
ASP-DAC 2001: 139-144 |
| 39 | EE | Gruia Calinescu,
Ion I. Mandoiu,
Peng-Jun Wan,
Alexander Zelikovsky:
Selecting forwarding neighbors in wireless Ad Hoc networks.
DIAL-M 2001: 34-43 |
| 38 | EE | 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.
ICCAD 2001: 408- |
| 37 | EE | Alexander Zelikovsky,
Ion I. Mandoiu:
Practical approximation algorithms for zero- and bounded-skew trees.
SODA 2001: 407-416 |
| 36 | EE | Feodor F. Dragan,
Andrew B. Kahng,
Ion I. Mandoiu,
Sudhakar Muddu,
Alexander Zelikovsky:
Practical Approximation Algorithms for Separable Packing Linear Programs.
WADS 2001: 325-337 |
| 35 | EE | Christopher S. Helvig,
Gabriel Robins,
Alexander Zelikovsky:
An improved approximation scheme for the Group Steiner Problem.
Networks 37(1): 8-20 (2001) |
| 34 | EE | Alexander Zelikovsky,
Ion I. Mandoiu:
Practical Approximation Algorithms for Zero- and Bounded-Skew Trees.
SIAM J. Discrete Math. 15(1): 97-111 (2001) |
| 2000 |
|---|
| 33 | EE | Yu Chen,
Andrew B. Kahng,
Gabriel Robins,
Alexander Zelikovsky:
Monte-Carlo algorithms for layout density control.
ASP-DAC 2000: 523-528 |
| 32 | EE | Yu Chen,
Andrew B. Kahng,
Gabriel Robins,
Alexander Zelikovsky:
Practical iterated fill synthesis for CMP uniformity.
DAC 2000: 671-674 |
| 31 | | Feodor F. Dragan,
Andrew B. Kahng,
Ion I. Mandoiu,
Sudhakar Muddu,
Alexander Zelikovsky:
Provably Good Global Buffering Using an Available Buffer Block Plan.
ICCAD 2000: 104-109 |
| 30 | EE | Gabriel Robins,
Alexander Zelikovsky:
Improved Steiner tree approximation in graphs.
SODA 2000: 770-779 |
| 29 | EE | Christopher S. Helvig,
Gabriel Robins,
Alexander Zelikovsky:
New approximation algorithms for routing with multiport terminals.
IEEE Trans. on CAD of Integrated Circuits and Systems 19(10): 1118-1128 (2000) |
| 28 | EE | Piotr Berman,
Andrew B. Kahng,
Devendra Vidhani,
Huijuan Wang,
Alexander Zelikovsky:
Optimal phase conflict removal for layout of dark field alternatingphase shifting masks.
IEEE Trans. on CAD of Integrated Circuits and Systems 19(2): 175-187 (2000) |
| 27 | EE | Ion I. Mandoiu,
Alexander Zelikovsky:
A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points.
Inf. Process. Lett. 75(4): 165-167 (2000) |
| 1999 |
|---|
| 26 | EE | Andrew B. Kahng,
Gabriel Robins,
Anish Singh,
Alexander Zelikovsky:
New Multilevel and Hierarchical Algorithms for Layout Density Control.
ASP-DAC 1999: 221-224 |
| 25 | EE | Andrew B. Kahng,
Paul Tucker,
Alexander Zelikovsky:
Optimization of Linear Placements for Wirelength Minimization with Free Sites.
ASP-DAC 1999: 241-244 |
| 24 | EE | Yu Chen,
Andrew B. Kahng,
Gang Qu,
Alexander Zelikovsky:
The associative-skew clock routing problem.
ICCAD 1999: 168-172 |
| 23 | EE | Piotr Berman,
Andrew B. Kahng,
Devendra Vidhani,
Huijuan Wang,
Alexander Zelikovsky:
Optimal phase conflict removal for layout of dark field alternating phase shifting masks.
ISPD 1999: 121-126 |
| 22 | | Andrew B. Kahng,
Gabriel Robins,
Anish Singh,
Alexander Zelikovsky:
New and Exact Filling Algorithms for Layout Density Control.
VLSI Design 1999: 106-110 |
| 21 | EE | 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.
WADS 1999: 25-36 |
| 20 | EE | Andrew B. Kahng,
Gabriel Robins,
Anish Singh,
Alexander Zelikovsky:
Filling algorithms and analyses for layout density control.
IEEE Trans. on CAD of Integrated Circuits and Systems 18(4): 445-462 (1999) |
| 19 | EE | Andrew E. Caldwell,
Andrew B. Kahng,
Stefanus Mantik,
Igor L. Markov,
Alexander Zelikovsky:
On wirelength estimations for row-based placement.
IEEE Trans. on CAD of Integrated Circuits and Systems 18(9): 1265-1278 (1999) |
| 1998 |
|---|
| 18 | EE | Christopher S. Helvig,
Gabriel Robins,
Alexander Zelikovsky:
Improved Approximation Bounds for the Group Steiner Problem.
DATE 1998: 406-413 |
| 17 | EE | Christopher S. Helvig,
Gabriel Robins,
Alexander Zelikovsky:
Moving-Target TSP and Related Problems.
ESA 1998: 453-464 |
| 16 | EE | Andrew E. Caldwell,
Andrew B. Kahng,
Stefanus Mantik,
Igor L. Markov,
Alexander Zelikovsky:
On wirelength estimations for row-based placement.
ISPD 1998: 4-11 |
| 15 | EE | Andrew B. Kahng,
Gabriel Robins,
Anish Singh,
Huijuan Wang,
Alexander Zelikovsky:
Filling and slotting: analysis and algorithms.
ISPD 1998: 95-102 |
| 1997 |
|---|
| 14 | EE | C. Douglass Bateman,
Christopher S. Helvig,
Gabriel Robins,
Alexander Zelikovsky:
Provably good routing tree construction with multi-port terminals.
ISPD 1997: 96-102 |
| 13 | | Alexander Zelikovsky:
A Series of Approximation Algorithms for the Acyclic Directed Steiner Tree Problem.
Algorithmica 18(1): 99-110 (1997) |
| 12 | EE | Ulrich Fößmeier,
Michael Kaufmann,
Alexander Zelikovsky:
Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem.
Discrete & Computational Geometry 18(1): 93-109 (1997) |
| 11 | EE | Marek Karpinski,
Juergen Wirtgen,
Alexander Zelikovsky:
An Approximation Algorithm for the Bandwidth Problem on Dense Graphs
Electronic Colloquium on Computational Complexity (ECCC) 4(17): (1997) |
| 10 | EE | Marek Karpinski,
Alexander Zelikovsky:
Approximating Dense Cases of Covering Problems
Electronic Colloquium on Computational Complexity (ECCC) 4(4): (1997) |
| 9 | | Marek Karpinski,
Alexander Zelikovsky:
New Approximation Algorithms for the Steiner Tree Problems.
J. Comb. Optim. 1(1): 47-65 (1997) |
| 1995 |
|---|
| 8 | | Cho Hwan-Gue,
Alexander Zelikovsky:
Spanning Closed Trail and Hamiltonian Cycle in Grid Graphs.
ISAAC 1995: 342-351 |
| 7 | EE | Marek Karpinski,
Alexander Zelikovsky:
1.757 and 1.267 - Approximation Algorithms for the Network and Rectilinear Steiner Tree Problems
Electronic Colloquium on Computational Complexity (ECCC) 2(3): (1995) |
| 6 | EE | Marek Karpinski,
Alexander Zelikovsky:
New Approximation Algorithms for the Steiner Tree Problems
Electronic Colloquium on Computational Complexity (ECCC) 2(30): (1995) |
| 1994 |
|---|
| 5 | | Piotr Berman,
Ulrich Fößmeier,
Marek Karpinski,
Michael Kaufmann,
Alexander Zelikovsky:
Approaching the 5/4-Approximation for Rectilinear Steiner Trees.
ESA 1994: 60-71 |
| 1993 |
|---|
| 4 | | Alexander Zelikovsky:
An approximation algorithm for weighted itk-polymatroids and the Steiner tree problem in graphs.
IPCO 1993: 89-98 |
| 3 | | Ulrich Fößmeier,
Michael Kaufmann,
Alexander Zelikovsky:
Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem.
ISAAC 1993: 533-542 |
| 2 | | Alexander Zelikovsky:
An 11/6-Approximation Algorithm for the Network Steiner Problem.
Algorithmica 9(5): 463-470 (1993) |
| 1 | | Alexander Zelikovsky:
A Faster Approximation Algorithm for the Steiner Tree Problem in Graphs.
Inf. Process. Lett. 46(2): 79-83 (1993) |
