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

• 1981
• 
  Hartmut Noltemeier:
  Graphtheoretic Concepts in Computer Science, Proceedings of the International Workshop WG '80, Bad Honnef, Germany, June 15-18, 1980. Lecture Notes in Computer Science 100, Springer 1981, ISBN 3-540-10291-4 [contents]
• 1980
• 
  Giorgio Ausiello, Alessandro D'Atri, Domenico Saccà:
  Graph Algorithms for the Synthesis and Manipulation of Data Base Schemes. WG 1980: 212-233
• 
  Carlo Batini, Alessandro D'Atri:
  Schema Hypergraphs: A Formalism to Investigate Logical Data Base Design. WG 1980: 177-194
• 
  Jon Louis Bentley, Thomas Ottmann:
  The Power of a One-Dimensional Vector of Processors. WG 1980: 80-89
• 
  Peter Brucker:
  The Chinese Postman Problem for Mixed Graphs. WG 1980: 354-366
• 
  Ulrich Derigs:
  F-Factors, Perfect Matchings and Related Concepts. WG 1980: 388-403
• 
  Jürgen Ebert, Jürgen Perl:
  Reachablity Homomorphisms on Nets. WG 1980: 326-334
• 
  Shimon Even, Yacov Yacobi:
  An Observation Concerning the Complexity of Problems with Few Solutions and its Application to Cryptography. WG 1980: 270-278
• 
  Horst W. Hamacher:
  Optimal (s, t)-Cuts (Extended Abstract). WG 1980: 383-387
• 
  Peter Kandzia, Margret Mangelmann:
  The Use of Transitively Irreducible Kernels of Full Families of Functional Dependencies in Logical Data Base Design. WG 1980: 195-211
• 
  Hans-Jörg Kreowski:
  A Comparison Between Petri-Nets and Graph Grammars. WG 1980: 306-317
• 
  Peter Läuchli:
  Generating All Planar 0-, 1-, 2-, 3-Connected Graphs. WG 1980: 379-382
• 
  Helmut J. Ludwigs:
  Properties of Ordered Graph Grammars. WG 1980: 70-79
• 
  Bernd Mahr:
  A Birds Eye View to Path Problems. WG 1980: 335-353
• 
  Hermann A. Maurer:
  The Post-Office Problem and Related Questions. WG 1980: 1-19
• 
  Kurt Mehlhorn:
  A New Data Structure for Representing Sorted Lists. WG 1980: 90-112
• 
  Burkhard Monien:
  Bounding the Bandwidth of NP-Complete Problems. WG 1980: 279-292
• 
  Manfred Nagl:
  Graph Rewriting and Automatic, Machine-Independent Program Optimization. WG 1980: 55-69
• 
  Hidenosuke Nishio:
  Series of Graphs Generated by Rational Machines. WG 1980: 20-31
• 
  Hartmut Noltemeier:
  On a Generalization of Heaps. WG 1980: 127-136
• 
  Thomas Ottmann, Hans-Werner Six, Derick Wood:
  The Analysis of Search Trees: A Survey. WG 1980: 234-249
• 
  Wolfgang Reisig:
  A Graph Grammar Representation of Non-Sequential Processes. WG 1980: 318-325
• 
  Arnold L. Rosenberg:
  Issues in the Study of Graph Embeddings. WG 1980: 150-176
• 
  Gunther Schmidt:
  Investigating Programs in Terms of Partial Graphs. WG 1980: 268-269
• 
  Hans Jürgen Schneider:
  Set-Theoretic Concepts in Programming Languages and their Implementation. WG 1980: 42-54
• 
  Manfred Schnitzler:
  Graph Grammars and the Complexity Gap in the Isomorphism Problem for Acyclic Digraphs. WG 1980: 137-149
• 
  Hans-Werner Six:
  A Framework for Data Structures. WG 1980: 250-267
• 
  Ivan Hal Sudborough:
  The Complexity of Path Problems in Graphs and Path Systems of Bounded Bandwidth. WG 1980: 293-305
• 
  Gottfried Tinhofer:
  On the Use of Some Almost Sure Graph Properties. WG 1980: 113-126
• 
  Oliver Vornberger:
  Alternative Cycle Covers and Paths. WG 1980: 367-378

skipping 1 more match