• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 29 matches

• 1988
• 
  Giovanni Andreatta, Luciano Romeo:
  Stochastic shortest paths with recourse. Networks 18(3): 193-204 (1988)
• 
  Rajan Batta, Richard C. Larson, Amedeo R. Odoni:
  A single-server priority queueing-location model. Networks 18(2): 87-103 (1988)
• 
  Oded Berman, David Simchi-Levi, Arie Tamir:
  The minimax multistop location problem on a tree. Networks 18(1): 39-49 (1988)
• 
  Robert C. Brigham, Phyllis Z. Chinn, Ronald D. Dutton:
  Vertex domination-critical graphs. Networks 18(3): 173-179 (1988)
• 
  Fred Buckley, Lynne L. Doty, Frank Harary:
  On graphs with signed inverses. Networks 18(3): 151-157 (1988)
• 
  Hyeong-Ah Choi, S. Louis Hakimi:
  Data transfers in networks with transceivers. Networks 18(3): 223-251 (1988)
• 
  Charles J. Colbourn, Daryl D. Harms:
  Bounding all-terminal reliability in computer networks. Networks 18(1): 1-12 (1988)
• 
  Ron S. Dembo, Ulrich Tulowitzki:
  Computing equilibria on large multicommodity networks: An application of truncated quadratic programming algorithms. Networks 18(4): 273-284 (1988)
• 
  Ding-Zhu Du, Frank K. Hwang:
  Generalized de Bruijn digraphs. Networks 18(1): 27-38 (1988)
• 
  Awi Federgruen, Henry Groenevelt:
  Polymatroidal flow network models with multiple sinks. Networks 18(4): 285-302 (1988)
• 
  Jane N. Hagstrom:
  Computational complexity of PERT problems. Networks 18(2): 139-147 (1988)
• 
  Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Arthur L. Liestman:
  A survey of gossiping and broadcasting in communication networks. Networks 18(4): 319-349 (1988)
• 
  Kazuo Iwano, Kenneth Steiglitz:
  Planarity testing of doubly periodic infinite graphs. Networks 18(3): 205-222 (1988)
• 
  R. Johnson, M. G. Pilcher:
  The traveling salesman problem, edited by E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B Shmoys, John Wiley & Sons, Chichester, 1985, 463 pp. Networks 18(3): 253-254 (1988)
• 
  Paul A. Kaschube:
  Combinatorics for computer science, by S. gill williamson, computer science press, Rockville, MD. 1985, 479 pp. price: $39.95. Networks 18(3): 258-259 (1988)
• 
  Vidyadhar G. Kulkarni:
  Minimal spanning trees in undirected networks with exponentially distributed arc weights. Networks 18(2): 111-124 (1988)
• 
  Udi Manber, Lawrence McVoy:
  Efficient storage of nonadaptive routing tables. Networks 18(4): 263-272 (1988)
• 
  Richard G. Ogier:
  Minimum-delay routing in continuous-time dynamic networks with Piecewise-constant capacities. Networks 18(4): 303-318 (1988)
• 
  Wen Lea Pearn:
  New lower bounds for the Capacitated Arc Routing Problem. Networks 18(3): 181-191 (1988)
• 
  Themistocles Politof:
  On a property of cyclic covers of p-graphs. Networks 18(1): 51-53 (1988)
• 
  J. Scott Provan:
  Convexity and the Steiner tree problem. Networks 18(1): 55-72 (1988)
• 
  N. Ravi, Richard E. Wendell:
  The tolerance approach to sensitivity analysis in network linear programming. Networks 18(3): 159-171 (1988)
• 
  Dana Richards, Arthur L. Liestman:
  Generalizations of broadcasting and gossiping. Networks 18(2): 125-138 (1988)
• 
  Masakazu Sengoku, Shoji Shinoda, Reigo Yatsuboshi:
  On a function for the vulnerability of a directed flow network. Networks 18(1): 73-83 (1988)
• 
  William F. Strain Jr.:
  Linked local area networks, second edition by Alan J. Mayne, Wiley, 1986, 628 pp., price: $44.95. Networks 18(3): 256-257 (1988)
• 
  Shuichi Ueno, Yoji Kajitani, Hajime Wada:
  Minimum augmentation of a tree to a K-edge-connected graph. Networks 18(1): 19-25 (1988)
• 
  Rakesh V. Vohra:
  Probabilistic analysis of the longest hamiltonian tour problem. Networks 18(1): 13-18 (1988)
• 
  Takeo Yamada:
  A network flow algorithm to find an elementary I/O matching. Networks 18(2): 105-109 (1988)
• 
  Jack Yurkiewicz, Pace Plaza:
  Operations research: Applications and algorithms, by Wayne L. Winston, Duxbury press, Boston, 1987, 1025 pages. Networks 18(3): 254-256 (1988)