Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Zelikovsky, Alexander"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Maximum series-parallel subgraph
Gruia Cȃlinescu
,
Cristina G. Fernandes
,
Hemanshu Kaul
,
Alexander Zelikovsky
Algorithmica
63
(1-2), 2012, pp. 137-157
A 3/2-approximation algorithm for Generalized Steiner Trees in complete graphs with edge lengths 1 and 2
Piotr Berman
,
Marek Karpinski
,
Alexander Zelikovsky
Lecture Notes in Computer Science
6506
, 2010, pp. 15-24
1.25-approximation algorithm for Steiner tree problem with distances 1 and 2
Piotr Berman
,
Marek Karpinski
,
Alexander Zelikovsky
Lecture Notes in Computer Science
5664
, 2009, pp. 86-97
MetNetAligner: A web service tool for metabolic network
Qiong Cheng
,
Robert Harrison
,
Alexander Zelikovsky
Bioinformatics
25
(15), 2009, pp. 1989-1990
2SNP: Scalable phasing based on 2-SNP haplotypes
Dumitru Brinza
,
Alexander Zelikovsky
Bioinformatics
22
(3), 2006, pp. 371-373
MLR-tagging: Informative SNP selection for unphased genotypes based on multiple linear regression
Jingwu He
,
Alexander Zelikovsky
Bioinformatics
22
(20), 2006, pp. 2558-2561
Improved approximation algorithms for the quality of service multicast tree problem
Marek Karpinski
,
Ion I. Măndoiu
,
Alexander Olshevsky
,
Alexander Zelikovsky
Algorithmica
42
(2), 2005, pp. 109-120
Tighter bounds for graph Steiner tree approximation
Gabriel Robins
,
Alexander Zelikovsky
SIAM Journal on Discrete Mathematics
19
(1), 2005, pp. 122-134
The polymatroid Steiner problems
Gruia Calinescu
,
Alexander Zelikovsky
Lecture Notes in Computer Science
3341
, 2004, pp. 234-245
A new approximation algorithm for finding heavy planar subgraphs
Gruia Cȃlinescu
,
Cristina G. Fernandes
,
Howard Karloff
,
Alexander Zelikovsky
Algorithmica
36
(2), 2003, pp. 179-205
Network lifetime and power assignment in ad hoc wireless networks
Gruia Calinescu
,
Sanjiv Kapoor
,
Alexander Olshevsky
,
Alexander Zelikovsky
Lecture Notes in Computer Science
2832
, 2003, pp. 114-126
Improved approximation algorithms for the quality of service Steiner tree problem
Marek Karpinski
,
Ion I. Mȃndoiu
,
Alexander Olshevsky
,
Alexander Zelikovsky
Lecture Notes in Computer Science
2748
, 2003, pp. 401-411
Practical approximation algorithms for separable packing linear programs
Feodor F. Dragan
,
Andrew B. Kahng
,
Ion I. Măndoiu
,
Sudhakar Muddu
,
Alexander Zelikovsky
Lecture Notes in Computer Science
2125
, 2001, pp. 325-337
An improved approximation scheme for the group Steiner problem
C.S. Helvig
,
Gabriel Robins
,
Alexander Zelikovsky
Networks
37
(1), 2001, pp. 8-20
Practical approximation algorithms for zero- and bounded-skew trees
Alexander Z. Zelikovsky
,
Ion I. Mandoiu
SIAM Journal on Discrete Mathematics
15
(1), 2001-2002, pp. 97-111
A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points
Ion I. Măndoiu
,
Alexander Z. Zelikovsky
Information Processing Letters
75
(4), 2000, pp. 165-167
The
T
-join problem in sparse graphs: Applications to phase assignment problem in VLSI mask layout
Piotr Berman
,
Andrew B. Kahng
,
Devendra Vidhani
,
Alexander Zelikovsky
Lecture Notes in Computer Science
1663
, 1999, pp. 25-36
Spanning closed trail and Hamiltonian cycle in grid graphs
Hwan-Gue Cho
,
Alexander Zelikovsky
Lecture Notes in Computer Science
1004
, 1995, pp. 342-351
Approaching the 5/4-approximation for rectilinear Steiner trees
Piotr Berman
,
Ulrich Föss̈meier
,
Marek Karpinski
,
Michael Kaufmann
,
Alexander Zelikovsky
Proceedings of the 2nd Annual European Symposium on Algorithms. ESA '94 (Utrecht, The Netherlands, September 26-28, 1994)
LNCS 855
, 1994, pp. 60-71
Faster approximation algorithms for the rectilinear Steiner tree problem
Ulrich Föss̈meier
,
Michael Kaufmann
,
Alexander Zelikovsky
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 533-542
An approximation algorithm for weighted
k
-polymatroids and the Steiner tree problem in graphs
Alexander Zelikovsky
Proceedings of the 3rd International Conference on Integer Programming and Combinatorial Optimization, IPCO'93 (Erice, Sicily, April 29 - May 1, 1993)
, 1993, pp. 89-98
A faster approximation algorithm for the Steiner tree problem in graphs
Alexander Z. Zelikovsky
Information Processing Letters
46
(2), 1993, pp. 79-83