Caroline Hammond
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Caroline Hammond has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Adebayo Emmanuel
University of Delaware
1 shared publication - Atticus McWhorter
Department of Mathematics, Dartmouth College, Hanover, USA
1 shared publication - Brooks Emerick
Kutztown University
1 shared publication - Calum Buchanan
University of Vermont
1 shared publication - Daryl DeFord
Department of Mathematics and Statistics, Vassar College, Poughkeepsie, USA
1 shared publication - George Michelogiannakis
Lawrence Berkeley National Laboratory
1 shared publication
Latest Publications
- 19 October 2026
- Published by Springer Nature in La Matematica
- Vol. 5 (4) , 73
Redistricting from the bottom up: sampling communities of interest with differential privacy
- 19 October 2026
- Published by Springer Nature in La Matematica
- Vol. 5 (4) , 73
Redistricting from the bottom up: sampling communities of interest with differential privacy
- Open Access
- 5 April 2025
- Published by Cambridge University Press (CUP) in Cambridge Open Engage
One Algorithm to Rule Them All
This report addresses the challenge of determining optimal mentor-mentee pairings for the University of Delaware’s GradLEAP program. Two mathematical models are developed—a linear programming approach solved using the Hungarian Method, and a stable marriage formulation solved via the Gale-Shapley algorithm. Compatibility scores, calculated using responses to a structured survey, incorporate both weighted and uniform criteria such as academic discipline, career interests, and age preferences. A revised survey introduces a Likert scale for ranking preferences, allowing for greater flexibility in determining weights and improving match quality. The performance of both models is evaluated using real and synthetically generated data, with results indicating that the Hungarian Method yields more consistent matches while the Gale-Shapley method is more likely to produce highly compatible pairings. The study also explores classification models using decision trees and random forests, with an eye toward future development of regression-based scoring systems. The final deliverables include a restructured survey, a user-friendly executable program, and documentation for use in future iterations of the GradLEAP program.
- 5 April 2025
- Published by Cambridge University Press (CUP) in Cambridge Open Engage
Open AccessOne Algorithm to Rule Them All
This report addresses the challenge of determining optimal mentor-mentee pairings for the University of Delaware’s GradLEAP program. Two mathematical models are developed—a linear programming approach solved using the Hungarian Method, and a stable marriage formulation solved via the Gale-Shapley algorithm. Compatibility scores, calculated using responses to a structured survey, incorporate both weighted and uniform criteria such as academic discipline, career interests, and age preferences. A revised survey introduces a Likert scale for ranking preferences, allowing for greater flexibility in determining weights and improving match quality. The performance of both models is evaluated using real and synthetically generated data, with results indicating that the Hungarian Method yields more consistent matches while the Gale-Shapley method is more likely to produce highly compatible pairings. The study also explores classification models using decision trees and random forests, with an eye toward future development of regression-based scoring systems. The final deliverables include a restructured survey, a user-friendly executable program, and documentation for use in future iterations of the GradLEAP program.
- Open Access
- 5 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Triangle Counting in the Temporal Domain
- 5 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Open AccessTriangle Counting in the Temporal Domain