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

• 1995
• 
  Hernán G. Abeledo, Uriel G. Rothblum:
  Paths to Marriage Stability. Discret. Appl. Math. 63(1): 1-12 (1995)
• 
  Igor Averbakh, Oded Berman, Abraham P. Punnen:
  Constrained Matroidal Bottleneck Problems. Discret. Appl. Math. 63(3): 201-214 (1995)
• 
  Abdelmadjid Bouabdallah, Charles Delorme, Selma Djelloul:
  Edge Deletion Preserving the Diameter of the Hypercube. Discret. Appl. Math. 63(1): 91-95 (1995)
• 
  María Rosa Brito:
  A Simple as Correct Algorithm for Deciding If a Graph Has a Perfect Matching. Discret. Appl. Math. 63(2): 181-185 (1995)
• 
  J. Orestes Cerdeira, Isabel Faria, Paulo Bárcia:
  Establishing Determinantal Inequalities for Positive-definite Matrices. Discret. Appl. Math. 63(1): 13-24 (1995)
• 
  Gerard J. Chang, C. Pandu Rangan, Satyan R. Coorg:
  Weighted Independent Perfect Domination on Cocomparability Graphs. Discret. Appl. Math. 63(3): 215-222 (1995)
• 
  Bruno Courcelle:
  The Monadic Second-order Logic of Graphs VI: On Several Representations of Graphs by Relational Structures. Discret. Appl. Math. 63(2): 199-200 (1995)
• 
  Mauro Dell'Amico, Silvano Martello, Daniele Vigo:
  Minimizing the Sum of Weighted Completion Times with Unrestricted Weights. Discret. Appl. Math. 63(1): 25-41 (1995)
• 
  James R. Driscoll, Dennis M. Healy Jr., Garth Isaak:
  Scheduling Dyadic Intervals. Discret. Appl. Math. 63(2): 101-116 (1995)
• 
  Fahir Ö. Ergincan, David A. Gregory:
  Directed Moore Hypergraphs. Discret. Appl. Math. 63(2): 117-127 (1995)
• 
  Carsten Flotow:
  on Powers of M-trapezoid Graphs. Discret. Appl. Math. 63(2): 187-192 (1995)
• 
  Alexandros V. Gerbessiotis:
  Close-to-optimal and Near-optimal Broadcasting in Random Graphs. Discret. Appl. Math. 63(2): 129-150 (1995)
• 
  Lucian Ilie:
  on Subwords of Infinite Words. Discret. Appl. Math. 63(3): 277-279 (1995)
• 
  Bettina Klinz, Rüdiger Rudolf, Gerhard J. Woeginger:
  on the Recognition of Permuted Bottleneck Monge Matrices. Discret. Appl. Math. 63(1): 43-74 (1995)
• 
  Evangelos Kranakis, Danny Krizanc:
  Labeled Versus Unlabeled Distributed Cayley Networks. Discret. Appl. Math. 63(3): 223-236 (1995)
• 
  Hong-Jian Lai, Hongyuan Lai:
  Every Matroid Is a Submatroid of a Uniformly Dense Matroid. Discret. Appl. Math. 63(2): 151-160 (1995)
• 
  Marjo Lipponen, Gheorghe Paun:
  Strongly Prime PCP Words. Discret. Appl. Math. 63(2): 193-197 (1995)
• 
  Eugeniusz Nowicki, Stanislaw Zdrzalka:
  A Bicriterion Approach to Preemptive Scheduling of Parallel Machines with Controllable Job Processing Times. Discret. Appl. Math. 63(3): 237-256 (1995)
• 
  Markus W. Schäffter:
  Drawing Graphs on Rectangular Grids. Discret. Appl. Math. 63(1): 75-89 (1995)
• 
  Mandayam A. Srinivas:
  Matroid optimization with Generalized Constraints. Discret. Appl. Math. 63(2): 161-174 (1995)
• 
  Wolfgang Stadje:
  Selecting Jobs for Scheduling on a Machine Subject to Failure. Discret. Appl. Math. 63(3): 257-265 (1995)
• 
  Jerzy Topp, Preben D. Vestergaard:
  Well Irredundant Graphs. Discret. Appl. Math. 63(3): 267-276 (1995)
• 
  Li-Hui Tsai:
  The Modified Differencing Method for the Set Partitioning Problem with Cardinality Constraints. Discret. Appl. Math. 63(2): 175-180 (1995)