Journal: Networks

Volume 24, Issue 8

409 -- 415Sivakumar Ravada, Alan T. Sherman. 3
417 -- 427Piotr Berman, Andrzej Pelc. Reliable distributed diagnosis for multiprocessor systems with random faults
429 -- 443Hideaki Harada, Zheng Sun, Hiroshi Nagamochi. An exact lower bound on the number of cut-sets in multigraphs
445 -- 454Jeffrey L. Arthur, James O. Frendewey. An algorithm for generating minimum cost network flow problems with specific structure and known optimal solutions

Volume 24, Issue 7

359 -- 367Michael J. Dinneen, Paul R. Hafner. New results for the degree/diameter problem
369 -- 384Warren B. Powell, Raymond K. Cheung. A network recourse decomposition method for dynamic networks with random arc capacities
385 -- 394Yeroon van den Berg, David M. Panton. Personnel shift assignment: Existence conditions and network models
395 -- 407Naoki Katoh, Kazuo Iwano. Efficient algorithms for minimum range cut problems

Volume 24, Issue 6

303 -- 317Gen-Huey Chen, Dyi-Rong Duh. Topological properties, communication, and computation on WK-recursive networks
319 -- 326John D. Carpinelli, A. Yavuz Oruç. Applications of matching and edge-coloring algorithms to routing in clos networks
327 -- 357Zevi Miller, Ivan Hal Sudborough. Compressing grids into small hypercubes

Volume 24, Issue 5

267 -- 271R. P. Swaminathan. A bad submatrix is easy to find
273 -- 276Wenceslas Fernandez de la Vega, Yannis Manoussakis. Computation of the forwarding index via flows: A note
277 -- 284Guifang Wang. A proof of Boesch's conjecture
285 -- 296Antoine Gautier, Frieda Granot. Ripples, complements, and substitutes in singly constrained monotropic parametric network flow problems
297 -- 302Jane N. Hagstrom, Ray Hagstrom, Ross A. Overbeek, Morgan Price, Linus Schrage. Maximum likelihood genetic sequence reconstruction from oligo content

Volume 24, Issue 4

195 -- 205Daniel Bienstock, Oktay Günlük. A degree sequence problem related to network design
207 -- 213Wayne Goddard. Measures of vulnerability-the integrity family
215 -- 224J. E. Beasley, F. Goffinet. A delaunay triangulation-based heuristic for the euclidean steiner problem
225 -- 232James W. Boland, Richard D. Ringeisen. On super i-connected graphs
233 -- 249Leizhen Cai, J. Mark Keil. Spanners in graphs of bounded degree
251 -- 259Olivier Goldschmidt, Patrick Jaillet, Richard Lasota. On reliability of graphs with node failures
261 -- 262Matteo Paris. Note: The diameter of edge domination critical graphs
263 -- 266Ingo Althöfer. Note: Small integral flows need only sparse networks

Volume 24, Issue 3

131 -- 145Jon Lee, Jennifer Ryan. Local bipartite turán graphs and graph partitioning
147 -- 159Konstantinos Kalpakis, Alan T. Sherman. d
161 -- 175Warren B. Powell, Raymond K. Cheung. Stochastic programs over trees with random arc capacities
177 -- 183Evelyne Flandrin, Hao Li. Mengerian properties, hamiltonicity, and claw-free graphs
185 -- 194Thomas Kämpke. A separation decomposition for orders

Volume 24, Issue 2

57 -- 67J. David Fuller, B. Lan. A fast algorithm for bounded generalized processing networks
69 -- 73Olivier Goldschmidt, Alexan Takvorian. An efficient graph planarization two-phase heuristic
75 -- 82Marie-Claude Heydemann, J. C. Meyer, Dominique Sotteau, Jaroslav Opatrny. Forwarding indices of consistent routings and their complexity
83 -- 90Ernest J. Cockayne, Christina M. Mynhardt, Bo Yu. Universal minimal total dominating functions in graphs
91 -- 101Arvind Krishna, Bruce Hajek, Andrea Pietracaprina. Sharper analysis of packet routing on a butterfly
103 -- 108Ding-Zhu Du, Frank K. Hwang, Andrew M. Odlyzko, Yanjun Zhang. Minimal-distance routing for KYKLOS II
109 -- 120Jue Xue. Edge-maximal triangulated subgraphs and heuristics for the maximum clique problem
121 -- 0Noel P. Greis. Operations management: Strategy and analysis, by Lee J. Krajewski and L. P. Ritzman, Addison-Wesley, Reading, MA, 1987, 916 pp., Price: $43.95
121 -- 123Jack Yurkiewicz. Computer models for management science, 3rd ed., by Warren Erikson and Owen Hall, Addison-Wesley, Reading, MA, 1989, 263 pp
123 -- 0Arthur W. Berger. Queueing networks with blocking, edited by H. G. Perros and T. Altiok, North-Holland, Amsterdam, 1989, 358 pp
124 -- 125Moshe B. Rosenwein. Discrete location theory, edited by P. B. Mirchandani and R. L. Francis, John Wiley & Sons, New York, 1990, 555 pp
125 -- 126Edward R. Scheinerman. Foundations of applied combinatorics, by Edward A. Bender and S. Gil Williamson, Addison-Wesley, Reading, MA, 1991, 425 pp
125 -- 0David Madigan. Graphical models in applied multivariate statistics, by J. Whittaker, John Wiley & Sons, New York, 1990, 448 pp. Price: $59.95
126 -- 0Thomas P. Capotosto. Communications networks: A first course, by Jean Walrand, Irwin Inc. and Aksen Associates, Homewood, IL, 1991, 460 pp. Price: $52.95
127 -- 128Pierre L'Ecuyer. Gradient estimation via perturbation analysis, by Paul Glasserman, Kluwer, Boston. MA, 1991, 221 pp
127 -- 0Joseph S. Kaufman. The art of computer systems performance analysis, by R. Jain, John Wiley & Sons. New York, 1991, 685 pp
128 -- 129Shu-Cherng Fang, Sarat C. Puthenpura. Numerical linear algebra and optimization-volume 1, by Philip E. Gill. Walter Murray, and Margaret H. Wright, Addison-Wesley, Redwood City, CA, 1991, 448 pp. Price: $46.25
129 -- 130Rubin Johnson. The stable marriage problem: Structure and algorithms, by Dan Gusfield and Robert Irving, The MIT Press, Cambridge, MA, 1989, 240 pp., $27.50

Volume 24, Issue 1

1 -- 9Chang Sup Sung, Cheol Min Joo. Locating an obnoxious facility on a euclidean network to minimize neighborhood damage
11 -- 21Matteo Fischetti, Horst W. Hamacher, Kurt Jørnsten, Francesco Maffioli. k-cardinality trees: Complexity and polyhedral structure
23 -- 29Ornan Ori Gerstel, Shmuel Zaks. A new characterization of tree medians with applications to distributed sorting
31 -- 41Oded Berman, Divinagracia I. Ingco, Amedeo R. Odoni. Improving the location of minimax facilities through network modification
43 -- 56Randolph W. Hall, Yafeng Du, Julia Lin. Use of continuous approximations within discrete algorithms for routing vehicles: Experimental results and interpretation