Chris Augeri's Publications

1. Chris Augeri, Barry Mullins, Leemon Baird, Dursun Bulutoglu, and Rusty Baldwin. “An algorithm for determining isomorphism using lexicographic sorting and the matrix inverse”, Congressus Numerantium, Utilitas Mathematica Publishing, vol. 184, pgs. 97–120, December 2007.

(pre-print, publisher)

B. Conference Articles (peer-reviewed)

1. Chris Augeri^* and Hesham Ali. “New Graph-based Algorithms for Partitioning VLSI Circuits”, in the Proceedings of the International Symposium on Circuits and Systems (ISCAS), Vancouver, BC, Canada, IEEE, vol. 4, pgs. 521–524, 23‑26 May 2004.

(pdf, poster, proceedings, conference, citation)

2. Dan Neebel, Chris Augeri, Gordon MacMillan^*, Leemon Baird, and Adrian de Freitas. “Work-in-progress: a visual cache memory simulator”, in the Proceedings of the 35th Frontiers in Education Conference (FIE), Indianapolis, IN, IEEE, 19‑22 October 2005.

(pdf, slides, proceedings, conference)

3. Chris Augeri^*, Dan Neebel, Leemon Baird, and Adrian de Freitas. “UAV communications: integrating a real-world scenario with computer architecture”, in the Proceedings of the 35th Frontiers in Education Conference (FIE), Indianapolis, IN, IEEE, 19‑22 October 2005.

(pdf, slides, proceedings, conference)

4. Chris Augeri^*, Kevin Morris, and Barry Mullins. “JOCosim: using Java, OPNET, and C to enable mobile co-simulation”, in the Proceedings of the 10th OPNETWORK Conference, Reagan Center, Washington D.C., OPNET, 28 August 2006‑1 September 2006.

(pdf, slides, conference)

5. Chris Augeri^*, Kevin Morris, and Barry Mullins. “HARVEST: a framework and co-simulation environment for analyzing unmanned aerial vehicle swarms”, in the Proceedings of the 25th Military Communications Conference (MILCOM), Washington D.C., IEEE,

23–25 October 2006.

(pdf, slides, proceedings, conference)

6. Chris Augeri^*, Barry Mullins, Dursun Bulutoglu, Rusty Baldwin, and Leemon Baird. “An analysis of XML compression efficiency”, in the Proceedings of the 1st Workshop on Experimental Computer Science (ExpCS), San Diego, CA, ACM, 13‑14 June 2007.

(supporting material, pdf, slides, proceedings, conference, citation)

7. Greg Brault^*, Chris Augeri, Barry Mullins, Rusty Baldwin, and Chris Mayer. “Enabling skip graphs to process k-dimensional range queries in a mobile sensor network”, in the Proceedings of the 6th IEEE International Symposium on Network Computing and Applications (NCA), Cambridge, MA, IEEE, 12‑14 July 2007

(pdf, slides, proceedings, conference)

8. Greg Brault^*, Chris Augeri, Barry Mullins, Chris Mayer, and Rusty Baldwin. “A comparison of multi-dimensional range querying and node mobility between standard and inverted skip graphs”, in the Proceedings of the 4th International Conference on Mobile and Ubiquitous Systems (MOBIQUITOUS), Philadelphia, PA, IEEE, 6‑10 August 2007.

(pdf, slides, proceedings, conference)

C. Print Articles

1. Chris Augeri. “America will overcome”, Airtides, McGuire Air Force Base Newspaper, October 2001.

(pdf)

2. Keith Shomper and Chris Augeri, “CS Think!”, Discovery, United States Air Force Academy, CO, April 2003.

(pdf)

3. Chris Augeri. “Intentional learners at USAFA”, Educator, United States Air Force Academy, Winter 2004.

(pdf)

4. Chris Augeri. “Mr. Quiz: an in-class active learning game”, Educator, United States Air Force Academy, Winter 2004.

(pdf)

D. Presentations

1. Chris Augeri^* and Hesham Ali. “On using Maple V to partition directed acyclic graphs”, presented at the Maple Summer Workshop, University of Waterloo, Waterloo, ON, Canada, July 2002.

(pdf, slides)

2. Chris Augeri^*, Barry Mullins, Leemon Baird, Dursun Bulutoglu, and Rusty Baldwin. “An algorithm for determining isomorphism”, presented at the 38th Southeastern International Conference on Combinatorics, Graph Theory, and Computing (CGTC), Florida Altlantic University, Boca Raton, FL, 5‑9 March 2007.

(abstract, slides, conference)

3. Chris Augeri^*, Barry Mullins, Leemon Baird, Dursun Bulutoglu, and Rusty Baldwin. “Determining a canonical graph isomorph using lexicographic sorting”, presented at the Discrete Mathematics Seminar, Department of Mathematics, Wright State University, Dayton, OH, 25 April 2007.

(abstract, slides, seminar - then, seminar - now)

4. Chris Augeri^*, Barry Mullins, Leemon Baird, Dursun Bulutoglu, and Rusty Baldwin. “Logarithmic coloring: how hard is it to determine isomorphism?”, presented at the 44th Midwestern Graph Theory Conference (MIGHTY), Wright State University, Dayton, OH, 11‑12 May 2007.

(abstract, slides, conference)

5. Chris Augeri^*, Barry Mullins, Leemon Baird, Dursun Bulutoglu, and Rusty Baldwin. “Linear systems and k-dimensional Weisfeiler-Lehman stabilization”, presented at the Discrete Mathematics Seminar, Department of Mathematics, Wright State University, Dayton, OH, 10 January 2008.

(abstract, seminar)

6. Chris Augeri^*, Barry Mullins, Rusty Baldwin, Leemon Baird, and Dursun Bulutoglu. “On Some Results in
Unmanned Aerial Vehicle Swarms”, an invited talk presented at the Department of Mathematics Colloquium, University of Dayton, Dayton, OH, 17 April 2008.

(slides, colloquium)

E. Theses

1. Chris Augeri. Development of an Abstract Graph Partitioning Model Using the Maple V Computer Algebra System, M.A. Thesis, University of Nebraska-Omaha, December 2000.

Favorite Result: United States 4-coloring balancing color area and border distance: (gif, png, jpg, bmp, txt)