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

• 2020
• 
  Zeynep Adak, Mahmure Övül Arioglu Akan, Serol Bulkan:
  Multiprocessor open shop problem: literature review and future directions. J. Comb. Optim. 40(2): 547-569 (2020)
• 
  Jafar Amjadi, R. Khoeilar, Mustapha Chellali, Zehui Shao:
  On the Roman domination subdivision number of a graph. J. Comb. Optim. 40(2): 501-511 (2020)
• 
  Spyros Angelopoulos, Christoph Dürr, Shendan Jin:
  Online maximum matching with recourse. J. Comb. Optim. 40(4): 974-1007 (2020)
• 
  Addie Armstrong, Nancy Eaton:
  New restrictions on defective coloring with applications to steinberg-type graphs. J. Comb. Optim. 40(1): 181-204 (2020)
• 
  Pawan Aurora, Shashank K. Mehta:
  A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation. J. Comb. Optim. 40(3): 590-609 (2020)
• 
  Xuqing Bai, Hong Chang, Xueliang Li:
  More on limited packings in graphs. J. Comb. Optim. 40(2): 412-430 (2020)
• 
  Vittorio Bilò, Francesco Cellinese, Giovanna Melideo, Gianpiero Monaco:
  Selfish colorful bin packing games. J. Comb. Optim. 40(3): 610-635 (2020)
• 
  Prosenjit Bose, Valentin Gledel, Claire Pennarun, Sander Verdonschot:
  Power domination on triangular grids with triangular and hexagonal shape. J. Comb. Optim. 40(2): 482-500 (2020)
• 
  Brahim Chaourar:
  Connected max cut is polynomial for graphs without the excluded minor $K_5\backslash e$. J. Comb. Optim. 40(4): 869-875 (2020)
• 
  Tanima Chatterjee, Bhaskar DasGupta, Laura Palmieri, Zainab Al-Qurashi, Anastasios Sidiropoulos:
  On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering. J. Comb. Optim. 40(2): 512-546 (2020)
• 
  Lily Chen, Shumei Chen, Ren Zhao, Xiangqian Zhou:
  The strong chromatic index of graphs with edge weight eight. J. Comb. Optim. 40(1): 227-233 (2020)
• 
  Ren-Xia Chen, Shi-Sheng Li:
  Minimizing maximum delivery completion time for order scheduling with rejection. J. Comb. Optim. 40(4): 1044-1064 (2020)
• 
  Yong Chen, Guohui Lin, Tian Liu, Taibo Luo, Bing Su, Yao Xu, Peng Zhang:
  A (1.4 + ε )-approximation algorithm for the 2-Max-Duo problem. J. Comb. Optim. 40(3): 806-824 (2020)
• 
  Cong Chen, Yinfeng Xu:
  Coordination mechanisms for scheduling selfish jobs with favorite machines. J. Comb. Optim. 40(2): 333-365 (2020)
• 
  M. R. Chithra, Manju K. Menon:
  Secure domination of honeycomb networks. J. Comb. Optim. 40(1): 98-109 (2020)
• 
  Peter Dankelmann, Fadekemi Janet Osaye:
  Average eccentricity, minimum degree and maximum degree in graphs. J. Comb. Optim. 40(3): 697-712 (2020)
• 
  Wei Ding, Ke Qiu:
  Approximating the asymmetric p-center problem in parameterized complete digraphs. J. Comb. Optim. 40(1): 21-35 (2020)
• 
  Shaojing Du, Suogang Gao, Bo Hou, Wen Liu:
  An approximation algorithm for submodular hitting set problem with linear penalties. J. Comb. Optim. 40(4): 1065-1074 (2020)
• 
  Oleg Duginov:
  Bottleneck subset-type restricted matching problems. J. Comb. Optim. 40(3): 796-805 (2020)
• 
  Radoslav Fulek, Csaba D. Tóth:
  Crossing minimization in perturbed drawings. J. Comb. Optim. 40(2): 279-302 (2020)
• 
  Zhichao Geng, Jiayu Liu:
  Single machine batch scheduling with two non-disjoint agents and splitable jobs. J. Comb. Optim. 40(3): 774-795 (2020)
• 
  Debarun Ghosh, Ervin Györi, Addisu Paulos, Nika Salia, Oscar Zamora:
  The maximum Wiener index of maximal planar graphs. J. Comb. Optim. 40(4): 1121-1135 (2020)
• 
  Zhiwei Guo, Hajo Broersma, Ruonan Li, Shenggui Zhang:
  Some algorithmic results for finding compatible spanning circuits in edge-colored graphs. J. Comb. Optim. 40(4): 1008-1019 (2020)
• 
  Lu Han, Dachuan Xu, Yicheng Xu, Dongmei Zhang:
  Approximating the τ-relaxed soft capacitated facility location problem. J. Comb. Optim. 40(3): 848-860 (2020)
• 
  Jiangxu Kong, Xiaoxue Hu, Yiqiao Wang:
  Plane graphs with Δ =7 are entirely 10-colorable. J. Comb. Optim. 40(1): 1-20 (2020)
• 
  Hakan Kutucu, Arif Gürsoy, Mehmet Kurt, Urfat G. Nuriyev:
  The band collocation problem. J. Comb. Optim. 40(2): 454-481 (2020)
• 
  Xiang Li, Hongbin George Du:
  A short proof for stronger version of DS decomposition in set function optimization. J. Comb. Optim. 40(4): 901-906 (2020)
• 
  Xiang Li, Hongbin George Du, Panos M. Pardalos:
  A variation of DS decomposition in set function optimization. J. Comb. Optim. 40(1): 36-44 (2020)
• 
  Pan Li, Qiang Hua, Zhijun Hu, Hing-Fung Ting, Yong Zhang:
  Approximation algorithms for the selling with preference. J. Comb. Optim. 40(2): 366-378 (2020)
• 
  Peihai Liu, Xiwen Lu:
  New approximation algorithms for machine scheduling with rejection on single and parallel machine. J. Comb. Optim. 40(4): 929-952 (2020)

skipping 26 more matches