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=263
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A combinatorial approach to Golomb forests
Mordecai J. Golin
Theoretical Computer Science
263
(1-2), 2001, pp. 283-304
NP
-completeness for calculating power indices of weighted majority games
Yasuko Matsu
,
Tomomi Matsui
Theoretical Computer Science
263
(1-2), 2001, pp. 305-310
On the covering radius problem for ternary self-dual codes
Michio Ozeki
Theoretical Computer Science
263
(1-2), 2001, pp. 311-332
Independent triangles covering given vertices of a graph
Hao Li
,
Jianping Li
Theoretical Computer Science
263
(1-2), 2001, pp. 333-344
When does a planar bipartite framework admit a continuous deformation?
H. Maehara
,
N. Tokushige
Theoretical Computer Science
263
(1-2), 2001, pp. 345-354
An improvement on a spernerity proof of Horrocks
Szu-En Cheng
,
Ko-Wei Lih
Theoretical Computer Science
263
(1-2), 2001, pp. 355-377
Seiten
<
1
2