default search action
Journal of Discrete Algorithms, Volume 34
Volume 34, September 2015
- Hideo Bannai, Solon P. Pissis:
Editorial. 1 - Heikki Hyyrö, Kazuyuki Narisawa, Shunsuke Inenaga:
Dynamic edit distance table under a general weighted cost function. 2-17 - Haoyue Bai, Antoine Deza, Frantisek Franek:
On a lemma of Crochemore and Rytter. 18-22 - Enno Ohlebusch, Timo Beller:
Alphabet-independent algorithms for finding context-sensitive repeats in linear time. 23-36 - Thorsten Ehlers, Florin Manea, Robert Mercas, Dirk Nowotka:
k-Abelian pattern matching. 37-48 - Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen:
A note on the longest common compatible prefix problem for partial words. 49-53 - Sergio De Agostino:
The greedy approach to dictionary-based static text compression on a distributed system. 54-61
- Yu-Hsiang Hsiao, Keh-Ning Chang:
A top down algorithm for constrained tree inclusion. 62-69 - Mitsugu Hirasaka, Kyoung-Tark Kim, Yoshihiro Mizoguchi:
Uniqueness of Butson Hadamard matrices of small degrees. 70-77 - Sanjay Bhattacherjee, Palash Sarkar:
Tree based symmetric key broadcast encryption. 78-107 - Johannes Köbler, Sebastian Kuhnert, Osamu Watanabe:
Interval graph representation with given interval and intersection lengths. 108-117 - Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
On the hardness of full Steiner tree problems. 118-127 - Tobias Friedrich, Christian Hercher:
On the kernel size of clique cover reductions for random intersection graphs. 128-136 - Cong Shi, Huanan Zhang, Chao Qin:
A faster algorithm for the resource allocation problem with convex cost functions. 137-146
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.