|
|
Journals in DBLP
Networks
2005, volume: 45, number: 4
- Fatma Gzara, Jean-Louis Goffin
Exact solution of the centralized network design problem on directed graphs. [Citation Graph (0, 0)][DBLP]
Networks, 2005, v:45, n:4, pp:181-192 [Journal]
- Yingjie Wang, Jianhua Li, Ling Tie
A simple protocol for deniable authentication based on ElGamal cryptography. [Citation Graph (0, 0)][DBLP]
Networks, 2005, v:45, n:4, pp:193-194 [Journal]
- Patrizia Beraldi, Gianpaolo Ghiani, Gilbert Laporte, Roberto Musmanno
Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem. [Citation Graph (0, 0)][DBLP]
Networks, 2005, v:45, n:4, pp:195-198 [Journal]
- Belén Melián-Batista, Manuel Laguna, José A. Moreno-Pérez
Minimizing the cost of placing and sizing wavelength division multiplexing and optical crossconnect equipment in a telecommunications network. [Citation Graph (0, 0)][DBLP]
Networks, 2005, v:45, n:4, pp:199-209 [Journal]
- Nawarat Ananchuen, Michael D. Plummer
Matchings in 3-vertex-critical graphs: The even case. [Citation Graph (0, 0)][DBLP]
Networks, 2005, v:45, n:4, pp:210-213 [Journal]
- Yana Kortsarts, Guy Kortsarz, Zeev Nutov
Greedy approximation algorithms for directed multicuts. [Citation Graph (0, 0)][DBLP]
Networks, 2005, v:45, n:4, pp:214-217 [Journal]
- Fu-Hsing Wang, Cheng-Ju Hsu, Jen-Chih Tsai
Minimal feedback vertex sets in directed split-stars. [Citation Graph (0, 0)][DBLP]
Networks, 2005, v:45, n:4, pp:218-223 [Journal]
- Jae-Hoon Kim, Kyung-Yong Chwa
Optimal broadcasting with universal lists based on competitive analysis. [Citation Graph (0, 0)][DBLP]
Networks, 2005, v:45, n:4, pp:224-231 [Journal]
- Toshihide Ibaraki, Yann Vaxès, Xiao-guang Yang
Lowering eccentricity of a tree by node upgrading. [Citation Graph (0, 0)][DBLP]
Networks, 2005, v:45, n:4, pp:232-239 [Journal]
|
