Journals in DBLP

Inf. Process. Lett.
2002, volume: 81, number: 5

1. 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:231-237 [Journal]
   
2. Dong-Ho Lee, Hyoung-Joo Kim
   An efficient nearest neighbor search in high-dimensional data spaces. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:81, n:5, pp:239-246 [Journal]
   
3. Refael Hassin, Shlomi Rubinstein
   A 7/8-approximation algorithm for metric Max TSP. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:81, n:5, pp:247-251 [Journal]
   
4. Alexander Meduna, Dusan Kolar
   Homogeneous grammars with a reduced number of non-context-free productions. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:81, n:5, pp:253-257 [Journal]
   
5. 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:259-264 [Journal]
   
6. Jae-Ha Lee, Sang-Min Park, Kyung-Yong Chwa
   Simple algorithms for searching a polygon with flashlights. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:81, n:5, pp:265-270 [Journal]
   
7. 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:271-276 [Journal]
   
8. 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:277-282 [Journal]
   
9. 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:283-288 [Journal]