Sunday, January 9

Session 4B

4:00 PM-6:05 PM
Room: Oregon/Nevada

4:00 The Interlace Polynomial: A New Graph Polynomial

Richard Arratia, University of Southern California; Béla Bollobás, University of Memphis; and Gregory B. Sorkin, IBM T. J. Watson Research Center

4:25 The Complexity of Counting Graph Homomorphisms

Martin Dyer and Catherine Greenhill, University of Leeds, United Kingdom

4:50 A Fast Algorithm to Generate Unlabeled Necklaces

Frank Ruskey and Joe Sawada, University of Victoria, Canada

5:15 Construction of Visual Secret Sharing Schemes with Almost Optimal Contrast

Christian Kuhlmann and Hans Ulrich Simon, Ruhr-Universität Bochum, Germany

5:40 Sharing One Secret vs. Sharing Many Secrets: Tight Bounds on the Average Improvement Ratio

Giovanni Di Crescenzo, Telcordia Technologies, Inc., and University of California, San Diego