Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 39, 2004
Volume 39, Number 1, May 2004
- Tetsuo Shibuya:
Generalization of a Suffix Tree for RNA Structural Pattern Matching. 1-19 - Charles U. Martel, Glen Nuckolls, Premkumar T. Devanbu
, Michael Gertz, April Kwong, Stuart G. Stubblebine:
A General Model for Authenticated Data Structures. 21-41 - Leah Epstein, Jirí Sgall:
Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines. 43-57 - Klaus Jansen:
Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation Scheme. 59-81 - Petko Yanev, Paolo Foschi, Erricos John Kontoghiorghes:
Algorithms for Computing the QR Decomposition of a Set of Matrices with Common Columns. 83-93
Volume 39, Number 2, June 2004
- Stavros D. Nikolopoulos, Leonidas Palios:
Algorithms for P4-Comparability Graph Recognition and Acyclic P4-Transitive Orientation. 95-126 - John H. Reif, Zheng Sun:
Movement Planning in the Presence of Flows. 127-153 - Chung Keung Poon, Pixing Zhang:
Minimizing Makespan in Batch Machine Scheduling. 155-174 - Esther M. Arkin, Refael Hassin, Shlomi Rubinstein, Maxim Sviridenko:
Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems. 175-187
Volume 39, Number 3, July 2004
- Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin:
A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem. 189-208 - Petr Kolman, Christian Scheideler:
Simple On-Line Algorithms for the Maximum Disjoint Paths Problem. 209-233 - David R. Wood:
Minimising the Number of Bends and Volume in 3-Dimensional Orthogonal Graph Drawings with a Diagonal Vertex Layout. 235-253 - Jianjun Zhou, Martin Müller:
Solving Systems of Difference Constraints Incrementally with Bidirectional Search. 255-274
Volume 39, Number 4, August 2004
- Adam L. Buchsbaum, Michael T. Goodrich:
Three-Dimensional Layers of Maxima. 275-286 - Anne Berry, Jean R. S. Blair, Pinar Heggernes, Barry W. Peyton:
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs. 287-298 - Björn Brodén, Mikael Hammar, Bengt J. Nilsson:
Online and Offline Algorithms for the Time-Dependent TSP with Time Zones. 299-319 - Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier:
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems. 321-347
a service of 
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-04-18 20:20 CEST 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:
