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=448
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
NP
-completeness and
APX
-completeness of restrained domination in graphs
Lei Chen
,
Weiming Zeng
,
Changhong Lu
Theoretical Computer Science
448
, 2012, pp. 1-8
Efficient methods for selfish network design
Dimitris Fotakis
,
Alexis C. Kaporis
,
Paul G. Spirakis
Theoretical Computer Science
448
, 2012, pp. 9-20
Weakly unambiguous morphisms
Dominik D. Freydenberger
,
Hossein Nevisi
,
Daniel Reidenbach
Theoretical Computer Science
448
, 2012, pp. 21-40
Polynomial characteristic sets for DFA identification
Pedro García
,
Damián López
,
Manuel Vázquez de Parga
Theoretical Computer Science
448
, 2012, pp. 41-46
An
O(m(m+n\log n)\log(nC))
-time algorithm to solve the minimum cost tension problem
Mehdi Ghiyasvand
Theoretical Computer Science
448
, 2012, pp. 47-55
Arithmetic circuits: The chasm at depth four gets wider
Pascal Koiran
Theoretical Computer Science
448
, 2012, pp. 56-65
An extended Earley's algorithm for Petri net controlled grammars without
\lambda
rules and cyclic rules
Taishin Y. Nishida
Theoretical Computer Science
448
, 2012, pp. 66-79
Distance transform computation for digital distance functions
Robin Strand
,
Nicolas Normand
Theoretical Computer Science
448
, 2012, pp. 80-93
A note on the paper ``On Brlek-Reutenauer conjecture''
Bojan Bas̑ić
Theoretical Computer Science
448
, 2012, pp. 94-96