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

• 2024
• 
  Tong Ge, Xu Luo, Yunhai Wang, Michael Sedlmair, Zhanglin Cheng, Ying Zhao, Xin Liu, Oliver Deussen, Baoquan Chen:
  Optimally Ordered Orthogonal Neighbor Joining Trees for Hierarchical Cluster Analysis. IEEE Trans. Vis. Comput. Graph. 30(8): 5034-5046 (2024)
• 2021
• 
  Barbara Covella, Fabrizio Frati, Maurizio Patrignani:
  On the area requirements of planar straight-line orthogonal drawings of ternary trees. Theor. Comput. Sci. 852: 197-211 (2021)
• 2020
• 
  Yee Ling Chan, Tong Boon Tang:
  Characterizing Functional Near Infrared Spectroscopy (fNIRS)-based Connectivity as Cost-effective Small World Network using Orthogonal Minimal Spanning Trees (OMSTs). EMBC 2020: 2901-2904
• 2019
• 
  Timothy M. Chan:
  Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back. Discret. Comput. Geom. 61(4): 899-922 (2019)
• 
  Antonio Páez, Fernando A. López, Manuel Ruiz, Máximo Camacho:
  Inducing non-orthogonal and non-linear decision boundaries in decision trees via interactive basis functions. Expert Syst. Appl. 122: 183-206 (2019)
• 
  Barbara Covella, Fabrizio Frati, Maurizio Patrignani:
  On the Area Requirements of Planar Straight-Line Orthogonal Drawings of Ternary Trees. CoRR abs/1902.11044 (2019)
• 2018
• 
  Barbara Covella, Fabrizio Frati, Maurizio Patrignani:
  On the Area Requirements of Straight-Line Orthogonal Drawings of Ternary Trees. IWOCA 2018: 128-140
• 2017
• 
  Stavros I. Dimitriadis, Marios Antonakakis, Panagiotis G. Simos, Jack M. Fletcher, Andrew C. Papanicolaou:
  Data-Driven Topological Filtering Based on Orthogonal Minimal Spanning Trees: Application to Multigroup Magnetoencephalography Resting-State Connectivity. Brain Connect. 7(10): 661-670 (2017)
• 
  Stavros I. Dimitriadis, Christos I. Salis, Ioannis Tarnanas, David E. J. Linden:
  Topological Filtering of Dynamic Functional Brain Networks Unfolds Informative Chronnectomics: A Novel Data-Driven Thresholding Scheme Based on Orthogonal Minimal Spanning Trees (OMSTs). Frontiers Neuroinformatics 11: 28 (2017)
• 
  Timothy M. Chan:
  Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back. SoCG 2017: 27:1-27:15
• 
  Nicolas Broutin, Henning Sulzbach:
  A limit field for orthogonal range searches in two-dimensional random point search trees. CoRR abs/1711.11354 (2017)
• 2016
• 
  Irina Mustata, Kousuke Nishikawa, Asahi Takaoka, Satoshi Tayu, Shuichi Ueno:
  On orthogonal ray trees. Discret. Appl. Math. 201: 201-212 (2016)
• 2012
• 
  Cédric Joncour, Arnaud Pêcher, Petru Valicov:
  MPQ-trees for the Orthogonal Packing Problem. J. Math. Model. Algorithms 11(1): 3-22 (2012)
• 2010
• 
  Cédric Joncour, Arnaud Pêcher, Petru Valicov:
  MPQ-trees for orthogonal packing problem. Electron. Notes Discret. Math. 36: 423-429 (2010)
• 2008
• 
  Sheung-Hung Poon:
  On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees. COCOON 2008: 374-384
• 2007
• 
  Fabrizio Frati:
  Straight-Line Orthogonal Drawings of Binary and Ternary Trees. GD 2007: 76-87
• 2006
• 
  Hillol Kargupta, Byung-Hoon Park, Haimonti Dutta:
  Orthogonal Decision Trees. IEEE Trans. Knowl. Data Eng. 18(8): 1028-1042 (2006)
• 2005
• 
  Zheng Rong Yang:
  Mining SARS-CoV protease cleavage data using non-orthogonal decision trees: a novel method for decisive template selection. Bioinform. 21(11): 2644-2650 (2005)
• 
  Haimonti Dutta, Hillol Kargupta, Anupam Joshi:
  Orthogonal Decision Trees for Resource-Constrained Physiological Data Stream Monitoring Using Mobile Devices. HiPC 2005: 118-127
• 2004
• 
  Hillol Kargupta, Haimonti Dutta:
  Orthogonal Decision Trees. ICDM 2004: 427-430
• 2000
• 
  John W. Krussel, Susan Marshall, Helen Verrall:
  Spanning Trees Orthogonal to One-Factorizations of K_2n. Ars Comb. 57 (2000)
• 1999
• 
  Uwe Leck, Volker Leck:
  Orthogonal Double Covers of Complete Graphs by Trees of Small Diameter. Discret. Appl. Math. 95(1-3): 377-388 (1999)
• 1998
• 
  Wolfgang Niehsen, Mathias Wien:
  Adaptive orthogonal filter bank trees for encoding of motion-compensated frame differences. EUSIPCO 1998: 1-4
• 1997
• 
  Hans-Dietrich O. F. Gronau, Ronald C. Mullin, Alexander Rosa:
  Orthogonal Double Covers of Complete Graphs by Trees. Graphs Comb. 13(3): 251-262 (1997)
• 1996
• 
  R. S. Booth, J. F. Weng:
  Steiner minimal trees on the union of two orthogonal rectangles. Australas. J Comb. 13: 109-118 (1996)
• 1995
• 
  Sung Kwon Kim:
  Simple algorithms for orthogonal upward drawings of binary and ternary trees. CCCG 1995: 115-120
• 1991
• 
  H. S. M. Coxeter:
  Orthogonal Trees. SCG 1991: 89-97
• 
  Isaac D. Scherson, Chunyao Huang:
  Embedding Binary Trees in Orthogonal Graphs. ICPP (3) 1991: 271-274
• 1989
• 
  Danièle Gardy, Philippe Flajolet, Claude Puech:
  Average cost of orthogonal range queries in multiattribute trees. Inf. Syst. 14(4): 341-350 (1989)
• 
  Danièle Gardy, Philippe Flajolet, Claude Puech:
  On the Performance of Orthogonal Range Queries in Multiattribute and Doubly Chained Trees. WADS 1989: 218-229

skipping 2 more matches