• 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 44 matches

• 1991
• 
  Veena Adlakha, Barbara Gladysz, Jerzy Kamburowski:
  Minimum flows in (s, t) planar networks. Networks 21(7): 767-773 (1991)
• 
  Christos Alexopoulos, George S. Fishman:
  Characterizing stochastic flow networks using the monte carlo method. Networks 21(7): 775-798 (1991)
• 
  Agha Iqbal Ali, Chung-Hsing Huang:
  Balanced spanning forests and trees. Networks 21(6): 667-687 (1991)
• 
  Ashok T. Amin, Kyle Siegrist, Peter J. Slater:
  On the nonexistence of uniformly optimal graphs for pair-connected reliability. Networks 21(3): 359-368 (1991)
• 
  David Avis, Michel Deza:
  The cut cone, L¹ embeddability, complexity, and multicommodity flows. Networks 21(6): 595-617 (1991)
• 
  Michel L. Balinski, Jaime Gonzalez:
  Maximum matchings in bipartite graphs via strong spanning trees. Networks 21(2): 165-179 (1991)
• 
  Michael O. Ball, J. Scott Provan, Douglas R. Shier:
  Reliability covering problems. Networks 21(3): 345-357 (1991)
• 
  Jean-Claude Bermond, Dvora Tzvieli:
  Minimal diameter double-loop networks: Dense optimal families. Networks 21(1): 1-9 (1991)
• 
  Francis T. Boesch, Xiaoming Li, Charles L. Suffel:
  On the existence of uniformly optimally reliable networks. Networks 21(2): 181-194 (1991)
• 
  Margaret L. Brandeau, Samuel S. Chiu:
  Parametric analysis of optimal facility locations. Networks 21(2): 223-243 (1991)
• 
  Robert C. Brigham, Ronald D. Dutton:
  A compilation of relations between graph invariants - supplement I. Networks 21(4): 421-455 (1991)
• 
  Janusz A. Brzozowski, T. Gahlinger, Farhad Mavaddat:
  Consistency and satisfiability of waveform timing specifications. Networks 21(1): 91-107 (1991)
• 
  Yong-Mao Chen, Prakash Ramanan:
  Euclidean shortest path in the presence of obstacles. Networks 21(3): 257-265 (1991)
• 
  Sang-Bang Choi, Arun K. Somani:
  The generalized folding-cube network. Networks 21(3): 267-294 (1991)
• 
  Sunil Chopra, M. R. Rao:
  On the multiway cut polyhedron. Networks 21(1): 51-89 (1991)
• 
  Robert J. Dawson, Abdel Aziz Farrag:
  Fault-tolerant extensions of star networks. Networks 21(4): 373-385 (1991)
• 
  Thore Egeland, Arne Bang Huseby:
  On dependence and reliability computations. Networks 21(5): 521-545 (1991)
• 
  Donald Goldfarb, Jianxiu Hao, Sheng-Roan Kai:
  Shortest path algorithms using dynamic breadth-first search. Networks 21(1): 29-50 (1991)
• 
  Dan Gusfield:
  Efficient algorithms for inferring evolutionary trees. Networks 21(1): 19-28 (1991)
• 
  Dan Gusfield, Dalit Naor:
  Efficient algorithms for generalized cut-trees. Networks 21(5): 505-520 (1991)
• 
  Jane N. Hagstrom:
  Computing rooted communication reliability in an almost acyclic digraph. Networks 21(5): 581-593 (1991)
• 
  Lih-Hsing Hsu, Shih-Yih Wang:
  Maximum independent number for series-parallel networks. Networks 21(4): 457-468 (1991)
• 
  Tetsuo Ichimori, Naoki Katoh:
  A two-commodity sharing problem on networks. Networks 21(5): 547-563 (1991)
• 
  Toshinobu Kashiwabara, Sumio Masuda, Kazuo Nakajima, Toshio Fujisawa:
  Polynomial time algorithms on circular-arc overlap graphs. Networks 21(2): 195-203 (1991)
• 
  Do Ba Khang, Okitsugu Fujiwara:
  Approximate solutions of capacitated fixed-charge minimum cost network flow problems. Networks 21(6): 689-704 (1991)
• 
  Shiow C. Lin, Eva Ma:
  Sensitivity analysis of 0-1 multiterminal network flows. Networks 21(7): 713-745 (1991)
• 
  Erick Mata-Montero:
  Resilience of partial k-tree networks with edge and node failures. Networks 21(3): 321-344 (1991)
• 
  John M. Mulvey, Hercules Vladimirou:
  Solving multistage stochastic networks: An application of scenario aggregation. Networks 21(6): 619-643 (1991)
• 
  Wendy J. Myrvold, Kim H. Cheung, Lavon B. Page, Jo Ellen Perry:
  Uniformly-most reliable networks do not always exist. Networks 21(4): 417-419 (1991)
• 
  Hiroshi Nagamochi, Toshihide Ibaraki:
  Maximum flows in probabilistic networks. Networks 21(6): 645-666 (1991)

skipping 14 more matches