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
[2]
Hilfe
Suche: Journal=Inf.~Process.~Lett. AND Volume=81
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The
NP
-completeness of
(1,r)
-subcolorability of cubic graphs
Hoàng-Oanh Le
,
Van Bang Le
Information Processing Letters
81
(3), 2002, pp. 157-162
Perfect code is
W[1]
-complete
Marco Cesati
Information Processing Letters
81
(3), 2002, pp. 163-168
Comparison of two code scalability tests
Gordon Lyon
Information Processing Letters
81
(3), 2002, pp. 169-174
Complexity of homomorphisms to direct products of graphs
Judit Büki
,
Csaba Szabó
Information Processing Letters
81
(4), 2002, pp. 175-178
A proof method for the correctness of modularized 0CFA
Oukseh Lee
,
Kwangkeun Yi
,
Yunheung Paek
Information Processing Letters
81
(4), 2002, pp. 179-185
Pancyclicity of recursive circulant graphs
Toru Araki
,
Yukio Shibata
Information Processing Letters
81
(4), 2002, pp. 187-190
4-edge-coloring graphs of maximum degree 3 in linear time
San Skulrattanakulchai
Information Processing Letters
81
(4), 2002, pp. 191-195
The expected complexity of Prim's minimum spanning tree algorithm
Chip Martel
Information Processing Letters
81
(4), 2002, pp. 197-201
Algorithms for maximum weight induced paths
Fanica Gavril
Information Processing Letters
81
(4), 2002, pp. 203-208
On enumeration of catastrophic fault patterns
Soumen Maity
,
Bimal K. Roy
,
Amiya Nayak
Information Processing Letters
81
(4), 2002, pp. 209-212
Randomized splay trees: Theoretical and experimental results
Susanne Albers
,
Marek Karpinski
Information Processing Letters
81
(4), 2002, pp. 213-221
On the minimum size of visibility graphs
Alfredo García Olaverri
,
Ferran Hurtado
,
Marc Noy
,
Javier Tejel
Information Processing Letters
81
(4), 2002, pp. 223-230
On a characterization of the standard Gray code by using its edge type on a hypercube
Zenji Kobayashi
,
Takeshi Sekiguchi
Information Processing Letters
81
(5), 2002, pp. 231-237
An efficient nearest neighbor search in high-dimensional data spaces
Dong-Ho Lee
,
Hyoung-Joo Kim
Information Processing Letters
81
(5), 2002, pp. 239-246
A
\frac{7}{8}
-approximation algorithm for metric MAX TSP
Refael Hassin
,
Shlomi Rubinstein
Information Processing Letters
81
(5), 2002, pp. 247-251
Homogeneous grammars with a reduced number of non-context-free productions
A. Meduna
,
D. Koláȓ
Information Processing Letters
81
(5), 2002, pp. 253-257
On the fatness of Minkowski sums
Mark de Berg
,
A. Frank van der Stappen
Information Processing Letters
81
(5), 2002, pp. 259-264
Simple algorithms for searching a polygon with flashlights
Jae-Ha Lee
,
Sang-Min Park
,
Kyung-Yong Chwa
Information Processing Letters
81
(5), 2002, pp. 265-270
Efficient minimum spanning tree construction wothout Delaunay triangulation
Hai Zhou
,
Narendra Shenoy
,
William Nicholls
Information Processing Letters
81
(5), 2002, pp. 271-276
Improved lower bound on the Shannon capacity of
C_7
Aleksander Vesel
,
Janez Z̑erovnik
Information Processing Letters
81
(5), 2002, pp. 277-282
An optimal algorithm for reporting visible rectangles
N. Kitsios
,
C. Makris
,
S. Sioutas
,
A. Tsakalidis
,
J. Tsaknakis
,
B. Vassiliadis
Information Processing Letters
81
(5), 2002, pp. 283-288
Algorithms for transitive closure
A. Koubková
,
V. Koubek
Information Processing Letters
81
(6), 2002, pp. 289-296
On an on-line scheduling problem for parallel jobs
Edwin Naroska
,
Uwe Schwiegelshohn
Information Processing Letters
81
(6), 2002, pp. 297-304
An efficient decoding technique for Huffman codes
Rezaul Alam Chowdhury
,
M. Kaykobad
,
Irwin King
Information Processing Letters
81
(6), 2002, pp. 305-308
There exist oriented planar graphs with oriented chromatic number at least sixteen
Éric Sopena
Information Processing Letters
81
(6), 2002, pp. 309-312
Seiten
<
1
2
3
>