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

• 2019
• 
  Andrej Brodnik, Silvano Martello:
  Combinatorial Optimization: Between Practice and Theory. Discret. Appl. Math. 264: 1-3 (2019)
• 
  Davi Castro-Silva, Eric Gourdin:
  A study on load-balanced variants of the bin packing problem. Discret. Appl. Math. 264: 4-14 (2019)
• 
  Zhou Chen, Yukun Cheng, Xiaotie Deng, Qi Qi, Xiang Yan:
  Agent incentives of strategic behavior in resource exchange. Discret. Appl. Math. 264: 15-25 (2019)
• 
  Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia:
  On approximating the Incremental Knapsack Problem. Discret. Appl. Math. 264: 26-42 (2019)
• 
  Dominik Goeke, Timo Gschwind, Michael Schneider:
  Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier. Discret. Appl. Math. 264: 43-61 (2019)
• 
  Sai Ji, Dachuan Xu, Donglei Du, Chenchen Wu:
  Approximation algorithms for the fault-tolerant facility location problem with penalties. Discret. Appl. Math. 264: 62-75 (2019)
• 
  Imed Kacem, Hans Kellerer:
  Complexity results for common due date scheduling problems with interval data and minmax regret criterion. Discret. Appl. Math. 264: 76-89 (2019)
• 
  Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
  Structural parameters, tight bounds, and approximation for (k, r)-center. Discret. Appl. Math. 264: 90-117 (2019)
• 
  Xiyu Li, Alena Otto, Erwin Pesch:
  Solving the single crane scheduling problem at rail transshipment yards. Discret. Appl. Math. 264: 134-147 (2019)
• 
  Shasha Li, Yongtang Shi, Jianhua Tu, Yan Zhao:
  On the complexity of k-rainbow cycle colouring problems. Discret. Appl. Math. 264: 125-133 (2019)
• 
  Fengwei Li, Xiaoyan Zhang, Hajo Broersma:
  A polynomial algorithm for weighted scattering number in interval graphs. Discret. Appl. Math. 264: 118-124 (2019)
• 
  Lili Mei, Minming Li, Deshi Ye, Guochuan Zhang:
  Facility location games with distinct desires. Discret. Appl. Math. 264: 148-160 (2019)
• 
  Dongmei Peng, Xiumei Wang:
  Ear decomposition and induced even cycles. Discret. Appl. Math. 264: 161-166 (2019)
• 
  Rafal Rózycki, Grzegorz Waligóra:
  On a certain class of power- and energy-related scheduling problems. Discret. Appl. Math. 264: 167-187 (2019)
• 
  Erfang Shan, Jing Zhao, Liying Kang:
  Maximally connected p-partite uniform hypergraphs. Discret. Appl. Math. 264: 188-195 (2019)
• 
  Sándor Szabó, Bogdán Zaválnij:
  Reducing hypergraph coloring to clique search. Discret. Appl. Math. 264: 196-207 (2019)
• 
  Yicheng Xu, Dachuan Xu, Donglei Du, Dongmei Zhang:
  Approximation algorithm for squared metric facility location problem with nonuniform capacities. Discret. Appl. Math. 264: 208-217 (2019)