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

• 1997
• 
  Fabrizio d'Amore, Paolo Giulio Franciosa, Alberto Marchetti-Spaccamela:
  Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, WG '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings. Lecture Notes in Computer Science 1197, Springer 1997, ISBN 3-540-62559-3 [contents]
• 1996
• 
  Paola Alimonti, Tiziana Calamoneri:
  Improved Approximations of Independent Dominating Set in Bounded Degree Graphs. WG 1996: 2-16
• 
  Luitpold Babel, Stephan Olariu:
  A New Characterization of P4-connected Graphs. WG 1996: 17-30
• 
  Michel Bauderon, Hélène Jacquet:
  Node Rewriting in Hypergraphs. WG 1996: 31-43
• 
  Sergei L. Bezrukov:
  On k-Partitioning the n-Cube. WG 1996: 44-55
• 
  Adrienne L. Broadwater, Kemal Efe, Antonio Fernández:
  Embedding Complete Binary Trees in Product Graphs. WG 1996: 56-66
• 
  Krzysztof Brys, Zbigniew Lonc:
  Clique and Anticlique Partition of Graphs. WG 1996: 67-72
• 
  Chi-Chang Chen, Jianer Chen:
  Optimal Parallel Routing in Star Graphs. WG 1996: 73-84
• 
  Serafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese:
  Counting Edges in a Dag. WG 1996: 85-100
• 
  Ornella Ciotti, Francesco Parisi-Presicce:
  Closure Properties of Context-Tree Hyperedge Replacement Systems. WG 1996: 101-113
• 
  Pierluigi Crescenzi, Paolo Penna:
  Upward Drawings of Search Trees (Extended Abstract). WG 1996: 114-125
• 
  Krzysztof Diks, Torben Hagerup:
  More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree. WG 1996: 126-140
• 
  Krzysztof Diks, Andrzej Pelc:
  System Diagnosis with Smallest Risk of Error. WG 1996: 141-150
• 
  Hristo N. Djidjev:
  On-Line Algorithms for Shortest Path Problems on Planar Digraphs. WG 1996: 151-165
• 
  Feodor F. Dragan, Falk Nicolai, Andreas Brandstädt:
  LexBFS-Orderings and Power of Graphs. WG 1996: 166-180
• 
  Jens Gustedt:
  Efficient Union-Find for Planar Graphs and other Sparse Graph Classes (Extended Abstract). WG 1996: 181-195
• 
  Stephan Hartmann, Markus W. Schäffter, Andreas S. Schulz:
  Switchbox Routing in VLSI Design: Closing the Complexity Gap. WG 1996: 196-210
• 
  Michel Hurfin, Michel Raynal:
  Detecting Diamond Necklaces in Labeled Dags (A Problem from Distributed Debugging). WG 1996: 211-223
• 
  Wolfram Kahl:
  Algebraic Graph Derivations for Graphical Calculi. WG 1996: 224-238
• 
  Damon Kaller:
  Definability Equals Recognizability of Partial 3-Trees. WG 1996: 239-253
• 
  Bettina Klinz, Gerhard J. Woeginger:
  One, Two, Three, Many, or: Complexity Aspects of Dynamic Network Flows with Dedicated Arcs. WG 1996: 254-267
• 
  Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, David Peleg:
  Approximate Maxima Finding of Continuous Functions Under Restricted Budget (Extended Abstract). WG 1996: 268-278
• 
  Leo G. Kroon, Arunabha Sen, Haiyong Deng, Asim Roy:
  The Optimal Cost Chromatic Partition Problem for Trees and Interval Graphs. WG 1996: 279-292
• 
  Sven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, S. S. Ravi, Kay U. Drangmeister:
  Modifying Networks to Obtain Low Cost Trees. WG 1996: 293-307
• 
  Ewa Malesinska, Alessandro Panconesi:
  On the Hardness of Allocating Frequencies for Hybrid Networks. WG 1996: 308-322
• 
  Falk Nicolai, Thomas Szymczak:
  Homogeneous Sets and Domination Problems. WG 1996: 323-337
• 
  Koji Obokata, Yukihiro Iwasaki, Feng Bao, Yoshihide Igarashi:
  Independent Spanning Trees of Product Graphs. WG 1996: 338-351
• 
  Swamy K. Sitarama, Abdol-Hossein Esfahanian:
  Designing Distance-Preserving Fault-Tolerant Topologies. WG 1996: 352-366
• 
  Tadao Takaoka:
  Shortest Path Algorithms for Nearly Acyclic Directed Graphs. WG 1996: 367-374
• 
  Spyros Tragoudas, Yaakov L. Varol:
  Computing Disjoint Path with Lenght Constraints. WG 1996: 375-389

skipping 2 more matches