![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Journal of Discrete Algorithms, Volume 10
Volume 10, January 2012
- Jacqueline W. Daykin
, Bill Smyth, Lynette van Zijl:
Editorial. 1 - 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 - Andrew Baker, Antoine Deza, Frantisek Franek:
On the structure of run-maximal strings. 10-14 - 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 - Sumaiya Nazeen, M. Sohel Rahman
, Rezwana Reaz:
Indeterminate string inference algorithms. 23-34
- 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 - Michal Walicki, Sjur K. Dyrkolbotn:
Finding kernels or solving SAT. 146-164 - Dirk Sudholt, Christian Thyssen:
Running time analysis of Ant Colony Optimization for shortest path problems. 165-180
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.