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

• 2006
• 
  Toru Araki:
  Hyper hamiltonian laceability of Cayley graphs generated by transpositions. Networks 48(3): 121-124 (2006)
• 
  Camino Balbuena, Pedro García-Vázquez, Xavier Marcote:
  Reliability of interconnection networks modeled by a product of graphs. Networks 48(3): 114-120 (2006)
• 
  Walid Ben-Ameur, Luis Eduardo Neves Gouveia:
  Further contributions to network optimization. Networks 48(1): 1-6 (2006)
• 
  Ethan D. Bolker, Thomas Zaslavsky:
  A simple algorithm that proves half-integrality of bidirected network programming. Networks 48(1): 36-38 (2006)
• 
  Maurizio Bruglieri, Francesco Maffioli, Marco Trubian:
  Solving minimum K-cardinality cut problems in planar graphs. Networks 48(4): 195-208 (2006)
• 
  Rainer E. Burkard, Elisabeth Gassner, Johannes Hatzl:
  A linear time algorithm for the reverse 1-median problem on a cycle. Networks 48(1): 16-23 (2006)
• 
  Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia:
  Route discovery with constant memory in oriented planar geometric networks. Networks 48(1): 7-15 (2006)
• 
  Matthew S. Daly, Christos Alexopoulos:
  State-space partition techniques for multiterminal flows in stochastic networks. Networks 48(2): 90-111 (2006)
• 
  Jeffrey H. Dinitz, Alan C. H. Ling, Douglas R. Stinson:
  Fault-tolerant routings with minimum optical index. Networks 48(1): 47-55 (2006)
• 
  Pierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc:
  Collective tree exploration. Networks 48(3): 166-177 (2006)
• 
  Bruce L. Golden, Douglas R. Shier:
  Editorial: 2005 Glover-Klingman prize winners. Networks 48(3): 113 (2006)
• 
  Luis Eduardo Neves Gouveia, Pierre Pesneau:
  On extended formulations for the precedence constrained asymmetric traveling salesman problem. Networks 48(2): 77-89 (2006)
• 
  G. A. Klunder, H. N. Post:
  The shortest path problem on large-scale real-road networks. Networks 48(4): 182-194 (2006)
• 
  Lawrence M. Leemis, Matthew J. Duggan, John H. Drew, Jeffrey A. Mallozzi, Kerry W. Connell:
  Algorithms to calculate the distribution of the longest path length of a stochastic activity network with continuous activity durations. Networks 48(3): 143-165 (2006)
• 
  Cheng-Kuan Lin, Hua-Min Huang, D. Frank Hsu, Lih-Hsing Hsu:
  On the spanning w-wide diameter of the star graph. Networks 48(4): 235-249 (2006)
• 
  Maren Martens, Martin Skutella:
  Flows on few paths: Algorithms and lower bounds. Networks 48(2): 68-76 (2006)
• 
  J. Reese:
  Solution methods for the p-median problem: An annotated bibliography. Networks 48(3): 125-142 (2006)
• 
  H. Edwin Romeijn, Dushyant Sharma, Robert L. Smith:
  Extreme point characterizations for infinite network flow problems. Networks 48(4): 209-222 (2006)
• 
  Andreas S. Schulz, Nicolás E. Stier Moses:
  Efficiency and fairness of system-optimal routing with user constraints. Networks 48(4): 223-234 (2006)
• 
  Jun Shao, Zhenfu Cao, Rongxing Lu:
  An improved deniable authentication protocol. Networks 48(4): 179-181 (2006)
• 
  Hanif D. Sherali, Chawalit Jeenanunta, Antoine G. Hobeika:
  The approach-dependent, time-dependent, label-constrained shortest path problem. Networks 48(2): 57-67 (2006)
• 
  Doreen A. Thomas, Jia F. Weng:
  Minimum cost flow-dependent communication networks. Networks 48(1): 39-46 (2006)
• 
  Fan Wang, Andrew Lim, Zhou Xu:
  The one-commodity pickup and delivery travelling salesman problem on a path or a tree. Networks 48(1): 24-35 (2006)