Sorry. This page contains some Japanese characters.

List of papers: If you are interested in a paper, please check the source file of this page.

---

Tomomi Matsui

To appear

• ----

Refereed Papers in Journals and Books

• Yuto Ushioda, Masato Tanaka, and Tomomi Matsui. ``Monte Carlo Methods for the Shapley--Shubik Power Index,'' Games, vol. 13 (2022), no. 3: 44. https://doi.org/10.3390/g13030044
• Masato Tanaka and Tomomi Matsui, ``Pseudo Polynomial Size LP Formulation for Calculating the Least Core Value of Weighted Voting Games,'' Mathematical Social Sciences, Volume 115, 2022, Pages 47-51.

• Akihiro Kawana and Tomomi Matsui, ``Trading Transforms of Non-weighted Simple Games and Integer Weights of Weighted Simple Games,'' Theory and Decision, 2021, 1-20.
• Kawase, Yasushi, Tomomi Matsui, and Atsushi Miyauchi. ``Additive approximation algorithms for modularity maximization,'' Journal of Computer and System Sciences, Volume 117, May 2021, Pages 182-201.

• Yoichi Izunaga, Tomomi Matsui, Yoshitsugu Yamamoto, ``A Doubly Nonnegative Relaxation for Modularity Density Maximization,'' Discrete Applied Mathematics, vol. 275 (2020), No. 31, pp. 69-78.
• Yusei Fujimori, Yasushi Kawase, Tomomi Matsui, Akiyoshi Shioura, ``A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption,'' Information Processing Letters, 162 (2020), 105991.

• Yuko Kuroki, Tomomi Matsui, ``Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems,'' Journal of Graph Algorithms and Applications (JGAA), vol. 23 (2019), No. 1, pp. 93-110.
• Ryuta Tamura, Ken Kobayashi, Yuichi Takano, Ryuhei Miyashiro, Kazuhide Nakata, Tomomi Matsui, ``Mixed integer quadratic optimization formulations for eliminating multicollinearity based on variance inflation factor,'' Journal of Global Optimization, vol. 73 (2019), No. 2, pp. 431-446.
• 黒川哲明, 松井知己, 大貝晴俊. ``頂点彩色問題の定式化を応用したスラブ山分け問題求解技術開発,'' 計測自動制御学会論文集, vol. 55, No. 5, pp. 369--378, 2019.

• 田村隆太, 小林健, 高野祐一, 宮代隆平, 中田和秀, 松井知己. ``多重共線性を考慮した回帰式の変数選択問題の定式化,'' オペレーションズ・リサーチ, Vol. 63, No. 3, pp. 128--133, Mar. 2018.
• Tomomi Matsui, Yuichiro Miyamoto, ``Characterizing Delaunay graphs via fixed point theorem: a simple proof,'' Journal of the Operations Research Society of Japan, Vol. 61 Issue 1, January 2018, pp. 151--162.

• Ryuta Tamura, Ken Kobayashi, Yuichi Takano, Ryuhei Miyashiro, Kazuhide Nakata, Tomomi Matsui, ''Best subset selection for eliminating multicollinearity,'' Journal of the Operations Research Society of Japan, Vol. 60 Issue 3, March 2017, pp. 321--336.
• Tomomi Matsui and Katsunori Ano, ``Compare the ratio of symmetric polynomials of odds to one and stop,'' Journal of Applied Probability, Volume 54, Issue 1, March 2017, pp. 12--22.

• Tomomi Matsui and Katsunori Ano, ``Lower Bounds for Bruss’ Odds Problem with Multiple Stoppings.'' Mathematics of Operations Research, Volume 41, Issue 2, pp. 700--714, 2016.
• Tomomi Matsui and Rudolf Scheifele, ``A Linear Time Algorithm for the Unbalanced Hitchcock Transportation Problem,'' Networks. Volume 67, Issue 2, March 2016, Pages 170--182.
• Yukihide Kohira, Chikaaki Kodama, Tomomi Matsui, Atsushi Takahashi, Shigeki Nojima and Satoshi Tanaka, ``Yield-aware mask assignment by positive semidefinite relaxation in triple patterning using cut process,'' Journal of Micro/Nanolithography, MEMS, and MOEMS (JM3), Volume 15, issue 2, pp. 1--7, 2016.

• Tomomi Matsui, Yukihide Kohira, Chikaaki Kodama, Atsushi Takahashi, ``Positive Semidefinite Relaxation and Approximation Algorithm for Triple Patterning Lithography,'' Algorithms and Computation, Lecture Notes in Computer Science, Volume 8889, 2014, pp 365-375
• Shinji Imahori, Tomomi Matsui and Ryuhei Miyashiro, ``A 2.75-approximation algorithm for the unconstrained traveling tournament problem,'' Annals of Operations Research, Volume 218 (July 2014), Issue 1, pp 237-247. (DOI: 10.1007/s10479-012-1161-y)
• Tomomi Matsui and Katsunori Ano, ``A note on a lower bound for the multiplicative odds theorem of optimal stopping,'' Journal of Applied Probability, Vol. 51 (2014), No. 3, pp. 885-889.
• Tomomi Matsui, Noriyoshi Sukegawa, Atsushi Miyauchi, ``Fractional programming formulation for the vertex coloring problem,'' Information Processing Letters, Volume 114 (2014), Issue 12, pp. 706-709.

• Tomomi Matsui, ``NP-Completeness of Arithmetical Restorations,'' Journal of Information Processing, Vol. 21 (2013), No. 3, pp. 402-404.

• Ryuhei Miyashiro, Tomomi Matsui, and Shinji Imahori, ``An Approximation Algorithm for the Traveling Tournament Problem,'' Annals of Operations Research, Volume 194 (2012), Number 1, pp. 317-324.
• Tomonari Kitahara, Tomomi Matsui and Shinji Mizuno, ``On the Number of Solutions Generated by Dantzig's Simplex Method for LP with Bounded Variables,'' Pacific Journal of Optimization, Volume 8, Number 3, July 2012, pp. 447-445.

• Daisuke Yamaguchi, Shinji Imahori, Ryuhei Miyashiro, and Tomomi Matsui, ``An Improved Approximation Algorithm for the Traveling Tournament Problem,'' Algorithmica, 61 (2011), pp. 1077-1091.
• Tomomi Matsui, ``Algorithmic Aspects of Equilibria of Stable Marriage Model with Complete Preference Lists,'' in Operations Research Proceedings 2010, Selected Papers of the Annual International Conference of the German Operations Research Society, Hu, B.; Morasch, K.; Pickl, S.; Siegle, M. (Eds.), Springer, pp. 47--52, 2011.
• Yutaka IWAIKAWA, Naoyuki KAMIYAMA and Tomomi MATSUI, ``Improved Approximation Algorithms for Firefighter Problem on Trees,'' IEICE TRANSACTIONS on Information and Systems, Volume E94-D (2011), Number 2, pp. 196--199. (February, 2011)

• 越川満，内山将夫，梅谷俊治，松井知己，山本幹雄， 「統計的機械翻訳におけるフレーズ対応最適化を利用したN-best翻訳候補のリランキング」， 情報処理学会論文誌, Vol. 51, No. 8, pp. 1443-1451. (Aug. 2010).
• Tomomi Matsui, Mitsuo Motoki, Naoyuki Kamatani and Shuji Kijima, ``Polynomial Time Approximate/Perfect Samplers for Discretized Dirichlet Distribution,'' Japan Journal of Industrial and Applied Mathematics, Volume 27 (2010), Number 1, pp. 91-123. (2010年5月1日)

• Hirotatsu Kobayashi and Tomomi Matsui, ``Cheating Strategies for the Gale-Shapley Algorithm with Complete Preference Lists,'' Algorithmica, Volume 58 (2010), Number 1, pp. 151-169. (2009年9月15日)
• Yuichiro Miyamoto and Tomomi Matsui, ``Perfectness and imperfectness of unit disk graphs on triangular lattice points,'' Discrete Mathematics, Volume 309 (2009), Issue 9, pp. 2733--2744. (6 May)
• Yusuke Kuroki and Tomomi Matsui, `` An Approximation Algorithm for Multidimensional Assignment Problems Minimizing the Sum of Squared Errors,'' Discrete Applied Mathematics, Volume 157 (2009), Issue 9, pp. 2124--2135. (6 May)
• Masaru Iwasa, Hiroo Saito, Tomomi Matsui, ``Approximation Algorithms for the Single Allocation Problem in Hub-and-Spoke Networks and Related Metric Labeling Problems,'' Discrete Applied Mathematics, Volume 157 (2009), Issue 9, pp. 2078--2088. (6 May)
• Hiroo Saito, Tetsuya Fujie, Tomomi Matsui, and Shiro Matuura, ``A study of the quadratic semi-assignment polytope,'' Discrete Optimization, Volume 6 (2009), No. 1, pp. 37--50. (February)
• Hirotatsu Kobayashi and Tomomi Matsui, ``Successful Manipulation in Stable Marriage Model with Complete Preference Lists,'' IEICE TRANSACTIONS on Information and Systems, Volume E92-D (2009), No. 2, pp. 116--119. (February) pdf file of MATCH-UP version

• 澤井賢一，黒木裕介，松井知己, 「フルートの運指最適化と逆最適化を用いたパラメータチューニング」, オペレーションズ・リサーチ，vol. 53 (2008), no. 1, pp. 39--46. (Jan)
  ★日本OR学会第29回事例研究賞(2009年3月17日)
• Shuji Kijima and Tomomi Matsui, "Polynomial Time Perfect Sampler for Discretized Dirichlet Distribution," In Hiroe Tsubaki, Ken Nishina and Shu Yamada, editors, The Grammer of Technology Development, pp. 179--199, Springer, 2008. (Jan) (post conference book)(The Grammer of Technology Development, January 15--16, 2005)
• Shuji Kijima and Tomomi Matsui, ``Randomized Approximation Scheme and Perfect Sampler for Closed Jackson networks with Multiple Servers, '' Annals of Operations Research, 162 (2008), pp. 35--55. (June)
• Hadas Shachnai, Lisa Zhang, and Tomomi Matsui, ``Exact Algorithms for the Master Ring Problem,'' Networks, 52 (2008), no. 2, pp. 98--107. (Jan)
• Shuji Kijima and Tomomi Matsui, ``Approximation algorithm and perfect sampler for closed Jackson networks with single servers,'' SIAM Journal on Computing, Volume 38, Issue 4, pp. 1484--1503 (2008). (Sep.)
  (SIAM Journal on Computing, Top 20 Most Downloaded Articles, SIAM Journal on Computing -- October 2008)

• Nobutomo Fujiwara, Shinji Imahori, Tomomi Matsui, and Ryuhei Miyashiro, "Constructive Algorithms for the Constant Distance Traveling Tournament Problem," Lecture Notes in Computer Science, 3867 (2007), pp. 135--146. (Dec) Practice and Theory of Automated Timetabling VI, 6th International Conference, PATAT 2006 Brno, Czech Republic, August 30-September 1, 2006 Revised Selected Papers, E.K. Burke and H. Rudov´a, editors.
• Ayami Suzuka, Ryuhei Miyashiro, Akiko Yoshise and Tomomi Matsui, "The home-away assignment problems and break minimization/maximization problems in sports scheduling," Pacific Journal of Optimization, 3(1) (2007), pp. 113--133. (January)

• Shuji Kijima and Tomomi Matsui, "Polynomial Time Perfect Sampling Algorithm for Two-Rowed Contingency Tables," Random Structures and Algorithms, 29(3) (2006), pp. 243--256. (Sep.)
• Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Yurai Nunez, David Rappaport, and Godfried Toussaint, ``Algorithms for Computing Geometric Measures of Melodic Similarity,'' Computer Music Journal, 30(3) (2006), pp. 67-77. (Fall (Sep.))
• Ayami Suzuka, Ryuhei Miyashiro, Akiko Yoshise, and Tomomi Matsui, ``Dependent Randomized Rounding to the Home-Away Assignment Problem in Sports Scheduling,'' IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. E89-A(5) (2006), pp. 1407--1416. (May)
• Ryuhei Miyashiro and Tomomi Matsui, ``Semidefinite programming based approaches to the break minimization problem,'' Computers and Operations Research, 33(7) (2006), pp. 1975--1982. (July)
• Shu YAMADA, Michiyo MATSUI, Tomomi MATSUI, Dennis K. J. LIN, and Takenori TAKAHASHI, ``A general construction method for mixed-level supersaturated design,'' Computational Statistics and Data Analysis, 50(1) (2006), pp. 254-265. (January)

• Ryuhei Miyashiro and Tomomi Matsui, ``A polynomial time algorithm to find an equitable home-away assignment,'' Operations Research Letters, 33(3) (2005), pp. 235--241. (May)

• Yuichiro Miyamoto and Tomomi Matsui, ``Linear time approximation algorithm for multicoloring lattice graphs with diagonals", Journal of Operations Research Society of Japan, 47(2) (2004), pp. 123-128. (June)
• Tomomi MATSUI, Yasuko MATSUI, Yoko ONO, ``Random generation of 2 X 2 X...X 2 X J contingency tables", Theoretical Computer Science, 326(1-2) (2004), pp. 117-135. (Oct.)
• Shuji KIJIMA and Tomomi MATSUI, ``Approximate counting scheme for mxn contingency tables", IEICE Transactions on Information and Systems, vol. E87-D(2) (2004), pp. 308--314. (Feb.)

• Ryuhei Miyashiro, Hideya Iwasaki and Tomomi Matsui, ``Characterizing Feasible Pattern Sets with a Minimum Number of Breaks,'' Practice and Theory of Automated Timetabling IV (PATAT2002), Selected Revised Papers, Lecture Notes in Computer Science, 2740 (2003), Springer-Verlag, pp. 78--99. (August)
• Shiro MATUURA and Tomomi MATSUI, ``New approximation algorithms for MAX 2SAT and MAX DICUT,'' Journal of Operations Research Society of Japan, 46(2) (2003), pp. 178--188. (June)

• Shu YAMADA and Tomomi MATSUI, "Optimality of Mixed Level Supersaturated Designs", Journal of Statistical Planning and Inference, vol. 104(2) (2002), pp. 459--469. (June)
• Ryuhei MIYASHIRO and Tomomi MATSUI, "Notes on equitable round-robin tournaments", IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. E85-A(5) (2002), pp. 1006--1010. (May)
• Hiro-o SAITO, Shiro MATUURA and Tomomi MATSUI, "A Linear Relaxation for Hub Network Design Problems", IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. E85-A(5) (2002), pp. 1000--1005. (May)
• Riyo Endo, Katsunori Ano, Tomomi Matsui, "Modified Banzhaf index for voting games". International Journal Mathematics, Game Theory, and Algebra, 12 (2002), no. 4, pp. 301--312.

• Masashi KIYOMI and Tomomi MATSUI, "Integer Programming Based Algorithms for Peg Solitaire Problems", Computers and Games, LNCS, vol. 2063 (2001), Second International Conference CG 2001, Hamamatsu, Japan, October 26-28, 2000 Revised Papers, Marsland, T. and Frank, I. Eds., pp. 229--240. (Oct.)
• Yasuko MATSUI, and Tomomi MATSUI, "NP-completeness for calculating power indices of weighted majority games", Theoretical Computer Science, vol. 263(1-2) (2001), pp. 305--310. (July)

• Tomomi MATSUI and Yasuko MATSUI, "A Survey of Algorithms for Calculating Power Indices of Weighted Majority Games", Journal of the Operations Research Society of Japan, vol. 43(1) (2000), pp. 71--86. (March) (related tech. report in ps file, pdf file)
• Tetsuo ASANO, Tomomi MATSUI, Takeshi TOKUYAMA, "Optimal Rounding of Sequences and Matrices", Nordic Journal of Computing, vol. 7(3) (2000), pp. 241--256. (July)
• Tomomi MATSUI, "Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs", Discrete and Computational Geomerty, Jin AKIYAMA, Mikio KANO, Masatsugu URABE (Eds.), Revised Papers, Lecture Notes in Computer Science, Springer-Verlag, 1763 (2000), pp. 194--200. (Jan.) ps file , pdf file

• 宮本裕一郎、松井知己 "チャネル割当問題の解法", 情報処理学会論文誌, 数理モデル化と応用, Vol.40, No.SIG2(TOM1) (1999), pp.23-32.
  Yuichiro MIYAMOTO and Tomomi MATSUI, "Algorithms for channel assignment problems", Information Processing Society of Japan, Transactions on Mathematical Modeling and Its Applications, vol. 40, No. SIG2(TOM1) (1999), pp. 23--32 (in Japanese) (Feb.).

• Satoru IWATA, Tomomi MATSUI and S. Thomas McCormic, "A Fast Bipartite Network Flow Algorithm for Selective Assembly", Operations Research Letters, vol. 22(4-5) (1998), pp. 137--143. (May)

• Tomomi MATSUI, "A flexible algorithm for generating all the spanning trees in undirected graphs", Algorithmica, vol. 18(4) (1997), pp. 530--544. (Aug.)

• Tomomi MATSUI, "Is a given flow uncontrollable?", IEICE Trans. Fundamentals, vol. E79-A(4) (1996), pp. 448--451. (April)
• Tomomi MATSUI, "NP-hardness of Linear Multiplicative Programming and Related Problems", Journal of Global Optimization, vol. 9(2) (1996), pp. 113--119. (Sep.)
• Yasuko MATSUI and Tomomi MATSUI, "An Enumeration Algorithm for the Edge Coloring Problem on Bipartite Graphs", Michel Deza, Reinhardt Euler, Yannis Manoussakis (Eds.): Combinatorics and Computer Science, 8th Franco-Japanese and 4th Franco-Chinese Conference, Brest, France, July 3-5, 1995, Selected Papers. Lecture Notes in Computer Science, Springer-Verlag, Vol. 1120 (1996), ISBN 3-540-61576-8, pp. 18--26. (May)

• Maiko SHIGENO, Yasufumi SARUWATARI and Tomomi MATSUI, "An Algorithm for Fractional Assignment Problems", Discrete Applied Mathematics, vol. 56(2-3) (1995), pp. 333--343. (Jan.)
• Tomomi MATSUI and Sunao TAMURA, "Adjacency on Combinatorial Polyhedra", Discrete Applied Mathematics, vol. 56(2-3) (1995), pp. 311--321. (Jan.)
• Tomomi MATSUI, "The minimum spanning tree problem on a planar graph", Discrete Applied Mathematics, vol. 58(1) (1995), pp.91--94. (March)

• Komei FUKUDA and Tomomi MATSUI, "Finding All the Perfect Matchings in Bipartite Graphs", Applied Mathematics Letters, vol. 7(1) (1994), pp. 15--18. (Jan.)
• 吉田泰子，松井知己，"２部グラフの辺彩色の列挙解法"，電気学会誌Ｃ部門誌（T.IEE Japan）, Vol.114-C(4) (1994), pp.444-449. (April)
  Yasuko YOSHIDA and Tomomi MATSUI,"Finding All the Edge Colorings in Bipartite Graphs", T. IEE Japan, vol. 114-C(4) (1994), pp. 444--449 (in Japanese) (April).
• Tomomi MATSUI, Akihisa TAMURA and Yoshiko IKEBE, "Algorithms for Finding a Kth Best Valued Assignment", Discrete Applied Mathematics, vol. 50(3) (1994), pp. 283--296. (May)
• 山田善靖，松井知己，杉山学，"ＤＥＡモデルに基づく新たな経営効率性分析法の提案"，Journal of Operations Research Society of Japan, vol. 37(2) (1994), pp. 158--168. (June)
  Yoshiyasu YAMADA, Tomomi MATSUI and Manabu SUGIYAMA, "An inefficiency measurement method for management systems",Journal of Operations Research Society of Japan, vol. 37(2) (1994), pp. 158--168 (In Japanese) (June).

• Yoshiko IKEBE, Tomomi MATSUI and Akihisa TAMURA, "Adjacency of the Best and Second Valued Best Solutions in Combinatorial Optimization Problems", Discrete Applied Mathematics, vol. 47(3) (1993), pp. 227--232. (Dec.)
• Yasufumi SARUWATARI and Tomomi MATSUI, "A Note on K Best Solutions to the Chinese Postman Problem", SIAM Journal on Optimization, vol. 3(4) (1993), pp. 726--733. (Nov.)

• Komei FUKUDA and Tomomi MATSUI, "Finding All Minimum-Cost Perfect Matchings in Bipartite Graphs", Networks, vol. 22(4) (1992), pp. 461--468. (Dec.)

• 宮川雅巳，松井知己，高野博行，"量反応デ−タに基づく二変量同時分布のノンパラメトリック推定", 応用統計学, vol. 20(1) (1991), pp. 1--10. (July)
• Hiroshi KONNO, Yasutoshi YAJIMA and Tomomi MATSUI, "Parametric Simplex Algorithms for Solving a Special Class of Nonconvex Minimization Problems", Journal of Global Optimization, vol. 1(1) (1991), pp. 65--81. (Jan.)
• Komei FUKUDA and Tomomi MATSUI, "On the Finiteness of the Criss-Cross Method",European Journal of Operational Research, vol. 52(4) (1991), pp. 119--124. (May)

Proceedings (refereed)

• Rina Azuma, Yukihide Kohira, Tomomi Matsui, Atsushi Takahashi, Chikaaki Kodama, ``Process variation-aware mask optimization with iterative improvement by subgradient method and boundary ?ipping,'' Proceedings Volume 11328, Design-Process-Technology Co-optimization for Manufacturability XIV; International Society for Optics and Photonics, vol. 11328 (2020), p. 113280, SPIE Advanced Lithography, 2020, San Jose, California, United States.

• Yuko Kuroki, Tomomi Matsui, ``Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems,'' In: Poon SH., Rahman M., Yen HC. (eds) WALCOM: Algorithms and Computation. WALCOM 2017. Lecture Notes in Computer Science, vol. 10167, (2017). Springer.

• Yukihide Kohira, Atsushi Takahashi, Tomomi Matsui, Chikaaki Kodama, Shigeki Nojima, and Satoshi Tanaka ``Manufacturability-aware mask assignment in multiple patterning lithography,'' In 2016 IEEE Asia Pacific Conference on Circuits and Systems (APCCAS), pp. 538-541, IEEE, 2016, October.
• Yasushi Kawase, Tomomi Matsui, and Atsushi Miyauchi, ''Additive approximation algorithms for modularity maximization,'' Proceedings of the 27th International Symposium on Algorithms and Computation (ISAAC 2016), 43:1-43:13.

• Yukihide Kohira, Chikaaki Kodama, Tomomi Matsui, Atsushi Takahashi, Shigeki Nojima, Satoshi Tanaka, ``Yield-aware mask assignment using positive semi-definite relaxation in LELECUT triple patterning,'' Proceedings Volume 9427, Design-Process-Technology Co-optimization for Manufacturability IX; 94270B (2015) SPIE Advanced Lithography, 2015, San Jose, California, United States.
• Yukihide Kohira, Tomomi Matsui, Yoko Yokoyama, Chikaaki Kodama, Atsushi Takahashi, Shigeki Nojima, Satoshi Tanaka, ``Fast mask assignment using positive semidefinite relaxation in LELECUT triple patterning lithography,'' The 20th Asia and South Pacific Design Automation Conference, Chiba, 2015, pp. 665-670, doi: 10.1109/ASPDAC.2015.7059084.
• Atsushi Takahashi, Ahmed Awad, Yukihide Kohira, TomomiMatsui, Chikaaki Kodama, Shigeki Nojima, Satoshi Tanaka, ``Multi patterning techniques for manufacturability enhancement in optical lithography,'' Proc. ICDV, pp. 117-122, 2014.

• Tomomi Matsui and Yuichiro Miyamoto, ``Characterizing Delaunay Graphs via Fixed Point Theorem,'' 24th Canadian Conference on Computational Geometry (CCCG), August 8-10, 2012, Charlottetown, Prince Edward Island, Canada, pp. 249-254. (Friday Aug. 10, Yuichiro Miyamoto)

• Naoyuki Kamiyama and Tomomi Matsui ``Approximation Algorithms for Data Association Problem Arising from Multitarget Tracking,'' in Proceedings of the 17th Computing: The Australasian Theory Symposium (CATS 2011) and in the Australian Computer Society series Conferences in Research and the Practice in Information Technology (CRPIT), Volume 119 (2011), pp. 137--144.
• Ryuta Ando and Tomomi Matsui, ``Algorithm for Single Allocation Problem on Hub-and-Spoke Networks in 2-Dimensional Plane,'' Proceedings of the 22th International Symposium on Algorithms and Computation (ISAAC 2011), Lecture Notes in Computer Science, Volume 7074, 2011, pp 474-483.

• Shinji Imahori, Tomomi Matsui, and Ryuhei Miyashiro, ``An Approximation Algorithm for the Unconstrained Traveling Tournament Problem,'' The 8th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2010), Queen's University Belfast, Northan Ireland, United Kingdom, August 10-13, 2010 (pp. 508-512).

• Daisuke Yamaguchi, Shinji Imahori, Ryuhei Miyashiro, and Tomomi Matsui, ``An Improved Approximation Algorithm for the Traveling Tournament Problem,'' Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC 2009), LNCS 5878, pp.~679--688, Springer, 2009. (2009/12)

• Ryuhei Miyashiro, Tomomi Matsui, and Shinji Imahori, ``An Approximation Algorithm for the Traveling Tournament Problem,'' Proceedings of PATAT 2008 (The 7th International Conference on the Practice and Theory of Automated Timetabling), CD-ROM. (Aug.)

• Yuichiro MIYAMOTO and Tomomi MATSUI, ``Approximation algorithms for minimum span channel assignment problems,'' In Siu-Wing Cheng and Chung Keung Poon, editors, Proceedings of the 2nd International Conference on Algorithmic Aspects in Information and Management (AAIM'06), LNCS 4041, pp. 334--342. Springer, 2006. (in HongKong, China, 2006/6) (Yuichiro Miyamoto)
• Ryuhei Miyashiro, Tomomi Matsui, ``Minimizing the carry-over effects value in a round-robin tournament,'' The 6th international conference on the Practice And Theory of Automated Timetabling (PATAT 2006), Hotel International Brno, Brno, Czech Republic, August 30--September 1, 2006. (Ryuhei Miyashiro 8/30) in Proceedings of the 6th international conference on the Practice And Theory of Automated Timetabling, E.K. Burke, H. Rudova (eds.), Faculty of Informatics, Masaryk University, Brno, Czech Republic, 2006, pp. 460--463.
• Nobutomo Fujiwara, Shinji Imahori, Tomomi Matsui, Ryuhei Miyashiro, ``Constructive algorithms for the constant distance traveling tournament problem,'' The 6th international conference on the Practice And Theory of Automated Timetabling (PATAT 2006), Hotel International Brno, Brno, Czech Republic, August 30--September 1, 2006. (Shinji Imahori 8/31). in Proceedings of the 6th international conference on the Practice And Theory of Automated Timetabling, E.K. Burke, H. Rudova (eds.), Faculty of Informatics, Masaryk University, Brno, Czech Republic, 2006, pp.402--405.

• Shuji Kijima and Tomomi Matsui, ``Approximate/perfect samplers for closed Jackson networks,'' The 2005 Winter Simulation Conference (WSC '05), Hilton at the Walt Disney World Resort in Orlando, FL, USA, December 4-7, 2005, pp. 862--868.
• Masashi Kiyomi, Takeaki Uno, and Tomomi Matsui, "Efficient Algorithms for the Electric Power Transaction Problem," Internet and Network Economics: First International Workshop, WINE 2005, Hong Kong, China, December 15-17, 2005. Proceedings, Editors: Xiaotie Deng, Yinyu Ye, Lecture Notes in Computer Science, Springer-Verlag, 3828 (2005), pp. 602-611.
• Shuji Kijima and Tomomi Matsui, "Rapidly Mixing Chain and Perfect Sampler for Logarithmic Separable Concave Distributions on Simplex," Proceedings of the 2005 International Conference on the Analysis of Algorithms, Discrete Mathematics and Computer Science, DMTCS Proceedings Series Volume AD, pp. 369--380, 2005, Universitat Politecnica de Catalunya, Barcelona Spain, June 6-10, 2005. (Committee chair: Conrado Martinez)
• Ayami SUZUKA, Ryuhei MIYASHIRO, Akiko YOSHISE and Tomomi MATSUI, "Semidefinite Programming Based Approaches to Home-away Assignment Problems in Sports Scheduling," The First International Conference on Algorithmic Applications in Management, June 22-24, Xi'an, Shaanxi, China, Editors: Nimrod Megiddo, Yinfeng Xu, Binhai Zhu, Lecture Notes in Computer Science, Springer-Verlag, 3521(2005), pp. 95--103.
• Yuichiro Miyamoto and Tomomi Matsui, "Perfectness and Imperfectness of the kth Power of Lattice Graphs," The First International Conference on Algorithmic Applications in Management, June 22-24, Xi'an, Shaanxi, China, Editors: Nimrod Megiddo, Yinfeng Xu, Binhai Zhu, Lecture Notes in Computer Science, Springer-Verlag, 3521(2005), pp. 233--242.
• Yuichiro Miyamoto and Tomomi Matsui, "Multicoloring Unit Disk Graphs on Triangular Lattice Points," Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA05), Sheraton Vancouver Wall Center Hotel, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 895-896.

• Shuji Kijima and Tomomi Matsui, "Polynomial Time Perfect Sampling Algorithm for Two-Rowed Contingency Tables," Mathematics and Computer Science III, Algorithms Trees, Combinatorics and Probabilities, M. Drmota, P. Flajolet, D. Gardy and B. Gittenberger (Ed.), Birkhaeuser, 2004, pp. 175-186. (ISBN 3-7643-7128-5)
• Ryuhei Miyashiro and Tomomi Matsui, ``The break minimization problem is solvable in polynomial time when the optimal value is less than the number of teams'', The 5th International Conference on the Practice and Theory of Automated Timetabling (PATAT2004), Sheraton Station Square, Pittsburgh, PA, USA 8/18-20, pp. 535-538, 2004.

• Tomomi MATSUI, Mitsuo MOTOKI and Naoyuki KAMATANI, "Polynomial Time Approximate Sampler for Discretized Dirichlet Distribution," 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 2003, Proceedings, T. Ibaraki, N. Katoh and H. Ono (Eds.), Lecture Notes in Computer Science, Springer-Verlag, 2906 (2003), pp. 676--685.
• Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, David Rappaport, and Godfried Toussaint, "Computing the Similarity of two Melodies," 15th Canadian Conference on Computational Geometry (CCCG2003), Dalhousie University, Halifax, August 11-13, 2003. (Greg Aloupis).

• Ryuhei Miyashiro, Hideya Iwasaki and Tomomi Matsui, "Characterizing Feasible Pattern Sets with a Minimum Number of Breaks", Proceedings of the 4th International Conference on the Practice and Theory of Automated Timetabling (PATAT2002), KaHo St.-Lieven, Gent, Belgium, 21-23, August, pp. 311-313, 2002.

• Shiro MATUURA and Tomomi MATSUI, "0.863 Approximation Algorithm for MAX DICUT", Approximation, Randomness and Combinatorial Optimization, 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomness and Application Techniques in Computer Science, RANDOM 2001, Berkeley, CA, USA, 18-20, 2001, Michel Goemans, Klaus Jansen, Jose D. P. Rolim, and Luca Trevisan (Ed.), Lecture Notes in Computer Science, Springer-Verlag, 2129 (2001), pp. 138--146.
• Tomomi MATSUI and Takahiro WATANABE, "Sealed Bid Multi-object Auctions with Necessary Bundles and Its Application to Spectrum Auctions", Intelligent Agents: Specification, Modeling, and Applications, 4th Pacific Rim International Workshop on Multi-Agents, PRIMA2001, Taipei, July 2001, Proceedings, Soe-Tsyr Yuan and Makoto Yokoo eds., Lecture Notes in Artificial Intelligence (LNAI) 2132 (2001), pp. 78--92. (related tech. report in ps file)

• Tetsuo ASANO, Tomomi MATSUI, Takeshi TOKUYAMA, "On the Complexities of the Optimal Rounding Problems", Algorithm Theory -- SWAT 2000, Magn\'{u}s M. Halld\'{o}rsson (Ed.), Lecture Notes in Computer Science, Springer-Verlag, 1851 (2000), pp. 476--489.

Proceedings (simply refereed)

• Masato Tanaka, Tomomi Matsui. Calculating the Least Core Value of Weighted Voting Games, The 12th Annual Meeting of the Asian Association for Algorithms and Computation (AAAC), Jan. 2021.

• Takashi Masuko and Tomomi Matsui, ``Minimum Cost Home-Away Assignment of Double Round-Robin Tournament,'' 3rd International Conference on Mathematics in Sport Proceedings Papers, June 22-24, 2011, Manchester, UK, pp. 125--131.

• Yuko Moriyama and Tomomi Matsui, ``Algorithms for Domino Portrait Generation,'' The 3rd Annual Meeting of the Asian Association for Algorithms and Computation (AAAC2010), April 17-19, 2010, Pohang, Korea. (4/17, Yuko Moriyama)
• Ryo Nakatsubo, Shuji Kijima and Tomomi Matsui, ``Computational Experiments on Perfect Sampling of Contingency Tables,'' The 3rd Annual Meeting of the Asian Association for Algorithms and Computation (AAAC2010), April 17-19, 2010, Pohang, Korea. (4/17, Ryo Nakatsubo)

• Hirotatsu Kobayashi and Tomomi Matsui, ``Successful Manipulation in Stable Marriage Model with Complete Preference Lists,'' Matching Under Preferences, Satelite workshop of ICALP 2008, July 6, 2008, Reykjavic, Iceland, pp. 17-22. pdf file of MATCH-UP version

• 宮代隆平、松井知己、 「スポーツスケジューリングの近年の展開」、 「日本スポーツ産業学会　第15回大会号 --- スポーツのブランディングを考える ---」、 ２００６年７月２２日〜２３日、天堂大学　本郷キャンパス、pp. 39-40. （松井知己）
• Shuji Kijima and Tomomi Matsui, ``Randomized approximation scheme and perfect sampler for closed Jackson networks,'' Second Madrid Conference on Queueing Theory, Complutense University of Madrid, Madrid, Spain, July 3-7, 2006. (4 July) (Shuji Kijima)
• Masaru Iwasa, Hiroo Saito, Tomomi Matsui, ``Approximation Algorithms for the Single Allocation Problem in Hub-and-Spoke Networks,'' Optimal Discrete Structures and Algorithms, 9/04-06, 2006, Universitaet Rostock, Rostock, Germany, p. 24. (Masaru IWASA)
• Yusuke KUROKI, Tomomi Matsui, ``Randomized Approximation Algorithm for a Geometrical Multidimensional Assignment Problem,'' Optimal Discrete Structures and Algorithms, 9/04-06, 2006, Universitaet Rostock, Rostock, Germany, P. 30. (Yusuke KUROKI)

• Shuji Kijima and Tomomi Matsui, "Polynomial Time Perfect Sampler for Closed Jackson Networks with Single Servers," The 5th International Symposium on Operations Research and Its Applications (ISORA2005), Lahsa, Tibet, China, August 9-13, Lecture Notes in Operations Research, 5 (2005), Xiang-Sun Zhang, De-Gang Liu and Ling-Yun Wu (Eds.), pp. 227-240, 2005.

• T. Matsui, M. Motoki, N. Kamatani, ``A Rapidly Mixing Approximate Sampler of Dirichlet Distribution '', Japan-Korea Joint Workshop on Algorithms and Computation (WAAC03), Sendai City Information & Industry Plaza (in AER Building), Sendai, Japan, 3 July, pp. 61-72, 2003.
• Hiro-o Saito, Tetsuya Fujie and Tomomi Matsui, ``Polyhedral Approach to the Hub Network Design Problem'', Japan-Korea Joint Workshop on Algorithms and Computation (WAAC03), Sendai City Information & Industry Plaza (in AER Building), Sendai, Japan, 3 July, pp. 22-25, 2003.
• Shuji Kijima and Tomomi Matsui, ``Sampling Algorithm for Two-rowed Contingency Tables'', Japan-Korea Joint Workshop on Algorithms and Computation (WAAC03), Sendai City Information & Industry Plaza (in AER Building), Sendai, Japan, 3 July, pp. 73-85, 2003.

• Shuji Kijima and Tomomi Matsui, "Approximate counting scheme for m x n contingency tables'', The Japan Conference on Discrete and Computational Geometry (JCDCG), Tokyo, Japan, December 6-9, pp. 59-60, 2002.
• Riyo Endo, Katsunori Ano, Tomomi Matsui, "Modified Banzhaf index for voting games", Game theory and applications, vol. VIII, pp. 29--42, Nova Sci. Publ., Huntington, NY, 2002.

• Hiro-o SAITO, Shiro MATUURA, and Tomomi MATSUI, "Linear Relaxation for Hub Location Problems", Proceedings of the 6th KOREA-JAPAN Joint Workshop on Algorithms and Computation, Pusan National University, Korea, 2001, pp. 15--20.
• Tetsuo ASANO, Naoki FUJIKAWA, Naoki KATOH, Tomomi MATSUI, Hiroshi NAGAMOCHI, Koji OBOKATA, and Takeshi TOKUYAMA, "Digital Halftoning: Its Computational Complexity and Approximation Algorithms Based on Network Flow", Proceedings of the 6th KOREA-JAPAN Joint Workshop on Algorithms and Computation, Pusan National University, Korea, 2001, pp. 21--28.
• Ryuhei MIYASHIRO, and Tomomi MATSUI, "Note on Equitable Round-Robin Tournaments", Proceedings of the 6th KOREA-JAPAN Joint Workshop on Algorithms and Computation, Pusan National University, Korea, 2001, pp.135--140.

• Yasuko Matsui and Tomomi Matsui, "NP-completeness for Calculating Power Indices of Weighted Majority Games", Proceedings 10th Franco-Japanese & 5th Franco-Chinese Conference combinatorics and computer Science.

• Tomomi MATSUI, "Repairing a Flaw in Contour Maps", Proceedings of the Third KOREA-JAPAN Joint Workshop on Algorithms and Computation, Seoul National University, Korea, p. 80--83, 1999.
• Tomomi MATSUI, "A note on the nucleolus of assignment games", Proceedings of the International Conference on Nonlinear Analysis and Convex Analysis (1999), World Scientific, Singapore, NACA98, Niigata Washington Hotel, Niigata, Japan, July 28-31, 1998, Wataru TAKAHASHI and Tamaki TANAKA Eds. (ISBN 981-02-4074-0), pp. 253-260.

• Yasuko MATSUI and Tomomi MATSUI, "Finding All Maximal Common Independent Sets of Matroids", Proceedings of Korea-Japan Joint Workshop on Algorithms and Computation, KAIST, Taejon, Korea, 1996, pp. 54--58.

• Yasuko MATSUI, Tomomi MATSUI and Takeaki UNO, "Finding All the s-t Paths in Acyclic Graphs", Lecture Notes in Operations Research 1 (ISBN 7-5062-2767-3), Proceedings of ISORA'95, Beijin, P. R. China, 1995, pp. 259--266.

• Tomomi MATSUI, "NP-completeness of Non-adjacency Relations on Some 0-1 Polytopes", Lecture Notes in Operations Research 1 (ISBN 7-5062-2767-3), Proceedings of ISORA'95, Beijin, P. R. China, 1995, pp. 249--258.

Proceedings (without referee process)

• Ryuta Tamura, Ken Kobayashi, Yuichi Takano, Ryuhei Miyashiro, Kazuhide Nakata, Tomomi Matsui, ''Mixed integer quadratic optimization formulation for eliminating multicollinearity based on variance inflation factor,'' Optimization Online, September 2016, 8 pages.
• ``An Improved Approximation Algorithm for the Traveling Tournament Problem,'' 山口大輔，今堀慎治，宮代隆平，松井知己, 統計数理研究所共同研究リポート252, 最適化：モデリングとアルゴリズム23, 2010年3月，pp. 1--14.
  

• ``燃料消費削減のための航空路線設計,'' 岩佐大, 齊藤廣大, 松井知己, ミニシンポジウム「新世代計算限界と地球環境問題」, 東京大学本郷キャンパス, 2006年12月6日, pp. 45--49.(岩佐大) pdf file ,
  

• ``CFTP を用いた Perfect Sampling,'' （チュートリアル講演） Randomness and Computation (RC2005), Sendai International Center, Sendai, Japan, 18 - 21 July, 2005. Lecture Notes in Tutorial Sessions (10 pages). pdf file ,
  

• 松井知己, 渡辺隆裕, 「オークションの設計理論と数理計画」, 日本オペレーションズ・リサーチ学会 第49回シンポジウム(2003年3月17日), 慶應義塾大学 矢上キャンパス, p. 7--12, pdf file , ps file , dvi file .
  

• 宮代隆平, 松井知己, 「スポーツスケジューリング問題」, 最適化：モデリングとアルゴリズム13(1999年3月31日), 統計数理研究所共同研究レポート125, pp. 275--189, 2000年 2月.
  

• 松井知己, 松井泰子, 「重み付き多数決ゲームにおける投票力指数の計算について」, dvi file , ps.Z file , 第１０回ＲＡＭＰシンポジウム論文集，京大会館，１９９８年９月２４日, pp.17-30.
  Tomomi MATSUI and Yasuko MATSUI, "Calculating Power Indices of Weighted Majority Games", Proceedings of the Tenth RAMP Symposium, Kyoudai Kaikan, 1998, 24 Sep., pp. 17--30.
  (RAMP: Research Association of Mathematical Programming)

• 松井知己,「最小ノルム点問題とその周辺」, 第５回ＲＡＭＰシンポジウム論文集，筑波大学, １９９３年１０月２１日, pp. 101--112.
  Tomomi MATSUI, "Minimum Norm Point Problems and Related Areas", Proceedings of the Fifthth RAMP Symposium, University of Tsukuba, 1998, 24 Sep., pp. 17--30.
  (RAMP: Research Association of Mathematical Programming)

• 松井知己,「組合せ最適化」, １９９２年オペレーションズ・リサーチ学会秋季研究発表会, チュートリアルセッション.
• Tomomi MATSUI, "A linear time algorithm for the Hitchcock transportation problem with fixed number of supply points", Optimization -Modeling and Algorithms-, Cooperative Research Report 35, The Institute of Statistical Mathematics, Minami-Azabu, Minato-ku, Tokyo, Japan, 1992, pp. 128-138.

• 福田公明, 松井知己,"Elementary Inductive Proofs for Linear Programming"，「帰納法を用いた線形計画法の基本定理の証明」, 数理解析研究所講究録680，計画数学とその関連分野，京都大学数理解析研究所，1989年．