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=516
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A loop-free shortest-path routing algorithm for dynamic networks
Gianlorenzo D'Angelo
,
Mattia D'Emidio
,
Daniele Frigioni
Theoretical Computer Science
516
, 2014, pp. 1-19
Vertex Nim played on graphs
Eric Duchêne
,
Gabriel Renault
Theoretical Computer Science
516
, 2014, pp. 20-27
(n-3)
-edge-fault-tolerant weak-pancyclicity of
(n,k)
-star graphs
Dyi-Rong Duh
,
Tzu-Lung Chen
,
Yue-Li Wang
Theoretical Computer Science
516
, 2014, pp. 28-39
Multidimensional cellular automata: Closing property, quasi-expansivity, and (un)decidability issues
Alberto Dennunzio
,
Enrico Formenti
,
Michael Weiss
Theoretical Computer Science
516
, 2014, pp. 40-59
Approximability of the vertex cover problem in power-law graphs
Mikael Gast
,
Mathias Hauptmann
Theoretical Computer Science
516
, 2014, pp. 60-70
\beta
-expansion and transcendence in
\mathbb F_q((x^{-1}))
-star
F. Abbes
,
M. Hbaib
,
M. Merkhi
Theoretical Computer Science
516
, 2014, pp. 71-77
On atomic structure of
P_5
-free subclasses and Maximum Weight Independent Set problem
T. Karthick
Theoretical Computer Science
516
, 2014, pp. 78-85
A
9k
kernel for nonseparating independent set in planar graphs
Łukasz Kowalik
,
Marcin Mucha
Theoretical Computer Science
516
, 2014, pp. 86-95
Fast recognition of doubled graphs
Frédéric Maffray
Theoretical Computer Science
516
, 2014, pp. 96-100
Parsing by matrix multiplication generalized to Boolean grammars
Alexander Okhotin
Theoretical Computer Science
516
, 2014, pp. 101-120
Adaptivity in the stochastic blackjack knapsack problem
Asaf Levin
,
Aleksander Vainer
Theoretical Computer Science
516
, 2014, pp. 121-126
One-sided random context grammars with a limited number of right random context rules
Alexander Meduna
,
Petr Zemek
Theoretical Computer Science
516
, 2014, pp. 127-132
Edge coloring of planar graphs which any two short cycles are adjacent at most once
Wei-Ping Ni
,
Jian-Liang Wu
Theoretical Computer Science
516
, 2014, pp. 133-138