Journal of Discrete Algorithms, Volume 10
Volume 10, January 2012
- Travis Gagie: Bounds from a card trick. 2-4
- Tanaeem M. Moosa, M. Sohel Rahman: Sub-quadratic time and linear space data structures for permutation matching in binary strings. 5-9
- Costas S. Iliopoulos, Derrick G. Kourie, Laurent Mouchard, Themba K. Musombuka, Solon P. Pissis, Corné de Ridder: An algorithm for mapping short reads to a dynamically changing genomic sequence. 15-22
- Hadas Shachnai, Tami Tamir: Approximation schemes for generalized two-dimensional vector packing with application to data placement. 35-48
- Sounaka Mishra: Complexity of majority monopoly and signed domination problems. 49-60
- Oliver Schaudt: On weighted efficient total domination. 61-69
- Omid Amini, Ignasi Sau, Saket Saurabh: Parameterized complexity of finding small degree-constrained subgraphs. 70-83
- Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara: Random generation and enumeration of bipartite permutation graphs. 84-97
- Ken Habgood, Itamar Arel: A condensation-based application of Cramer's rule for solving large-scale linear systems. 98-109
- Prasad Chebolu, Mary Cryan, Russell Martin: Exact counting of Euler tours for generalized series-parallel graphs. 110-122
- Irena Rusu: New applications of interval generators to genome comparison. 123-139
- Prosenjit Bose, John Howat, Pat Morin: A distribution-sensitive dictionary with low space overhead. 140-145
- Dirk Sudholt, Christian Thyssen: Running time analysis of Ant Colony Optimization for shortest path problems. 165-180
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-17T203403 by the dblp team