The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Process. Lett.
2006, volume: 100, number: 3

  1. Kimmo Fredriksson, Maxim Mozgovoy
    Efficient parameterized string matching. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:100, n:3, pp:91-96 [Journal]
  2. Alexandre Pinlou, Eric Sopena
    Oriented vertex and arc colorings of outerplanar graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:100, n:3, pp:97-104 [Journal]
  3. Tatsuya Akutsu
    A relation between edit distance for ordered trees and edit distance for Euler strings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:100, n:3, pp:105-109 [Journal]
  4. Xianchao Zhang, Weifa Liang, He Jiang
    Flow equivalent trees in undirected node-edge-capacitated planar graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:100, n:3, pp:110-115 [Journal]
  5. Andre Gronemeier
    A note on the decoding complexity of error-correcting codes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:100, n:3, pp:116-119 [Journal]
  6. Asish Mukhopadhyay, Samidh Chatterjee, Benjamin J. Lafreniere
    On the All-Farthest-Segments problem for a planar set of points. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:100, n:3, pp:120-123 [Journal]
  7. Artiom Alhazov
    P systems without multiplicities of symbol-objects. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:100, n:3, pp:124-129 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002