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

• 1992
• 
  Gunther Schmidt, Rudolf Berghammer:
  17th International Workshop, WG '91, Fischbachau, Germany, June 17-19, 1991, Proceedings. Lecture Notes in Computer Science 570, Springer 1992, ISBN 3-540-55121-2 [contents]
• 1991
• 
  Marc Andries, Jan Paredaens:
  A Language for Generic Graph-Transformations. WG 1991: 63-74
• 
  Hans L. Bodlaender:
  On Disjoint Cycles. WG 1991: 230-238
• 
  Hans L. Bodlaender, John R. Gilbert, Ton Kloks, Hjálmtyr Hafsteinsson:
  Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height. WG 1991: 1-12
• 
  Andreas Brandstädt:
  Short Disjoint Cycles in Cubic Bridgeless Graphs. WG 1991: 239-249
• 
  Bruno Courcelle, Mohamed Mosbah:
  Monadic Second-Order Evaluations on Tree-Decomposable Graphs. WG 1991: 13-24
• 
  Jurek Czyzowicz, Eduardo Rivera-Campo, Nicola Santoro, Jorge Urrutia, Joseph Zaks:
  Tight Bounds for the Rectangualr Art Gallery Problem. WG 1991: 105-112
• 
  Peter Damaschke:
  Logic Arrays for Interval Indicator Functions. WG 1991: 219-225
• 
  Ding-Zhu Du, Yuh-Dauh Lyuu, D. Frank Hsu:
  Line Digraph Iterations and Spread Concept - with Application to Graph Theory, Fault Tolerance, and Routing. WG 1991: 169-179
• 
  Esteban Feuerstein, Alberto Marchetti-Spaccamela:
  Dynamic Algorithms for Shortest Paths in Planar Graphs. WG 1991: 187-197
• 
  Rudolf Freund, Brigitte Haberstroh:
  Attributed Elementarz Programmed Graph Grammars. WG 1991: 75-84
• 
  Leonidas J. Guibas, Joseph S. B. Mitchell:
  Voronoi Diagrams of Moving Points in the Plane. WG 1991: 113-125
• 
  Ralf Heckmann, Ralf Klasing, Burkhard Monien, Walter Unger:
  Optimal Embedding of Complete Binary Trees into Lines and Grids. WG 1991: 25-35
• 
  Edmund Ihler:
  The Complexity of Approximating the Class Steiner Tree Problem. WG 1991: 85-96
• 
  Xiaoyi Jiang, Horst Bunke:
  Optimal Vertex Ordering of a Graph and its Application to Symmetry Detection. WG 1991: 148-158
• 
  Zvi M. Kedem, Krishna V. Palem, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis:
  Fast Parallel Algorithms for Coloring Random Graphs. WG 1991: 135-147
• 
  Ludek Kucera:
  A Generalized Encryption Scheme Based on Random Graphs. WG 1991: 180-186
• 
  Zbigniew Lonc:
  On Complexity of Some Chain and Antichain Partition Problems. WG 1991: 97-104
• 
  Yasuyoshi Okada, Masahiro Hayashi:
  Graph Rewriting Systems and their Application to Network Reliability Analysis. WG 1991: 36-47
• 
  Takayoshi Shoudai:
  Using Maximal Independent Sets to Solve Problems in Parallel. WG 1991: 126-134
• 
  Iain A. Stewart:
  Copmlete Problems for Logspace Involving Lexicographic First Paths in Graphs. WG 1991: 198-208
• 
  Elena Stöhr:
  On the Broadcast Time of the Butterfly network. WG 1991: 226-229
• 
  Ondrej Sýkora, Imrich Vrto:
  On the Crossing Number of the Hypercube and the Cube Connected Cycles. WG 1991: 214-218
• 
  Ondrej Sýkora, Imrich Vrto:
  Edge Separators for Graphs of Bounded Genus with Applications. WG 1991: 159-168
• 
  Tadao Takaoka:
  A New Upper Bound on the Complexity of the All Pairs Shortest Path Problem. WG 1991: 209-213
• 
  Albert Zündorf, Andy Schürr:
  Nondeterministic Control Structures for Graph Rewriting Systems. WG 1991: 48-62