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

• 2006
• 
  Yogesh Kumar Agarwal:
  k-Partition-based facets of the network design problem. Networks 47(3): 123-139 (2006)
• 
  Gautam Appa, Balázs Kotnyek:
  A bidirected generalization of network matrices. Networks 47(4): 185-198 (2006)
• 
  Roberto Baldacci, Vittorio Maniezzo:
  Exact methods based on node-routing formulations for undirected arc-routing problems. Networks 47(1): 52-60 (2006)
• 
  Johanna Becker, Zsolt Csizmadia, Jérôme Galtier, Alexandre Laugier, Jácint Szabó, László Szegö:
  An integer programming approach to routing in daisy networks. Networks 47(2): 116-121 (2006)
• 
  Jean-Claude Bermond, Frédéric Havet, Csaba D. Tóth:
  Fault tolerant on-board networks with priorities. Networks 47(1): 9-25 (2006)
• 
  Tiziana Calamoneri, Annalisa Massini:
  Nearly optimal three dimensional layout of hypercube networks. Networks 47(1): 1-8 (2006)
• 
  Ann Melissa Campbell, Timothy J. Lowe, Li Zhang:
  Upgrading arcs to minimize the maximum travel time in a network. Networks 47(2): 72-80 (2006)
• 
  Olena Chapovska, Abraham P. Punnen:
  Variations of the prize-collecting Steiner tree problem. Networks 47(4): 199-205 (2006)
• 
  Yen Hung Chen, Bang Ye Wu, Chuan Yi Tang:
  Approximation algorithms for some k-source shortest paths spanning tree problems. Networks 47(3): 147-156 (2006)
• 
  Stefan Dobrev, Paola Flocchini, Rastislav Kralovic, Peter Ruzicka, Giuseppe Prencipe, Nicola Santoro:
  Black hole search in common interconnection networks. Networks 47(2): 61-71 (2006)
• 
  Donglei Du, R. Chandrasekaran:
  The multiroute maximum flow problem revisited. Networks 47(2): 81-92 (2006)
• 
  Lars Engebretsen, Madhu Sudan:
  Harmonic broadcasting is bandwidth-optimal assuming constant bit rate. Networks 47(3): 172-177 (2006)
• 
  Paraskevi Fragopoulou:
  Approximation algorithms for the k-source multicast tree construction problem. Networks 47(3): 178-183 (2006)
• 
  Rajiv Gandhi, Samir Khuller, Aravind Srinivasan, Nan Wang:
  Approximation algorithms for channel allocation problems in broadcast networks. Networks 47(4): 225-236 (2006)
• 
  Hovhannes A. Harutyunyan:
  Minimum multiple message broadcast graphs. Networks 47(4): 218-224 (2006)
• 
  Stefan Hougardy, Stefan Kirchner:
  Lower bounds for the relative greedy algorithm for approximating Steiner trees. Networks 47(2): 111-115 (2006)
• 
  Sun-Yuan Hsieh, Tien-Te Hsiao:
  The k-degree Cayley graph and its topological properties. Networks 47(1): 26-36 (2006)
• 
  Yuqing Lin, Mirka Miller, Camino Balbuena, Xavier Marcote:
  All (k;g)-cages are edge-superconnected. Networks 47(2): 102-110 (2006)
• 
  Elder M. Macambira, Nelson Maculan, Cid C. de Souza:
  A column generation approach for SONET ring assignment. Networks 47(3): 157-171 (2006)
• 
  J. Gómez Martí, M. Miller:
  Two new families of large compound graphs. Networks 47(3): 140-146 (2006)
• 
  Silvia Miquel, Bas van Velzen, Herbert Hamers, Henk Norde:
  Fixed tree games with multilocated players. Networks 47(2): 93-101 (2006)
• 
  Justo Puerto, Antonio M. Rodríguez-Chía, Arie Tamir, Dionisio Pérez-Brito:
  The bi-criteria doubly weighted center-median path problem on a tree. Networks 47(4): 237-247 (2006)
• 
  Daniel J. Rosenkrantz, Giri Kumar Tayi, S. S. Ravi:
  Obtaining online approximation algorithms for facility dispersion from offline algorithms. Networks 47(4): 206-217 (2006)
• 
  Hasan Ural, Keqin Zhu:
  Distributed delay constrained multicast routing algorithm with efficient fault recovery. Networks 47(1): 37-51 (2006)