1. Greedy Algorithm for approximation of the Maximum Induced Matching problem in regular graphs of girth at least six Open Access Author: Patel, Chaitanya Title: Greedy Algorithm for approximation of the Maximum Induced Matching problem in regular graphs of girth at least six Area of Honors: Computer Science Keywords: Graph TheoryInduced MatchingRegular graphsComputer Science File: Download Patel_Chaitanya_inducedmatchinginregulargraphs.pdf Thesis Supervisors: Piotr Berman, Thesis SupervisorDr. John Joseph Hannan, Thesis Honors Advisor
2. The effect of external signals and combinatorial interventions in the epithelial-to-mesenchymal transition network model Open Access Author: Sarathy, Danyas Sharmila Title: The effect of external signals and combinatorial interventions in the epithelial-to-mesenchymal transition network model Area of Honors: Physics Keywords: EMTGraph TheoryDiscrete Dynamic Modeling File: Download Sarathy_Danyas_SchreyerThesis_Final.pdf Thesis Supervisors: Reka Z Albert, Thesis SupervisorProf. Richard Wallace Robinett, Thesis Honors Advisor
3. Optimization Applied in Graph Theory: Zero-forcing Diameter Open Access Author: Loedding, Jakob Title: Optimization Applied in Graph Theory: Zero-forcing Diameter Area of Honors: Mathematics (Behrend) Keywords: OptimizationInteger ProgrammingGraph TheoryZero-forcingZero-forcing Diameter File: Download Loedding_JakobThesis.pdf Thesis Supervisors: Thomas Robert Cameron, Thesis SupervisorDaniel Joseph Galiffa, Thesis Honors Advisor
4. Comparing Efficacy of Secondary School Bell Schedules at Mitigating Infectious Diseases Open Access Author: Sim, Julian Title: Comparing Efficacy of Secondary School Bell Schedules at Mitigating Infectious Diseases Area of Honors: Statistics Keywords: StatisticsInfectious DiseaseNetworksERGMEpidemiologyGraph TheoryEpiModel File: Download Sim_Julian_Comparing_Efficacy_Of_Secondary_School_Bell_Schedules_At_Mitigating_Infectious_Diseases.pdf Thesis Supervisors: David Hunter, Thesis SupervisorMatthew D Beckman, Thesis Honors Advisor