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=500
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Better bounds on online unit clustering
Martin R. Ehmsen
,
Kim S. Larsen
Theoretical Computer Science
500
, 2013, pp. 1-24
The complexity of
Free-Flood-It
on
2\times n
boards
Kitty Meeks
,
Alexander Scott
Theoretical Computer Science
500
, 2013, pp. 25-43
Bandwidth and low dimensional embedding
Yair Bartal
,
Douglas E. Carroll
,
Adam Meyerson
,
Ofer Neiman
Theoretical Computer Science
500
, 2013, pp. 44-56
Introducing privileged words: Privileged complexity of Sturmian words
Jarkko Peltomäki
Theoretical Computer Science
500
, 2013, pp. 57-67
Optimal random matchings, tours, and spanning trees in hierarchically separated trees
Béla Csaba
,
Thomas A. Plick
,
Ali Shokoufandeh
Theoretical Computer Science
500
, 2013, pp. 68-89
A super-stabilizing
\log (n)
-approximation algorithm for dynamic Steiner trees
Lélia Blin
,
Maria Potop-Butucaru
,
Stephane Rovedakis
Theoretical Computer Science
500
, 2013, pp. 90-112