Volume 2,
Number 1,
March 2004
SPIRE 2002
Volume 2,
Number 2,
June 2004
Combinatiorial Pattern Matching
- Raffaele Giancarlo, David Sankoff:
Editorial: Combinatiorial Pattern Matching.
135-136
Electronic Edition (link) BibTeX
- Ian H. Witten:
Adaptive text mining: inferring structure from sequences.
137-159
Electronic Edition (link) BibTeX
- Rolf Backofen:
A polynomial time upper bound for the number of contacts in the HP-model on the face-centered-cubic lattice (FCC).
161-206
Electronic Edition (link) BibTeX
- David Liben-Nowell, Jon M. Kleinberg:
Structural properties and tractability results for linear synteny.
207-228
Electronic Edition (link) BibTeX
- David Bryant:
A lower bound for the breakpoint phylogeny problem.
229-255
Electronic Edition (link) BibTeX
- Tao Jiang, Guohui Lin, Bin Ma, Kaizhong Zhang:
The longest common subsequence problem for arc-annotated sequences.
257-270
Electronic Edition (link) BibTeX
- David Fernández-Baca, Timo Seppäläinen, Giora Slutzki:
Parametric multiple sequence alignment and phylogeny construction.
271-287
Electronic Edition (link) BibTeX
- Leszek Gasieniec, Jesper Jansson, Andrzej Lingas:
Approximation algorithms for Hamming clustering problems.
289-301
Electronic Edition (link) BibTeX
- Sung-Ryul Kim, Kunsoo Park:
A dynamic edit distance table.
303-312
Electronic Edition (link) BibTeX
- Steven Skiena, Pavel Sumazin:
Shift error detection in standardized exams.
313-331
Electronic Edition (link) BibTeX
Volume 2,
Number 3,
September 2004
Volume 2,
Number 4,
December 2004
The 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2000)
- Ulrik Brandes, Dorothea Wagner:
Foreword: Special Issue of Journal of Discrete Algorithms on the 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '2000) held June 15-17, 2000 in Konstanz, Germany.
381
Electronic Edition (link) BibTeX
- Serafino Cicerone, Gabriele Di Stefano:
Networks with small stretch number.
383-405
Electronic Edition (link) BibTeX
- Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth:
Optimizing cost flows by edge cost and capacity upgrade.
407-423
Electronic Edition (link) BibTeX
- Stefan Dobrev:
Computing input multiplicity in anonymous synchronous networks with dynamic faults.
425-438
Electronic Edition (link) BibTeX
- Ekkehard Köhler:
Recognizing graphs without asteroidal triples.
439-452
Electronic Edition (link) BibTeX
- Goran Konjevod, Sven Oliver Krumke, Madhav V. Marathe:
Budget constrained minimum cost connected medians.
453-469
Electronic Edition (link) BibTeX
- Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
Approximating schedules for dynamic process graphs efficiently.
471-500
Electronic Edition (link) BibTeX
- Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela:
Approximating call-scheduling makespan in all-optical networks.
501-515
Electronic Edition (link) BibTeX
- Koichi Wada, Wei Chen:
Optimal fault-tolerant routings with small routing tables for k-connected graphs.
517-530
Electronic Edition (link) BibTeX
Copyright © Sun May 17 00:09:04 2009
by Michael Ley (ley@uni-trier.de)
