Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 52
Volume 52, Number 1, August 2008
- Matthew D. Bailey, Robert L. Smith, Jeffrey M. Alden:
A Reach and Bound algorithm for acyclic dynamic-programming networks. 1-7 - Walid Ben-Ameur, José Neto:
Spectral bounds for the maximum cut problem. 8-13 - Thomas C. Sharkey
, H. Edwin Romeijn:
A simplex algorithm for minimum-cost network-flow problems in infinite networks. 14-31 - Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger:
The computational complexity of graph contractions II: Two tough polynomially solvable cases. 32-56
Volume 52, Number 2, September 2008
- Joanna Bauer, Dag Haugland, Di Yuan:
Analysis and computational study of several integer programming formulations for minimum-energy multicasting in wireless ad hoc networks. 57-68 - Xuerong Yong, Yuanping Zhang, Mordecai J. Golin:
The number of spanning trees in a class of double fixed-step loop networks. 69-77 - Min Lü, Chao Wu, Guo-Liang Chen, Cheng Lv:
On super connectivity of Cartesian product graphs. 78-87 - Takeshi Shirabe:
Minimum work paths in elevated networks. 88-97 - Hadas Shachnai, Lisa Zhang, Tomomi Matsui:
Exact algorithms for the master ring problem. 98-107
Volume 52, Number 3, October 2008
- J. Cole Smith:
Preface. 109-110 - Feng Pan, David P. Morton:
Minimizing a stochastic maximum-reliability path. 111-119 - Udom Janjarassuk, Jeff T. Linderoth:
Reformulation and sampling to solve a stochastic network interdiction problem. 120-132 - Halil Bayrak, Matthew D. Bailey:
Shortest path network interdiction with asymmetric information. 133-140 - Asuman E. Ozdaglar:
Price competition with elastic traffic. 141-155 - Arnon Dagan, Shmuel Gal:
Network search games, with arbitrary searcher starting point. 156-161 - Steve Alpern:
Hide-and-seek games on a tree to which Eulerian networks are attached. 162-166 - Paola Flocchini, Miao Jun Huang, Flaminia L. Luccio:
Decontamination of hypercubes by mobile agents. 167-178
Volume 52, Number 4, December 2008
- Bruce L. Golden, Douglas R. Shier:
Editorial: 2007 Glover-Klingman Prize winners. 179 - Jyhmin Kuo, Hung-Lin Fu:
On the diameter of the generalized undirected de Bruijn graphs UGB(n, m), n2 < m <= n3. 180-182 - Bernhard Fuchs:
On the hardness of range assignment problems. 183-195 - Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela:
Conditional diameter saturated graphs. 196-201 - Chao Yang, Jun-Ming Xu:
Reliability of interconnection networks modeled by Cartesian product digraphs. 202-205 - Peter Broström, Kaj Holmberg:
Valid cycles: A source of infeasibility in open shortest path first routing. 206-215 - Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco:
Approximation bounds for Black Hole Search problems. 216-226 - Mourad Baïou, Francisco Barahona:
A linear programming approach to increasing the weight of all minimum spanning trees. 227-234 - Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou:
Competitive algorithms and lower bounds for online randomized call control in cellular networks. 235-251 - Dieter Rautenbach, Lutz Volkmann:
Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles. 252-255 - W. Matthew Carlyle, Johannes O. Royset, R. Kevin Wood:
Lagrangian relaxation and enumeration for solving constrained shortest-path problems. 256-270 - Jørgen Bang-Jensen, Tibor Jordán:
On persistent directed graphs. 271-276 - Bey-Chi Lin, Chin-Tau Lea:
Multirate nonblocking multicast Log2(N, m, p) networks. 277-286 - Julie Christophe, Sophie Dewez, Jean-Paul Doignon, Gilles Fasbender, Philippe Grégoire, David Huygens, Martine Labbé, Sourour Elloumi, Hadrien Mélot, Hande Yaman:
Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships. 287-298 - Charles J. Colbourn, Gaetano Quattrocchi, Violet R. Syrotiuk:
Lower bounds for two-period grooming via linear programming duality. 299-306 - Charles J. Colbourn, Gaetano Quattrocchi, Violet R. Syrotiuk:
Grooming for two-period optical networks. 307-324 - Gennaro Cordasco, Luisa Gargano, Alberto Negro, Vittorio Scarano, Mikael Hammar:
F-Chord: Improved uniform routing on Chord. 325-332
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 2024-04-17 20:30 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:
