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.
Weighted connected
k
-domination and weighted
k
-dominating clique in distance-hereditary graphs
Hong-Gwa Yeh
,
Gerard J. Chang
Theoretical Computer Science
263
(1-2), 2001, pp. 3-8
Notes on acyclic orientations and the shelling lemma
Komei Fukuda
,
Alain Prodon
,
Tadashi Sakuma
Theoretical Computer Science
263
(1-2), 2001, pp. 9-16
On point covers of
c
-oriented polygons
Frank Nielsen
Theoretical Computer Science
263
(1-2), 2001, pp. 17-29
On the number of inducitively minimal geometries
Philippe Cara
,
Serge Lehman
,
Dimitrii V. Pasechnik
Theoretical Computer Science
263
(1-2), 2001, pp. 31-35
On computing Hilbert bases via the Elliot-MacMahon algorithm
Dmitrii V. Pasechnik
Theoretical Computer Science
263
(1-2), 2001, pp. 37-46
Characterizing bipartite Toeplitz graphs
Reinhardt Euler
Theoretical Computer Science
263
(1-2), 2001, pp. 47-58
Graph colourings and partitions
V. Yegnanarayanan
Theoretical Computer Science
263
(1-2), 2001, pp. 59-74
Ramsey numbers for tournaments
Yannis Manoussakis
,
Zsolt Tuza
Theoretical Computer Science
263
(1-2), 2001, pp. 75-85
Generalized and geometric Ramsey numbers for cycles
Gyula Károlyi
,
Vera Rosta
Theoretical Computer Science
263
(1-2), 2001, pp. 87-98
A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs
Guillaume Damiand
,
Michel Habib
,
Christophe Paul
Theoretical Computer Science
263
(1-2), 2001, pp. 99-111
Finding the shortest boundary guard of a simple polygon
Bor-Kuan Lu
,
Fang-Rong Hsu
,
Chuan Yi Tang
Theoretical Computer Science
263
(1-2), 2001, pp. 113-121
Mod 3 arithmetic on triangulated Riemann surfaces
E.G. Belaga
Theoretical Computer Science
263
(1-2), 2001, pp. 123-137
Channel graphs of bit permutation networks
Li-Da Tong
,
Frank K. Hwang
,
Gerard J. Chang
Theoretical Computer Science
263
(1-2), 2001, pp. 139-143
Uniform asymptotics of some Abel sums arising in coding theory
Hsien-Kuei Hwang
Theoretical Computer Science
263
(1-2), 2001, pp. 145-158
On the landscape ruggedness of the quadratic assignment problem
Eric Angel
,
Vassilis Zissimopoulos
Theoretical Computer Science
263
(1-2), 2001, pp. 159-172
Efficient reconfiguration algorithms of de Bruijn and Kautz networks into linear arrays
Rabah Harbane
,
Marie-Claude Heydemann
Theoretical Computer Science
263
(1-2), 2001, pp. 173-189
Convexity and global optimization: A theoretical link
A. Quilliot
Theoretical Computer Science
263
(1-2), 2001, pp. 191-204
Note on Ramsey theorems for spatial graphs
Seiya Negami
Theoretical Computer Science
263
(1-2), 2001, pp. 205-210
A complementary survey on double-loop networks
F.K. Hwang
Theoretical Computer Science
263
(1-2), 2001, pp. 211-229
A simulation of cellular automata on hexagons by cellular automata on rings
Bruno Martin
Theoretical Computer Science
263
(1-2), 2001, pp. 231-234
Combinatorial optimization algorithms for radio network planning
Patrice Calégari
,
Frédéric Guidec
,
Pierre Kuonen
,
Frank Nielsen
Theoretical Computer Science
263
(1-2), 2001, pp. 235-245
Neighborhood unions and regularity in graphs
O. Favaron
,
Y. Redouane
Theoretical Computer Science
263
(1-2), 2001, pp. 247-254
Partitioning vertices of 1-tough graphs into paths
Cristina Bazgan
,
Amel Harkat-Benhamdine
,
Hao Li
,
Mariusz Woźniak
Theoretical Computer Science
263
(1-2), 2001, pp. 255-261
Voronoi diagrams on piecewise flat surfaces and an application to biological growth
C. Indermitte
,
Th.M. Liebling
,
M. Troyanov
,
H. Clémençon
Theoretical Computer Science
263
(1-2), 2001, pp. 263-274
Finite-dimensional
T
-colorings of graphs
Roger K. Yeh
Theoretical Computer Science
263
(1-2), 2001, pp. 275-281
Seiten 1
2
>