
Search the dblp DataBase
Hervé Kerivin:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Walid BenAmeur, Hervé Kerivin
Networks new economical virtual private. [Citation Graph (0, 0)][DBLP] Commun. ACM, 2003, v:46, n:6, pp:6973 [Journal]
 Mohamed Didi Biha, Hervé Kerivin, Ali Ridha Mahjoub
Steiner trees and polyhedra. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2001, v:112, n:13, pp:101120 [Journal]
 Hervé Kerivin, Ali Ridha Mahjoub
On survivable network polyhedra. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2005, v:290, n:2/3, pp:183210 [Journal]
 Hervé Kerivin, Ali Ridha Mahjoub
Design of Survivable Networks: A survey. [Citation Graph (0, 0)][DBLP] Networks, 2005, v:46, n:1, pp:121 [Journal]
 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:265268 [Journal]
 Hervé Kerivin, Dritan Nace, ThiTuyetLoan 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:248261 [Journal]
A note on the datadriven capacity of P2P networks [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.002secs
