default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRichard Hoshino
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c15]Richard Hoshino, Irene Fabris:
Partitioning Students into Cohorts During COVID-19. CPAIOR 2021: 89-105- 2020
- [c14]Richard Hoshino, Irene Fabris:
Optimizing Student Course Preferences in School Timetabling. CPAIOR 2020: 283-299
2010 – 2019
- 2019
- [c13]Richard Hoshino, Max Notarangelo:
Computational Intractability and Solvability for the Birds of a Feather Game. AAAI 2019: 9648-9655 - [c12]Richard Hoshino, Maximilian Kahn:
Predicting Unsolvable Deals in the Birds of a Feather Solitaire Game. AAAI 2019: 9748-9749 - 2018
- [c11]Richard Hoshino:
A Recursive Algorithm to Generate Balanced Weekend Tournaments. AAAI 2018: 6195-6201 - [c10]Richard Hoshino, Aaron Slobodin
, William Bernoudy:
An Automated Employee Timetabling System for Small Businesses. AAAI 2018: 7673-7679 - [c9]Richard Hoshino, Jeneva Beairsto:
Optimal Pricing for Distance-Based Transit Fares. AAAI 2018: 7765-7770 - 2015
- [j11]Richard Hoshino, Ken-ichi Kawarabayashi:
The edge density of critical digraphs. Comb. 35(5): 619-631 (2015) - 2014
- [c8]Marc Goerigk, Richard Hoshino, Ken-ichi Kawarabayashi, Stephan Westphal:
Solving the Traveling Tournament Problem by Packing Three-Vertex Paths. AAAI 2014: 2271-2277 - [c7]Richard Hoshino, Caleb Raible-Clark:
The Quest Draft: An Automated Course Allocation Algorithm. AAAI 2014: 2906-2913 - [i2]Richard Hoshino, Ken-ichi Kawarabayashi:
Scheduling Bipartite Tournaments to Minimize Total Travel Distance. CoRR abs/1401.3909 (2014) - [i1]Richard Hoshino, Ken-ichi Kawarabayashi:
Generating Approximate Solutions to the TTP using a Linear Distance Relaxation. CoRR abs/1401.6049 (2014) - 2013
- [j10]Richard Hoshino, Ken-ichi Kawarabayashi:
An Approximation Algorithm for the Bipartite Traveling Tournament Problem. Math. Oper. Res. 38(4): 720-728 (2013) - [c6]Richard Hoshino, Ken-ichi Kawarabayashi:
Balancing the Traveling Tournament Problem for Weekday and Weekend Games. IAAI 2013: 1525-1531 - 2012
- [j9]Jason I. Brown, Richard Hoshino:
On Circulants Uniquely Characterized by their Independence Polynomials. Ars Comb. 104: 363-374 (2012) - [j8]Jason I. Brown, Richard Hoshino:
Line Graphs and Circulants. Ars Comb. 105: 463-476 (2012) - [j7]Richard Hoshino, Ken-ichi Kawarabayashi:
Generating Approximate Solutions to the TTP using a Linear Distance Relaxation. J. Artif. Intell. Res. 45: 257-286 (2012) - [c5]Richard Hoshino, Ken-ichi Kawarabayashi:
The Linear Distance Traveling Tournament Problem. AAAI 2012: 1770-1778 - 2011
- [j6]Jason I. Brown, Richard Hoshino:
Well-covered circulant graphs. Discret. Math. 311(4): 244-251 (2011) - [j5]Richard Hoshino, Ken-ichi Kawarabayashi:
A multi-round generalization of the traveling tournament problem and its application to Japanese baseball. Eur. J. Oper. Res. 215(2): 481-497 (2011) - [j4]Richard Hoshino, Ken-ichi Kawarabayashi:
Scheduling Bipartite Tournaments to Minimize Total Travel Distance. J. Artif. Intell. Res. 42: 91-124 (2011) - [c4]Richard Hoshino, Ken-ichi Kawarabayashi:
The Inter-League Extension of the Traveling Tournament Problem and its Application to Sports Scheduling. AAAI 2011: 977-984 - [c3]Richard Hoshino, Ken-ichi Kawarabayashi:
The Multi-Round Balanced Traveling Tournament Problem. ICAPS 2011 - [c2]Dmitry O. Gorodnichy, Elan Dubrofsky, Richard Hoshino, Wael Khreich, Eric Granger, Robert Sabourin:
Exploring the upper bound performance limit of iris biometrics using score calibration and fusion. CIBIM 2011: 54-61 - 2010
- [j3]Jason I. Brown, Richard Hoshino:
Proof of a conjecture on fractional Ramsey numbers. J. Graph Theory 63(2): 164-178 (2010) - [c1]Dmitry O. Gorodnichy, Richard Hoshino:
Score Calibration for Optimal Biometric Identification. Canadian AI 2010: 357-361
2000 – 2009
- 2009
- [j2]Jason I. Brown, Richard Hoshino:
Independence polynomials of circulants with an application to music. Discret. Math. 309(8): 2292-2304 (2009) - 2007
- [j1]Jason I. Brown, Richard Hoshino:
The Ehrenfeucht-Fraisse Game for Paths and Cycles. Ars Comb. 83 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
