default search action
Theoretical Computer Science, Volume 432
Volume 432, May 2012
- Hsing-Yen Ann, Chang-Biau Yang, Chiou-Ting Tseng, Chiou-Yi Hor:
Fast algorithms for computing the constrained LCS of run-length encoded strings. 1-9 - Péter Biró, David F. Manlove
, Eric McDermid:
"Almost stable" matchings in the Roommates problem with bounded preference lists. 10-20 - Francine Blanchet-Sadri, Aleksandar Chakarov, Lucas Manuelli, Jarett Schwartz, Slater Stich:
Constructing partial words with subword complexities not achievable by full words. 21-27 - Kuan-Yu Chen, Ping-Hui Hsu, Kun-Mao Chao
Efficient retrieval of approximate palindromes in a run-length encoded string. 28-37 - Michael Elberfeld, Ilka Schnoor, Till Tantau:
Influence of tree topology restrictions on the complexity of haplotyping with missing data. 38-51 - Ian Gambini, Laurent Vuillon:
Non-lattice-periodic tilings of R3 by single polycubes. 52-57 - Longkun Guo, Hong Shen:
On the complexity of the edge-disjoint min-min problem in planar digraphs. 58-63 - Spyros C. Kontogiannis
On mutual concavity and strategically-zero-sum bimatrix games. 64-76 - Kaisa Matomäki, Kalle Saari:
A new geometric approach to Sturmian words. 77-84 - Arto Salomaa:
Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism. 85-93
- Juha Honkala:
Marked D0L systems and the 2n-conjecture. 94-97
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.
last updated on 2024-12-13 19:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: