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
Hilfe
Suche: Journal=Algorithmica AND Volume=13
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Combinatorial algorithms for DNA sequence assembly
J.D. Kececioglu
,
E.W. Myers
Algorithmica
13
(1-2), 1995, pp. 7-51
Physical mapping of chromosomes: A combinatorial problem in molecular biology
F. Alizadeh
,
R.M. Karp
,
L.A. Newberg
,
D.K. Weisser
Algorithmica
13
(1-2), 1995, pp. 52-76
DNA physical mapping and alternating Eulerian cycles in colored graphs
P.A. Pevzner
Algorithmica
13
(1-2), 1995, pp. 77-105
Linear-space algorithms that build local alignments from fragments
Kun-Mao Chao
,
W. Miller
Algorithmica
13
(1-2), 1995, pp. 106-134
Multiple filtration and approximate pattern matching
P.A. Pevzner
,
M.S. Waterman
Algorithmica
13
(1-2), 1995, pp. 135-154
A robust model for finding optimal evolutionary trees
M. Farach
,
S. Kannan
,
T. Warnow
Algorithmica
13
(1-2), 1995, pp. 155-179
Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
J. Kececioglu
,
D. Sankoff
Algorithmica
13
(1-2), 1995, pp. 180-210
Super-pattern matching
J.R. Knight
,
E.W. Myers
Algorithmica
13
(1-2), 1995, pp. 211-243
Dynamic expression trees
R.F. Cohen
,
R. Tamassia
Algorithmica
13
, 1995, pp. 245-265
The complexity of induced minors and related problems
M.R. Fellows
,
J. Kratochvíl
,
M. Middendorf
,
F. Pfeiffer
Algorithmica
13
, 1995, pp. 266-282
A lower bound on the probability of conflict under nonuniform access in database systems
K. Humenik
,
P. Matthews
,
A.B. Stephens
,
Y. Yesha
Algorithmica
13
, 1995, pp. 283-300
Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity
H.-P. Lenhof
,
M. Smid
Algorithmica
13
, 1995, pp. 301-312
The joint distribution of the three types of nodes in uniform binary trees
H.M. Mahmoud
Algorithmica
13
, 1995, pp. 313-323
Dynamic half-space range reporting and its applications
P.K. Agarwal
,
J. Matous̑ek
Algorithmica
13
, 1995, pp. 325-345
Random parallel algorithms for finding exact Branchings, perfect matchings, and cycles
D. Bruschi
,
F. Ravasio
Algorithmica
13
, 1995, pp. 346-356
New primal and dual matching heuristics
M. Jünger
,
W. Pulleyblank
Algorithmica
13
, 1995, pp. 357-380
On greedy heuristics for Steiner minimum trees
Ding-Zhu Du
Algorithmica
13
, 1995, pp. 381-386
Point set pattern matching in
d
-dimensions
P.J. de Rezende
,
D.T. Lee
Algorithmica
13
, 1995, pp. 387-404
Squares, cubes, and time-space efficient string searching
M. Crochemore
,
W. Rytter
Algorithmica
13
, 1995, pp. 405-425
All-pairs shortest paths and the essential subgraph
C.C. McGeoch
Algorithmica
13
, 1995, pp. 426-441
Using geometry to solve the transportation problem in the plane
D.S. Atkinson
,
P.M. Vaidya
Algorithmica
13
, 1995, pp. 442-461
Asymptotic speed-ups in constructive solid geometry
D. Eppstein
Algorithmica
13
, 1995, pp. 462-471
Landmark-based robot navigation
A. Lazanas
,
J.-C. Latombe
Algorithmica
13
, 1995, pp. 472-501
Fully dynamic biconnectivity in graphs
M.R. Henzinger
Algorithmica
13
, 1995, pp. 503-538
Assembly sequences for polyhedra
A. Schweikard
,
R.H. Wilson
Algorithmica
13
, 1995, pp. 539-552
Seiten 1
2
>