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=485
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Simulation relations for pattern matching in directed graphs
Johanna Björklund
,
Lars-Daniel Öhman
Theoretical Computer Science
485
, 2013, pp. 1-15
Abelian-primitive partial words
F. Blanchet-Sadri
,
Nathan Fox
Theoretical Computer Science
485
, 2013, pp. 16-37
Weighted finite automata over hemirings
Manfred Droste
,
Werner Kuich
Theoretical Computer Science
485
, 2013, pp. 38-48
Impartial coloring games
G. Beaulieu
,
K. Burke
,
E. Duchêne
Theoretical Computer Science
485
, 2013, pp. 49-60
Fast balanced partitioning is hard even on grids and trees
Andreas Emil Feldmann
Theoretical Computer Science
485
, 2013, pp. 61-68
Tight complexity bounds for FPT subgraph problems parameterized by the clique-width
Hajo Broersma
,
Petr A. Golovach
,
Viresh Patel
Theoretical Computer Science
485
, 2013, pp. 69-84
Four one-shot learners for regular tree languages and their polynomial characterizability
Anna Kasprzik
Theoretical Computer Science
485
, 2013, pp. 85-106