Richard Hoshino
(he/him/his)
Teaching Professor
Research interests
- Scheduling optimization
- Operations research
- Mathematics pedagogy
Education
- PhD in Mathematics, Dalhousie University – Canada
- MS in Mathematics, Dalhousie University – Canada
- BMath in Combinatorics and Optimization, University of Waterloo – Canada
- BEd in Mathematics Teacher Education, Queen’s University – Canada
Biography
Richard Hoshino is a teaching professor of computer science at the Khoury College of Computer Sciences at Northeastern University's Vancouver campus. His areas of teaching include discrete structures, algorithms, and foundations of artificial intelligence.
Before joining Northeastern’s faculty in 2020, he worked as a professor of mathematics at Quest University in Canada. Prior to this, he was a postdoctoral fellow at the National Institute of Informatics, as well as a research scientist at the Canada Border Services Agency. He is the owner of Hoshino Math Services, a boutique math consulting firm.
Hoshino has published numerous research papers, including two that received the Deployed Application Award from the world's largest artificial intelligence research society. In 2017, he became the youngest-ever recipient of the Adrien Pouliot Award, awarded by the Canadian Mathematical Society as a lifetime achievement award to celebrate significant and sustained contributions to mathematics education. He has been published in various conferences including AAAI and CPAIOR.
Recent publications
-
The Post-Enrollment Course Timetabling Problem with Flexible Teacher Assignments
Citation: Richard Hoshino and Zilei Liu. (2025). "The Post-Enrollment Course Timetabling Problem with Flexible Teacher Assignments." Proceedings of the 19th Learning and Intelligent Optimization Conference (LION 2025). https://staging.khoury.northeastern.edu/home/rhoshino/papers/nu2.pdf -
Cohort-Based Timetabling with Integer Linear Programming
Citation: Richard Hoshino and Jameson Albers. (2024). "Cohort-Based Timetabling with Integer Linear Programming." Proceedings of the 14th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2024). https://staging.khoury.northeastern.edu/home/rhoshino/papers/nu1.pdf -
Partitioning Students into Cohorts during COVID-19
Citation: R. Hoshino and I. Fabris, Partitioning Students into Cohorts during COVID-19, Proceedings of the 18th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2021), Vienna, Austria, July 2021. -
Optimizing Student Course Preferences in School Timetabling
Citation: R. Hoshino and I. Fabris, Optimizing Student Course Preferences in School Timetabling, Proceedings of the 17th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2020), Vienna, Austria, May 2020. -
Computational Intractability and Solvability for the Birds of a Feather Game
Citation: R. Hoshino and M. Notarangelo, Computational Intractability and Solvability for the Birds of a Feather Game, Proceedings of the 9th EAAI Conference on Artificial Intelligence (EAAI 2019), Honolulu, Hawaii, January 2019. -
Predicting Unsolvable Deals in the Birds of a Feather Solitaire Game
Citation: Richard Hoshino, Maximilian Kahn. (2019). Predicting Unsolvable Deals in the Birds of a Feather Solitaire Game AAAI, 9748-9749. https://doi.org/10.1609/aaai.v33i01.33019748 -
Supporting Mathematical Creativity Through Problem Solving
Citation: Richard Hoshino. (2018). Supporting Mathematical Creativity Through Problem Solving. In: Kajander, A., Holm, J., Chernoff, E. (eds) Teaching and Learning Secondary School Mathematics. Advances in Mathematics Education. Springer, Cham. https://doi.org/10.1007/978-3-319-92390-1_34 -
Nomogram to Predict Graft Thickness in Descemet Stripping Automated Endothelial Keratoplasty: An Eye Bank Study
Citation: Bae, Steven S et al. “Nomogram to Predict Graft Thickness in Descemet Stripping Automated Endothelial Keratoplasty: An Eye Bank Study.” Cornea vol. 37,6 (2018): 687-690. doi:10.1097/ICO.0000000000001524 -
A Recursive Algorithm to Generate Balanced Weekend Tournaments
Citation: Richard Hoshino. (2018). A Recursive Algorithm to Generate Balanced Weekend Tournaments AAAI, 6195-6201. https://www.aaai.org/ocs/index.php/AAAI/AAAI18/paper/view/16293 -
Optimal Pricing for Distance-Based Transit Fares
Citation: R. Hoshino and J. Beairsto, Optimal Pricing for Distance-Based Transit Fares, Proceedings of the 30th IAAI Conference on Artificial Intelligence (IAAI 2018), New Orleans, Louisiana, February 2018. -
An Automated Employee Timetabling System for Small Businesses
Citation: R. Hoshino, A. Slobodin, and W. Bernoudy, An Automated Employee Timetabling System for Small Businesses, Proceedings of the 30th IAAI Conference on Artificial Intelligence (IAAI 2018), New Orleans, Louisiana, February 2018. Winner of the Deployed Application Award. -
Problem Solving: Definition, Role, and Pedagogy
Citation: Richard Hoshino. (2016). "Problem Solving: Definition, Role, and Pedagogy." Proceedings of the 40th Annual Meeting of the Canadian Mathematics Education Study Group (CMESG). https://staging.khoury.northeastern.edu/home/rhoshino/papers/mathed2.pdf -
The edge density of critical digraphs
Citation: Richard Hoshino and Ken-Ichi Kawarabayashi. 2015. The edge density of critical digraphs. Combinatorica 35, 5 (October 2015), 619–631. https://doi.org/10.1007/s00493-014-2862-4 -
Solving the Traveling Tournament Problem by Packing Three-Vertex Paths
Citation: Marc Goerigk, Richard Hoshino, Ken-Ichi Kawarabayashi, and Stephan Westphal. 2014. Solving the traveling tournament problem by packing three-vertex paths. In Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence (AAAI'14). AAAI Press, 2271–2277. -
The Quest Draft: an Automated Course Allocation Algorithm
Citation: R. Hoshino and C. Raible-Clark, The Quest Draft: an Automated Course Allocation Algorithm, Proceedings of the 26th IAAI Conference on Artificial Intelligence (IAAI 2014), Quebec City, Quebec, July 2014. Winner of the Deployed Application Award. -
An Approximation Algorithm for the Bipartite Traveling Tournament Problem
Citation: Richard Hoshino and Ken-ichi Kawarabayashi. 2013. An Approximation Algorithm for the Bipartite Traveling Tournament Problem. Math. Oper. Res. 38, 4 (November 2013), 720–728. https://doi.org/10.1287/moor.2013.0597 -
Balancing the Traveling Tournament Problem for Weekday and Weekend Games
Citation: Hoshino, R., and K.- ichi Kawarabayashi. “Balancing the Traveling Tournament Problem for Weekday and Weekend Games”. Proceedings of the AAAI Conference on Artificial Intelligence, vol. 27, no. 2, July 2013, pp. 1525-31, doi:10.1609/aaai.v27i2.18994. -
Graph Theory and Sports Scheduling
Citation: R. Hoshino and K. Kawarabayashi, Graph Theory and Sports Scheduling, Notices of the American Mathematical Society, 60.6 (2013) 726-731. http://dx.doi.org/10.1090/noti1010 -
The Mathematics of Game Show Scheduling
Citation: R. Hoshino, The Mathematics of Game Show Scheduling, Notes of the Canadian Mathematical Society, 44(6) (2012) 14-15. -
Generating Approximate Solutions to the TravelingTournament Problem using a Linear Distance Relaxation
Citation: Hoshino, Richard & Kawarabayashi, Ken-ichi. (2014). Generating Approximate Solutions to the TTP using a Linear Distance Relaxation. The Journal of Artificial Intelligence Research (JAIR). 45. 10.1613/jair.3713. -
The Linear Distance Traveling Tournament Problem
Citation: Hoshino, R., & Kawarabayashi, K.- ichi. (2021). The Linear Distance Traveling Tournament Problem. Proceedings of the AAAI Conference on Artificial Intelligence, 26(1), 1770-1778. https://doi.org/10.1609/aaai.v26i1.8358 -
Line Graphs and Circulants
Citation: Brown, Jason & Hoshino, Richard. (2012). Line Graphs and Circulants. Ars Combinatoria. 105. -
On Circulants Uniquely Characterized by their Independence Polynomials
Citation: Brown, Jason & Hoshino, Richard. (2012). On Circulants Uniquely Characterized by their Independence Polynomials. Ars Combinatoria. 104. -
Scheduling Bipartite Tournaments to Minimize Total Travel Distance
Citation: Richard Hoshino and Ken-ichi Kawarabayashi. 2011. Scheduling bipartite tournaments to minimize total travel distance. J. Artif. Int. Res. 42, 1 (September 2011), 91–124. -
The Inter-League Extension of the Traveling Tournament Problem and its Application to Sports Scheduling
Citation: Hoshino, R., and K.- ichi Kawarabayashi. “The Inter-League Extension of the Traveling Tournament Problem and Its Application to Sports Scheduling”. Proceedings of the AAAI Conference on Artificial Intelligence, vol. 25, no. 1, Aug. 2011, pp. 977-84, doi:10.1609/aaai.v25i1.8003. -
The Edge-Density of Critical Digraphs
Citation: Hoshino, R., Kawarabayashi, Ki. The edge density of critical digraphs. Combinatorica 35, 619–631 (2015). https://doi.org/10.1007/s00493-014-2862-4 -
Exploring the upper bound performance limit of iris biometrics using score calibration and fusion
Citation: D. O. Gorodnichy, E. Dubrofsky, R. Hoshino, W. Khreich, E. Granger and R. Sabourin, "Exploring the upper bound performance limit of iris biometrics using score calibration and fusion," 2011 IEEE Workshop on Computational Intelligence in Biometrics and Identity Management (CIBIM), Paris, France, 2011, pp. 54-61, doi: 10.1109/CIBIM.2011.5949213. -
A Multi-Round Generalization of the Traveling Tournament Problem and its Application to Japanese Baseball
Citation: Hoshino, Richard & Kawarabayashi, Ken-ichi. (2011). A multi-round generalization of the traveling tournament problem and its application to Japanese baseball. European Journal of Operational Research. 215. 481-497. 10.1016/j.ejor.2011.06.014. -
The Multi-Round Balanced Traveling Tournament Problem
Citation: Hoshino, Richard, and Ken-ichi Kawarabayashi. 2011. “The Multi-Round Balanced Traveling Tournament Problem”. Proceedings of the International Conference on Automated Planning and Scheduling 21 (1):106-13. https://doi.org/10.1609/icaps.v21i1.13443. -
Well-Covered Circulant Graphs
Citation: J. I. Brown and R. Hoshino, Well-Covered Circulant Graphs, Discrete Mathematics 311 (2011) 244-251. -
Two-stage approach for unbalanced classification with time-varying decision boundary: application to marine container inspection
Citation: Richard Hoshino, R. Wayne Oldford, and Mu Zhu. 2010. Two-stage approach for unbalanced classification with time-varying decision boundary: application to marine container inspection. In ACM SIGKDD Workshop on Intelligence and Security Informatics (ISI-KDD '10). Association for Computing Machinery, New York, NY, USA, Article 1, 1–5. https://doi.org/10.1145/1938606.1938607 -
Score calibration for optimal biometric identification
Citation: Gorodnichy, D.O., Hoshino, R. (2010). Score Calibration for Optimal Biometric Identification. In: Farzindar, A., Kešelj, V. (eds) Advances in Artificial Intelligence. Canadian AI 2010. Lecture Notes in Computer Science(), vol 6085. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13059-5_46 -
Calibrated Confidence Scoring for Biometric Identification
Citation: Gorodnichy, Dmitry & Hoshino, Richard. (2010). Calibrated confidence scoring for biometric identification. -
Proof of a Conjecture on Fractional Ramsey Numbers
Citation: Jason Brown and Richard Hoshino. 2010. Proof of a conjecture on fractional Ramsey numbers. J. Graph Theory 63, 2 (February 2010), 164–178. -
Applications and extensions of cost curves to marine container inspection
Citation: R. Hoshino & D. Coughtrey & S. Sivaraja & I. Volnyansky & S. Auer & A. Trichtchenko, 2011. "Applications and extensions of cost curves to marine container inspection," Annals of Operations Research, Springer, vol. 187(1), pages 159-183, July. -
Nordhaus-Gaddum Inequalities for the Fractional and Circular Chromatic Numbers
Citation: Brown, Jason & Hoshino, Richard. (2009). Nordhaus–Gaddum inequalities for the fractional and circular chromatic numbers. Discrete Mathematics. 309. 2223-2232. 10.1016/j.disc.2008.04.052. -
Independence Polynomials of Circulants with an Application to Music
Citation: Jason Brown and Richard Hoshino. 2009. Independence polynomials of circulants with an application to music. Discrete Math. 309, 8 (April, 2009), 2292–2304. https://doi.org/10.1016/j.disc.2008.05.003 -
The Ehrenfeucht-Fraisse Game for Paths and Cycles
Citation: Jason Brown, Richard Hoshino. The Ehrenfeucht-Fraissé Game for Paths and Cycles[J], Ars Combinatoria, Volume 083. 193-212.
