Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=432
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fast algorithms for computing the constrained LCS of run-length encoded strings
Hsing-Yen Ann
,
Chang-Biau Yang
,
Chiou-Ting Tseng
,
Chiou-Yi Hor
Theoretical Computer Science
432
, 2012, pp. 1-9
``Almost stable'' matchings in the Roommates problem with bounded preference lists
Péter Biró
,
David F. Manlove
,
Eric J. McDermid
Theoretical Computer Science
432
, 2012, pp. 10-20
Constructing partial words with subword complexities not achievable by full words
F. Blanchet-Sadri
,
Aleksandar Chakarov
,
Lucas Manuelli
,
Jarett Schwartz
,
Slater Stich
Theoretical Computer Science
432
, 2012, pp. 21-27
Efficient retrieval of approximate palindromes in a run-length encoded string
Kuan-Yu Chen
,
Ping-Hui Hsu
,
Kun-Mao Chao
Theoretical Computer Science
432
, 2012, pp. 28-37
Influence of tree topology restrictions on the complexity of haplotyping with missing data
Michael Elberfeld
,
Ilka Schnoor
,
Till Tantau
Theoretical Computer Science
432
, 2012, pp. 38-51
Non-lattice-periodic tilings of
\mathbb R^3
by single polycubes
I. Gambini
,
L. Vuillon
Theoretical Computer Science
432
, 2012, pp. 52-57
On the complexity of the edge-disjoint min-min problem in planar digraphs
Longkun Guo
,
Hong Shen
Theoretical Computer Science
432
, 2012, pp. 58-63
On mutual concavity and strategically-zero-sum bimatrix games
Spyros Kontogiannis
,
Paul Spirakis
Theoretical Computer Science
432
, 2012, pp. 64-76
A new geometric approach to Sturmian words
Kaisa Matomäki
,
Kalle Saari
Theoretical Computer Science
432
, 2012, pp. 77-84
Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism
Arto Salomaa
Theoretical Computer Science
432
, 2012, pp. 85-93
Marked D0L systems and the
2n
-conjecture
Juha Honkala
Theoretical Computer Science
432
, 2012, pp. 94-97