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=472
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Linearly many faults in dual-cube-like networks
Ariana Angjeli
,
Eddie Cheng
,
László Lipták
Theoretical Computer Science
472
, 2013, pp. 1-8
On some coloring problems in grids
Marc Demange
,
Dominique De Werra
Theoretical Computer Science
472
, 2013, pp. 9-27
Exploring an unknown dangerous graph using tokens
Stefan Dobrev
,
Paola Flocchini
,
Rastislav Královic̑
,
Nicola Santoro
Theoretical Computer Science
472
, 2013, pp. 28-45
Hamiltonian connectivity of restricted hypercube-like networks under the conditional fault model
Qiang Dong
,
Junlin Zhou
,
Yan Fu
,
Hui Gao
Theoretical Computer Science
472
, 2013, pp. 46-59
Optimal memory-aware Sensor Network Gossiping (or how to break the Broadcast lower bound)
Martín Farach-Colton
,
Antonio Fernández Anta
,
Miguel A. Mosteiro
Theoretical Computer Science
472
, 2013, pp. 60-80
Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable
Michael Fellows
,
Tobias Friedrich
,
Danny Hermelin
,
Nina Narodytska
,
Frances Rosamond
Theoretical Computer Science
472
, 2013, pp. 81-89
Winner-imposing strategyproof mechanisms for multiple Facility Location games
Dimitris Fotakis
,
Christos Tzamos
Theoretical Computer Science
472
, 2013, pp. 90-103
On the complexity of deciding degeneracy in a bimatrix game with sparse payoff matrix
Ye Du
Theoretical Computer Science
472
, 2013, pp. 104-109