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

• 2005
• 
  Therese Biedl, Timothy M. Chan:
  A note on 3D orthogonal graph drawing. Discret. Appl. Math. 148(2): 189-193 (2005)
• 
  Therese Biedl, Timothy M. Chan, Yashar Ganjali, Mohammad Taghi Hajiaghayi, David R. Wood:
  Balanced vertex-orderings of graphs. Discret. Appl. Math. 148(1): 27-48 (2005)
• 
  Francine Blanchet-Sadri:
  Primitive partial words. Discret. Appl. Math. 148(3): 195-213 (2005)
• 
  Han Hyuk Cho, Suh-Ryung Kim:
  A class of acyclic digraphs with interval competition graphs. Discret. Appl. Math. 148(2): 171-180 (2005)
• 
  Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, David Schindl:
  A solvable case of image reconstruction in discrete tomography. Discret. Appl. Math. 148(3): 240-245 (2005)
• 
  Keith Edwards, Graham Farr:
  On monochromatic component size for improper colourings. Discret. Appl. Math. 148(1): 89-105 (2005)
• 
  Luis Hernández Encinas, Ángel Martín del Rey, Jaime Muñoz Masqué:
  Faa' di Bruno's formula, lattices, and partitions. Discret. Appl. Math. 148(3): 246-255 (2005)
• 
  Leah Epstein:
  Tight bounds for bandwidth allocation on two links. Discret. Appl. Math. 148(2): 181-188 (2005)
• 
  Thomas Erlebach, Klaus Jansen:
  Conversion of coloring algorithms into maximum weight independent set algorithms. Discret. Appl. Math. 148(1): 107-125 (2005)
• 
  Alastair Farrugia:
  Orientable convexity, geodetic and hull numbers in graphs. Discret. Appl. Math. 148(3): 256-262 (2005)
• 
  Jirí Fiala, Riste Skrekovski:
  Generalized list T-colorings of cycles. Discret. Appl. Math. 148(1): 13-25 (2005)
• 
  Anis Gharbi, Mohamed Haouari:
  Optimal parallel machines scheduling with availability constraints. Discret. Appl. Math. 148(1): 63-87 (2005)
• 
  Christian Glaßer, Steffen Reith, Heribert Vollmer:
  The complexity of base station positioning in cellular networks. Discret. Appl. Math. 148(1): 1-12 (2005)
• 
  Joan P. Hutchinson:
  A note on rectilinear and polar visibility graphs. Discret. Appl. Math. 148(3): 263-272 (2005)
• 
  Frank K. Hwang:
  A competitive algorithm to find all defective edges in a graph. Discret. Appl. Math. 148(3): 273-277 (2005)
• 
  Hark-Chin Hwang, Kangbok Lee, Soo Y. Chang:
  The effect of machine availability on the worst-case performance of LPT. Discret. Appl. Math. 148(1): 49-61 (2005)
• 
  Shuguang Li, Guojun Li, Shaoqiang Zhang:
  Minimizing makespan with release times on identical parallel batching machines. Discret. Appl. Math. 148(1): 127-134 (2005)
• 
  Juan Rada:
  Variation of the Wiener index under tree transformations. Discret. Appl. Math. 148(2): 135-146 (2005)
• 
  Stephen J. Willson:
  Consistent formulas for estimating the total lengths of trees. Discret. Appl. Math. 148(3): 214-239 (2005)
• 
  Baogang Xu, Lusheng Wang:
  Decomposing toroidal graphs into circuits and edges. Discret. Appl. Math. 148(2): 147-159 (2005)
• 
  Amr M. Youssef, Stafford E. Tavares:
  Affine equivalence in the AES round function. Discret. Appl. Math. 148(2): 161-170 (2005)