Research

From 2001 to 2006, I studied at Nova Scotia's Dalhousie University, where I completed my M.Sc. and Ph.D. in pure mathematics. My specific field was Graph Theory.

From 2006 to 2010, I worked for the Government of Canada, hired as the first-ever mathematician by the Canada Border Services Agency. During my four years at CBSA, my focus switched to Operations Research, and I collaborated with senior executives to identify projects where mathematics and statistics could be applied to improve border management.

From 2010 to 2012, I was a Post-Doctoral Fellow at the National Institute of Informatics in Tokyo. I switched fields once again, this time to Scheduling, motivated by the specific application of creating mathematically-optimal schedules for the popular Nippon Professional Baseball League in Japan.

Since 2013, I have been collaborating with talented undergraduate students at Quest University Canada, working on projects that improve the efficiency and effectiveness of our university. Success stories include the implementation of a new roommate-matching algorithm, a more equitable process for course registration, and a new basketball and volleyball schedule for the PACWEST Athletic League that has improved competitive balance for five hundred student-athletes at ten universities.

Papers with Undergraduate Students

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.

Papers on Scheduling

M. Goerigk, R. Hoshino, K. Kawarabayashi, S. Westphal, Solving the Traveling Tournament Problem by Packing Three-Vertex Paths, Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI 2014), Quebec City, Quebec, July 2014.

R. Hoshino and K. Kawarabayashi, Balancing the Traveling Tournament Problem for Weekday and Weekend Games, Proceedings of the 25th IAAI Conference on Artificial Intelligence (IAAI 2013), Bellevue, Washington, July 2013.

R. Hoshino and K. Kawarabayashi, Graph Theory and Sports Scheduling, Notices of the American Mathematical Society, 60.6 (2013) 726-731.

R. Hoshino and K. Kawarabayashi, An Approximation Algorithm for the Bipartite Traveling Tournament Problem, Mathematics of Operations Research, 38.4 (2013) 720-728.

R. Hoshino and K. Kawarabayashi, Generating Approximate Solutions to the Traveling Tournament Problem using a Linear Distance Relaxation, Journal of Artificial Intelligence Research, 45 (2012) 257-286.

R. Hoshino and K. Kawarabayashi, The Linear Distance Traveling Tournament Problem, Proceedings of the 26th AAAI Conference on Artificial Intelligence (AAAI 2012), Toronto, Canada, July 2012.

R. Hoshino, The Mathematics of Game Show Scheduling, Notes of the Canadian Mathematical Society, 44(6) (2012) 14-15.

R. Hoshino and K. Kawarabayashi, The Inter-League Extension of the Traveling Tournament Problem and its Application to Sports Scheduling Proceedings of the 25th AAAI Conference on Artificial Intelligence (AAAI 2011), San Francisco, USA, August 2011.

R. Hoshino and K. Kawarabayashi, The Multi-Round Balanced Traveling Tournament Problem, Proceedings of the 21st International Conference on Automated Planning and Scheduling (ICAPS 2011), Freiburg, Germany, June 2011.

R. Hoshino and K. Kawarabayashi, The Distance-Optimal Inter-League Schedule for Japanese Pro Baseball, Proceedings of the ICAPS 2011 Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems (COPLAS 2011), Freiburg, Germany, June 2011.

R. Hoshino and K. Kawarabayashi, A Multi-Round Generalization of the Traveling Tournament Problem and its Application to Japanese Baseball, European Journal of Operational Research 215 (2011) 481-497.

R. Hoshino and K. Kawarabayashi, Scheduling Bipartite Tournaments to Minimize Total Travel Distance, Journal of Artificial Intelligence Research 42 (2011) 91-124.

Papers on Operations Research

D. O. Gorodnichy, E. Dubrofsky, R. Hoshino, W. Khreich, E. Granger, R. Sabourin, Exploring the Upper Bound Performance Limit of Iris Biometrics, Proceedings of the IEEE SSCI Workshop on Computational Intelligence in Biometrics and Identity Management (CIBIM), Paris, France, April 2011.

D. O. Gorodnichy and R. Hoshino, Calibrated Confidence Scoring for Biometric Identification, Proceedings of the International Biometric Performance Testing Conference, Gaithersburg, Maryland, USA, March 2010.

D. O. Gorodnichy and R. Hoshino, Score Calibration for Optimal Biometric Identification, Proceedings of the 23rd Canadian Conference on Artificial Intelligence, Ottawa, Ontario, Canada, June 2010.

R. Hoshino, D. Coughtrey, S. Sivaraja, I. Volnyansky, S. Auer, A. Trichtchenko, Applications and Extensions of Cost Curves to Marine Container Inspection, Annals of Operations Research (2009) 1-25.

R. Hoshino, R. W. Oldford, M. Zhu, Two-stage Approach for Unbalanced Classification with Time-varying Decision Boundary: Application to Marine Container Inspection, Proceedings of the ACM SIG-KDD Workshop on Intelligence and Security Informatics, Washington DC, USA, July 2010.

Papers on Graph Theory

R. Hoshino and K. Kawarabayashi, The Edge-Density of Critical Digraphs, Accepted by Combinatorica.

J. I. Brown and R. Hoshino, Well-Covered Circulant Graphs, Discrete Mathematics 311 (2011) 244-251.

J. I. Brown and R. Hoshino, Proof of a Conjecture on Fractional Ramsey Numbers, Journal of Graph Theory 63 (2010) 164-178.

J. I. Brown and R. Hoshino, Independence Polynomials of Circulants with an Application to Music, Discrete Mathematics 309 (2009) 2292-2304.

J. I. Brown and R. Hoshino, Nordhaus-Gaddum Inequalities for the Fractional and Circular Chromatic Numbers, Discrete Mathematics 309 (2009) 2223-2232.

J. I. Brown and R. Hoshino, Line Graphs and Circulants, Ars Combinatoria 105 (2012) 463-476

J. I. Brown and R. Hoshino, On Circulants Uniquely Characterized by their Independence Polynomials, Ars Combinatoria 104 (2012) 363-374.

J. I. Brown and R. Hoshino, The Ehrenfeucht-Fraisse Game for Paths and Cycles, Ars Combinatoria 83 (2007) 192-212.