2021 American Mathematical Society Data Science Talk
SkaggsAcademicCV2016
1. R. Duane Skaggs, PhD
EDUCATION
• PhD, Mathematics, University of South Africa, Pretoria, South Africa (2007) Thesis: Identifying
Vertices in Graphs and Digraphs. Promoters: Marietje Frick and Gerd H. Fricke
• MA, Mathematics, University of Kentucky, Lexington, KY (1996)
• BS, Mathematics, Summa Cum Laude, Shawnee State University, Portsmouth, OH (1994)
• Class Valedictorian, Portsmouth Clay High School, Portsmouth, OH (1990)
PROFESSIONAL APPOINTMENTS
YOST Labs Portsmouth, OH
2016 – Present Research Scientist, Motion Capture Research Team
Morehead State University Morehead, KY
2014 – Present Associate Professor, Mathematics
2008 – 2014 Assistant Professor, Mathematics
1998 – 2008 Instructor/Technology Coordinator, Mathematics and Computer Science
Ohio University Southern Ironton, OH
2004 – Present Adjunct Professor, Computer Science Technology
Shawnee State University Portsmouth, OH
1999 – 2007 Adjunct Professor, Mathematics and Computer Engineering Technology
1996 – 1998 Senior Instructor, Mathematics
YEI Corporation Portsmouth, OH
2008 – 2011 Consulting Mathematician
2001 – 2003 Senior Mathematician, Biodynotics Research Team
SPS Industries, LLC Portsmouth, OH
2000 – 2001 President/Audio Engineering Consultant
University of Kentucky Lexington, KY
1994 – 1996 Graduate Assistant, Mathematics
COURSES TAUGHT
• Morehead State University
First Year Seminar, Introductory Algebra, Intermediate Algebra, General Mathematics and
Problem Solving, Technical Mathematics, Trigonometry, Introduction to Computer Science,
Pre-Calculus, Calculus I, Calculus II, Calculus III, Statistics, Business Statistics, Practical
Cryptography and Computer Security, Discrete Mathematics, Linear Algebra, Numerical
Methods, Codes and Cryptography, Theory of Computation, Symmetry and Supersymmetry,
Computer Graphics, Artificial Intelligence, Senior Capstone, Graph Theory (undergraduate and
graduate), Complex Adaptive Systems (undergraduate and graduate), Number Theory
(undergraduate and graduate), Problem Solving (graduate), Voting Theory (undergraduate and
graduate), Game Theory (undergraduate and graduate)
• Ohio University Southern
Fundamentals of Business Computing, Web Server Management, Database Design, Database
Management, Systems Analysis, and Network Systems
• Shawnee State University
Developmental Mathematics, College Algebra, Geometry, Statistics, Mathematics for Liberal
Arts, Applied Finite Mathematics, Business Calculus, Calculus I, Calculus II, Calculus III,
Discrete Mathematics, Philosophy of Mathematics, and Algorithms
• University of Kentucky
College Algebra and recitation for Honors Calculus II and Honors Calculus III
2. Skaggs 2
UNIVERSITY SERVICE
• Morehead State University
Curriculum Committee (chair), Technology Coordinator Search Committee (chair), College
Technology Committee (chair), Mathematics Upper Level Course Committee, First Year
Program (MSU 101) Advisory Committee, Computer Science Committee, MPATE Day
Committee, Recruitment/Retention Committee, University Graduate Committee (vice chair),
University Academic Appeals Committee
• Shawnee State University
University Technology Advisory Committee, Curriculum Committee, and Senior Project
Revision Committee (chair)
UNDERGRADUATE RESEARCH SUPERVISION
Senior Thesis
2016
• William Burriss (CS/math), Machine learning, natural language, and elementary word problems
• Zack Kiser (math), A mathematical model of farm management
• Kristen Knight (math), Random graph models
• Derek McKenzie (math education), Warmups and bellringers
• Jeffrey Taylor (math), An algebraic approach to constrained vertex domination in graphs
2015
• Trevor Applegate (CS), Optimization of rural mail delivery
• Zane Dixon* (CS), Automated flash cards from portable document format files
• Jordan Watkins (CS), Quadratic reciprocity and fair virtual coin tosses
2014
• Larisa Gauze (math education), Applications of Zeckendorf’s theorem
• Brittany Knapmeyer (math education), The urban planning problem on graphs
• Dylan Hargett (CS), User interface and database design for the university timetabling problem
• John Hargett (CS), Solving the university timetabling problem with genetic algorithms
• William Holbrook (CS/math), Inverse preference in random geometric graphs
• Mark Sticklen (math), Domination and identification partitionable trees
2013
• Lauren Burton (math education), Pedagogy of mathematical games
• Samantha Griffith (math), Modeling the spread of information
• Michael Fantini (math), Visual analysis of the marching arts
• Joshua Waltmire (math), Variants of the Cops-and-Robbers game
2012
• Angela Collier (physics), Lattice models for the Lorentz gas
• Chelsea Staton (math), I call Heads, Heads, Tails, Heads
• Lindzey Thacker (math), Fractional identifying codes in graphs
2011
• Chad Clair (CS), Genetic algorithms for the University Course Timetabling Problem
• Timothy Evans (math), How to be mediocre at Mediocrity
• Anthony Fitch, (CS), Access control system with RFID and smartphones
• Julie Lang (math), Global properties of some preferential attachment graphs
• Blake Nickell (math), Identifying members of dynamic social networks
2010
• James Howard (CS/math), Some sum costs of some sum graphs
• Ashley Marcum (math), Simply graphs
• Alan Marion (CS), Cost effective Brownian motion in relation to computer graphics
• Amanda Mills (CS), Grade calculator using iPhone SDK 3.0
• Justin Smallwood (math), Trees with disjoint dominating sets and identifying codes
2009
• Kyle Sweeney (CS), Disappearing data: Steganography
• Courtney Hall (math), Models of growth and decline in social networks
3. Skaggs 3
2008
• John Mosley (CS/math), Solving systems of multivariable polynomial equations
• Jed Reader (CS), Notes to numbers: Guitar tablature computation
• Josh Knox (math), Preferential attachment graphs for modeling social networks
• Michael Rigdon (CS), A cross-platform graphical approach to course scheduling
• Jaison Wattula (CS), Propositional calculus and satisfiability
2007
• Jon Reitmann (CS), Keeping secrets on the web
• Adam Travis (CS), Project Arcane: Hardware emulation in action
• Joe Harless* (math), Separation in transit graphs
• Eric McCann (CS), Waking a sleeping giant: A CD bootable cluster
2006
• Nathan Gilbert (CS), Domination in zero-divisor graphs
• Ray Stone (CS), Realtime wireless network maps
2005
• Jon Bradford* (CS), ACELock: An electronic access control device
• Zach Thomas* (CS), Client/server management of electronic access control
2004
• Matt Caldwell (CS), A corpus-based approach to Natural Language Generation
2003
• Brad McDavid (CS), Almost equitable colorings in graphs
• Scott Pack (CS), Fault detection in wireless networks
• Daniel Waddell (CS), Algorithmic complexity of the sum cost of sum graphs
2002
• Adam Eldridge* (math), The non-attacking queens problem
• Shannon Hord (CS), Information hiding through digital steganography
• Michael McCarty* (astronomy), A 3D model of planetary interiors
• Michael McCarty (CS), Automated theorem proving and natural language processing
2001
• Michael Slone (math), Model theory and Smullyan systems
• Kevin Swartz (math), Vertex labels and label sums of paths and cycles
2000
• Michael Howard (math), Applications of domination in graphs
• Mae Hylton (math), Random knots and graphs
1999
• Michael Howard (math), Knots, graphs, and applications
1998
• James Hannah (math), Implementation of an algorithm to find Gröbner bases
• John Liston* (math), Applications of linear algebra to data compression
• Jacki Pettigrew* (math), Quadratic programming and portfolio management
Undergraduate Research Fellows
2016
• Binamrata Sharma (math), Urban planning in graphs
2015
• Brittany Alloway* (CS/math), Studies in separation in graphs
• Iris Johnson* (math), Studies in separation in graphs
• Kristen Knight (math), Covering graphs by equivalence relations
• Michael McGinnis* (CS), Studies in separation in graphs
2014
• Brittany Alloway* (CS/math), Studies in separation in graphs
• Iris Johnson* (math), Studies in separation in graphs
• Kristen Knight* (math), Studies in separation in graphs
4. Skaggs 4
• Michael McGinnis* (CS), Studies in separation in graphs
2013
• Biswas Sharma* (math), Studies in separation in graphs
• Mark Sticklen (math), Graphs with equal domination and identification parameters
2012
• Mark Sticklen (math), Graphs with equal domination and identification parameters
• Logan Higginbotham* (math), Studies in separation in graphs
• Biswas Sharma* (math), Studies in separation in graphs
• William Holbrook* (CS/math), Studies in separation in graphs
2011
• William Holbrook* (CS/math), Studies in separation in graphs
• Blake Nickell* (math), Studies in separation in graphs
2010
• Angela Collier (physics/math), Preferential attachment graphs
• William Holbrook* (math), Studies in separation in graphs
2009
• James Gibbs (CS), The sum cost of sum graphs
• Brian Salyer* (math), Studies in separation in graphs
2008
• Amber Harrison* (math), The sum cost of sum graphs
• Brian Salyer* (math), Studies in separation in graphs
2007
• Nick Wahle* (math), Studies in separation in graphs
• Jaison Wattula* (CS), Development and implementation of an algorithm for computing invariants
of 3-manifolds
* served as co-supervisor
Graduate Student Supervision
2015
• Lisa Williams (math), Urban planning on graphs
2011
• James Hufford (math), Trees with disjoint dominating sets and identifying codes
2008 – 2009
• Thomas Suter (digital art and new media), Concepts for Art, Academy of Art University, San
Francisco (external thesis project advisor)
GRANTS
• Separation Problems on Chessboards, with R.D. Chatham (PI), R. Blankenship, and M. Doyle,
Kentucky NSF-EPSCoR grant UKRF 3046884400-07-419, $25000, 2006 – 2007.
• A Scalable Research Cluster, with M. Doyle (PI), R.D. Chatham, and T. O’Brien, Kentucky
NASA-EPSCoR grant NCC5-571, $23394, 2005 – 2007.
• High Performance Computing Prototype, with M. Doyle, MSU Faculty Research grant 225229,
$3220, 2005.
• Undergraduate Recruitment Video and Web Design, university funded, $2000, 2001 – 2002.
• Student Web Team Development, with D.E. Spickler, university funded, $1050, 2000.
PUBLICATIONS
Refereed
• R.D. Chatham, M. Doyle, R.J. Jeffers, W.A. Kosters, R.D. Skaggs, and J. Ward, Centrosymmetric
solutions to chessboard separation problems, Bull. Inst. Comb. Appl. 65 (2012) 6 – 26.
• R.D. Chatham, M. Doyle, J. Miller, A. Rogers, R.D. Skaggs, and J. Ward, Algorithm performance
for chessboard separation problems, J. Combin. Math. Combin. Comput. 70 (2009) 127 – 142.
• R.D. Chatham, M. Doyle, G.H. Fricke, J. Reitmann, R.D. Skaggs, and M. Wolff, Independence
and domination separation on chessboard graphs, J. Combin. Math. Combin. Comput. 68 (2009) 3
– 17.
5. Skaggs 5
• M. Frick, G.H. Fricke, C.M. Mynhardt, and R.D. Skaggs, Critical graphs with respect to vertex
identification, Util. Math. 76 (2008) 213 – 227.
• R.D. Chatham, G.H. Fricke, and R.D. Skaggs, The Queens separation problem, Util. Math. 69
(2006) 129 – 141.
• O. Favaron, G. Fricke, W. Goddard, S.M. Hedetniemi, S.T. Hedetniemi, P. Kristiansen, R.C.
Laskar, and D. Skaggs, Offensive alliances in graphs, Discuss. Math. Graph Theory 24 (2004)
263 – 275.
Works in progress
• R. Blankenship, R.D. Chatham, J.V. Harless, B. Salyer, R.D. Skaggs, and B.N. Wahle, Covering
powers of cycles by equivalence relations, in revision.
• G.H. Fricke, J.F. Gibbs, F.N. Harary, J. Howard, R.D. Skaggs, and J.A. Ward, The sum cost of
sum graphs, in revision.
• J.R. Hufford, R.D. Skaggs, J. Smallwood, and M. Sticklen, A note on trees with disjoint
dominating sets and identifying codes, in preparation.
• B. Knapmeyer, B. Sharma, R.D. Skaggs, and L. Williams, Urban planning on graphs, in
preparation.
• R.D. Skaggs and W. Holbrook, Inverse preference in random geometric graphs, in preparation.
• R.D. Skaggs and M. Slone, A note on weak and strong domination in graphs, in preparation.
Miscellaneous
• R.D. Skaggs and P. Yost, Translation of foreign road signs using a personal digital assistant,
Technical Report #R16, YEI Corporation, 2002.
• R.D. Skaggs and P. Yost, Wireless multi-array robot system for ubiquitous telepresence and
telescience, Technical Report #R19, YEI Corporation, 2002.
• R.D. Skaggs and P. Yost, Tracking user appendages for human/computer interaction, Technical
Report #R23, YEI Corporation, 2002.
• F. Hartop, R.D. Skaggs, and P. Yost, A neo-evolutionary robotics paradigm, Technical Report
#R24, YEI Corporation, 2002.
• H.T. Goodwill, R.D. Skaggs, and D.E. Spickler, Twice reducible fractions, manuscript.
• S.A. Purtee and R.D. Skaggs, Completely intransitive voter preference models, manuscript.
PRESENTATIONS, WORKSHOPS, AND CONFERENCES
• E. Jerde, J. Myers, M. McClave, and R.D. Skaggs, Shining the spotlight on students, course
design, and faculty in online STEM courses, Pedagogicon 2015, Eastern Kentucky University, 22
May 2015.
• G. Gonzalez, C. Schroeder, R.D. Skaggs, N. Wang, and Y. You, Choose your own adventure:
Interactive asynchronous learning, poster, Pedagogicon 2015, Eastern Kentucky University, 22
May 2015.
• Kentucky MAA Section Meeting, Morehead State University, Organizing Committee, 27-28
March 2015.
• Kentucky MAA Section Meeting, Transylvania University, The spring number of a graph, 5 April
2013.
• Kentucky MAA Section Meeting, University of Kentucky, Large identifying codes in graphs, 26
March 2010.
• Kentucky Academy of Sciences Annual Meeting, Northern Kentucky University, Graphs with
disjoint dominating sets and identifying codes, 14 November 2009.
• GEAR-UP Problem Solving Workshops for Eighth Graders, Morehead State University, 10, 13,
14 November 2006.
• Morehead State University Department of Mathematics and Computer Science Faculty Seminar,
Finding small identifying codes is hard, 8 September 2006.
• High-Performance Computing and Computational Grid Workshop, University of Kentucky, 17
October 2005.
• SIAM-SEAS 2004, East Tennessee State University, Counting minimal addition chains, April
2004.
6. Skaggs 6
• Morehead State University Department of Mathematics and Computer Science Faculty Seminar,
Some results on addition chains, February 2004.
• GEAR-UP Problem Solving Workshop for Eighth Graders, Morehead State University, 10
December 2003.
• Morehead State University Department of Mathematics and Computer Science Faculty Seminar,
Finding a point on a line, 5 December 2003.
• The 17th
Clemson Mini-Conference on Combinatorial Optimization, Clemson University, 10 – 11
October 2002.
• EDUCO Training and Dissemination Project, Institute for Training and Dissemination, Clark
Atlanta University, 7-8 June 2002.
• The 16th
Annual Symposium in the Mathematical, Statistical, and Computer Sciences, Eastern
Kentucky University, 12 April 2002.
• IBM and Linux Product Briefing Workshop, Morehead State University, 2 May 2002.
• Crossroads in Mathematics, AMATYC Workshop, Shawnee State University, March 2002.
• Kentucky MAA Section Meeting, University of Kentucky, Identifying vertices in graphs, 6 April
2001.
• The 15th
Clemson Mini-Conference on Discrete Mathematics, Clemson University, 20 – 21
October 2000.
• Invited Senior Seminar Speaker, Morehead State University, Completely intransitive voter
preference models, 4 April 2000.
• The 12th
Cumberland Conference on Combinatorics, Graph Theory, and Computing, University of
Louisville, 20 – 22 May 1999.
• Colloquium Speaker, University of Alabama in Huntsville, What is so special about 8.5 × 11?
Calculus, technology, and communication, 12 May 1999.
• Invited Speaker, Lexington Community College, Pizza, quadratic equations, and you, May 1999.
• Invited Speaker, Morehead State University Math Club, Knot theory with applications to
chemistry, physics, and biology, March 1999.
• Keynote Speaker, Clay High School Academic Banquet, Portsmouth, OH, May 1998.
• Invited Speaker, Midwest Talent Search Awards Ceremony, Scioto County, OH, February 1998.
• Ohio MAA Sectional Meeting, Shawnee State University, October 1997.
• Ohio Project NExT conference, October 1997.
• Casualty Actuary Society conference, Chicago, Illinois, November 1996.
• Graduate Student Colloquium, University of Kentucky, The Alexander polynomial and other knot
invariants, 10 April 1996.
• Graduate Student Colloquium, University of Kentucky, A prime decomposition theorem for knots,
October 1994.
ADDITIONAL ACTIVITIES
• Associate Fellow, The Institute of Combinatorics and Its Applications
• Member, Kentucky Academy of Sciences
• National Councilor, Council on Undergraduate Research, 2011 – 2014.
• Recipient of Outstanding Teaching Award, Department of Mathematics, Computer Science and
Physics, 8 May 2010.
• Reviewer for Mathematical Reviews, Discrete Mathematics, Discrete Applied Mathematics,
Journal of Combinatorial Mathematics and Combinatorial Computing, and Journal of the
Kentucky Academy of Sciences
• Senior Editor of Morehead Electronic Journal of Applicable Mathematics
• Kentucky Governor’s Scholars Program, Modes of Mathematical Thinking, 2008.
• Upward Bound, Shawnee State University, 2002. Morehead State University, 2004 – 2008.
• Science Fair Judge, Green Elementary and Middle School, 2007 – 2010.
• Coordinating Judge, Mathematics and Computer Science Division, Ohio Junior Academy of
Science District Science Fair, 1997 – 1998.
7. Skaggs 7
REFERENCES
Dora Ahmadi, PhD
Associate Dean of International Student Services and Associate Professor of Mathematics
Department of Mathematics and Physics
Morehead State University
Morehead, KY
Phone: 606.783.2930
Email: d.ahmadi@moreheadstate.edu
Maureen, Doyle, PhD
Associate Dean of Informatics and Associate Professor of Computer Science
College of Informatics
Northern Kentucky University
Highland Heights, KY
Phone: 859.572.5468
Email: doylem3@nku.edu
Nathan Gilbert
Software Engineer
Autodesk, Inc.
Salt Lake City, UT
Phone: 801.656.7268
Email: nathan.gilbert@autodesk.com
Michael McCarty
Senior Software Engineer
Booz Allen Hamilton
McLean, VA
Phone: 865.274.2171
Email: mccarty_michael@bah.com