This Year's Schedule of Talks

9:45 - Welcome

10:00 - 10:20 Key Structure of AES
Bill Bauldry
Appalachian State University


10:30 - 10:50 Scaled Structures and Self-Similarity in the Morse-Thue Sequence
Nathan Vish
Appalachian State University


11:00 - 11:20 What the Hecke? Parity of k-regular partition functions
Shirley Law, Philip Lee, Jeanne Radder
Appalachian State University


Lunch


12:45 - 1:45 Keynote Address: Stable allocation problems and algorithms
Brian Dean
Clemson University


2:00 - 2:20 K-Traceability in Graphs
Brittany Jones
Converse College


2:30 - 2:50 Double domination on the Queen's graph, Rook's graph, and King's graph
Paul Burchett
University of Virginia at Wise

3:00 - 3:20 Structural Characteristics of Online Social Networks
Mitchell Jareo
Appalachian State University

3:30 - 3:50 Which Chessboards have a Closed Knight's Tour within the Cube?
Joe DeMaio
Kennesaw State University

4:00 - 4:20 Independent Open Irredundant Sets
Jamie Breedlove
Appalachian State University

4:30 - Closing Comments

Link to previous schedules:

  1. 2005 schedule
  2. 2004 schedule
  3. 2003 schedule
  4. 2002 schedule
  5. 2001 schedule
  6. 2000 schedule

This conference is an MAA NSF-RUMC sponsored activity, funded by NSF Grant DMS-0241090. We are thankful for their support.


Last Modified: Tuesday, 16-Apr-06 - AAM