9:00 - 9:10 Welcome
Bill Bauldry, Chairman of Department of Mathematical Sciences

9:10 - 9:30 New Results on Quasi-Uniquely Edge Colorable Graphs
Brooke Cranswick
Appalachian State University

9:40 - 10:00 A probabilistic approach to Euler's formula
Jake Bentfield
East Tennessee State University

10:10 - 10:30 Six proofs of an elementary combinatorial identity
Dayla Pike
East Tennessee State University

Break

10:50 - 11:10 Rijndael, the proposed Advanced Encryption Standard (AES) for the US
Bill Bauldry
Appalachian State University

11:20 - 11:40 Coloring k-paired graphs
Kelly Wise
Appalachian State University

11:50 - 12:10 Realizability of graphs given fixed domination number and number of good and bad vertices
Genie Jackson
East Tennessee State University

12:30 - 2:00 Luncheon with Keynote Speaker
To Change or Not to Change
Teresa Haynes
East Tennessee State University

2:20 - 2:40 Ordinary, Nice and Very Nice Venn Diagrams
Gabriel Zimmer
East Tennessee State University

2:50 - 3:10 Antipodal Gray Codes
Chip Killian
North Carolina State University

Break

3:30 - 3:50 6174 is a special number
Jason Lewis
East Tennessee State University

4:00 - 4:20 Self-stabilizing graph algorithms
Petter Kristiansen
University of Bergen

4:30 - 4:50 Effect of Scanning Procedure on the Digital Image Set Compression
Casey Parks
Appalachian State University

4:55 - 5:00 Closing Comments