Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Discrete Algorithms, Volume 3
Volume 3, Number 1, March 2005
- Gill Barequet, Prosenjit Bose
, Matthew T. Dickerson, Michael T. Goodrich:
Optimizing a constrained convex polygonal annulus. 1-26 - Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni:
Partially dynamic maintenance of minimum weight hyperpaths. 27-46 - Xiao Zhou, Yuki Matsuo, Takao Nishizeki:
List total colorings of series-parallel graphs. 47-60 - Ingo Wegener, Carsten Witt:
On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions. 61-78 - William Duckworth, David F. Manlove, Michele Zito:
On the approximability of the maximum induced matching problem. 79-91 - Tomasz Luczak, Eric Vigoda:
Torpid mixing of the Wang-Swendsen-Kotecký algorithm for sampling colorings. 92-100 - David Peleg, Uri Pincas:
Virtual path layouts optimizing total hop count on ATM tree networks. 101-112 - Ian F. Blake, V. Kumar Murty, Guangwu Xu:
Efficient algorithms for Koblitz curves over fields of characteristic three. 113-124
Volume 3, Numbers 2-4, June 2005
- Ricardo A. Baeza-Yates, Maxime Crochemore:
Foreword. 125
- Dong Kyue Kim, Jeong Seop Sim, Heejin Park, Kunsoo Park:
Constructing suffix arrays in linear time. 126-142 - Pang Ko, Srinivas Aluru:
Space efficient linear time construction of suffix arrays. 143-156 - Gonzalo Navarro, Erkki Sutinen, Jorma Tarhio:
Indexing text with approximate q-grams. 157-175 - Raphaël Clifford:
Distributed suffix trees. 176-197
- Maxime Crochemore, Costas S. Iliopoulos, Gonzalo Navarro, Yoan J. Pinzón, Alejandro Salinger:
Bit-parallel (delta, gamma)-matching and suffix automata. 198-214 - Heikki Hyyrö:
Bit-parallel approximate string matching algorithms with transposition. 215-229 - Nadia Nedjah, Luiza de Macedo Mourelle:
More efficient left-to-right matching for overlapping pattern. 230-247 - Kjell Lemström, Veli Mäkinen:
On minimizing pattern splitting in multi-track string matching. 248-266 - Kjell Lemström, Gonzalo Navarro, Yoan J. Pinzón:
Practical algorithms for transposition-invariant string-matching. 267-292
- Johann Pelfrêne, Saïd Abdeddaïm, Joël Alexandre:
Extracting approximate patterns. 293-320 - Mohamed Ibrahim Abouelhoda, Enno Ohlebusch:
Chaining algorithms for multiple genome comparison. 321-341 - Maria Emília Telles Walter, Mauro C. Sobrinho, Eugenia T. G. Oliveira, Lorena S. Soares, Adilton G. Oliveira, Thelmo E. S. Martins, Tiago M. Fonseca:
Improving the algorithm of Bafna and Pevzner for the problem of sorting by transpositions: a practical approach. 342-361 - Olivier Elemento, Olivier Gascuel:
An exact and polynomial distance-based algorithm to reconstruct single copy tandem duplication trees. 362-374 - Behshad Behzadi, Jean-Marc Steyaert:
An improved algorithm for generalized comparison of minisatellites. 375-389
- François Nicolas, Eric Rivals:
Hardness results for the center and median string problems under the weighted and unweighted edit distances. 390-415 - Hiroshi Sakamoto:
A fully linear-time approximation algorithm for grammar-based compression. 416-430 - Gabriel Valiente:
Constrained tree inclusion. 431-447 - Serge Dulucq, Hélène Touzet:
Decomposition algorithms for the tree edit distance problem. 448-471
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-22 20:02 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:
