Embedded Files
Supervising student research is my favorite part about teaching at University of Minnesota Duluth. Undergraduates at UMD are eligible to participate in the Undergraduate Research Opportunity Program (UROP) which provides $1,800 for the student to conduct research with a faculty member over the course of a semester. While I was an undergraduate at UMD, I completed a UROP under the direction of Dr. Carmen Latterell. The experience was formative and I have been paying it forward by supervising UROPs nearly every term since 2020.
Supervising student research is my favorite part about teaching at University of Minnesota Duluth. Undergraduates at UMD are eligible to participate in the Undergraduate Research Opportunity Program (UROP) which provides $1,800 for the student to conduct research with a faculty member over the course of a semester. While I was an undergraduate at UMD, I completed a UROP under the direction of Dr. Carmen Latterell. The experience was formative and I have been paying it forward by supervising UROPs nearly every term since 2020.
Below is a list of students and projects that I have supervised recently. If you are a student interested in joining this list, please contact me.
Below is a list of students and projects that I have supervised recently. If you are a student interested in joining this list, please contact me.
From left to right: Bryan, Alexa, Jasper, Gretta
Recognition
Recognition
I was recently spotlighted in the University of Minnesota Office of Undergraduate Research Newsletter.
List of Students and Projects
List of Students and Projects
Undergraduates
Undergraduates
Yujeong Hong∗ and Elsa Murray* (F. 24). G-designs for tricyclic graphs with eight edges
Brandon Mueller∗ (Sp. 24). Bully avoiding problems on various grids
Xuejian Sundvall (23–24). Decomposing complete graphs into a triangle and two isolated edges
Ryan Peters (F. 23). Decomposition of complete graphs into forests with six edges+
Aidan Jerdee∗ and Miro Zajchowski∗ (F. 23). Super edge-magic total deficiency of some graphs
Gretta Jensen∗ (F. 22). Bicyclic G-designs with nine edges+
Christopher Chapin∗ (Su. 22). Combinatorial lawn mowing
Gretta Jensen∗, Ethan Peters*, Ryan Purrington, and Kaysie Scott* (Sp. 22). Type (a,b,c) face-magic labelings of calendula graphs+
Alexa Hedtke∗ (F. 21). Neighborhood face-magic labelings of some families of graphs+
Daniel Banegas∗ (Su. 21). Distance quasi-magic graphs+
Grace Aspenson∗, Dustin Baker*, and Coy Schweider* (Sp. 21). Decomposition of complete graphs into unicyclic graphs with nine edges+
Walter Sands∗ (F. 20). 2-Handicap regular graphs of even order
Grant Montgomery∗ (Sp. 20). Constant sum partitions
Nhan Tran (Sp. 19). Decomposition of complete graphs into bipartite unicyclic graphs with eight edges+
∗Partially supported by the University of Minnesota Office of Undergraduate Research
+Project led to peer-reviewed publication
Graduates
Graduates
Sawyer Gapinski (2023–2024) Edge-magic total labeling of disjoint cycles
Daniel Banegas (2023+) Decomposing complete graphs into forests with seven edges
Page updated
Report abuse