default search action
Journal of Discrete Algorithms, Volume 17
Volume 17, December 2012
- Laurent Mouchard, Simon J. Puglisi:
Editorial. 1 - Frantisek Franek, Robert C. G. Fuller, Jamie Simpson, William F. Smyth:
More results on overlapping squares. 2-8 - Antoine Deza, Frantisek Franek, Min Jing Liu:
On a conjecture of Erdős for multiplicities of cliques. 9-14 - Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis:
Tree template matching in ranked ordered trees by pushdown automata. 15-23 - Alberto Apostolico, Péter L. Erdös, Ervin Györi, Zsuzsanna Lipták, Cinzia Pizzi:
Efficient algorithms for the periodic subgraphs mining problem. 24-30 - Michalis Christou, Maxime Crochemore, Ondrej Guth, Costas S. Iliopoulos, Solon P. Pissis:
On left and right seeds of a string. 31-44
- Amr Elmasry:
Enumerating trichromatic triangles containing the origin in linear time. 45-50 - Zeev Nutov:
Approximating subset k-connectivity problems. 51-59 - Pierre Charbit, Michel Habib, Nicolas Trotignon, Kristina Vuskovic:
Detecting 2-joins faster. 60-66 - Muhammad Rashed Alam, M. Sohel Rahman:
The substring inclusion constraint longest common subsequence problem can be solved in quadratic time. 67-73 - Jirí Fiala, Marcin Kaminski, Daniël Paulusma:
Detecting induced star-like minors in polynomial time. 74-85 - Dror Rawitz, Shimon Shahar:
Capacitated Arc Stabbing. 86-94 - Cédric Bentz, Marie-Christine Costa, Christophe Picouleau, Bernard Ries, Dominique de Werra:
d-Transversals of stable sets and vertex covers in weighted bipartite graphs. 95-102 - Manish Patil, Rahul Shah, Sharma V. Thankachan:
Succinct representations of weighted trees supporting path queries. 103-108 - Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter:
On position restricted substring searching in succinct space. 109-114
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.