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=532
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A comparison of performance measures via online search
Joan Boyar
,
Kim S. Larsen
,
Abyayananda Maiti
Theoretical Computer Science
532
, 2014, pp. 2-13
Fast relative Lempel-Ziv self-index for similar sequences
Huy Hoang Do
,
Jesper Jansson
,
Kunihiko Sadakane
,
Wing-Kin Sung
Theoretical Computer Science
532
, 2014, pp. 14-30
Voronoi diagram with visual restriction
Chenglin Fan
,
Jun Luo
,
Wencheng Wang
,
Binhai Zhu
Theoretical Computer Science
532
, 2014, pp. 31-39
A simple optimal binary representation of mosaic floorplans and Baxter permutations
Bryan Dawei He
Theoretical Computer Science
532
, 2014, pp. 40-50
On the complexity of the black-and-white coloring problem on some classes of perfect graphs
Ton Kloks
,
Sheung-Hung Poon
,
Feng-Ren Tsai
,
Yue-Li Wang
Theoretical Computer Science
532
, 2014, pp. 51-63
Bandwidth consecutive multicolorings of graphs
Kazuhide Nishikawa
,
Takao Nishizeki
,
Xiao Zhou
Theoretical Computer Science
532
, 2014, pp. 64-72
Minimization of the maximum distance between the two guards patrolling a polygonal region
Xuehou Tan
,
Bo Jiang
Theoretical Computer Science
532
, 2014, pp. 73-79
Succinct strictly convex greedy drawing of 3-connected plane graphs
Jiun-Jie Wang
,
Xin He
Theoretical Computer Science
532
, 2014, pp. 80-90