Journals in DBLP

J. Discrete Algorithms
2007, volume: 5, number: 2

1. Alberto Apostolico, Ricardo A. Baeza-Yates, Massimo Melucci
   2004 Symposium on String Processing and Information Retrieval. [Citation Graph (0, 0)][DBLP]
   J. Discrete Algorithms, 2007, v:5, n:2, pp:203- [Journal]
   
2. Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur
   Efficient one-dimensional real scaled matching. [Citation Graph (0, 0)][DBLP]
   J. Discrete Algorithms, 2007, v:5, n:2, pp:205-211 [Journal]
   
3. Rolf Backofen, Sven Siebert
   Fast detection of common sequence structure patterns in RNAs. [Citation Graph (0, 0)][DBLP]
   J. Discrete Algorithms, 2007, v:5, n:2, pp:212-228 [Journal]
   
4. Costas S. Iliopoulos, Katerina Perdikuri, Evangelos Theodoridis, Athanasios K. Tsakalidis, Kostas Tsichlas
   Algorithms for extracting motifs from biological weighted sequences. [Citation Graph (0, 0)][DBLP]
   J. Discrete Algorithms, 2007, v:5, n:2, pp:229-242 [Journal]
   
5. Inbok Lee, Costas S. Iliopoulos, Kunsoo Park
   Linear time algorithm for the longest common repeat problem. [Citation Graph (0, 0)][DBLP]
   J. Discrete Algorithms, 2007, v:5, n:2, pp:243-249 [Journal]
   
6. Sabine Cornelsen, Gabriele Di Stefano
   Track assignment. [Citation Graph (0, 0)][DBLP]
   J. Discrete Algorithms, 2007, v:5, n:2, pp:250-261 [Journal]
   
7. Roee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor
   Cut problems in graphs with a budget constraint. [Citation Graph (0, 0)][DBLP]
   J. Discrete Algorithms, 2007, v:5, n:2, pp:262-279 [Journal]
   
8. Magnus Bordewich, Martin E. Dyer
   Path coupling without contraction. [Citation Graph (0, 0)][DBLP]
   J. Discrete Algorithms, 2007, v:5, n:2, pp:280-292 [Journal]
   
9. Raja Jothi, Balaji Raghavachari
   Approximating the k-traveling repairman problem with repairtimes. [Citation Graph (0, 0)][DBLP]
   J. Discrete Algorithms, 2007, v:5, n:2, pp:293-303 [Journal]
   
10. Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki
    Algorithms for finding distance-edge-colorings of graphs. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:2, pp:304-322 [Journal]
    
11. Tomasz Tyrakowski, Zbigniew Palka
    On the communication complexity of Bar-Yehuda, Goldreich and Itai's randomized broadcasting algorithm. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:2, pp:323-329 [Journal]
    
12. Gilles Didier, Thomas Schmidt, Jens Stoye, Dekel Tsur
    Character sets of strings. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:2, pp:330-340 [Journal]
    
13. Ales Berkopec
    HyperQuick algorithm for discrete hypergeometric distribution. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:2, pp:341-347 [Journal]
    
14. Gill Barequet, Micha Moffie
    On the complexity of Jensen's algorithm for counting fixed polyominoes. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:2, pp:348-355 [Journal]
    
15. Milad Niqui
    Exact arithmetic on the Stern-Brocot tree. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:2, pp:356-379 [Journal]
    
16. Dana Shapira, James A. Storer
    Edit distance with move operations. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:2, pp:380-392 [Journal]