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

• 2017
• 
  Néstor E. Aguilera, Ricardo D. Katz, Paola B. Tolomei:
  Vertex adjacencies in the set covering polyhedron. Discret. Appl. Math. 218: 40-56 (2017)
• 
  Gabriela Araujo-Pardo, Camino Balbuena, Mirka Miller, Mária Zdímalová:
  A family of mixed graphs with large order and diameter 2. Discret. Appl. Math. 218: 57-63 (2017)
• 
  Zhibing Chen, Guifu Su, Lutz Volkmann:
  Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected graphs. Discret. Appl. Math. 218: 64-70 (2017)
• 
  Kinkar Chandra Das, Eliseu Fritscher, Lucélia Kowalski Pinheiro, Vilmar Trevisan:
  Maximum Laplacian energy of unicyclic graphs. Discret. Appl. Math. 218: 71-81 (2017)
• 
  Ali Dehghan, Mohsen Molla Haji Aghaei:
  On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs. Discret. Appl. Math. 218: 82-97 (2017)
• 
  Insung Ihm, Jung-Heum Park:
  A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph. Discret. Appl. Math. 218: 98-112 (2017)
• 
  Gleb A. Koshevoy, Takamasa Suzuki, Dolf Talman:
  Cooperative games with restricted formation of coalitions. Discret. Appl. Math. 218: 1-13 (2017)
• 
  Brian G. Kronenthal, Wing Hong Tony Wong:
  Paired many-to-many disjoint path covers of hypertori. Discret. Appl. Math. 218: 14-20 (2017)
• 
  Min-Sheng Lin, Chien-Min Chen:
  Counting independent sets in tree convex bipartite graphs. Discret. Appl. Math. 218: 113-122 (2017)
• 
  Kerri Morgan, Rui Chen:
  An infinite family of 2-connected graphs that have reliability factorisations. Discret. Appl. Math. 218: 123-127 (2017)
• 
  Kedong Yan, Hong Seo Ryoo:
  0-1 multilinear programming as a unifying theory for LAD pattern generation. Discret. Appl. Math. 218: 21-39 (2017)