Richard Hoshino

Irene Fabris

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2021

2020

Optimizing Student Course Preferences in School Timetabling.

[BibT_eX]

[DOI]

Irene Fabris

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2020

2019

Computational Intractability and Solvability for the Birds of a Feather Game.

[BibT_eX]

[DOI]

Max Notarangelo

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Predicting Unsolvable Deals in the Birds of a Feather Solitaire Game.

[BibT_eX]

[DOI]

Maximilian Kahn

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

An Automated Employee Timetabling System for Small Businesses.

[BibT_eX]

[DOI]

Aaron Slobodin

William Bernoudy

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

Optimal Pricing for Distance-Based Transit Fares.

[BibT_eX]

[DOI]

Jeneva Beairsto

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

A Recursive Algorithm to Generate Balanced Weekend Tournaments.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2015

The edge density of critical digraphs.

[BibT_eX]

[DOI]

Comb., 2015

2014

The Quest Draft: An Automated Course Allocation Algorithm.

[BibT_eX]

[DOI]

Caleb Raible-Clark

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

Solving the Traveling Tournament Problem by Packing Three-Vertex Paths.

[BibT_eX]

[DOI]

Marc Goerigk

Stephan Westphal

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013

An Approximation Algorithm for the Bipartite Traveling Tournament Problem.

[BibT_eX]

[DOI]

Math. Oper. Res., 2013

Balancing the Traveling Tournament Problem for Weekday and Weekend Games.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Innovative Applications of Artificial Intelligence Conference, 2013

2012

Generating Approximate Solutions to the TTP using a Linear Distance Relaxation.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2012

Line Graphs and Circulants.

[BibT_eX]

Ars Comb., 2012

On Circulants Uniquely Characterized by their Independence Polynomials.

[BibT_eX]

Ars Comb., 2012

The Linear Distance Traveling Tournament Problem.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

Scheduling Bipartite Tournaments to Minimize Total Travel Distance.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2011

A multi-round generalization of the traveling tournament problem and its application to Japanese baseball.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2011

Well-covered circulant graphs.

[BibT_eX]

[DOI]

Discret. Math., 2011

Exploring the upper bound performance limit of iris biometrics using score calibration and fusion.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE Workshop on Computational Intelligence in Biometrics and Identity Management, 2011

The Multi-Round Balanced Traveling Tournament Problem.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Automated Planning and Scheduling, 2011

The Inter-League Extension of the Traveling Tournament Problem and its Application to Sports Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010

Proof of a conjecture on fractional Ramsey numbers.

[BibT_eX]

[DOI]

J. Graph Theory, 2010

Score Calibration for Optimal Biometric Identification.

[BibT_eX]

[DOI]

Dmitry O. Gorodnichy

Proceedings of the Advances in Artificial Intelligence, 2010

2009

Independence polynomials of circulants with an application to music.

[BibT_eX]

[DOI]

Discret. Math., 2009

2007

The Ehrenfeucht-Fraisse Game for Paths and Cycles.

[BibT_eX]