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

• 2017
• 
  Taher Abualrub, Nuh Aydin:
  Additive cyclic codes over mixed alphabets and the football pool problem. Discret. Math. Algorithms Appl. 9(1): 1750010:1-1750010:13 (2017)
• 
  Katharine L. M. Adamyk, Edward C. Holmes, G. R. Mayfield, Dennis J. Moritz, Marion Scheepers, Bridget Eileen Tenner, Helen C. Wauck:
  Sorting permutations: Games, genomes, and cycles. Discret. Math. Algorithms Appl. 9(5): 1750063:1-1750063:31 (2017)
• 
  Ali Ahmad:
  Computation of certain topological properties of para-line graph of honeycomb networks and graphene. Discret. Math. Algorithms Appl. 9(5): 1750064:1-1750064:16 (2017)
• 
  Reza Ahmadzadeh, Sohrab Kordrostami, Alireza Amirteimoori:
  Evaluating the efficiency of a two-stage network structure with the use of fractional programming. Discret. Math. Algorithms Appl. 9(3): 1750034:1-1750034:14 (2017)
• 
  Reza Alimoradi:
  A new certificateless multiple key agreement scheme. Discret. Math. Algorithms Appl. 9(1): 1750002:1-1750002:15 (2017)
• 
  Jafar Amjadi, Sakineh Nazari-Moghaddam, Seyed Mahmoud Sheikholeslami:
  Global total Roman domination in graphs. Discret. Math. Algorithms Appl. 9(4): 1750050:1-1750050:13 (2017)
• 
  I. Keerthi Asir, S. Athisayanathan:
  Clique-to-vertex monophonic distance in graphs. Discret. Math. Algorithms Appl. 9(1): 1750004:1-1750004:18 (2017)
• 
  Mahdieh Azari:
  On ordinary and weighted Harary indices of Mycielski graphs. Discret. Math. Algorithms Appl. 9(2): 1750022:1-1750022:14 (2017)
• 
  Ishwar Baidari, Preeti Savant:
  On min-max distance degree index. Discret. Math. Algorithms Appl. 9(6): 1750073:1-1750073:17 (2017)
• 
  S. Balamurugan:
  Changing and unchanging isolate domination: Edge removal. Discret. Math. Algorithms Appl. 9(1): 1750003:1-1750003:9 (2017)
• 
  Ali Behtoei, Akbar Davoodi, Mohsen Jannesari, Behnaz Omoomi:
  A characterization of some graphs with metric dimension two. Discret. Math. Algorithms Appl. 9(2): 1750027:1-1750027:15 (2017)
• 
  Y. M. Borse, S. R. Shaikh:
  On 4-regular 4-connected bipancyclic subgraphs of hypercubes. Discret. Math. Algorithms Appl. 9(3): 1750032:1-1750032:12 (2017)
• 
  Yuehua Bu, Hongguo Zhu:
  Strong edge-coloring of subcubic planar graphs. Discret. Math. Algorithms Appl. 9(1): 1750013:1-1750013:11 (2017)
• 
  Gruia Calinescu:
  T-joins in strongly connected hypergraphs. Discret. Math. Algorithms Appl. 9(6): 1750068:1-1750068:19 (2017)
• 
  Gek Ling Chia, Wanida Hemakul, Sirirat Singhun:
  Graphs with cyclomatic number three having panconnected square. Discret. Math. Algorithms Appl. 9(5): 1750067:1-1750067:14 (2017)
• 
  Peter Damaschke:
  Finding defectives on a line by random docking and interval group tests. Discret. Math. Algorithms Appl. 9(3): 1750029:1-1750029:11 (2017)
• 
  Angsuman Das:
  Coefficient of domination in graph. Discret. Math. Algorithms Appl. 9(2): 1750018:1-1750018:12 (2017)
• 
  Angsuman Das:
  Infinite graphs with finite dominating sets. Discret. Math. Algorithms Appl. 9(4): 1750053:1-1750053:9 (2017)
• 
  Nilanjan De:
  Narumi-Katayama index of total transformation graphs. Discret. Math. Algorithms Appl. 9(3): 1750033:1-1750033:17 (2017)
• 
  Sarika Devhare, Vinayak Joshi:
  Perfect non-commuting graphs of matrices over chains. Discret. Math. Algorithms Appl. 9(4): 1750049:1-1750049:15 (2017)
• 
  M. V. Dhanyamol, Sunil Mathew:
  On transit functions in weighted graphs. Discret. Math. Algorithms Appl. 9(3): 1750036:1-1750036:23 (2017)
• 
  Ömer Egecioglu:
  A note on iterated galileo sequences. Discret. Math. Algorithms Appl. 9(2): 1750015:1-1750015:4 (2017)
• 
  Jian Gao, Fanghui Ma:
  Some results on quadratic residue codes over the ring Fp + vFp + v2Fp + v3Fp. Discret. Math. Algorithms Appl. 9(3): 1750035:1-1750035:9 (2017)
• 
  Pinkimani Goswami, Madan Mohan Singh, Bubu Bhuyan:
  A new public key cryptosystem over ℤn2*. Discret. Math. Algorithms Appl. 9(6): 1750080:1-1750080:11 (2017)
• 
  Haixia Guo, You Gao:
  Class dimension of association schemes in singular linear spaces. Discret. Math. Algorithms Appl. 9(1): 1750005:1-1750005:5 (2017)
• 
  Muhammad Imran, Shehnaz Akhter:
  Degree-based topological indices of double graphs and strong double graphs. Discret. Math. Algorithms Appl. 9(5): 1750066:1-1750066:15 (2017)
• 
  Hiroki Izumi, Sennosuke Watanabe, Yoshihide Watanabe:
  Augmenting trail theorem for the maximum 1-2 matching problem. Discret. Math. Algorithms Appl. 9(4): 1750056:1-1750056:7 (2017)
• 
  Jinto James, K. Augustine Germina, P. Shaini:
  Learning graphs and 1-uniform dcsl graphs. Discret. Math. Algorithms Appl. 9(4): 1750046:1-1750046:9 (2017)
• 
  Mehri Javanian:
  On the size of paged recursive trees. Discret. Math. Algorithms Appl. 9(2): 1750021:1-1750021:10 (2017)
• 
  Sumit Kumar Jha:
  Revisiting calculation of moments of number of comparisons used by the randomized quick sort algorithm. Discret. Math. Algorithms Appl. 9(1): 1750001:1-1750001:6 (2017)

skipping 50 more matches