
Journals in DBLP
 Zenji Kobayashi, Takeshi Sekiguchi
On a characterization of the standard Gray code by using its edge type on a hypercube. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:81, n:5, pp:231237 [Journal]
 DongHo Lee, HyoungJoo Kim
An efficient nearest neighbor search in highdimensional data spaces. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:81, n:5, pp:239246 [Journal]
 Refael Hassin, Shlomi Rubinstein
A 7/8approximation algorithm for metric Max TSP. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:81, n:5, pp:247251 [Journal]
 Alexander Meduna, Dusan Kolar
Homogeneous grammars with a reduced number of noncontextfree productions. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:81, n:5, pp:253257 [Journal]
 Mark de Berg, A. Frank van der Stappen
On the fatness of Minkowski sums. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:81, n:5, pp:259264 [Journal]
 JaeHa Lee, SangMin Park, KyungYong Chwa
Simple algorithms for searching a polygon with flashlights. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:81, n:5, pp:265270 [Journal]
 Hai Zhou, Narendra V. Shenoy, William Nicholls
Efficient minimum spanning tree construction without Delaunay triangulation. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:81, n:5, pp:271276 [Journal]
 Aleksander Vesel, Janez Zerovnik
Improved lower bound on the Shannon capacity of C7. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:81, n:5, pp:277282 [Journal]
 Nectarios Kitsios, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, John Tsaknakis, Bill Vassiliadis
An optimal algorithm for reporting visible rectangles. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:81, n:5, pp:283288 [Journal]
