Tokyo University of Science   Industrial Administration, Faculty of Science and Technology

1990.4 - 1992.3

A constant-ratio approximation algorithm for a class of hub-and-spoke network design problems and metric labeling problems: Star metric case Reviewed

Yuko Kuroki, Tomomi Matsui

Discrete Applied Mathematics   349   201 - 214   2024.5

A formulation of mask optimization into QUBO model for Ising machines Reviewed

Yukihide Kohira, Haruki Nakayama, Naoki Nonaka, Tomomi Matsui, Atsushi Takahashi, Chikaaki Kodama

Photomask Technology 2023   81 - 81   2023.11

Additive approximation algorithms for modularity maximization Reviewed

Yasushi Kawase, Tomomi Matsui, Atsushi Miyauchi

Journal of Computer and System Sciences   117   182 - 201   2021.5

Monte Carlo Methods for Calculating Shapley-Shubik Power Index in Weighted Majority Games.

Yuto Ushioda, Masato Tanaka, Tomomi Matsui

CoRR   abs/2101.02841   2021

A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption Reviewed

Yusei Fujimori, Yasushi Kawase, Tomomi Matsui, Akiyoshi Shioura

Information processing letters   162   105991 - 105991   2020.10

Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems. Reviewed

Yuko Kuroki, Tomomi Matsui

J. Graph Algorithms Appl.   23 ( 1 )   93 - 110   2019.1

多重共線性を考慮した回帰式の変数選択問題の定式化 Invited

田村隆太, 小林健, 高野祐一, 宮代隆平, 中田和秀, 松井知己

オペレーションズ・リサーチ   63 ( 3 )   128 - 133   2018.3

半正定値計画緩和に基づく擬似スティッチを用いたTPLのためのレイアウト分割手法 Reviewed

半田昌平, 高橋篤司, 中田和秀, 松井知己

第29回 回路とシステムワークショップ 論文集   29   pp. 214 - 219   2016.5

双対から齧るLovaszのサンドイッチ定理

松井知己

オペレーションズ・リサーチ   2016.1

特集にあたって(<特集>OR研究の過去・現在・未来)

松井知己

オペレーションズ・リサーチ : 経営の科学   2015.1

Yield-aware Mask Assignment using Positive Semidefinite Relaxation in LELECUT Triple Patterning Reviewed

Yukihide Kohira, Chikaaki Kodama, Tomomi Matsui, Atsushi Takahashi, Shigeki Nojima, Satoshi Tanaka

DESIGN-PROCESS-TECHNOLOGY CO-OPTIMIZATION FOR MANUFACTURABILITY IX   9427   94270B   2015

Fast Mask Assignment using Positive Semidefinite Relaxation in LELECUT Triple Patterning Lithography Reviewed

Yukihide Kohira, Tomomi Matsui, Yoko Yokoyama, Chikaaki Kodama, Atsushi Takahashi, Shigeki Nojima, Satoshi Tanaka

2015 20TH ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE (ASP-DAC)   665 - 670   2015

A linear time algorithm for the unbalanced Hitchcock transportation problem Reviewed

Matsui Tomomi, Scheifele Rudolf

Networks   67 ( 2 )   2015

0.863-approximation algorithm for MAX DICUT Reviewed

Matuura S, Matsui T

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   2129   138 - 146   2015

Fractional programming formulation for the vertex coloring problem Reviewed

Tomomi Matsui, Noriyoshi Sukegawa, Atsushi Miyauchi

INFORMATION PROCESSING LETTERS   114 ( 12 )   706 - 709   2014.12

A NOTE ON A LOWER BOUND FOR THE MULTIPLICATIVE ODDS THEOREM OF OPTIMAL STOPPING Reviewed

Tomomi Matsui, Katsunori Ano

JOURNAL OF APPLIED PROBABILITY   51 ( 3 )   885 - 889   2014.9

Positive Semidefinite Relaxation and Approximation Algorithm for Triple Patterning Lithography Reviewed

Tomomi Matsui, Yukihide Kohira, Chikaaki Kodama, Atsushi Takahashi

ALGORITHMS AND COMPUTATION, ISAAC 2014   8889   365 - 375   2014

A 2.75-approximation algorithm for the unconstrained traveling tournament problem Reviewed

Imahori Shinji, Matsui Tomomi, Miyashiro Ryuhei

Annals of Operations Research   218 ( 1 )   237 - 247   2014

1-D-4 Compare the Ratio of Symmetric Polynomials of Odds to One and Stop

MATSUI Tomomi, ANO Katsunori

日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集   2014   60 - 61   2014

[Invited] Multi Patterning Techniques for Manufacturability Enhancement in Optical Lithography Reviewed

Takahashi Atsushi, Awad Ahmed, Kohira Yukihide, Matsui Tomomi, Kodama Chikaaki, Nojima Shigeki, Tanaka Satoshi

Proc. the 2014 International Conference on Integrated Circuits, Design, and Verification (ICDV 2014)   117 - 122   2014

NP-completeness of Arithmetical Restorations Reviewed

Matsui Tomomi

Journal of information processing   21 ( 3 )   402   2013

ON THE NUMBER OF SOLUTIONS GENERATED BY DANTZIG'S SIMPLEX METHOD FOR LP WITH BOUNDED VARIABLES Reviewed

Tomonari Kitahara, Tomomi Matsui, Shinji Mizuno

PACIFIC JOURNAL OF OPTIMIZATION   8 ( 3 )   447 - 455   2012.7

An approximation algorithm for the traveling tournament problem Reviewed

Ryuhei Miyashiro, Tomomi Matsui, Shinji Imahori

ANNALS OF OPERATIONS RESEARCH   194 ( 1 )   317 - 324   2012.4

和音に対するピアノ運指決定法

Wakamatsu Masako, Matsui Tomomi

数理解析研究所講究録   1773   87 - 95   2012

Lower Bounds for Bruss' Odds Problem with Multiple Stoppings

Matsui, Tomomi, Ano, Katsunori

arXiv preprint arXiv:1204.5537   2012

Characterizing Delaunay Graphs via Fixed Point Theorem. Reviewed

Matsui Tomomi, Miyamoto Yuichiro

CCCG   2012 ( 1 )   241 - 246   2012

An Improved Approximation Algorithm for the Traveling Tournament Problem Reviewed

Daisuke Yamaguchi, Shinji Imahori, Ryuhei Miyashiro, Tomomi Matsui

ALGORITHMICA   61 ( 4 )   1077 - 1091   2011.12

Improved Approximation Algorithms for Firefighter Problem on Trees Reviewed

Yutaka Iwaikawa, Naoyuki Kamiyama, Tomomi Matsui

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS   E94D ( 2 )   196 - 199   2011.2

On the number of solutions generated by Dantzig’s simplex method for LP with bounded variables Reviewed

Kitahara Tomonari, Matsui Tomomi, Mizuno Shinji

Pacific Journal of optimization   2011

Algorithm for Single Allocation Problem on Hub-and-Spoke Networks in 2-Dimensional Plane Reviewed

Ryuta Ando, Tomomi Matsui

ALGORITHMS AND COMPUTATION   7074   474 - 483   2011

Minimum Cost Home-Away Assignment of Double Round-Robin Tournament Reviewed

Masuko Takashi, Matsui Tomomi

Minimum Cost Home-Away Assignment of Double Round-Robin Tournament   125 - 131   2011

DS-1-8 Randomized Approximation Scheme for Estimating Critical Path Length of Stochastic PERT Network

YAMAGUCHI Daisuke, MATSUI Tomomi

電子情報通信学会総合大会講演論文集   2011 ( 1 )   2011

Approximation algorithms for data association problem arising from multitarget tracking Reviewed

Kamiyama Naoyuki, Matsui Tomomi

Proceedings of the Seventeenth Computing on The Australasian Theory Symposium-Volume 119   119   137 - 143   2011

Algorithmic Aspects of Equilibria of Stable Marriage Model with Complete Preference Lists Reviewed

Tomomi Matsui

OPERATIONS RESEARCH PROCEEDINGS 2010   47 - 52   2011

Cheating Strategies for the Gale-Shapley Algorithm with Complete Preference Lists Reviewed

Hirotatsu Kobayashi, Tomomi Matsui

ALGORITHMICA   58 ( 1 )   151 - 169   2010.9

Polynomial time approximate or perfect samplers for discretized Dirichlet distribution Reviewed

Tomomi Matsui, Mitsuo Motoki, Naoyuki Kamatani, Shuji Kijima

JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS   27 ( 1 )   91 - 123   2010.6

An approximation algorithm for the unconstrained traveling tournament problem Reviewed

Imahori S, Matsui T, Miyashiro R

PATAT 2010 - Proceedings of the 8th International Conference on the Practice and Theory of Automated Timetabling   508 - 512   2010

Computational Experiments on Perfect Sampling of Contingency Tables

Nakatsubo, Ryo, Kijima, Shuji, Matsui, Tomomi

Computational Experiments on Perfect Sampling of Contingency Tables   2010

Algorithms for Domino Portrait Generation

Moriyama, Yuko, Matsui, Tomomi

Algorithms for Domino Portrait Generation   2010

A note on generalized rank aggregation Reviewed

Hadas Shachnai, Lisa Zhang, Tomomi Matsui

INFORMATION PROCESSING LETTERS   109 ( 13 )   647 - 651   2009.6

An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors Reviewed

Yusuke Kuroki, Tomomi Matsui

DISCRETE APPLIED MATHEMATICS   157 ( 9 )   2124 - 2135   2009.5

Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems Reviewed

Masaru Iwasa, Hiroo Saito, Tomomi Matsui

DISCRETE APPLIED MATHEMATICS   157 ( 9 )   2078 - 2088   2009.5

A study of the quadratic semi-assignment polytope Reviewed

Hiroo Saito, Tetsuya Fujie, Tomomi Matsui, Shiro Matuura

DISCRETE OPTIMIZATION   6 ( 1 )   37 - 50   2009.2

Successful Manipulation in Stable Marriage Model with Complete Preference Lists Reviewed

Hirotatsu Kobayashi, Tomomi Matsui

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS   E92D ( 2 )   116 - 119   2009.2

2-C-14 Cheating Strategies for Gale-Shapley Algorithm with Complete Preference Lists

KOBAYASHI Hirotatsu, MATSUI Tomomi

日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集   2009   194 - 195   2009

Perfectness and imperfectness of unit disk graphs on triangular lattice points Reviewed

Miyamoto Yuichiro, Matsui Tomomi

Discrete Mathematics   309 ( 9 )   2733 - 2744   2009

Integer Programming for a Phrase Alignment Problem on Statistical Machine Translation (Mathematical Programming in the 21st Century: Optimization Modeling and Algorithms)

Yamamoto Mikio, Umetani Shunji, Koshikawa Mitsuru, Matsui Tomomi

RIMS Kokyuroku   1629   87 - 93   2009

Exact algorithms for the master ring problem Reviewed

Hadas Shachnai, Lisa Zhang, Tomomi Matsui

NETWORKS   52 ( 2 )   98 - 107   2008.9

Approximation algorithm and perfect sampler for closed jackson networks with single servers Reviewed

Kijima Shuji, Matsui Tomomi

SIAM Journal on Computing   38 ( 4 )   1484 - 1503   2008

Diversion of Hierarchical Phrases as Reordering Templates.

Yamamoto Mikio, Norimatsu Jyunya, Koshikawa Mitsuru, Fukutomi Takahiro, Nishio Taku, Sadamitsu Kugatsu, Utsuro Takehito, Utiyama Masao, Umetani Shunji, Matsui Tomomi

NTCIR   2008

Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers Reviewed

Kijima Shuji, Matsui Tomomi

Annals of Operations Research   162 ( 1 )   35 - 55   2008

Polynomial time perfect sampler for discretized Dirichlet distribution Reviewed

Matsui Tomomi, Kijima Shuji

The Grammar of Technology Development   179 - 199   2008

A special issue on the 50th anniversary of the Operations Research Society of Japan - Introduction

Naoki Katoh, Hiroshi Yabe, Shoji Kasahara, Kazuhisa Makino, Tomomi Matsui, Hiroshi Morita, Masakazu Muramatsu, Atsuo Suzuki

JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN   50 ( 4 )   277 - 277   2007.12

Perfect Simulation of Markov Chains Reviewed

Matsui T, Kijima S

JOURNAL-JAPAN SOCIETY FOR SIMULATION TECHNOLOGY   26 ( 2 )   21 - 21   2007

The home--away assignment problems and break minimization/maximization problems in sports scheduling Reviewed

Suzuka Ayami, Miyashiro Ryuhei, Yoshise Akiko, Matsui Tomomi

Pacific Journal of Optimization   3 ( 1 )   113 - 133   2007

Algorithms for computing geometric measures of melodic similarity Reviewed

Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Yurai Nuñez, David Rappaport, Godfried Toussaint

Computer Music Journal   30 ( 3 )   67 - 76   2006.9

Dependent randomized rounding to the home-away assignment problem in sports scheduling Reviewed

Ayami Suzuka, Ryuhei Miyashiro, Akiko Yoshise, Tomomi Matsui

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E89A ( 5 )   1407 - 1416   2006.5

DS-1-4 スポーツのスケジューリングにおける会場割当問題(DS-1.COMP-NHC学生シンポジウム,シンポジウム)

Suzuka,Ayami, Miyashiro,Ryuhei, Yoshise,Akiko, Matsui,Tomomi

Proceedings of the IEICE General Conference   2006 ( 1 )   - 15   2006.3

A general construction method for mixed-level supersaturated design Reviewed

S Yamada, M Matsui, T Matsui, DKJ Lin, T Takahashi

COMPUTATIONAL STATISTICS & DATA ANALYSIS   50 ( 1 )   254 - 265   2006.1

Special section on discrete mathematics and its applications

Imai K, Koga H, Matsui M, Matsui T, Miyaji A, Sadakane K, Shibuya T, Shioura A, Takagi T, Takenaga Y, Takimoto E, Tanaka K, Tsukiji T, Uehara R, Uno T, Yamazaki K, Fujita S

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences   E89-A ( 5 )   1159   2006

Semidefinite programming based approaches to the break minimization problem Reviewed

Miyashiro Ryuhei, Matsui Tomomi

Computers & Operations Research   33 ( 7 )   1975   2006

Random sampling via Markov chain

Kijima, Shuji, Matsui, Tomomi, マルコフ連鎖を用いたランダムサンプリング法

2006

多変量離散分布とマルコフ連鎖モンテカルロ法(学生セッション)

来嶋 秀治, 松井 知己

日本計算機統計学会シンポジウム論文集   20   81 - 84   2006

The symmetric quadratic semi-assignment polytope Reviewed

Hiroo Saito

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences   E89-A ( 5 )   1227 - 1232   2006

Sports Timetabling-Constructive Algorithms for the Constant Distance Traveling Tournament Problem Reviewed

Fujiwara Nobutomo, Imahori Shinji, Matsui Tomomi, Miyashiro Ryuhei

Lecture Notes in Computer Science   3867   135 - 135   2006

Recent progress in integer programming Reviewed

Miyashiro R, Matsui T

SYSTEMS CONTROL AND INFORMATION   50 ( 9 )   363 - 363   2006

Constructive algorithms for the constant distance traveling tournament problem Reviewed

Fujiwara Nobutomo, Imahori Shinji, Matsui Tomomi, Miyashiro Ryuhei

Practice and theory of automated timetabling VI   3867 LNCS   135 - 146   2006

Approximation algorithms for minimum span channel assignment problems Reviewed

Yuichiro Miyamoto, Tomomi Matsui

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   4041   334 - 342   2006

Approximation Algorithms for the Single Allocation Problem in Hub-and-Spoke Networks Reviewed

Iwasa Masaru, Saito Hiroo, Matsui Tomomi

Electronic Notes in Discrete Mathematics   27   51 - 52   2006

Randomized approximation scheme and perfect sampler for closed Jackson networks Reviewed

Kijima Shuji, Matsui Tomomi

Randomized approximation scheme and perfect sampler for closed Jackson networks   2006

Randomized Approximation Algorithm for a Geometrical Multidimensional Assignment Problem Reviewed

Kuroki Yusuke, Matsui Tomomi

Electronic Notes in Discrete Mathematics   27   63 - 64   2006

Polynomial time perfect sampling algorithm for two-rowed contingency tables Reviewed

Kijima Shuji, Matsui Tomomi

Random Structures & Algorithms   29 ( 2 )   243 - 256   2006

Minimizing the carry-over effects value in a round robin tournament Reviewed

Miyashiro Ryuhei, Matsui Tomomi

Proceedings of the 6th International Conference on the Practice and Theory of Automated Timetabling   460 - 463   2006

電力取り引きにおける約定量決定問題の高速解法

清見礼, 宇野毅明, 松井知己

第101回情報処理学会アルゴリズム研究会   17 - 24   2005.5

リーグ戦の最適会場割当問題に対するSDP緩和を用いた手法(グラフ・ネットワーク(1))

SUZUKA,Ayami, MIYASHIRO,Ryuhei, YOSHISE,Akiko, MATSUI,Tomomi

日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集   2005 ( 0 )   110 - 111   2005.3

Semidefinite Programming Based Approaches to the Break Minimization Problem

Ryuhei Miyashiro, Tomomi Matsui

統計数理研究所共同研究リポート   178   278 - 286   2005.3

Perfectness and imperfectness of the kth power of lattice graphs Reviewed

Y Miyamoto, T Matsui

ALGORITHMIC APPLICATIONS IN MANAGEMENT, PROCEEDINGS   3521   233 - 242   2005

Multicoloring unit disk graphs on triangular lattice points Reviewed

Miyamoto Yuichiro, Matsui Tomomi

Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms   895 - 896   2005

Efficient algorithms for the electric power transaction problem Reviewed

M Kiyomi, T Uno, T Matsui

INTERNET AND NETWORK ECONOMICS, PROCEEDINGS   3828   602 - 611   2005

Approximate/perfect samplers for closed Jackson networks Reviewed

Kijima Shuji, Matsui Tomomi

Proceedings of the 37th conference on Winter simulation   862 - 868   2005

A polynomial-time algorithm to find an equitable home--away assignment Reviewed

Miyashiro Ryuhei, Matsui Tomomi

Operations Research Letters   33 ( 3 )   235 - 241   2005

Semidefinite programming based approaches to home-away assignment problems in sports scheduling Reviewed

A Suzuka, R Miyashiro, A Yoshise, T Matsui

ALGORITHMIC APPLICATIONS IN MANAGEMENT, PROCEEDINGS   3521   95 - 103   2005

Rapidly mixing chain and perfect sampler for logarithmic separable concave distributions on simplex Reviewed

Kijima Shuji, Matsui Tomomi

International Conference on Analysis of Algorithms DMTCS proc. AD   371   382 - 382   2005

Polynomial-time perfect sampler for closed Jackson networks with single servers Reviewed

Shuji Kijima, Tomomi Matsui

OPERATIONS RESEARCH AND ITS APPLICATIONS   5   227 - 240   2005

Random generation of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mn>2</mml:mn><mml:mo>×</mml:mo><mml:mn>2</mml:mn><mml:mo>×</mml:mo><mml:mo>⋯</mml:mo><mml:mo>×</mml:mo><mml:mn>2</mml:mn><mml:mo>×</mml:mo><mml:mi>J</mml:mi></mml:math> contingency tables Reviewed

Tomomi Matsui, Yasuko Matsui, Yoko Ono

Theoretical Computer Science   326 ( 1-3 )   117 - 135   2004.10

Linear time approximation algorithm for multicoloring lattice graphs with diagonals Reviewed

Y Miyamoto, T Matsui

JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN   47 ( 2 )   123 - 128   2004.6

Approximate counting scheme for m x n contingency tables Reviewed

S Kijima, T Matsui

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS   E87D ( 2 )   308 - 314   2004.2

The break minimization problem is solvable in polynomial time when the optimal value is less than the number of teams Reviewed

Miyashiro Ryuhei, Matsui Tomomi

The 5th International Conference on the Practice and Theory of Automated Timetabling   535 - 538   2004

New approximation algorithms for MAX 2SAT and MAX DICUT Reviewed

S Matuura, T Matsui

JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN   46 ( 2 )   178 - 188   2003.6

Computing a geometric measure of the similarity between two melodies Reviewed

Aloupis Greg, Fevens Thomas, Langerman Stefan, Matsui Tomomi, Mesa Antonio, Nunez Yurai, Rappaport David, Toussaint Godfried

Proc. 15th Canadian Conf. Computational Geometry   81   2003

Characterizing feasible pattern sets with a minimum number of breaks Reviewed

R Miyashiro, H Iwasaki, T Matsui

PRACTICE AND THEORY OF AUTOMATED TIMETABLING IV   2740   78 - 99   2003

Home-Away Table Feasibility Problem

MIYASHIRO Ryuhei, MATSUI Tomomi

日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集   2003   152 - 153   2003

Round-robin tournaments with a small number of breaks Reviewed

Miyashiro Ryuhei, Matsui Tomomi

Department of Mathematical Informatics, The University of Tokyo, Mathematical Engineering Technical Reports METR   29   2003   2003

Polynomial time approximate sampler for discretized Dirichlet distribution Reviewed

T Matsui, M Motoki, N Kamatani

ALGORITHMS AND COMPUTATION, PROCEEDINGS   2906   676 - 685   2003

Polynomial Time Perfect Sampling Algorithm for Two-rowed Contingency Tables Reviewed

Kijima Shuji, Matsui Tomomi

Mathematical Engineering Technical Reports   15   2003

Polyhedral Approach to the Hub Network Design Problem Reviewed

Saito Hiroo, Fujie Tetsuya, Matsui Tomomi

Polyhedral Approach to the Hub Network Design Problem   22 - 25   2003

Sampling Algorithm for Two-rowed Contingency Tables Reviewed

Kijima Shuji, Matsui Tomomi

Sampling Algorithm for Two-rowed Contingency Tables   73 - 85   2003

Optimality of mixed-level supersaturated designs Reviewed

S Yamada, T Matsui

JOURNAL OF STATISTICAL PLANNING AND INFERENCE   104 ( 2 )   459 - 468   2002.6

Notes on equitable round-robin tournaments Reviewed

R Miyashiro, T Matsui

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E85A ( 5 )   1006 - 1010   2002.5

A linear relaxation for hub network design problems Reviewed

H Saito, S Matuura, T Matsui

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E85A ( 5 )   1000 - 1005   2002.5

Characterizing feasible pattern sets with a minimum number of breaks Reviewed

Miyashiro Ryuhei, Iwasaki Hideya, Matsui Tomomi

Practice and Theory of Automated Timetabling IV   78 - 99   2002

Modified Banzhaf index for voting games Reviewed

Endo Riyo, Ano Katsunori, Matsui Tomomi

Game Theory and Applications   8   29 - 29   2002

NP-completeness for calculating power indices of weighted majority games Reviewed

Y Matsui, T Matsui

THEORETICAL COMPUTER SCIENCE   263 ( 1-2 )   305 - 310   2001.7

Sealed bid multi-object auctions with necessary bundles and its application to spectrum auctions Reviewed

Matsui Tomomi, Watanabe Takahiro

Intelligent Agents: Specification, Modeling, and Applications   2132   78 - 92   2001

0.935-approximation randomized algorithm for MAX 2SAT and its derandomization Reviewed

Matuura Shiro, Matsui Tomomi

PRI (t) [ Cp⎪ F t C⎪ Cp C⎪ F t ]/ 1 C⎪ F t 2 1 C⎪ Cp 2 1/2 where A B indicates the simple correlation coefficient between A and B. Intuitively, PRI (t) represents www. sciencemag. org SCIENCE VOL 291 26 JANUARY 2001 663 the corr   2001 ( 115 )   69 - 76   2001

0.863-approximation algorithm for MAX DICUT Reviewed

S Matuura, T Matsui

APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES   2129   138 - 146   2001

Linear Relaxation for Hub Network Design Problems

SAITO Hiro-o, MATUURA Shiro, MATSUI Tomomi

日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集   2001   34 - 35   2001

Integer Programming Based Algorithms for Peg Solitaire Problems (Algorithm Engineering as a New Paradigm) Reviewed

Kiyomi Masashi, Matsui Tomomi

RIMS Kokyuroku   1185   100 - 108   2001

Digital Halftoning: Its Computational Complexity and Approximation Algorithms Based on Network Flow Reviewed

ASANO Tetsuo, FUJIKAWA Naoki, KATOH Naoki, Matsui Tomomi, NAGAMOCHI Hiroshi, OBOKATA Koji, TOKUYAMA Takeshi

Proceedings of the 6th KOREA-JAPAN Joint Workshop on Algorithms and Computation   21 - 28   2001

Digital Halftoning: Formulation as a Combinatorial Optimization Problem and Approximation Algorithms Based on Network Flow (Algorithm Engineering as a New Paradigm) Reviewed

Asano Tetsuo, Fujikawa Naoki, Katoh Naoki, Matsui Tomomi, Nagamochi Hiroshi, Tokuyama Takeshi, Usui Nobuaki

RIMS Kokyuroku   1185   18 - 27   2001

Note on Equitable Round-Robin Tournaments

Miyashiro Ryuhei, Matsui Tomomi

日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集   2001   268 - 269   2001

Linear relaxation for hub location problems Reviewed

Saito Hiroo, Matuura Shiro, Matsui Tomomi

Proceedings of the 6th KOREA-JAPAN Joint Workshop on Algorithms and Computation   15 - 20   2001

スポーツスケジューリング問題

宮代 隆平, 松井 知己

統計数理研究所共同研究リポート   125   275 - 289   2000.2

Approximation algorithms for maximum independent set problems and fractional coloring problems on unit disk graphs Reviewed

Matsui T

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   1763   194 - 200   2000

A survey of algorithms for calculating power indices of weighted majority games Reviewed

Matsui Tomomi, Matsui Yasuko

Journal of the Operations Research Society of Japan   43 ( 1 )   71 - 86   2000

A note on asymmetric power index for voting games Reviewed

MATSUI Tomomi, UEHARA Yoshikata

日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集   2000   42 - 43   2000

Optimal roundings of sequences and matrices Reviewed

Asano Tetsuo, Matsui Tomomi, Tokuyama Takeshi

Nordic Journal of Computing   7 ( 3 )   241 - 256   2000

On the complexities of the optimal rounding problems of sequences and matrices Reviewed

T Asano, T Matsui, T Tokuyama

ALGORITHM THEORY - SWAT 2000   1851   476 - 489   2000

Integer programming based algorithms for peg solitaire problems Reviewed

Kiyomi Masashi, Matsui Tomomi

Computers and Games   229 - 240   2000

A SURVEY OF ALGORITHMS FOR CALCULATING POWER INDICES OF WEIGHTED MAJORITY GAMES Reviewed

Tomomi Matsui, Yasuko Matsui

Journal of the Operations Research Society of Japan   43 ( 1 )   71 - 86   2000

Repairing a Flaw in Contour Maps Reviewed

Matsui Tomomi

Proceedings of the Third KOREA-JAPAN Joint Workshop on Algorithms and Computation   80 - 83   1999

A fast bipartite network flow algorithm for selective assembly Reviewed

S Iwata, T Matsui, ST McCormick

OPERATIONS RESEARCH LETTERS   22 ( 4-5 )   137 - 143   1998.5

A note on the nucleolus of assignment games Reviewed

Matsui Tomomi

Proceedings of the International Conference on Nonlinear Analysis and Convex Analysis   253 - 260   1998

Approximation algorithms for maximum independent set problems and fractional coloring problems on unit disk graphs Reviewed

Matsui Tomomi

Discrete and Computational Geometry   194 - 200   1998

A note on mixed level supersaturated designs

MATSUI Tomomi

日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集   1998   148 - 149   1998

A flexible algorithm for generating all the spanning trees in undirected graphs Reviewed

T Matsui

ALGORITHMICA   18 ( 4 )   530 - 543   1997.8

NP-hardness of linear multiplicative programming and related problems Reviewed

T Matsui

JOURNAL OF GLOBAL OPTIMIZATION   9 ( 2 )   113 - 119   1996.9

NP-hardness of linear multiplicative programming and related problems Reviewed

T. Matsui

Journal of Global Optimization   9 ( 2 )   113 - 119   1996.9

Is a given flow uncontrollable? Reviewed

T Matsui

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E79A ( 4 )   448 - 451   1996.4

Enumeration algorithm for the edge coloring problem on bipartite graphs Reviewed

Matsui Yasuko, Matsui Tomomi

Combinatorics and Computer Science   1120   18 - 26   1996

Finding All Maximal Common Independent Sets of Matroids Reviewed

MATSUI Yasuko, Matsui Tomomi

Proceedings of Korea-Japan Joint Workshop on Algorithms and Computation   54 - 58   1996

The minimum spanning tree problem on a planar graph Reviewed

Tomomi Matsui

Discrete Applied Mathematics   58 ( 1 )   91 - 94   1995.3

AN ALGORITHM FOR FRACTIONAL ASSIGNMENT PROBLEMS Reviewed

M SHIGENO, Y SARUWATARI, T MATSUI

DISCRETE APPLIED MATHEMATICS   56 ( 2-3 )   333 - 343   1995.1

NP-completeness of non-adjacency relations on some 0-1-polytopes Reviewed

Matsui Tomomi

Lecture Notes in Operations Research   1   249 - 258   1995

Finding All the st Paths in Acyclic Graphs Reviewed

MATSUI Yasuko, Matsui Tomomi, Unoi Takeaki

Lecture Notes in Operations Research 1 (ISBN 7-5062-2767-3)   259 - 266   1995

The minimum spanning tree problem on a planar graph Reviewed

Matsui Tomomi

Discrete Applied Mathematics   58 ( 1 )   91 - 94   1995

ALGORITHMS FOR FINDING A KTH BEST VALUED ASSIGNMENT Reviewed

T MATSUI, A TAMURA, Y IKEBE

DISCRETE APPLIED MATHEMATICS   50 ( 3 )   283 - 296   1994.5

FINDING ALL THE PERFECT MATCHINGS IN BIPARTITE GRAPHS Reviewed

K FUKUDA, T MATSUI

APPLIED MATHEMATICS LETTERS   7 ( 1 )   15 - 18   1994.1

An inefficiency measurement method for management systems

Yamada, Yoshiyasu, Matsui, Tomomi, Sugiyama, Manabu

Journal of Operations Research Society of Japan   37 ( 2 )   158 - 168   1994

ADJACENCY OF THE BEST AND 2ND BEST VALUED SOLUTIONS IN COMBINATORIAL OPTIMIZATION PROBLEMS Reviewed

Y IKEBE, T MATSUI, A TAMURA

DISCRETE APPLIED MATHEMATICS   47 ( 3 )   227 - 232   1993.12

A NOTE ON K-BEST SOLUTIONS TO THE CHINESE POSTMAN PROBLEM Reviewed

Yasufumi Saruwatari, Tomomi Matsui

SIAM JOURNAL ON OPTIMIZATION   3 ( 4 )   726 - 733   1993.11

An algorithm for finding all the spanning trees in undirected graphs Reviewed

Matsui Tomomi

METR93-08, Department of Mathematical Engineering and Information Physics, Faculty of Engineering, University of Tokyo   16   237 - 252   1993

藤重悟編, 離散構造とアルゴリズムI, II, 近代科学社

松井 知己

応用数理   3 ( 3 )   254 - 255   1993

FINDING ALL MINIMUM-COST PERFECT MATCHINGS IN BIPARTITE GRAPHS Reviewed

K FUKUDA, T MATSUI

NETWORKS   22 ( 5 )   461 - 468   1992.8

An analysis of Dinkelbach's algorithm for 0-1 fractional programming problems Reviewed

Matsui Tomomi, Saruwatari Yasufumi, Shigeno Maiko

1992

Combinatorial Aspects of Some Linear Programming Problems

Matsui, Tomomi

Combinatorial Aspects of Some Linear Programming Problems   1992

A linear time algorithm for the Hitchcock transportation problem with fixed number of supply points

Matsui Tomomi

Unpublished manuscript   1991   256 - 257   1992

ON THE FINITENESS OF THE CRISSCROSS METHOD Reviewed

K FUKUDA, T MATSUI

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH   52 ( 1 )   119 - 124   1991.5

Parametric simplex algorithms for solving a special class of nonconvex minimization problems Reviewed

Hiroshi Konno, Yasutoshi Yajima, Tomomi Matsui

Journal of Global Optimization   1 ( 1 )   65 - 81   1991.3

Elementary inductive proofs for linear programming

Fukuda Komei, Matsui T

RIMS Kokyuroku   680   117 - 126   1989

アルゴリズム工学，2.5節「数理計画 」, 6.10節「スポーツのスケジューリング」, 6.15節「真円度問題とその解法 」.

共立出版  2001.6 

組合せ最適化［短編集］

朝倉書店  1999.1 

離散構造とアルゴリズムIV，第４章「０－１多面体における端点の隣接性」

近代科学社  1995.10 

Pseudo Polynomial Size LP Formulation for Calculating the Least Core Value of Weighted Voting Games

Masato Tanaka, Tomomi Matsui

Mathematical Social Sciences   115   47 - 51   2021.1

Mixed integer quadratic optimization formulations for eliminating multicollinearity based on variance inflation factor

Ryuta Tamura, Ken Kobayashi, Yuichi Takano, Ryuhei Miyashiro, Kazuhide Nakata, Tomomi Matsui

Journal of Global Optimization   73 ( 2 )   431 - 446   2019.2

処理速度可変な並列機械でのスケジューリングにおける終了時間とエネルギー量の和の最小化

藤森友誠, 河瀬康志, 松井知己, 塩浦昭義

電子情報通信学会技術研究報告   119 ( 314(MSS2019 23-40) )   2019

処理速度可変な並列機械での総終了時間とエネルギー量の和の最小化スケジューリング問題に対する高速解法

藤森友誠, 河瀬康志, 松井知己, 塩浦昭義

日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集   2019   2019

Characterizing delaunay graphs via fixed point theorem: a simple proof

Tomomi Matsui, Yuichiro Miyamoto

Journal of the Operations Research Society of Japan   61 ( 1 )   151 - 162   2018.1

A doubly nonnegative relaxation for modularity density maximization

Yoichi Izunaga, Tomomi Matsui, Yoshitsugu Yamamoto

Discrete Applied Mathematics   275   69 - 78   2018.1

Best subset selection for eliminating multicollinearity

Ryuta Tamura, Ken Kobayashi, Yuichi Takano, Ryuhei Miyashiro, Kazuhide Nakata, Tomomi Matsui

Journal of the Operations Research Society of Japan   60 ( 3 )   321 - 336   2017.7

COMPARE THE RATIO OF SYMMETRIC POLYNOMIALS OF ODDS TO ONE AND STOP

Tomomi Matsui, Katsunori Ano

JOURNAL OF APPLIED PROBABILITY   54 ( 1 )   12 - 22   2017.3

Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems

Yuko Kuroki, Tomomi Matsui

WALCOM: ALGORITHMS AND COMPUTATION, WALCOM 2017   10167   397 - 408   2017

モジュラリティ最大化に対する加法的近似解法

河瀬康志, 松井知己, 宮内敦史

電子情報通信学会大会講演論文集(CD-ROM)   2017   2017

Additive approximation algorithms for modularity maximization

Yasushi Kawase, Tomomi Matsui, Atsushi Miyauchi

Leibniz International Proceedings in Informatics, LIPIcs   64   43.1 - 43.13   2016.12

Lower Bounds for Bruss' Odds Problem with Multiple Stoppings

Tomomi Matsui, Katsunori Ano

MATHEMATICS OF OPERATIONS RESEARCH   41 ( 2 )   700 - 714   2016.5

Yield-aware mask assignment by positive semidefinite relaxation in triple patterning using cut process

Yukihide Kohira, Chikaaki Kodama, Tomomi Matsui, Atsushi Takahashi, Shigeki Nojima, Satoshi Tanaka

JOURNAL OF MICRO-NANOLITHOGRAPHY MEMS AND MOEMS   15 ( 2 )   2016.4

A-6-12 A correction term for positive semidefinite relaxation of MPL layout decomposition

Handa Shohei, Takahashi Atsushi, Nakata Kazuhide, Matsui Tomomi

Proceedings of the IEICE Engineering Sciences Society/NOLTA Society Conference   2016   86 - 86   2016.3

A linear time algorithm for the unbalanced Hitchcock transportation problem

Tomomi Matsui, Rudolf Scheifele

NETWORKS   67 ( 2 )   170 - 182   2016.3

Manufacturability-aware Mask Assignment in Multiple Patterning Lithography

Yukihide Kohira, Atsushi Takahashi, Tomomi Matsui, Chikaaki Kodama, Shigeki Nojima, Satoshi Tanaka

2016 IEEE ASIA PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS (APCCAS)   538 - 541   2016

船舶の航行速度最適化問題の解法

昆野修平, 河瀬康志, 松井知己

日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集   2016   2016

モジュラリティ最大化に対する加法的近似解法

河瀬康志, 松井知己, 宮内敦史

日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集   2016   2016

Newtonの不等式を用いたオッズ問題の解析 (特集 最適停止とその応用)

松井 知己, 穴太 克則

オペレーションズ・リサーチ   60 ( 3 )   132 - 137   2015.3

0.863-approximation algorithm for MAX DICUT

Shiro Matuura, Tomomi Matsui

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   2129   138 - 146   2015.1

Fast Mask Assignment using Positive Semidefinite Relaxation in LELECUT Triple Patterning Lithography

Yukihide Kohira, Tomomi Matsui, Yoko Yokoyama, Chikaaki Kodama, Atsushi Takahashi, Shigeki Nojima, Satoshi Tanaka

2015 20TH ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE (ASP-DAC)   665 - 670   2015

Fractional programming formulation for the vertex coloring problem

Tomomi Matsui, Noriyoshi Sukegawa, Atsushi Miyauchi

INFORMATION PROCESSING LETTERS   114 ( 12 )   706 - 709   2014.12

A 2.75-approximation algorithm for the unconstrained traveling tournament problem

Shinji Imahori, Tomomi Matsui, Ryuhei Miyashiro

ANNALS OF OPERATIONS RESEARCH   218 ( 1 )   237 - 247   2014.7

LELECUT Triple Patterning Lithography Layout Decomposition using Positive Semidefinite Relaxation

KOHIRA Yukihide, MATSUI Tomomi, YOKOYAMA Yoko, KODAMA Chikaaki, TAKAHASHI Atsushi, NOJIMA Shigeki, TANAKA Satoshi

Technical report of IEICE. VLD   114 ( 59 )   27 - 32   2014.5

Multiple Patterning Lithography by Positive Semidefinite Relaxation

Matsui Tomomi

Technical report of IEICE. VLD   114 ( 59 )   19 - 19   2014.5

LELECUT Triple Patterning Lithography Layout Decomposition using Positive Semidefinite Relaxation

Yukihide Kohira, Tomomi Matsui, Yoko Yokoyama, Chikaaki Kodama, Atsushi Takahashi, Shigeki Nojima, Satoshi Tanaka

2014 ( 6 )   1 - 6   2014.5

Multiple Patterning Lithography by Positive Semidefinite Relaxation

Tomomi Matsui

2014 ( 4 )   1 - 1   2014.5

1-G-9 分数計画による頂点彩色問題の定式化(離散最適化(2))

松井 知己, [スケ]川 矩義, 宮内 敦史

日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集   2014   130 - 131   2014.3

Local Pattern Modification Method for Lithographical ECO in Double Patterning

MIYABE Yutaro, TAKAHASHI Atsushi, MATSUI Tomomi, KOHIRA Yukihide, YOKOYAMA Yoko

Technical report of IEICE. VLD   113 ( 454 )   87 - 92   2014.3

A note on a lower bound for the multiplicative odds theorem of optimal stopping

Tomomi Matsui, Katsunori Ano

Journal of Applied Probability   51 ( 3 )   885 - 889   2014.1

安定マッチング問題の応用 : 嘘をつく人々 (特集 グラフ理論の新展開)

松井 知己

数学セミナー   53 ( 1 )   39 - 43   2014.1

Positive Semidefinite Relaxation and Approximation Algorithm for Triple Patterning Lithography

Tomomi Matsui, Yukihide Kohira, Chikaaki Kodama, Atsushi Takahashi

ALGORITHMS AND COMPUTATION, ISAAC 2014   8889   365 - 375   2014

NP-completeness of arithmetical restorations

Tomomi Matsui

Journal of Information Processing   21 ( 3 )   402 - 404   2013

Characterizing delaunay graphs via fixed point theorem

Tomomi Matsui, Yuichiro Miyamoto

Proceedings of the 24th Canadian Conference on Computational Geometry, CCCG 2012   241 - 246   2012.12

2-C-3 不動点定理によるドロネー性の確認(離散最適化(2))

松井 知己, 宮本 裕一郎

日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集   2012   182 - 183   2012.9

ON THE NUMBER OF SOLUTIONS GENERATED BY DANTZIG'S SIMPLEX METHOD FOR LP WITH BOUNDED VARIABLES

Tomonari Kitahara, Tomomi Matsui, Shinji Mizuno

PACIFIC JOURNAL OF OPTIMIZATION   8 ( 3 )   447 - 455   2012.7

An approximation algorithm for the traveling tournament problem

Ryuhei Miyashiro, Tomomi Matsui, Shinji Imahori

ANNALS OF OPERATIONS RESEARCH   194 ( 1 )   317 - 324   2012.4

Approximation algorithms for data association problem arising from multitarget tracking

Naoyuki Kamiyama, Tomomi Matsui

Conferences in Research and Practice in Information Technology Series   119   137 - 143   2011.12

An Improved Approximation Algorithm for the Traveling Tournament Problem

Daisuke Yamaguchi, Shinji Imahori, Ryuhei Miyashiro, Tomomi Matsui

ALGORITHMICA   61 ( 4 )   1077 - 1091   2011.12

Algorithmic Aspects of Equilibria of Stable Marriage Model with Complete Preference Lists

Tomomi Matsui

Operations Research Proceedings 2010, Selected Papers of the Annual International Conference of the German Operations Research Society   47--52   2011.7

Algorithmic Aspects of Equilibria of Stable Marriage Model with Complete Preference Lists

Tomomi Matsui

Operations Research Proceedings 2010, Selected Papers of the Annual International Conference of the German Operations Research Society   47--52   2011.7

数理ゲームの必勝法とイカサマの技(パズルとゲームの計算理論)

松井 知己

シンポジウム   ( 65 )   1 - 6   2011.3

Improved Approximation Algorithms for Firefighter Problem on Trees

Yutaka Iwaikawa, Naoyuki Kamiyama, Tomomi Matsui

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS   E94D ( 2 )   196 - 199   2011.2

Improved Approximation Algorithms for Firefighter Problem on Trees

Yutaka IWAIKAWA, Naoyuki KAMIYAMA, Tomomi MATSUI

IEICE TRANSACTIONS on Information and Systems   Vol. 94 ( No. 2 )   196 - 199   2011.2

Improved Approximation Algorithms for Firefighter Problem on Trees

Yutaka Iwaikawa, Naoyuki Kamiyama, Tomomi Matsui

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS   E94D ( 2 )   196 - 199   2011.2

Approximation Algorithms for Data Association Problem Arising from Multitarget Tracking

Naoyuki Kamiyama, Tomomi Matsui

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)   119   137 - 144   2011.1

Approximation Algorithms for Data Association Problem Arising from Multitarget Tracking

Naoyuki Kamiyama, Tomomi Matsui

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)   137 - 144   2011.1

Algorithm for Single Allocation Problem on Hub-and-Spoke Networks in 2-Dimensional Plane

Ryuta Ando, Tomomi Matsui

ALGORITHMS AND COMPUTATION   7074   474 - 483   2011

3C2 INVERSE ASSIGNMENT PROBLEM FOR TIMETABLING IN TUTORING SCHOOL(Technical session 3C: OS2: Timetabling and assignment problems(2)) :

Hidaka Takuro, Matsui Tomomi

Proceedings of International Symposium on Scheduling   2011   145 - 148   2011

An approximation algorithm for the unconstrained traveling tournament problem

Shinji Imahori, Tomomi Matsui, Ryuhei Miyashiro

PATAT 2010 - Proceedings of the 8th International Conference on the Practice and Theory of Automated Timetabling   508 - 512   2010.12

Cheating Strategies for the Gale-Shapley Algorithm with Complete Preference Lists

Hirotatsu Kobayashi, Tomomi Matsui

ALGORITHMICA   58 ( 1 )   151 - 169   2010.9

An Approximation Algorithm for the Unconstrained Traveling Tournament Problem

Shinji Imahori, Tomomi Matsui, Ryuhei Miyashiro

Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC 2009), LNCS 5878   508 - 512   2010.8

統計的機械翻訳におけるフレーズ対応最適化を利用したN-best翻訳候補のリランキング

越川満, 内山将夫, 梅谷俊治, 松井知己, 山本幹雄

情報処理学会論文誌   51 ( 8 )   1443 - 1451   2010.8

An Approximation Algorithm for the Unconstrained Traveling Tournament Problem

Shinji Imahori, Tomomi Matsui, Ryuhei Miyashiro

Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC 2009), LNCS 5878   508 - 512   2010.8

スポーツスケジューリング

宮代 隆平, 松井 知己, 今堀 慎治

数学セミナー   49 ( 7 )   60 - 64   2010.7

Polynomial time approximate or perfect samplers for discretized Dirichlet distribution

Tomomi Matsui, Mitsuo Motoki, Naoyuki Kamatani, Shuji Kijima

JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS   27 ( 1 )   91 - 123   2010.6

古典的オーヴァーハングパズルをLP で解く

松井知己

オペレーションズ・リサーチ   55 ( 1 )   45--47 - 47   2010.1

Cheating Strategies for the Gale-Shapley Algorithm with Complete Preference Lists

KOBAYASHI HIROTATSU, MATSUI TOMOMI

2009 ( 6 )   1 - 8   2009.7

A note on generalized rank aggregation

Hadas Shachnai, Lisa Zhang, Tomomi Matsui

INFORMATION PROCESSING LETTERS   109 ( 13 )   647 - 651   2009.6

新入生のための数学ブートキャンプ 後編

松井知己

数学セミナー   48 ( 5 )   42 - 47   2009.5

Perfectness and imperfectness of unit disk graphs on triangular lattice points

Y. Miyamoto, T. Matsui

DISCRETE MATHEMATICS   309 ( 9 )   2733 - 2744   2009.5

Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems

Masaru Iwasa, Hiroo Saito, Tomomi Matsui

DISCRETE APPLIED MATHEMATICS   157 ( 9 )   2078 - 2088   2009.5

An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors

Yusuke Kuroki, Tomomi Matsui

DISCRETE APPLIED MATHEMATICS   157 ( 9 )   2124 - 2135   2009.5

新入生のための数学ブートキャンプ 前編

松井知己

数学セミナー   48 ( 4 )   50 - 55   2009.4

Successful Manipulation in Stable Marriage Model with Complete Preference Lists

Hirotatsu Kobayashi, Tomomi Matsui

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS   E92D ( 2 )   116 - 119   2009.2

A study of the quadratic semi-assignment polytope

Hiroo Saito, Tetsuya Fujie, Tomomi Matsui, Shiro Matuura

DISCRETE OPTIMIZATION   6 ( 1 )   37 - 50   2009.2

An Improved Approximation Algorithm for the Traveling Tournament Problem

Daisuke Yamaguchi, Shinji Imahori, Ryuhei Miyashiro, Tomomi Matsui

ALGORITHMS AND COMPUTATION, PROCEEDINGS   5878   679 - +   2009

解けないパズルをLP で解く ―ペグソリティアとパゴダ関数と線形計画－

松井知己

オペレーションズ・リサーチ   53 ( 11 )   643 - 648   2008.11

Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers

Shuji Kijima, Tomomi Matsui

ANNALS OF OPERATIONS RESEARCH   162 ( 1 )   35 - 55   2008.9

Exact algorithms for the master ring problem

Hadas Shachnai, Lisa Zhang, Tomomi Matsui

NETWORKS   52 ( 2 )   98 - 107   2008.9

フルートの運指最適化と逆最適化を用いたパラメータチューニング

澤井賢一, 黒木裕介, 松井知己

オペレーションズ・リサーチ   53 ( 1 )   39 - 46   2008.1

Polynomial time perfect sampler for discretized Dirichlet distribution

Tomomi Matsui, Shuji Kijima

GRAMMAR OF TECHNOLOGY DEVELOPMENT   179 - 199   2008

APPROXIMATION ALGORITHM AND PERFECT SAMPLER FOR CLOSED JACKSON NETWORKS WITH SINGLE SERVERS

S. Kijima, T. Matsui

SIAM JOURNAL ON COMPUTING   38 ( 4 )   1484 - 1503   2008

Constructive Algorithms for the Constant Distance Traveling Tournament Problem

Nobutomo Fujiwara, Shinji Imahori, Tomomi Matsui, Ryuhei Miyashiro

Lecture Notes in Computer Science   135 - 146   2007.12

Dependent Rounding Technique (従属丸め技法) : 最小カット問題の整数性

松井 知己

オペレーションズ・リサーチ : 経営の科学 = [O]perations research as a management science [r]esearch   52 ( 9 )   519 - 521   2007.9

クラス編成問題 素敵な出会いを演出します

松井知己

数学セミナー   550 ( 7 )   39 - 43   2007.7

マルコフ連鎖の完璧シミュレーション

松井知己, 来嶋秀治

シミュレーション   26 ( 2 )   101 - 106   2007.6

The home-away assignment problems and break minimization/maximization problems in sports scheduling

Ayami Suzuka, Ryuhei Miyashiro, Akiko Yoshise, Tomomi Matsui

Pacific Journal of Optimization   113 - 133   2007.1

The home-away assignment problems and break minimization/maximization problems in sports scheduling

Ayami Suzuka, Ryuhei Miyashiro, Akiko Yoshise, Tomomi Matsui

Pacific Journal of Optimization   3 ( 1 )   113 - 133   2007.1

Constructive algorithms for the constant distance traveling tournament problem

Nobutomo Fujiwara, Shinji Imahori, Tomomi Matsui, Ryuhei Miyashiro

PRACTICE AND THEORY OF AUTOMATED TIMETABLING VI   3867   135 - +   2007

Modeling and Optimization of Flute Fingerings

SAWAI Ken'ichi, KUROKI Yusuke, MATSUI Tomomi, AIHARA Kazuyuki

IPSJ SIG Notes   2006 ( 133 )   13 - 18   2006.12

Constructive algorithms for the constant distance traveling tournament problem

Nobutomo Fujiwara, Shinji Imahori, Tomomi Matsui, Ryuhei Miyashiro

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   3867 LNCS   135 - 146   2006.12

Approximation Algorithms for the Single Allocation Problem in Hub-and-Spoke Networks

Masaru Iwasa, Hiroo Saito, Tomomi Matsui

Electronic Notes in Discrete Mathematics   27   51 - 52   2006.10

Randomized Approximation Algorithm for a Geometrical Multidimensional Assignment Problem

Yusuke Kuroki, Tomomi Matsui

Electronic Notes in Discrete Mathematics   27   63 - 64   2006.10

1-C-9 フルートの運指のモデル化とその最適化に関する研究(離散最適化(2))

澤井 賢一, 黒木 裕介, 松井 知己

日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集   2006   68 - 69   2006.9

ここまで解ける整数計画

宮代 隆平, 松井 知己

システム/情報/制御   50 ( 9 )   363 - 368   2006.9

Algorithms for computing geometric measures of melodic similarity

Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Yurai Nuñez, David Rappaport, Godfried Toussaint

Computer Music Journal   30 ( 3 )   67 - 76   2006.9

Polynomial time perfect sampling algorithm for two-rowed contingency tables

Shuji Kijima, Tomomi Matsui

RANDOM STRUCTURES & ALGORITHMS   29 ( 2 )   243 - 256   2006.9

Semidefinite programming based approaches to the break minimization problem

R Miyashiro, T Matsui

COMPUTERS & OPERATIONS RESEARCH   33 ( 7 )   1975 - 1982   2006.7

Dependent randomized rounding to the home-away assignment problem in sports scheduling

Ayami Suzuka, Ryuhei Miyashiro, Akiko Yoshise, Tomomi Matsui

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E89A ( 5 )   1407 - 1416   2006.5

1-A-3 対戦日程計画におけるCarry-Over Effect最小化問題(離散最適化(1))

宮代 隆平, 松井 知己

日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集   2006   14 - 15   2006.3

DS-1-3 MCMC METHOD FOR CLOSED JACKSON NETWORKS

Kijima Shuji, Matsui Tomomi

Proceedings of the IEICE General Conference   2006 ( 1 )   "S - 13"-"S-14"   2006.3

スーパーコンピューティングコンテスト2005

松井知己

数学セミナー   45 ( 1 )   58 - 61   2006.1

A general construction method for mixed-level supersaturated design

S Yamada, M Matsui, T Matsui, DKJ Lin, T Takahashi

COMPUTATIONAL STATISTICS & DATA ANALYSIS   50 ( 1 )   254 - 265   2006.1

Approximation algorithms for minimum span channel assignment problems

Yuichiro Miyamoto, Tomomi Matsui

ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, PROCEEDINGS   4041   334 - 342   2006

Perfectness and imperfectness of the kth power of lattice graphs

Yuichiro Miyamoto, Tomomi Matsui

Lecture Notes in Computer Science   3521   233 - 242   2005.9

1-D-13 Sampling from Logarithmic Separable Concave Distribution on Simplex

KIJIMA Shuji, MATSUI Tomomi

2005   106 - 107   2005.9

離散化Dirichlet分布に従うパーフェクトサンプリング(セッション4, 日本計算機統計学会第18回大会報告)

松井 知己, 来嶋 秀治

計算機統計学   17 ( 2 )   162 - 162   2005.8

Polynomial Time Perfect Sampler for Closed Jackson Networks with Single Servers

Shuji KIJIMA, Tomomi MATSUI

Lecture Notes in Operations Research   227 - 240   2005.8

Polynomial Time Perfect Sampler for Closed Jackson Networks with Single Servers

Shuji KIJIMA, Tomomi MATSUI

Lecture Notes in Operations Research   ( 5 )   227 - 240   2005.8

Perfectness and Imperfectness of the kth Power of Lattice Graphs

Yuichiro MIYAMOTO, Tomomi MATSUI

Lecture Notes in Computer Science   233 - 242   2005.6

Semidefinite Programming Based Approaches to Home-away Assignment Problems in Sports Scheduling

Ayami SUZUKA, Ryuhei MIYASHIRO, Akiko YOSHISE, Tomomi MATSUI

Lecture Notes in Computer Science   95 - 103   2005.6

Semidefinite Programming Based Approaches to Home-away Assignment Problems in Sports Scheduling

Ayami SUZUKA, Ryuhei MIYASHIRO, Akiko YOSHISE, Tomomi MATSUI

Lecture Notes in Computer Science   ( 3521 )   95 - 103   2005.6

Rapidly Mixing Chain and Perfect Sampler for Logarithmic Separable Concave Distributions on Simplex

Shuji KIJIMA, Tomomi MATSUI

Proceedings of the 2005 International Conference on the Analysis of Algorithms   AD   369 - 380   2005.6

Rapidly Mixing Chain and Perfect Sampler for Logarithmic Separable Concave Distributions on Simplex

Shuji KIJIMA, Tomomi MATSUI

Proceedings of the 2005 International Conference on the Analysis of Algorithms   369 - 380   2005.6

Perfectness and Imperfectness of the kth Power of Lattice Graphs

Yuichiro MIYAMOTO, Tomomi MATSUI

Lecture Notes in Computer Science   ( 3521 )   233 - 242   2005.6

完璧にサンプリングしよう！(3)

来嶋秀治, 松井知己

オペレーションズ・リサーチ   50 ( 5 )   329 - 334   2005.5

A polynomial-time algorithm to find an equitable home-away assignment

R Miyashiro, T Matsui

OPERATIONS RESEARCH LETTERS   33 ( 3 )   235 - 241   2005.5

完璧にサンプリングしよう! : 第二話 天と地の狭間で

来嶋 秀治, 松井 知己

オペレーションズ・リサーチ : 経営の科学 = [O]perations research as a management science [r]esearch   50 ( 4 )   264 - 269   2005.4

Perfectness and Multicoloring of Unit Disk Graphs on Triangular Lattice Points (Theoretical Computer Science and its Applications)

Miyamoto Yuichiro, Matsui Tomomi

RIMS Kokyuroku   1426   159 - 165   2005.4

完璧にサンプリングしよう！(2)

来嶋秀治, 松井知己

オペレーションズ・リサーチ   50 ( 4 )   264 - 269   2005.4

完璧にサンプリングしよう！(1)

来嶋秀治, 松井知己

オペレーションズ・リサーチ   50 ( 3 )   169 - 174   2005.3

スポーツスケジューリング―未解決問題を中心に―

宮代隆平, 松井知己

オペレーションズ・リサーチ   50 ( 2 )   119 - 124   2005.2

スポーツスケジューリング ―未解決問題を中心に―

宮代 隆平, 松井 知己

オペレーションズ・リサーチ   50 ( 2 )   10 - 14   2005.2

Multicoloring Unit Disk Graphs on Triangular Lattice Points

Yuichiro MIYAMOTO, Tomomi MATSUI

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms   895 - 896   2005.1

Multicoloring Unit Disk Graphs on Triangular Lattice Points

Yuichiro MIYAMOTO, Tomomi MATSUI

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms   895 - 896   2005.1

Multicoloring Unit Disk Graphs on Triangular Lattice Points

Yuichiro Miyamoto, Tomomi Matsui

PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS   895 - 896   2005

Approximate/perfect samplers for closed Jackson networks

S Kijima, T Matsui

PROCEEDINGS OF THE 2005 WINTER SIMULATION CONFERENCE, VOLS 1-4   2005   862 - 868   2005

Semidefinite programming based approaches to home-away assignment problems in sports scheduling

A Suzuka, R Miyashiro, A Yoshise, T Matsui

ALGORITHMIC APPLICATIONS IN MANAGEMENT, PROCEEDINGS   3521   95 - 103   2005

Efficient algorithms for the electric power transaction problem

M Kiyomi, T Uno, T Matsui

INTERNET AND NETWORK ECONOMICS, PROCEEDINGS   3828   602 - 611   2005

Perfect Sampler for Closed Jackson Networks

KIJIMA Shuji, MATSUI Tomomi

IEICE technical report. Theoretical foundations of Computing   104 ( 318 )   55 - 59   2004.10

Perfect Sampler for Closed Jackson Networks

KIJIMA Shuji, MATSUI Tomomi

IPSJ SIG Notes   2004 ( 101 )   55 - 59   2004.10

Random generation of 2x2x center dot center dot center dot x2xJ contingency tables

T Matsui, Y Matsui, Y Ono

THEORETICAL COMPUTER SCIENCE   326 ( 1-3 )   117 - 135   2004.10

電力取り引きにおける約定量決定問題の高速解法(組合せ最適化(5))

清見 礼, 宇野 毅明, 松井 知己

日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集   2004   220 - 221   2004.9

Polynomial Time Perfect Sampling Algorithm for Two-Rowed Contingency Tables

Shuji KIJIMA, Tomomi MATSUI

Mathematics and Computer Science III   175 - 186   2004.9

Polynomial Time Perfect Sampling Algorithm for Two-Rowed Contingency Tables

Shuji KIJIMA, Tomomi MATSUI

Mathematics and Computer Science III   175 - 186   2004.9

The Break Minimization Problem is Solvable in Polynomial Time When the Optimal Value is Less Than the Number of Teams

Ryuhei MIYASHIRO, Tomomi MATSUI

The 5th International Conference on the Practice and Theory of Automated Timetabling   535 - 538   2004.8

The Break Minimization Problem is Solvable in Polynomial Time When the Optimal Value is Less Than the Number of Teams

Ryuhei MIYASHIRO, Tomomi MATSUI

The 5th International Conference on the Practice and Theory of Automated Timetabling   535 - 538   2004.8

平衡状態を探す：マルコフ連鎖／CFTP

来嶋秀治, 松井知己

数学セミナー   43 ( 8 )   42 - 46   2004.8

Linear Time Approximation Algorithm for Multicoloring Lattice Graphs with Diagonals

MIYAMOTO Yuichiro, MATSUI Tomomi

IPSJ SIG Notes   2004 ( 34 )   35 - 40   2004.3

Weighted Lattice Graph with Diagonals に対するマルチカラーリングの線形時間近似解法(グラフ・ネットワーク)

宮本 裕一郎, 松井 知己

日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集   2004   4 - 5   2004.3

離散化Dirichlet分布に従うPerfect Sampler(マルコフモデル)

松井 知己, 来嶋 秀治

日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集   2004   192 - 193   2004.3

The Break Minimization Problem

MIYASHIRO Ryohei, MATSUI Tomomi

2004   176 - 177   2004.3

Approximate Counting Scheme for m×n Contingency Tables

KIJIMA Shuji, MATSUI Tomomi

IEICE transactions on information and systems   E87-D ( 2 )   308 - 314   2004.2

Approximate Counting Scheme for mxn Contingency Tables

Shuji KIJIMA, Tomomi MATSUI

IEICE Transactions on Information and Systems   308 - 314   2004.2

Linear time approximation algorithm for multicoloring lattice graphs with diagonals

Yuichiro Miyamoto, Tomomi Matsui

Journal of the Operations Research Society of Japan   47 ( 2 )   123 - 128   2004

A Cutting Plane Approach to Hub Network Design Problems

SAITO Hiroo, FUJIE Tetsuya, MATSUI Tomomi

2003   294 - 295   2003.9

2行分割表の多項式時間 Perfect Sampling

来嶋 秀治, 松井 知己

日本統計学会講演報告集   71   3 - 4   2003.9

Computing the Similarity of two Melodies

Greg Aloupis

Proceedings of 15th Canadian Conference on Computational Geometry   113 - 116   2003.8

Computing the Similarity of two Melodies

Greg Aloupis

Proceedings of 15th Canadian Conference on Computational Geometry   113 - 116   2003.8

オークションの設計理論とOR (2)

松井知己

オペレーションズ・リサーチ   48 ( 8 )   574 - 579   2003.8

A Rapidly Mixing Approximate Sampler of Dirichlet Distribution

Tomomi MATSUI, Mitsuo MOTOKI, Naoyuki, KAMATANI

Japan-Korea Joint Workshop on Algorithms and Computation   61 - 72   2003.7

Sampling Algorithm for Two-rowed Contingency Tables

Shuji KIJIMA, Tomomi MATSUI

Japan-Korea Joint Workshop on Algorithms and Computation   73 - 85   2003.7

オークションの設計理論とOR(1)

松井知己

オペレーションズ・リサーチ   48 ( 7 )   516 - 521   2003.7

Sampling Algorithm for Two-rowed Contingency Tables

Shuji KIJIMA, Tomomi MATSUI

Japan-Korea Joint Workshop on Algorithms and Computation   73 - 85   2003.7

Polyhedral Approach to the Hub Network Design Problem

Hiro-o SAITO, Tetsuya FUJIE, Tomomi MATSUI

Japan-Korea Joint Workshop on Algorithms and Computation   22 - 25   2003.7

A Rapidly Mixing Approximate Sampler of Dirichlet Distribution

Tomomi MATSUI, Mitsuo MOTOKI, Naoyuki, KAMATANI

Japan-Korea Joint Workshop on Algorithms and Computation   61 - 72   2003.7

Polyhedral Approach to the Hub Network Design Problem

Hiro-o SAITO, Tetsuya FUJIE, Tomomi MATSUI

Japan-Korea Joint Workshop on Algorithms and Computation   22 - 25   2003.7

New approximation algorithms for MAX 2SAT and MAX DICUT

S Matuura, T Matsui

JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN   46 ( 2 )   178 - 188   2003.6

Characterizing Feasible Pattern Sets with a Minimum Number of Breaks

Ryuhei MIYASHIRO, Hideya IWASAKI, Tomomi MATSUI

Lecture Notes in Computer Science   78 - 99   2003.5

2×n分割表のPerfect Sampling(マルコフ連鎖)

来嶋 秀治, 松井 知己

日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集   2003   78 - 79   2003.3

オークションの設計理論と数理計画

MATSUI TOMOMI, WATANABE TAKAHIRO

日本オペレーションズ・リサーチ学会シンポジウム   49th   7 - 12   2003.3

Polynomial time approximate sampler for discretized Dirichlet distribution

T Matsui, M Motoki, N Kamatani

ALGORITHMS AND COMPUTATION, PROCEEDINGS   2906 ( 2906 )   676 - 685   2003

A-2 2行分割表の多項式時間Perfect Sampling(コンペティション(1))(2003年度統計関連学会連合大会記録(日本統計学会第71回大会))

来嶋 秀治, 松井 知己

日本統計学会誌   33 ( 3 )   383 - 383   2003

Characterizing feasible pattern sets with a minimum number of breaks

R Miyashiro, H Iwasaki, T Matsui

PRACTICE AND THEORY OF AUTOMATED TIMETABLING IV   2740   78 - 99   2003