• 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 1,843 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)
• 
  Patrick J. Andersen, Charl J. Ras:
  Degree bounded bottleneck spanning trees in three dimensions. J. Comb. Optim. 39(2): 457-491 (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)
• 
  Pradeesha Ashok, Aniket Basu Roy, Sathish Govindarajan:
  Local search strikes again: PTAS for variants of geometric covering and packing. J. Comb. Optim. 39(2): 618-635 (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)
• 
  S. Banerjee, Michael A. Henning, Dinabandhu Pradhan:
  Algorithmic results on double Roman domination in graphs. J. Comb. Optim. 39(1): 90-114 (2020)
• 
  Miklós Bartha, Miklós Krész:
  On the König deficiency of zero-reducible graphs. J. Comb. Optim. 39(1): 273-292 (2020)
• 
  Sergey Bereg, Andrew Brunner, Luis Evaristo Caraballo, José Miguel Díaz-Báñez, Mario Alberto López:
  On the robustness of a synchronized multi-robot system. J. Comb. Optim. 39(4): 988-1016 (2020)
• 
  Stéphane Bessy, François Dross, Katarína Hrináková, Martin Knor, Riste Skrekovski:
  The structure of graphs with given number of blocks and the maximum Wiener index. J. Comb. Optim. 39(1): 170-184 (2020)
• 
  Vittorio Bilò, Francesco Cellinese, Giovanna Melideo, Gianpiero Monaco:
  Selfish colorful bin packing games. J. Comb. Optim. 40(3): 610-635 (2020)
• 
  Endre Boros, Yves Crama, Elisabeth Rodríguez-Heck:
  Compact quadratizations for pseudo-Boolean functions. J. Comb. Optim. 39(3): 687-707 (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)
• 
  Lkhagva Buyantogtokh, Batmend Horoldagva, Kinkar Chandra Das:
  On reduced second Zagreb index. J. Comb. Optim. 39(3): 776-791 (2020)
• 
  Natalia de Castro, Maria Angeles Garrido, Rafael Robles, María Trinidad Villar-Liñán:
  Contrast in greyscales of graphs. J. Comb. Optim. 39(3): 874-898 (2020)
• 
  Yulin Chang, Fei Jing, Guanghui Wang:
  Local antimagic orientation of graphs. J. Comb. Optim. 39(4): 1129-1152 (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)
• 
  Yi Chu, Boxiao Liu, Shaowei Cai, Chuan Luo, Haihang You:
  An efficient local search algorithm for solving maximum edge weight clique problem in large graphs. J. Comb. Optim. 39(4): 933-954 (2020)
• 
  Peter Dankelmann, Fadekemi Janet Osaye:
  Average eccentricity, minimum degree and maximum degree in graphs. J. Comb. Optim. 40(3): 697-712 (2020)
• 
  Amit Kumar Dhar, Raghunath Reddy Madireddy, Supantha Pandit, Jagpreet Singh:
  Maximum independent and disjoint coverage. J. Comb. Optim. 39(4): 1017-1037 (2020)
• 
  Wei Ding, Ke Qiu:
  Approximating the asymmetric p-center problem in parameterized complete digraphs. J. Comb. Optim. 40(1): 21-35 (2020)
• 
  Yanxia Dong, Moo Young Sohn, Zuosong Liang:
  Domination and matching in power and generalized power hypergraphs. J. Comb. Optim. 39(2): 425-436 (2020)

skipping 1,813 more matches