The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Process. Lett.
2004, volume: 92, number: 2

  1. Atsuko Yamaguchi, Kiyoko F. Aoki, Hiroshi Mamitsuka
    Finding the maximum common subgraph of a partial k-tree and a graph with a polynomially bounded number of spanning trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:92, n:2, pp:57-63 [Journal]
  2. Andrzej Szepietowski, Monika Targan
    A note on the oriented chromatic number of grids. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:92, n:2, pp:65-70 [Journal]
  3. Pascal Ochem
    Oriented colorings of triangle-free planar graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:92, n:2, pp:71-76 [Journal]
  4. S. Fossé, Gwénaël Richomme
    Some characterizations of Parikh matrix equivalent binary words. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:92, n:2, pp:77-82 [Journal]
  5. Hagen Völzer
    A constructive proof for FLP. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:92, n:2, pp:83-87 [Journal]
  6. Giorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Th. Paschos
    Algorithms for the On-Line Quota Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:92, n:2, pp:89-94 [Journal]
  7. Maciej Kurowski
    A 1.235 lower bound on the number of points needed to draw all n-vertex planar graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:92, n:2, pp:95-98 [Journal]
  8. Heum-Geun Kang, Jun-Ki Min, Seok-Ju Chun, Chin-Wan Chung
    A compression method for prefix-sum cubes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:92, n:2, pp:99-105 [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