This map shows the geographic impact of Tomomi Matsui'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 Tomomi Matsui with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Tomomi Matsui more than expected).
This network shows the impact of papers produced by Tomomi Matsui. 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 Tomomi Matsui. The network helps show where Tomomi Matsui may publish in the future.
Co-authorship network of co-authors of Tomomi Matsui
This figure shows the co-authorship network connecting the top 25 collaborators of Tomomi Matsui.
A scholar is included among the top collaborators of Tomomi Matsui 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 Tomomi Matsui. Tomomi Matsui is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Matsui, Tomomi, et al.. (2018). Trading Transforms of Non-weighted Simple Games and Integer Weights of Weighted Simple Games. Tokyo Tech Research Repository (Tokyo Institute of Technology).1 indexed citations
3.
Matsui, Tomomi, et al.. (2017). Lower Bounds for Bruss’ Odds Problem with Multiple Stoppings. Tokyo Tech Research Repository (Tokyo Institute of Technology).2 indexed citations
Matsui, Tomomi, et al.. (2012). On the Number of Solutions Generated by Dantzig's Simplex Method for LP with Bounded Variables ∗. 8(3). 447–455.4 indexed citations
Kijima, Shuji & Tomomi Matsui. (2004). Approximate Counting Scheme for m × n Contingency Tables. IEICE Transactions on Information and Systems. 87(2). 308–314.5 indexed citations
10.
Aloupis, Greg, et al.. (2003). Computing the Similarity of two Melodies.. Tokyo Tech Research Repository (Tokyo Institute of Technology). 81–84.2 indexed citations
11.
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
12.
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
13.
Matsui, Tomomi, et al.. (2002). A Linear Relaxation for Hub Networks Design Problems. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 85(5). 1000–1005.3 indexed citations
14.
Matsui, Tomomi, et al.. (2001). Linear Relaxation for Hub Network Design Problems. 2001. 34–35.2 indexed citations
15.
Kiyomi, Masashi & Tomomi Matsui. (2001). Integer Programming Based Algorithms for Peg Solitaire Problems.
Matsui, Tomomi, et al.. (2000). A note on Asymmetric Power Index for Voting Games. 2000. 42–43.
18.
Matsui, Tomomi. (1996). Is a Given Flow Uncontrollable? (Special Section on Discrete Mathematics and Its Applications). IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 79(4). 448–451.2 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.