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=535
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Latency-bounded target set selection in social networks
Ferdinando Cicalese
,
Gennaro Cordasco
,
Luisa Gargano
,
Martin Milanic̑
,
Ugo Vaccaro
Theoretical Computer Science
535
, 2014, pp. 1-15
Faster algorithms for vertex partitioning problems parameterized by clique-width
Sang-il Oum
,
Sigve Hortemo Sæther
,
Martin Vatshelle
Theoretical Computer Science
535
, 2014, pp. 16-24
An improved parameterized algorithm for the independent feedback vertex set problem
Yinglei Song
Theoretical Computer Science
535
, 2014, pp. 25-30
A family of Nim-like arrays: The Locator Theorem
Lowell Abrams
,
Dena S. Cowen-Morton
Theoretical Computer Science
535
, 2014, pp. 31-37
Two new identity-based threshold ring signature schemes
Lunzhi Deng
,
Jiwen Zeng
Theoretical Computer Science
535
, 2014, pp. 38-45
The algorithmic complexity of bondage and reinforcement problems in bipartite graphs
Fu-Tao Hu
,
Moo Young Sohn
Theoretical Computer Science
535
, 2014, pp. 46-53
Approximation algorithm for the minimum weight connected
k
-subgraph cover problem
Yaping Zhang
,
Yishuo Shi
,
Zhao Zhang
Theoretical Computer Science
535
, 2014, pp. 54-58
Computing degree and class degree
Mahsa Allahbakhshi
Theoretical Computer Science
535
, 2014, pp. 59-64