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

• 1996
• 
  Michel Deza, Reinhardt Euler, Yannis Manoussakis:
  Combinatorics and Computer Science, 8th Franco-Japanese and 4th Franco-Chinese Conference, Brest, France, July 3-5, 1995, Selected Papers. Lecture Notes in Computer Science 1120, Springer 1996, ISBN 3-540-61576-8 [contents]
• 1995
• 
  Thomas Andreae, Michael Nölle, Christof Rempel, Gerald Schreiber:
  On Embedding 2-Dimensional Toroidal Grids into de Bruijn Graphs with Clocked Congestion One. Combinatorics and Computer Science 1995: 316-327
• 
  Evripidis Bampis, Pavol Hell, Yannis Manoussakis, Moshe Rosenfeld:
  Finding an Antidirected Hamiltonian Path Starting with a Forward Arc from a Given Vertex of a Tournament. Combinatorics and Computer Science 1995: 67-73
• 
  Evripidis Bampis, Yannis Manoussakis, Ioannis Milis:
  On the Parallel Complexity of the Alternating Hamiltonian Cycle Problem. Combinatorics and Computer Science 1995: 367-377
• 
  József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger:
  Worst-Case Analysis for On-Line Data Compression. Combinatorics and Computer Science 1995: 288-300
• 
  Jean-Claude Bermond, Takako Kodate, Stephane Perennes:
  Gossiping in Cayley Graphs by Packets. Combinatorics and Computer Science 1995: 301-315
• 
  Sergei L. Bezrukov, Firoz Kaderali, Werner Poguntke:
  On Central Spanning Trees of a Graph. Combinatorics and Computer Science 1995: 53-57
• 
  Vincent Bouchitté, Abdelmajid Hilali, Roland Jégou, Jean-Xavier Rampon:
  Contiguity Orders. Combinatorics and Computer Science 1995: 275-287
• 
  Yves Caseau, François Laburthe:
  Improving Branch and Bound for Jobshop Scheduling with Constraint Propagation. Combinatorics and Computer Science 1995: 129-149
• 
  Fouad B. Chedid:
  On the Hybrid Neural Network Model for Solving Optimization Problems. Combinatorics and Computer Science 1995: 182-193
• 
  Chiuyuan Chen, Chin-Chen Chang:
  Connected Proper Interval Graphs and the Guard Problem in Spiral Polygons. Combinatorics and Computer Science 1995: 39-47
• 
  Bor-Liang Chen, Ming-Tat Ko, Ko-Wei Lih:
  Equitable and m-Bounded Coloring of Split Graphs. Combinatorics and Computer Science 1995: 1-5
• 
  Marc Demange, Vangelis Th. Paschos:
  Constructive - Non-constructive Approximation and Maximum Independent Set Problem. Combinatorics and Computer Science 1995: 194-207
• 
  Antoine Deza, Michel Deza, Komei Fukuda:
  On Skeletons, Diameters and Volumes of Metric Polyhedra. Combinatorics and Computer Science 1995: 112-128
• 
  Michel Deza, Tayuan Huang:
  Complementary l₁-Graphs and Related Combinatorial Structures. Combinatorics and Computer Science 1995: 74-90
• 
  Reinhardt Euler, Laurent Lemarchand:
  Some Applications of Combinatorial Optimization in Parallel Computing. Combinatorics and Computer Science 1995: 348-366
• 
  Komei Fukuda, Alain Prodon:
  Double Description Method Revisited. Combinatorics and Computer Science 1995: 91-111
• 
  Wen-Lian Hsu:
  On-Line Recognition of Interval Graphs in O(m + nlog n) Time. Combinatorics and Computer Science 1995: 27-38
• 
  T. C. Hu, J. David Morgenthaler:
  Optimum Alphabetic Binary Trees. Combinatorics and Computer Science 1995: 234-243
• 
  Jihad Mohamad Jaam:
  Ramsey Numbers by Stochastic Algorithms with New Heuristics. Combinatorics and Computer Science 1995: 163-181
• 
  Bettina Klinz, Gerhard J. Woeginger:
  A New Efficiently Solvable Special Case of the Three-Dimensional Axial Bottleneck Assignment Problem. Combinatorics and Computer Science 1995: 150-162
• 
  Håkan Lennerstad, Lars Lundberg:
  Combinatorics for Multiprocessor Scheduling Optimization and Oter Contexts in Computer Architecture. Combinatorics and Computer Science 1995: 341-347
• 
  Chiang Lin, Jenq-Jong Lin, Tay-Woei Shyu:
  Complete Bipartite Decompositions of Crowns, with Applications to Complete Directed Graphs. Combinatorics and Computer Science 1995: 58-66
• 
  Karina Marcus, András Sebö:
  On Integer Multiflows and Metric Packings in Matroids. Combinatorics and Computer Science 1995: 218-233
• 
  Yasuko Matsui, Tomomi Matsui:
  Enumeration Algorithm for the Edge Coloring Problem on Bipartite Graphs. Combinatorics and Computer Science 1995: 18-26
• 
  Ioannis Milis:
  Task Assignment in Distributed Systems Using Network Flow Methods. Combinatorics and Computer Science 1995: 396-405
• 
  Fouzia Moussouni, Christian Lavault:
  N-Cube String Matching Algorithm with Long Texts. Combinatorics and Computer Science 1995: 328-340
• 
  Dritan Nace, Jacques Carlier:
  Distributed Rerouting in DCS Mesh Networks. Combinatorics and Computer Science 1995: 406-415
• 
  Bruno Patrou:
  Zigzag Codes and Z-Free Hulls. Combinatorics and Computer Science 1995: 263-274
• 
  Rossella Petreschi, Andrea Sterbini:
  Threshold Graphs and Synchronization Protocols. Combinatorics and Computer Science 1995: 378-395

skipping 4 more matches