• 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

• 2005
• 
  Siemion Fajtlowicz, Patrick W. Fowler, Pierre Hansen, Melvin F. Janowitz, Fred S. Roberts:
  Graphs and Discovery, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, November 12-16, 2001. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 69, DIMACS/AMS 2005, ISBN 978-0-8218-4380-2 [contents]
• 2001
• 
  Jonathan W. Berry:
  Considerations for Future Designers of General Purpose Graph Software. Graphs and Discovery 2001: 1-6
• 
  Eric Breimer, Mark K. Goldberg, David L. Hollinger, Darren T. Lim:
  Discovering Optimization Algorithms Through Automated Learning. Graphs and Discovery 2001: 7-26
• 
  Gunnar Brinkmann, Olaf Delgado-Friedrichs, Ulrike von Nathusius:
  Numbers of Faces and Boundary Encodings of Patches. Graphs and Discovery 2001: 27-38
• 
  Dragos M. Cvetkovic, Slobodan K. Simic:
  Graph Theoretical Results Obtained by the Support of the Expert System "Graph" - An Extended Survey. Graphs and Discovery 2001: 39-70
• 
  Ermelinda DeLaViña:
  Graffiti.pc: A Variant of Graffiti. Graphs and Discovery 2001: 71-79
• 
  Ermelinda DeLaViña:
  Some History of the Development of Graffiti. Graphs and Discovery 2001: 81-118
• 
  Ermelinda DeLaViña, Siemion Fajtlowicz, William Waller:
  On Some Conjectures of Griggs and Graffiti. Graphs and Discovery 2001: 119-125
• 
  Siemion Fajtlowicz:
  On The Representation and Characterization of Fullerene C60. Graphs and Discovery 2001: 127-135
• 
  Jack E. Graver:
  The Structure of Fullerene Signatures. Graphs and Discovery 2001: 137-165
• 
  Jack E. Graver:
  Catalog of All Fullerenes with Ten or More Symmetries. Graphs and Discovery 2001: 167-188
• 
  Pierre Hansen:
  How Far Is, Should and Could Be Conjecture-Making in Graph Theory an Automated Process? Graphs and Discovery 2001: 189-229
• 
  Pierre Hansen, Mustapha Aouchiche, Gilles Caporossi, Hadrien Mélot, Dragan Stevanovic:
  What Forms Do Interesting Conjectures Have in Graph Theory? Graphs and Discovery 2001: 231-251
• 
  Pierre Hansen, Hadrien Mélot:
  Variable Neighborhood Search for Extremal Graphs. 9. Bounding the Irregularity of a Graph. Graphs and Discovery 2001: 253-264
• 
  Summer M. Husband, Christopher P. Husband, Nathaniel Dean, James M. Tour:
  Mathematics for the Nanocell Approach to Molecular Electronics. Graphs and Discovery 2001: 265-286
• 
  Robert J. Kingan, Sandra R. Kingan:
  A Software System for Matroids. Graphs and Discovery 2001: 287-295
• 
  Craig E. Larson:
  A Survey of Research in Automated Mathematical Conjecture-Making. Graphs and Discovery 2001: 297-318
• 
  Reinhard Laue, Thomas Grüner, Markus Meringer, Adalbert Kerber:
  Constrained Generation of Molecular Graphs. Graphs and Discovery 2001: 319-331
• 
  Wendy J. Myrvold, Tania Prsa, Neil Walker:
  A Dynamic Programming Approach for Timing and Designing Clique Algorithms. Graphs and Discovery 2001: 333-340
• 
  Ryan D. Pepper:
  On New Didactics of Mathematics: Learning Graph Theory via Graffiti. Graphs and Discovery 2001: 341-349
• 
  Tomaz Pisanski, Marko Boben, Arjana Zitnik:
  Interactive Conjecturing with Vega. Graphs and Discovery 2001: 351-364
• 
  Dragan Stevanovic, Gilles Caporossi:
  On the (1, 2)-Spectral Spread of Fullerenes. Graphs and Discovery 2001: 365-370
• 
  Forward. Graphs and Discovery 2001: v-
• 
  Preface. Graphs and Discovery 2001: vii-