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=481
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the least number of palindromes contained in an infinite word
Gabriele Fici
,
Luca Q. Zamboni
Theoretical Computer Science
481
, 2013, pp. 1-8
A new filtration method and a hybrid strategy for approximate string matching
Chia Wei Lu
,
Chin Lung Lu
,
R.C.T. Lee
Theoretical Computer Science
481
, 2013, pp. 9-17
Further hardness results on the rainbow vertex-connection number of graphs
Lily Chen
,
Xueliang Li
,
Huishu Lian
Theoretical Computer Science
481
, 2013, pp. 18-23
Boolean nested canalizing functions: A comprehensive analysis
Yuan Li
,
John O. Adeyeye
,
David Murrugarra
,
Boris Aguilar
,
Reinhard Laubenbacher
Theoretical Computer Science
481
, 2013, pp. 24-36
A tight characterization of strategic games with a unique equilibrium
Antoniy Ganchev
,
Lata Narayanan
,
Sunil Shende
Theoretical Computer Science
481
, 2013, pp. 37-50
The Receptor Density Algorithm
Nick D.L. Owens
,
Andrew Greensted
,
Jon Timmis
,
Andy Tyrrell
Theoretical Computer Science
481
, 2013, pp. 51-73
Increasing the minimum degree of a graph by contractions
Petr A. Golovach
,
Marcin Kamiński
,
Daniël Paulusma
,
Dimitrios M. Thilikos
Theoretical Computer Science
481
, 2013, pp. 74-84
Satisfiability of acyclic and almost acyclic CNF formulas
Sebastian Ordyniak
,
Daniel Paulusma
,
Stefan Szeider
Theoretical Computer Science
481
, 2013, pp. 85-99
Cops and invisible robbers: The cost of drunkenness
Athanasios Kehagias
,
Dieter Mitsche
,
Paweƚ Praƚat
Theoretical Computer Science
481
, 2013, pp. 100-120