Monday, July 10

Discrete Methods and Applications

10:30 AM-12:30 PM
Rio Mar 10
Chair: Edwin Shapiro, University of San Francisco, USA

10:30-10:42 Puzzles, Games and Graphs
Nathaniel Dean, Rice University, USA
10:45-10:57 A Directed Graph for Assessing Statement Complexity
Narayan Debnath and Joyati Debnath, Winona State University, USA
11:00-11:12 Coloring Graphs of Bounded Decomposability
William Christian, Rice University, USA
11:15-11:27 Testing for Underage (Minor) Graphs
Illya V. Hicks, Rice University, USA
11:30-11:42 Discrete Optimization and Decomposition Heuristics
Padmanaban Kesavan and Paul I. Barton, Massachusetts Institute of Technology, USA
11:45-11:57 The Personnel Scheduling Problem: from a Fractional Solution to a Continuous Solution by Rounding
Edwin Shapiro, University of San Francisco, USA
12:00-12:12 Cancelled Guillotine Cutting of 3D-Box to Details with Two Unit Width
I. I. Ignatenko and N. N. Ivanov, Grodno State University, Belarus
12:15-12:27 Computational Protein Design
Niles A. Pierce, D. Benjamin Gordon, and Stephen L. Mayo, California Institute of Technology, USA
12:30-12:42 Maximum Cliques and Minimum Colorings in Graphs
Earl R. Barnes, Georgia Institute of Technology, USA

©2000, Society for Industrial and Applied Mathematics
Designed by Donaghy's Web Consulting
Created 4/12/00; Updated 5/7/00