The SCEAS System
Navigation Menu

Search the dblp DataBase


Hervé Kerivin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Walid Ben-Ameur, Hervé Kerivin
    Networks new economical virtual private. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 2003, v:46, n:6, pp:69-73 [Journal]
  2. Mohamed Didi Biha, Hervé Kerivin, Ali Ridha Mahjoub
    Steiner trees and polyhedra. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:112, n:1-3, pp:101-120 [Journal]
  3. Hervé Kerivin, Ali Ridha Mahjoub
    On survivable network polyhedra. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:290, n:2/3, pp:183-210 [Journal]
  4. Hervé Kerivin, Ali Ridha Mahjoub
    Design of Survivable Networks: A survey. [Citation Graph (0, 0)][DBLP]
    Networks, 2005, v:46, n:1, pp:1-21 [Journal]
  5. Hervé Kerivin, Ali Ridha Mahjoub
    Separation of partition inequalities for the (1, 2)-survivable network design problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2002, v:30, n:4, pp:265-268 [Journal]
  6. Hervé Kerivin, Dritan Nace, Thi-Tuyet-Loan Pham
    Design of capacitated survivable networks with a single facility. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2005, v:13, n:2, pp:248-261 [Journal]

  7. A note on the data-driven capacity of P2P networks [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.002secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002