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

• 1999
• 
  Tsutomu Anazawa:
  On a condition for obtaining an explicit solution of optimum requirement spanning tree. Networks 34(2): 132-135 (1999)
• 
  Tsutomu Anazawa, Takayuki Kodera, Masakazu Jimbo:
  Optimum requirement spanning trees and reliability of tree networks. Networks 34(2): 122-131 (1999)
• 
  Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra:
  Analysis of LP relaxations for multiway and multicut problems. Networks 34(2): 102-114 (1999)
• 
  Ángeles Carmona, Josep Fàbrega:
  On the superconnectivity and the conditional diameter of graphs and digraphs. Networks 34(3): 197-205 (1999)
• 
  Maw-Shang Chang, Sheng-Lung Peng, Jenn-Liang Liaw:
  Deferred-query: An efficient approach for some problems on interval graphs. Networks 34(1): 1-10 (1999)
• 
  Gary Chartrand, Weizhen Gu, Michelle Schultz, Steven J. Winters:
  Eccentric graphs. Networks 34(2): 115-121 (1999)
• 
  Sheshayya A. Choudum, N. Priya:
  Tenacity of complete graph products and grids. Networks 34(3): 192-196 (1999)
• 
  Peter Dankelmann, Wayne Goddard, Michael A. Henning, Henda C. Swart:
  Generalized eccentricity, radius, and diameter in graphs. Networks 34(4): 312-319 (1999)
• 
  Shlomi Dolev, Michael Kate, Jennifer L. Welch:
  A competitive analysis for retransmission timeout. Networks 34(1): 73-80 (1999)
• 
  Cees Duin, Stefan Voß:
  The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs. Networks 34(3): 181-191 (1999)
• 
  Robert F. Easley, David Hartvigsen:
  Crossing properties of multiterminal cuts. Networks 34(3): 215-220 (1999)
• 
  Tamar Eilam, Shlomo Moran, Shmuel Zaks:
  Lower bounds for linear interval routing. Networks 34(1): 37-46 (1999)
• 
  Andreas T. Ernst, Mohan Krishnamoorthy, Robert H. Storer:
  Heuristic and exact algorithms for scheduling aircraft landings. Networks 34(3): 229-241 (1999)
• 
  Michele Flammini:
  Deadlock-free interval routing schemes. Networks 34(1): 47-60 (1999)
• 
  Robert S. Garfinkel, Ian R. Webb:
  On crossings, the Crossing Postman Problem, and the Rural Postman Problem. Networks 34(3): 173-180 (1999)
• 
  Michel Gendreau, Jean-Francois Larochelle, Brunilde Sansò:
  A tabu search heuristic for the Steiner Tree Problem. Networks 34(2): 162-172 (1999)
• 
  Gianpaolo Ghiani, Gilbert Laporte:
  Eulerian location problems. Networks 34(4): 291-302 (1999)
• 
  José Gómez, M. Escudero:
  Optimal edge coloring of large graphs. Networks 34(1): 61-65 (1999)
• 
  José Gómez, Ignacio M. Pelayo, Camino Balbuena:
  New large graphs with given degree and diameter six. Networks 34(2): 154-161 (1999)
• 
  Eleni Hadjiconstantinou, Nicos Christofides:
  An efficient implementation of an algorithm for finding K shortest simple paths. Networks 34(2): 88-101 (1999)
• 
  S. Louis Hakimi, Martine Labbé, Edward F. Schmeichel:
  Locations on time-varying networks. Networks 34(4): 250-257 (1999)
• 
  Jessen T. Havill, Weizhen Mao:
  Greedy online algorithms for routing permanent virtual circuits. Networks 34(2): 136-153 (1999)
• 
  Karen Klemm, Steven J. Winters:
  Properties of edge-deleted distance stable graphs. Networks 34(4): 279-282 (1999)
• 
  Evangelos Kranakis, Andrzej Pelc, Anthony Spatharis:
  Optimal adaptive fault diagnosis for simple multiprocessor systems. Networks 34(3): 206-214 (1999)
• 
  Priyalal Kulasinghe, Saïd Bettayeb:
  An optimal algorithm for layered wheel floorplan designs. Networks 34(1): 67-72 (1999)
• 
  Hoàng-Oanh Le, Van Bang Le:
  Optimal tree 3-spanners in directed path graphs. Networks 34(2): 81-87 (1999)
• 
  Stefan Nickel, Justo Puerto:
  A unified approach to network location problems. Networks 34(4): 283-290 (1999)
• 
  Juhani Nieminen, Matti Peltola:
  The subtree center of a tree. Networks 34(4): 272-278 (1999)
• 
  Ortrud Oellermann:
  On Steiner centers and Steiner medians of graphs. Networks 34(4): 258-263 (1999)
• 
  K. Brooks Reid:
  Balance vertices in trees. Networks 34(4): 264-271 (1999)

skipping 5 more matches