Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 45
Volume 45, Number 1, January 2005
- Antonio Sedeño-Noda
, Carlos González-Martín, Sergio Alonso-Rodríguez:
Solving the undirected minimum cost flow problem with arbitrary costs. 1-3
- Frank K. Hwang, Binwu Zhang:
Strict nonblockingness of reduced shuffle-exchange networks. 4-8 - Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Andrea Vitaletti, Suhas N. Diggavi, S. Muthukrishnan, Thyagarajan Nandagopal:
Parallel scheduling problems in next generation wireless networks. 9-22 - Carme Àlvarez, Maria J. Blesa, Josep Díaz, Maria J. Serna, Antonio Fernández:
Adversarial models for priority-based networks. 23-35 - Ravindra K. Ahuja, Horst W. Hamacher:
A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy. 36-41 - Yingyu Wan, Weifa Liang:
On the minimum number of wavelengths in multicast trees in WDM networks. 42-48
Volume 45, Number 2, March 2005
- Camino Balbuena, Xavier Marcote, Daniela Ferrero:
Diameter vulnerability of iterated line digraphs in terms of the girth. 49-54 - Illya V. Hicks:
Graphs, branchwidth, and tangles! Oh my! 55-60 - Thomas L. Magnanti, S. Raghavan:
Strong formulations for network design problems with connectivity requirements. 61-79 - Xavier Marcote, Camino Balbuena, Josep Fàbrega:
Connectedness of digraphs and graphs under constraints on the conditional diameter. 80-87 - Jian-Hua Yin, Jiong-Sheng Li, Guo-Liang Chen, Cheng Zhong:
On the fault-tolerant diameter and wide diameter of omega-connected graphs. 88-94 - Iris Gaber, Michal Parnas:
All-port line broadcasting in highly connected graphs. 95-103 - Paola Cappanera, Maria Grazia Scutellà:
Balanced paths in acyclic networks: Tractable cases and related approaches. 104-111
Volume 45, Number 3, May 2005
- Camino Balbuena, Xavier Marcote, Pedro García-Vázquez:
On restricted connectivities of permutation graphs. 113-118 - Andreas Baltz, Gerold Jäger, Anand Srivastav:
Constructions of sparse asymmetric connectors with number theoretic methods. 119-124 - Alberto Ceselli, Giovanni Righini:
A branch-and-price algorithm for the capacitated p-median problem. 125-142 - Zevi Miller, Dan Pritikin, Manley Perkel, Ivan Hal Sudborough:
The sequential sum problem and performance bounds on the greedy algorithm for the on-line Steiner problem. 143-164 - Jason I. Brown, Xiaohu Li:
The strongly connected reliability of complete digraphs. 165-168 - Wei Shi, Abdelmadjid Bouabdallah, Pradip K. Srimani:
Leader election in oriented star graphs. 169-179
Volume 45, Number 4, July 2005
- Fatma Gzara, Jean-Louis Goffin:
Exact solution of the centralized network design problem on directed graphs. 181-192 - Yingjie Wang, Jianhua Li, Ling Tie:
A simple protocol for deniable authentication based on ElGamal cryptography. 193-194 - Patrizia Beraldi, Gianpaolo Ghiani, Gilbert Laporte, Roberto Musmanno:
Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem. 195-198 - 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. 199-209 - Nawarat Ananchuen, Michael D. Plummer:
Matchings in 3-vertex-critical graphs: The even case. 210-213 - Yana Kortsarts, Guy Kortsarz, Zeev Nutov:
Greedy approximation algorithms for directed multicuts. 214-217 - Fu-Hsing Wang, Cheng-Ju Hsu, Jen-Chih Tsai:
Minimal feedback vertex sets in directed split-stars. 218-223 - Jae-Hoon Kim, Kyung-Yong Chwa:
Optimal broadcasting with universal lists based on competitive analysis. 224-231 - Toshihide Ibaraki, Yann Vaxès, Xiao Guang Yang:
Lowering eccentricity of a tree by node upgrading. 232-239
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2023-06-01 23:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
