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

• 1995
• 
  Yasukazu Aoki:
  Probing the Arrangement of Hyperplanes. Discret. Appl. Math. 56(2-3): 101-125 (1995)
• 
  Dominique Barth, Johny Bond, André Raspaud:
  Compatible Eulerian Circuits in K_n**. Discret. Appl. Math. 56(2-3): 127-136 (1995)
• 
  David Blokh, Gregory Z. Gutin:
  Maximizing Traveling Salesman Problem for Special Matrices. Discret. Appl. Math. 56(1): 83-86 (1995)
• 
  Peng Cheng, Shigeru Masuyama:
  A Lower Bound of the Expected Maximum Number of Edge-disjoint S-t Paths on Probabilistic Graphs. Discret. Appl. Math. 56(2-3): 137-155 (1995)
• 
  Martin Cohn:
  on the Channel Capacity of Read/write Isolated Memory. Discret. Appl. Math. 56(1): 1-8 (1995)
• 
  Michel Deza, Viatcheslav P. Grishukhin:
  L-polytopes and Equiangular Lines. Discret. Appl. Math. 56(2-3): 181-214 (1995)
• 
  Michel Deza, Monique Laurent:
  Hypercube Embedding of Generalized Bipartite Metrics. Discret. Appl. Math. 56(2-3): 215-230 (1995)
• 
  Matteo Fischetti:
  Clique Tree Inequalities Define Facets of the Asymmetric Traveling Salesman Polytope. Discret. Appl. Math. 56(1): 9-18 (1995)
• 
  David C. Fisher, Jennifer Ryan:
  Probabilities Within optimal Strategies for Tournament Games. Discret. Appl. Math. 56(1): 87-91 (1995)
• 
  Hubert de Fraysseix, Patrice Ossona de Mendez, Pierre Rosenstiehl:
  Bipolar orientations Revisited. Discret. Appl. Math. 56(2-3): 157-179 (1995)
• 
  Komei Fukuda, Toshihide Ibaraki:
  Preface. Discret. Appl. Math. 56(2-3): 99-100 (1995)
• 
  Komei Fukuda, Makoto Namiki:
  Finding All Common Bases in Two Matroids. Discret. Appl. Math. 56(2-3): 231-243 (1995)
• 
  Masazumi Hanazawa, Hiroshi Narushima, Nobuhiro Minaka:
  Generating Most Parsimonious Reconstructions on a Tree: A Generalization of the Farris-Swofford-Maddison Method. Discret. Appl. Math. 56(2-3): 245-265 (1995)
• 
  Steven B. Horton, R. Gary Parker:
  on Halin Subgraphs and Supergraphs. Discret. Appl. Math. 56(1): 19-35 (1995)
• 
  Alexander V. Karzanov:
  Half-integral Flows in a Planar Graph with Four Holes. Discret. Appl. Math. 56(2-3): 267-295 (1995)
• 
  Rajeev Kohli, Ramesh Krishnamurti:
  Joint Performance of Greedy Heuristics for the Integer Knapsack Problem. Discret. Appl. Math. 56(1): 37-48 (1995)
• 
  Alain Leblanc:
  Finding Degeneracies Among Sets of Lines. Discret. Appl. Math. 56(1): 49-60 (1995)
• 
  Yannis Manoussakis:
  Alternating Paths in Edge-colored Complete Graphs. Discret. Appl. Math. 56(2-3): 297-309 (1995)
• 
  Tomomi Matsui, Sunao Tamura:
  Adjacency on Combinatorial Polyhedra. Discret. Appl. Math. 56(2-3): 311-321 (1995)
• 
  Seiya Negami, Kenichi Kawagoe:
  Polynomial Invariants of Graphs with State Models. Discret. Appl. Math. 56(2-3): 323-331 (1995)
• 
  Nancy Norris:
  Universal Covers of Graphs: Isomorphism to Depth N-1 Implies Isomorphism to All Depths. Discret. Appl. Math. 56(1): 61-74 (1995)
• 
  Erich Prisner:
  Clique Covering and Clique Partition in Generalizations of Line Graphs. Discret. Appl. Math. 56(1): 93-98 (1995)
• 
  Jennifer Ryan:
  The Depth and Width of Local Minima in Discrete Solution Spaces. Discret. Appl. Math. 56(1): 75-82 (1995)
• 
  Maiko Shigeno, Yasufumi Saruwatari, Tomomi Matsui:
  An Algorithm for Fractional Assignment Problems. Discret. Appl. Math. 56(2-3): 333-343 (1995)