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

• 2001
• 
  Amir Averbuch, Yehuda Roditty, Barack Shoham:
  Efficient line broadcasting in a d-dimensional grid. Discret. Appl. Math. 113(2-3): 129-141 (2001)
• 
  Olivier Baudon, Guillaume Fertin, Ivan Havel:
  Routing permutations and 2-1 routing requests in the hypercube. Discret. Appl. Math. 113(1): 43-58 (2001)
• 
  Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul:
  Diameter determination on restricted graph families. Discret. Appl. Math. 113(2-3): 143-166 (2001)
• 
  Todd Easton, R. Gary Parker:
  On completing latin squares. Discret. Appl. Math. 113(2-3): 167-181 (2001)
• 
  Jirí Fiala, Ton Kloks, Jan Kratochvíl:
  Fixed-parameter complexity of lambda-labelings. Discret. Appl. Math. 113(1): 59-72 (2001)
• 
  Celina M. H. de Figueiredo, Kristina Vuskovic:
  Recognition of quasi-Meyniel graphs. Discret. Appl. Math. 113(2-3): 255-260 (2001)
• 
  Paola Flocchini, Frédéric Geurts, Nicola Santoro:
  Optimal irreversible dynamos in chordal rings. Discret. Appl. Math. 113(1): 23-42 (2001)
• 
  Jean-Luc Fouquet, Gena Hahn:
  Cycle regular graphs need not be transitive. Discret. Appl. Math. 113(2-3): 261-264 (2001)
• 
  Josep Freixas, María Albina Puente:
  A note about games-composition dimension. Discret. Appl. Math. 113(2-3): 265-273 (2001)
• 
  Ronny Hadany, David Harel:
  A multi-scale algorithm for drawing graphs nicely. Discret. Appl. Math. 113(1): 3-21 (2001)
• 
  David Hartvigsen:
  A strongly polynomial time algorithm for a constrained submodular optimization problem. Discret. Appl. Math. 113(2-3): 183-194 (2001)
• 
  Dietrich Hauptmeier, Sven Oliver Krumke, Jörg Rambau, Hans-Christoph Wirth:
  Euler is standing in line dial-a-ride problems with precedence-constraints. Discret. Appl. Math. 113(1): 87-107 (2001)
• 
  Alan J. Hoffman, Baruch Schieber:
  The edge versus path incidence matrix of series-parallel graphs and greedy packing. Discret. Appl. Math. 113(2-3): 275-284 (2001)
• 
  Juha Honkala:
  Easy cases of the D0L sequence equivalence problem. Discret. Appl. Math. 113(2-3): 285-290 (2001)
• 
  Kiyoshi Hosono:
  On an estimate of the size of the maximum matching for a family of disjoint compact convex sets in the plane. Discret. Appl. Math. 113(2-3): 291-298 (2001)
• 
  Kiyoshi Hosono, Henk Meijer, David Rappaport:
  On the visibility graph of convex translates. Discret. Appl. Math. 113(2-3): 195-210 (2001)
• 
  Frank K. Hwang, J. S. Lee:
  Optimal quantitative group testing on cycles and paths. Discret. Appl. Math. 113(2-3): 299-302 (2001)
• 
  Pranava K. Jha:
  Smallest independent dominating sets in Kronecker products of cycles. Discret. Appl. Math. 113(2-3): 303-306 (2001)
• 
  Charles R. Johnson, Michael Lundquist, Thomas J. Lundy, John S. Maybee:
  Deterministic inverse zero-patterns. Discret. Appl. Math. 113(2-3): 211-236 (2001)
• 
  Peter Che Bor Lam, Wai Chee Shiu, Chong Sze Tong, Zhongfu Zhang:
  On the equitable chromatic number of complete n-partite graphs. Discret. Appl. Math. 113(2-3): 307-310 (2001)
• 
  Serge Lawrencenko, Michael D. Plummer, Xiaoya Zha:
  Bounds for isoperimetric constants of infinite plane graphs. Discret. Appl. Math. 113(2-3): 237-241 (2001)
• 
  Xiangwen Li, Bing Wei, Fan Yang:
  A degree condition of 2-factors in bipartite graphs. Discret. Appl. Math. 113(2-3): 311-318 (2001)
• 
  Weifa Liang:
  Finding the k most vital edges with respect to minimum spanning trees for fixed k. Discret. Appl. Math. 113(2-3): 319-327 (2001)
• 
  Mei Lu, Zhengguang Yu:
  Cycles of length 1 modulo 3 in graph. Discret. Appl. Math. 113(2-3): 329-336 (2001)
• 
  Malwina J. Luczak, Steven D. Noble:
  Optimal arrangement of data in a tree directory. Discret. Appl. Math. 113(2-3): 243-253 (2001)
• 
  Assaf Natanzon, Ron Shamir, Roded Sharan:
  Complexity classification of some edge modification problems. Discret. Appl. Math. 113(1): 109-128 (2001)
• 
  Jovanka Pantovic, Ratko Tosic, Gradimir Vojvodic:
  Relative completeness with respect to two unary functions. Discret. Appl. Math. 113(2-3): 337-342 (2001)
• 
  Hans-Christoph Wirth, Jan Steffan:
  Reload cost problems: minimum diameter spanning tree. Discret. Appl. Math. 113(1): 73-85 (2001)