Friday, July 17

CP24
Discrete Mathematics

2:00 PM-4:00 PM
Chair: Tamara G. Kolda, Oak Ridge National Laboratory
Room: Sidney Smith 1070

2:00 A New Spectral Method for Envelope Reduction

Tamara G. Kolda, Oak Ridge National Laboratory

2:15 New Spectral Graph Partitioning Algorithms

Michael Holzrichter and Suely Oliveira, Texas A&M University, College Station

2:30 Graph Pebbling, Threshold Functions, and the LYM Inequality

Glenn H. Hurlbert, Arizona State University; and Nancy Eaton, University of Rhode Island

2:30 The Code TEAM for Fast Multi-Dimensional Assignment

Richard H. Burkhart, Boeing Information and Support Services

2:45 Making a Fair Trial with a Biased Coin

Kenneth J. Supowit, Ohio State University

2:45 Structural Analysis of Linear Systems: Some Unexpected Theorems Based on Graph Theory

Roland P. Lantner, University of Paris 1, France

3:00 A Fast Labeling Algorithm for the Single Machine Batching Problem to Minimize the Total Weighted Completion Time

Wendy Huang, Lakehead University, Ontario, Canada

3:15 Graph Models and Techniques in Construction of Efficient and Reliable Programs

Victor N. Kasyanov, Institute of Informatics Systems, Russia