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

• 2021
• 
  Hui Jiang, Wenjing Li, Xueliang Li, Colton Magnant:
  On proper (strong) rainbow connection of graphs. Discuss. Math. Graph Theory 41(2): 469-479 (2021)
• 2020
• 
  Meng Ji, Xueliang Li:
  Strong conflict-free connection of graphs. Appl. Math. Comput. 364 (2020)
• 
  Logan A. Smith, David T. Mildebrath, Illya V. Hicks:
  An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs. CoRR abs/2006.02988 (2020)
• 2019
• 
  Yingbin Ma, Kairui Nie:
  (Strong) Proper Connection in Some Digraphs. IEEE Access 7: 69692-69697 (2019)
• 
  Fei Huang, Jinjiang Yuan:
  On strong proper connection number of cubic graphs. Discret. Appl. Math. 265: 104-119 (2019)
• 
  Lijie Chen, R. Ryan Williams:
  Stronger Connections Between Circuit Analysis and Circuit Lower Bounds, via PCPs of Proximity. Computational Complexity Conference 2019: 19:1-19:43
• 
  Logan A. Smith, David T. Mildebrath, Illya V. Hicks:
  A Polynomial Time Algorithm for Computing the Strong Rainbow Connection Numbers of Odd Cacti. CoRR abs/1912.11906 (2019)
• 2018
• 
  Lin Chen, Xueliang Li, Henry Liu, Jinfeng Liu:
  On various (strong) rainbow connection numbers of graphs. Australas. J Comb. 70: 137-156 (2018)
• 
  Elzbieta Sidorowicz, Éric Sopena:
  Strong rainbow connection in digraphs. Discret. Appl. Math. 238: 133-143 (2018)
• 
  Yulong Wei, Min Xu, Kaishun Wang:
  Strong rainbow connection numbers of toroidal meshes. Discret. Math. Algorithms Appl. 10(3): 1850039:1-1850039:10 (2018)
• 2015
• 
  Jakub Pawlewicz, Ryan B. Hayward, Philip Henderson, Broderick Arneson:
  Stronger Virtual Connections in Hex. IEEE Trans. Comput. Intell. AI Games 7(2): 156-166 (2015)
• 
  James Geller, Shmuel T. Klein, Yuriy Polyakov:
  Identifying Pairs of Terms with Strong Semantic Connections in a Textbook Index. KEOD 2015: 307-315
• 
  Fendy Septyanto, Kiki Ariyanti Sugeng:
  On the Rainbow and Strong Rainbow Connection Numbers of the m-Splitting of the Complete Graph K_n. ICGTIS 2015: 155-161
• 
  Juane Li, Keke Liu, Shu Lin, Khaled A. S. Abdel-Ghaffar, William E. Ryan:
  An unnoticed strong connection between algebraic-based and protograph-based LDPC codes, Part I: Binary case and interpretation. ITA 2015: 36-45
• 2012
• 
  Emad A. M. Andrews, Anthony J. Bonner:
  Finding MAPs using strongly equivalent high order recurrent symmetric connectionist networks. Cogn. Syst. Res. 14(1): 50-59 (2012)
• 
  Peter A. Jansen, Scott Watter:
  Strong systematicity through sensorimotor conceptual grounding: an unsupervised, developmental approach to connectionist sentence processing. Connect. Sci. 24(1): 25-55 (2012)
• 2011
• 
  Hengzhe Li, Xueliang Li, Sujuan Liu:
  The (strong) rainbow connection numbers of Cayley graphs on Abelian groups. Comput. Math. Appl. 62(11): 4082-4088 (2011)
• 
  Ray E. Reagans:
  Close Encounters: Analyzing How Social Similarity and Propinquity Contribute to Strong Network Connections. Organ. Sci. 22(4): 835-849 (2011)
• 2009
• 
  Amir Epstein, Michal Feldman, Yishay Mansour:
  Strong equilibrium in cost sharing connection games. Games Econ. Behav. 67(1): 51-68 (2009)
• 
  Stan Matwin:
  Image Analysis and Machine Learning: How to Foster a Stronger Connection? ICIAP 2009: 5
• 2008
• 
  Edwin J. Beggs, Tomasz Brzezinski:
  An Explicit Formula for a Strong Connection. Appl. Categorical Struct. 16(1-2): 57-63 (2008)
• 
  Ghassen Ben Brahim, Bilal Khan, Ala I. Al-Fuqaha, Mohsen Guizani:
  Weak many vs. strong few: reducing BER through packet duplication in power-budgeted wireless connections. Int. J. Sens. Networks 4(3): 145-154 (2008)
• 
  Li Ding, Brandon Dixon:
  Using an edge-dual graph and k-connectivity to identify strong connections in social networks. ACM Southeast Regional Conference 2008: 475-480
• 2007
• 
  Jonathan David Farley:
  A structure theorem for posets admitting a "strong" chain partition: : A generalization of a conjecture of Daykin and Daykin (with connections to probability correlation inequalities). Discret. Math. 307(2): 191-198 (2007)
• 
  Amir Epstein, Michal Feldman, Yishay Mansour:
  Strong equilibrium in cost sharing connection games. EC 2007: 84-92
• 2006
• 
  Giampiero Salvi:
  Dynamic behaviour of connectionist speech recognition with strong latency constraints. Speech Commun. 48(7): 802-818 (2006)
• 2002
• 
  Jörg H. Siekmann, Graham Wrightson:
  An Open Research Problem: Strong Completeness of R. Kowalski's Connection Graph Proof Procedure. Log. J. IGPL 10(1): 85-103 (2002)
• 
  Jörg H. Siekmann, Graham Wrightson:
  An Open Research Problem: Strong Completeness of R. Kowalski's Connection Graph Proof Procedure. Computational Logic: Logic Programming and Beyond 2002: 231-252
• 
  Quan Yuan, Wen Gao, Hongxun Yao, Chunli Wang:
  Recognition of Strong and Weak Connection Models in Continuous Sign Language. ICPR (1) 2002: 75-78
• 
  Vasile Postolica:
  General connection between strong optimization and Pareto efficiency. Analysis and Optimization of Differential Systems 2002: 315-320

skipping 5 more matches