Associate Chair
Case School of Engineering
Associate Professor
Department of Computer and Data Sciences
Case School of Engineering
Robert J. Herbold Professor of Transformative Teaching
Applies theoretical computer science techniques to discover problem structures and improve algorithm performance.
Teaching Information
Teaching Interests
Programming languages, discrete mathematics, graph theory, algorithms, data structures, computer science theory, artificial intelligence, database programming.
Office Hours
Mondays 1:00-2:00 p.m., Tuesdays 3:30-4:30 p.m., Wednesdays 1:30-2:30 p.m., and Thursdays 10:15-11:15 a.m.
Research Information
Research Interests
- Random constraint satisfaction problems
- Algorithms
- Artificial intelligence
- Graph theory
- Computer Science Education
Awards and Honors
Carl F. Wittke Award for Excellence in Undergraduate Teaching
2019
Case Western Reserve University
Guy Savastano Outstanding Educator Award
2019
Delta Upsilon
Srinivasa P. Gutti Engineering Teaching Award
2017
Tau Beta Pi
Publications
- Cruz, I., Claudio, M., Boerstler H., Connamacher, H., Crosby, R., Glassey, R., Haldeman, G., Kiljunen, O., Kumar, A., Liu, D., Luxton-Reilly, A., Matsumoto, S., Oliveira, E., Russell, S., & Shah, A. (2025) Introducing code quality at CS1 level: examples and activities. ITiCSE-WGR '24, 339--377.
- Young, B, Hacher, A., & Connamacher, H. (2023). The number of labeled n-ary abelian groups and totally symmetric medial quasigroups. Journal of Algebraic Combinatorics, 57, 461--479.
- Raj, R. K., Impagliazzo, J., Aly, S. G., Bowers, D. S., Connamacher, H., Kurkovsky, S., MacKellar, B., Prickett, T., & Samary, M. M. (2022) Toward compentency-based professional accreditation in computing. ITiCSE-WGR '22, 1--35.
- Connamacher, H., & Dobrosotskaya, J. (2020). On the uniformity of the approximation for generalized Stirling numbers of the second kind. Contributions to Discrete Mathematics, 15 (3), 25--42.
- Connamacher, H., Pancha, N., Liu, R., & Ray, S. (2029). Rankboost + +: an improvement to Rankboost. Machine Learning, 109, 51--78.
- Connamacher, H., & Alguttar, A. (2017). Why does look-ahead work?. Scientific Journal of Faculty of Education, 1 (7), 3-16.
- Connamacher, H., & Molloy, M. (2012). The Satisfiability Threshold for a Seemingly Intractable Random Constraint Satisfaction Problem. SIAM Journal on Discrete Mathematics, 26 (2), 768-800.
- Connamacher, H. (2012). Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT. Theoretical Computer Science, 421 (), 25-55.
- Connamacher, H. S., & Proskurowski, A. (2003). The complexity of minimizing certain cost metrics for k-source spanning trees. Discrete Applied Mathematics, 131 (1), 113-127.
Education
PhD
Computer Science
University of Toronto
2008
Master of Science
Computer and Information Science
University of Oregon
2000
Bachelor of Arts
Computer Science
Oberlin College
1991