default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 13, 1995
Volume 13, Number 1/2, January/February 1995
- Eugene W. Myers:
Guest Editor's Foreword: Special Issue on Computational Molecular Biology. 1-6 - John D. Kececioglu, Eugene W. Myers:
Combinatiorial Algorithms for DNA Sequence Assembly. 7-51 - Farid Alizadeh, Richard M. Karp, Lee Aaron Newberg, Deborah K. Weisser:
Physical Mapping of Chromosomes: A Combinatorial Problem in Molecular Biology. 52-76 - Pavel A. Pevzner:
DNA Physical Mapping and Alternating Eulerian Cycles in Colored Graphs. 77-105 - Kun-Mao Chao
, Webb Miller:
Linear-Space Algorithms that Build Local Alignments from Fragments. 106-134 - Pavel A. Pevzner, Michael S. Waterman:
Multiple Filtration and Approximate Pattern Matching. 135-154 - Martin Farach, Sampath Kannan, Tandy J. Warnow:
A Robust Model for Finding Optimal Evolutionary Trees. 155-179 - John D. Kececioglu, David Sankoff:
Exact and Approximation Algorithms for Sorting by Reversals, with Application to Genome Rearrangement. 180-210 - James R. Knight, Eugene W. Myers:
Super-Pattern Matching. 211-243
Volume 13, Number 3, March 1995
- Robert F. Cohen, Roberto Tamassia:
Dynamic Expression Trees. 245-265 - Michael R. Fellows, Jan Kratochvíl, Matthias Middendorf, Frank Pfeiffer:
The Complexity of Induced Minors and Related Problems. 266-282 - Keith E. Humenik, Peter Matthews, A. B. Stephens, Yelena Yesha:
A Lower Bound on the Probability of Conflict Under Nonuniform Access in Database Systems. 283-312 - Hans-Peter Lenhof, Michiel H. M. Smid:
Maintaining the Visibility Map of Spheres While Moving the Viewpoint on a Circle at Infinity. 301-312 - Hosam M. Mahmoud:
The Joint Distribution of the Three Types of Nodes in Uniform Binary Trees. 313-323
Volume 13, Number 4, April 1995
- Pankaj K. Agarwal, Jirí Matousek:
Dynamic Half-Space Range Reporting and Its Applications. 325-345 - Danilo Bruschi, F. Ravasio:
Random Parallel Algorithms for Finding Exact Branchings, Perfect Matchings, and Cycles. 346-356 - Michael Jünger, William R. Pulleyblank:
New Primal and Dual Matching Heuristics. 357-386 - Ding-Zhu Du:
On Greedy Heuristics for Steiner Minimum Trees. 381-386 - Pedro Jussieu de Rezende, D. T. Lee:
Point Set Pattern Matching in d-Dimensions. 387-404
Volume 13, Number 5, May 1995
- Maxime Crochemore, Wojciech Rytter:
Squares, Cubes, and Time-Space Efficient String Searching. 405-425 - Catherine C. McGeoch:
All-Pairs Shortest Paths and the Essential Subgraph. 426-441 - David S. Atkinson, Pravin M. Vaidya:
Using Geometry To Solve the Transportation Problem in the Plane. 442-461 - David Eppstein:
Asymptotic Speed-Ups in Constructive Solid Geometry. 462-471 - Anthony Lazanas, Jean-Claude Latombe:
Landmark-Based Robot Navigation. 472-501
Volume 13, Number 6, June 1995
- Monika Rauch Henzinger:
Fully Dynamic Biconnectivity in Graphs. 503-538 - Achim Schweikard, Randall H. Wilson:
Assembly Sequences for Polyhedra. 539-552 - Xin He:
An Efficient Parallel Algorithm for Finding Rectangular Duals of Plane Triangular Graphs. 553-572 - Michel Habib, Marianne Huchard, Jeremy P. Spinrad:
A Linear Algorithm To Decompose Inheritance Graphs Into Modules. 573-591 - Pilar de la Torre, Raymond Greenlaw, Alejandro A. Schäffer:
Optimal Edge Ranking of Trees in Polynomial Time. 592-618
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-22 19:43 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
