The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Stefano Pallottino: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Paolo Dell'Olmo, Pierre Hansen, Stefano Pallottino, Giovanni Storchi
    On uniform k-partition problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:150, n:1-3, pp:121-139 [Journal]
  2. Giorgio Gallo, Giustino Longo, Stefano Pallottino
    Directed Hypergraphs and Applications. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:42, n:2, pp:177-201 [Journal]
  3. Stefano Pallottino, Giovanni M. Sechi, Paola Zuddas
    A DSS for water resources management under uncertainty by scenario analysis. [Citation Graph (0, 0)][DBLP]
    Environmental Modelling and Software, 2005, v:20, n:8, pp:1031-1042 [Journal]
  4. Ravindra K. Ahuja, James B. Orlin, Stefano Pallottino, Maria Grazia Scutellà
    Dynamic shortest paths minimizing travel times and costs. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:41, n:4, pp:197-205 [Journal]
  5. Stefano Pallottino, Roberto Tadei
    Foreword. [Citation Graph (0, 0)][DBLP]
    Networks, 2004, v:44, n:2, pp:59-60 [Journal]
  6. Stefano Pallottino, Maria Grazia Scutellà
    Dual algorithms for the shortest path tree problem. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:29, n:2, pp:125-133 [Journal]
  7. Maria Paola Scaparra, Stefano Pallottino, Maria Grazia Scutellà
    Large-scale local search heuristics for the capacitated vertex p-center problem. [Citation Graph (0, 0)][DBLP]
    Networks, 2004, v:43, n:4, pp:241-255 [Journal]
  8. Stefano Pallottino, Maria Grazia Scutellà
    A new algorithm for reoptimizing shortest paths when the arc costs change. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:2, pp:149-160 [Journal]
  9. Changming Sun, Stefano Pallottino
    Circular shortest path in images. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 2003, v:36, n:3, pp:709-719 [Journal]
  10. Stefano Pallottino, Tommaso Toffoli
    An Efficient Algorithm for Determining the Length of the Longest Dead Path in a ``LIFO'' Branch-and-Bound Exploration Schema. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1981, v:7, n:4, pp:498-504 [Journal]

  11. The stack loading and unloading problem. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.008secs
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