Justin Schroeder
Justin Schroeder
Assistant Professor
Department
College of Arts & Sciences
Education
Ph.D. Mathematics, Vanderbilt University
B.A., Carthage College
Biography
Dr. Justin Schroeder is an Assistant Professor in The Beacom College of Computer & Cyber Sciences. He specializes in discrete mathematics and board game design, and supervises undergraduate research projects related to these areas.
Justin Schroeder came to DSU in August 2023 after spending 8 years on a church-planting team in southeastern Europe. Before heading overseas, he taught for two years at George Mason University in Virginia.
Outside of the classroom, Justin occasionally teaches Sunday School and often hosts international students for an annual Thanksgiving dinner.
Contact
Office Location: Ruth Habeger Science Center
Phone: (605) 256-5194
Email
- Discrete mathematics
- Mathematics of games
- Graph theory
- Combinatorial designs
- Steiner triple systems
- Latin squares
- Strong starters in abelian groups
- Graph labeling
Winner 2019 Gen Cant Game Design Contest for Polyhedral Park Planner.
Bjarni Jónsson Prize for Research, Vanderbilt University, 2012.
B.F. Bryant Award for Excellence in Teaching, Vanderbilt University, 2012.
AMS Graduate Student Travel Grant for Joint Mathematics Meetings, 2012.
Graduate Student Summer Research Award, Vanderbilt University, 2011.
J.Z. Schroeder, A 2-regular graph has a prime labeling if and only if it has at most one odd component, J. Combin. 12 (2021), 379-388. Erratum to appear.
J.Z. Schroeder, Every cubic bipartite graph has a prime labeling except K3,3, Graphs Combin. 35 (2019), 119-140. Erratum in: Graphs Combin. 38 (2022), 148.
J.Z. Schroeder, A tripling construction for mutually orthogonal symmetric hamiltonian double Latin squares, J. Combin. Designs 27 (2019), 42-52.
E. Rarity, S.A. Schluchter, and J.Z. Schroeder, The smallest self-dual embeddable graphs in a pseudosurface, Missouri J. Math. Sci. 30 (2018), 85-92.
S.A. Schluchter and J.Z. Schroeder, Self-dual embeddings of K4m,4n in different orientable and nonorientable pseudosurfaces with the same Euler characteristic, Electron. J. Graph Theory Appl. 5 (2017), 247-263.
S.A. Schluchter, J.Z. Schroeder, et al., Prime labelings of generalized Petersen graphs, Involve 10 (2017), 109-124.
J.Z. Schroeder, A lower bound for the number of rough numbers, arXiv:1705.04831, 16 May 2017.
T.A. McCourt and J.Z. Schroeder, Self-embeddings of doubled affine Steiner triple systems, Australas. J. Combin. 66 (2016), 23-43.
Constructing mutually orthogonal symmetric hamiltonian double latin squares from MullinNemeth starters in finite fields, 6th Macedonian Workshop on Graph Theory and Applied Mathematics, Ohrid, North Macedonia, 14 August 2022.
A brief overview of some open problems on graph embeddings, 5th Macedonian Workshop on Graph Theory and Applications, Ohrid, North Macedonia, 17 September 2021
Steiner triple systems with small circumference, 3rd Macedonian Workshop on Graph Theory and Applications, Ohrid, North Macedonia, 16 August 2018.
Prime labeling of 2-regular graphs, 2nd Macedonian Workshop on Graph Theory and Applications, Ohrid, North Macedonia, 17 August 2017