Countries citing papers authored by Ryuhei Miyashiro
Since
Specialization
Citations
This map shows the geographic impact of Ryuhei Miyashiro's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Ryuhei Miyashiro with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ryuhei Miyashiro more than expected).
Fields of papers citing papers by Ryuhei Miyashiro
This network shows the impact of papers produced by Ryuhei Miyashiro. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Ryuhei Miyashiro. The network helps show where Ryuhei Miyashiro may publish in the future.
Co-authorship network of co-authors of Ryuhei Miyashiro
This figure shows the co-authorship network connecting the top 25 collaborators of Ryuhei Miyashiro.
A scholar is included among the top collaborators of Ryuhei Miyashiro based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Ryuhei Miyashiro. Ryuhei Miyashiro is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Miyashiro, Ryuhei, et al.. (2019). Feature subset selection for the multinomial logit model via mixed-integer optimization. International Conference on Artificial Intelligence and Statistics. 1254–1263.2 indexed citations
Miyashiro, Ryuhei, et al.. (2011). The Home-Away Assignment Problems and Break Minimization/Maximization Problems in Sports Scheduling. Terrestrial Environment Research Center (University of Tsukuba).3 indexed citations
Miyashiro, Ryuhei, et al.. (2007). A Tabu Search Algorithm for the Traveling Tournament Problem.. Parallel and Distributed Processing Techniques and Applications. 42(3 Suppl). 726–731.1 indexed citations
Miyashiro, Ryuhei, Hideya Iwasaki, & Tomomi Matsui. (2003). Characterizing feasible pattern sets with a minimum number of breaks. Lecture notes in computer science. 78–99.35 indexed citations
19.
Miyashiro, Ryuhei & Tomomi Matsui. (2003). Round-Robin Tournaments with a Small Number of Breaks.7 indexed citations
20.
Miyashiro, Ryuhei & Tomomi Matsui. (2002). Notes on Equitable Round-Robin Tournaments. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 85(5). 1006–1010.3 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.