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

• 1995
• 
  Jean-Claude Bermond, Pierre Fraigniaud, Joseph G. Peters:
  Antepenultimate broadcasting. Networks 26(3): 125-137 (1995)
• 
  Haitze J. Broersma, F. Göbel:
  Bipartite regular graphs with fixed diameter. Networks 26(3): 139-144 (1995)
• 
  I-Ming Chao, Bruce L. Golden, Edward A. Wasil:
  An improved heuristic for the period vehicle routing problem. Networks 26(1): 25-44 (1995)
• 
  Satyan R. Coorg, C. Pandu Rangan:
  Feedback vertex set on cocomparability graphs. Networks 26(2): 101-111 (1995)
• 
  Martin Erwig:
  Encoding shortest paths in spatial networks. Networks 26(4): 291-303 (1995)
• 
  Henrik Esbensen:
  Computing near-optimal solutions to the steiner problem in a graph using a genetic algorithm. Networks 26(4): 173-185 (1995)
• 
  Matteo Fischetti, Juan José Salazar González, Paolo Toth:
  The symmetric generalized traveling salesman polytope. Networks 26(2): 113-123 (1995)
• 
  Bezalel Gavish, Suresh Sridhar:
  Computing the 2-median on tree networks in O(n lg n) time. Networks 26(4): 305-317 (1995)
• 
  Michael D. Grigoriadis, Leonid G. Khachiyan:
  An exponential-function reduction method for block-angular convex programs. Networks 26(2): 59-68 (1995)
• 
  Oh-Heum Kwon, Kyung-Yong Chwa:
  Multiple message broadcasting in communication networks. Networks 26(4): 253-261 (1995)
• 
  Wen-Jui Li, H.-S. Jacob Tsao, Osman Ulular:
  The shortest path with at most / nodes in each of the series/parallel clusters. Networks 26(4): 263-271 (1995)
• 
  Ángel Marín:
  Restricted simplicial decomposition with side constraints. Networks 26(4): 199-215 (1995)
• 
  Gur Mosheiov:
  The pickup delivery location problem on networks. Networks 26(4): 243-251 (1995)
• 
  Young-Soo Myung, Chang-ho Lee, Dong-wan Tcha:
  On the generalized minimum spanning tree problem. Networks 26(4): 231-241 (1995)
• 
  Anna Nagurney, Takashi Takayama, Ding Zhang:
  Projected dynamical systems modeling and computation of spatial network equilibria. Networks 26(2): 69-85 (1995)
• 
  Doowon Paik, Sartaj Sahni:
  Network upgrading problems. Networks 26(1): 45-58 (1995)
• 
  Charles C. Palmer, Aaron Kershenbaum:
  An approach to a problem in network design using genetic algorithms. Networks 26(3): 151-163 (1995)
• 
  Andrew B. Philpott, Mark Craddock:
  An adaptive discretization algorithm for a class of continuous network programs. Networks 26(1): 1-11 (1995)
• 
  Marco Roccetti:
  Reliability analysis of tree-based networks and its application to fault-tolerant VLSI systems. Networks 26(4): 217-230 (1995)
• 
  J. MacGregor Smith, Richard S. Weiss, Minoo Patel:
  An O(N²) heuristic for steiner minimal trees in E³. Networks 26(4): 273-289 (1995)
• 
  Arun K. Somani, Sanjay Thatte:
  The helical cube network. Networks 26(2): 87-100 (1995)
• 
  Constantine Stivaros, Klaus Sutner:
  The intractability of the reliable assignment problem in split networks. Networks 26(4): 165-172 (1995)
• 
  Donald M. Topkis:
  Repeated uncoordinated information dissemination by flooding. Networks 26(1): 13-23 (1995)
• 
  Pawel Winter:
  Reductions for the rectilinear steiner tree problem. Networks 26(4): 187-198 (1995)
• 
  Stephen A. Wong:
  Hamilton cycles and paths in butterfly graphs. Networks 26(3): 145-150 (1995)