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.
To appear
-
Shuji Kijima and Tomomi Matsui,
``Approximation algorithm and perfect sampler for closed Jackson networks with single servers,''
(to appear in SICOMP).
-
Ryuhei Miyashiro, Tomomi Matsui, and Shinji Imahori,
``An Approximation Algorithm for the Traveling Tournament Problem,''
(to appear in Proceedings of PATAT 2008).
-
Yuichiro Miyamoto and Tomomi Matsui,
``Perfectness and imperfectness of unit disk graphs on triangular lattice points,''
(to appear in Discrete Mathematics).
-
Hirotatsu Kobayashi and Tomomi Matsui,
``Successful Manipulation in Stable Marriage Model with Complete Preference Lists,''
(to appear in IEICE).
pdf file of MATCH-UP version
-
Yusuke Kuroki and Tomomi Matsui,
`` An Approximation Algorithm for Multidimensional Assignment Problems Minimizing the Sum of Squared Errors,''
(to appear in Discrete Applied Mathematics).
-
Hadas Shachnai, Lisa Zhang, and Tomomi Matsui,
``Exact Algorithms for the Master Ring Problem,''
(to appear in Networks).
Refereed Papers in Journals and Books
-
$B_70f8-0l!$9uLZM52p!$>>0fCN8J(B,
$B!V%U%k!<%H$N1?;X:GE,2=$H5U:GE,2=$rMQ$$$?%Q%i%a!<%?%A%e!<%K%s%0!W(B,
$B%*%Z%l!<%7%g%s%:!&%j%5!<%A!$(Bvol. 53 (2008), no. 1, pp. 39--46. (Jan)
-
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)
-
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$B!-(Ba, 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
-
$B5\K\M50lO:!">>0fCN8J(B "$B%A%c%M%k3dEvLdBj$N2rK!(B",
$B>pJs=hM}3X2qO@J8;o(B, $B?tM}%b%G%k2=$H1~MQ(B, 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.)
-
$B5HEDBY;R!$>>0fCN8J!$(B"$B#2It%0%i%U$NJU:L?'$NNs5s2rK!(B"$B!$EE5$3X2q;o#CItLg;o!J(BT.IEE Japan$B!K(B, 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)
-
$B;3EDA1Lw!$>>0fCN8J!$?y;33X!$(B"$B#D#E#A%b%G%k$K4p$E$/?7$?$J7P1D8zN(@-J,@OK!$NDs0F(B"$B!$(BJournal 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.)
-
$B5\@n2mL&!$>>0fCN8J!$9bLnGn9T!$(B"$BNLH?1~%G!]%?$K4p$E$/FsJQNLF1;~J,I[$N%N%s%Q%i%a%H%j%C%/?dDj(B", $B1~MQE}7W3X(B, 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)
-
``Approximation algorithms for minimum span channel assignment problems,''
Yuichiro MIYAMOTO and Tomomi MATSUI,
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)
-
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)
-
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).
-
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)
-
$B!V%9%]!<%D%9%1%8%e!<%j%s%0$N6aG/$NE83+!W!"5\BeN4J?!">>0fCN8J!"(B
$B!VF|K\%9%]!<%D;:6H3X2q!!Bh(B15$B2sBg2q9f(B
--- $B%9%]!<%D$N%V%i%s%G%#%s%0$r9M$($k(B ---$B!W!"(B
$B#2#0#0#6G/#77n#2#2F|!A#2#3F|!"E7F2Bg3X!!K\6?%-%c%s%Q%9!"(Bpp. 39-40.
$B!J>>0fCN8J!K(B
-
``Randomized approximation scheme and perfect sampler for closed Jackson networks,''
Shuji Kijima and Tomomi Matsui,
Second Madrid Conference on Queueing Theory,
Complutense University of Madrid, Madrid, Spain, July 3-7, 2006. (4 July)
(Shuji Kijima)
-
``Minimizing the carry-over effects value in a round-robin tournament,''
Ryuhei Miyashiro, Tomomi Matsui,
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.
-
``Constructive algorithms for the constant distance traveling tournament problem,''
Nobutomo Fujiwara, Shinji Imahori, Tomomi Matsui, Ryuhei Miyashiro,
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.
-
``Approximation Algorithms for the Single Allocation Problem in Hub-and-Spoke Networks,''
Masaru Iwasa, Hiroo Saito, Tomomi Matsui,
Optimal Discrete Structures and Algorithms,
9/04-06, 2006, Universitaet Rostock, Rostock, Germany, p. 24.
(Masaru IWASA)
-
``Randomized Approximation Algorithm for a Geometrical Multidimensional Assignment Problem,''
Yusuke KUROKI, Tomomi Matsui,
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.
-
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,
Sheraton Station Square, Pittsburgh, PA, USA 8/18-20, pp. 535-538, 2004.
-
``A Rapidly Mixing Approximate Sampler of Dirichlet Distribution '',
T. Matsui, M. Motoki, N. Kamatani,
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.
-
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.
-
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)
-
``$BG3NA>CHq:o8:$N$?$a$N9R6uO)@~@_7W(B,'' $B4d:4Bg(B, $BsnF#W"Bg(B, $B>>0fCN8J(B,
$B%_%K%7%s%]%8%&%`!V?7@$Be7W;;8B3&$HCO5e4D6-LdBj!W(B,
$BEl5~Bg3XK\6?%-%c%s%Q%9(B, 2006$BG/(B12$B7n(B6$BF|(B, pp. 45--49.($B4d:4Bg(B)
pdf file ,
-
``CFTP $B$rMQ$$$?(B Perfect Sampling,'' $B!J%A%e!<%H%j%"%k9V1i!K(B
Randomness and Computation (RC2005),
Sendai International Center, Sendai, Japan, 18 - 21 July, 2005.
Lecture Notes in Tutorial Sessions (10 pages).
pdf file ,
-
$B>>0fCN8J(B, $BEOJUN4M5(B, $B!V%*!<%/%7%g%s$N@_7WM}O@$H?tM}7W2h!W(B, $BF|K\%*%Z%l!<%7%g%s%:!&%j%5!<%A3X2q(B $BBh(B49$B2s%7%s%]%8%&%`(B(2003$BG/(B3$B7n(B17$BF|(B),
$B7DXf5A=NBg3X(B $BLp>e%-%c%s%Q%9(B, p. 7--12,
pdf file ,
ps file ,
dvi file .
-
$B5\BeN4J?(B, $B>>0fCN8J(B, $B!V%9%]!<%D%9%1%8%e!<%j%s%0LdBj!W(B, $B:GE,2=!'%b%G%j%s%0$H%"%k%4%j%:%`(B13(1999$BG/(B3$B7n(B31$BF|(B), $BE}7W?tM}8&5f=j6&F18&5f%l%]!<%H(B125, pp. 275--189, 2000$BG/(B 2$B7n(B.
-
$B>>0fCN8J(B, $B>>0fBY;R(B,
$B!V=E$_IU$-B??t7h%2!<%`$K$*$1$kEjI dvi file ,
ps.Z file ,
$BBh#1#02s#R#A#M#P%7%s%]%8%&%`O@J8=8!$5~Bg2q4[!$#1#9#9#8G/#97n#2#4F|(B, 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)
-
$B>>0fCN8J(B,$B!V:G>.%N%k%`E@LdBj$H$=$N<~JU!W(B,
$BBh#52s#R#A#M#P%7%s%]%8%&%`O@J8=8!$C^GHBg3X(B, $B#1#9#9#3G/#1#07n#2#1F|(B, 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)
-
$B>>0fCN8J(B,$B!VAH9g$;:GE,2=!W(B, $B#1#9#9#2G/%*%Z%l!<%7%g%s%:!&%j%5!<%A3X2q=)5(8&5fH/I=2q(B, $B%A%e!<%H%j%"%k%;%C%7%g%s(B.
-
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.
-
$BJ!ED8xL@(B, $B>>0fCN8J(B,"Elementary Inductive Proofs for Linear Programming"$B!$!V5"GZL@!W(B, $B?tM}2r@O8&5f=j9V5fO?(B680$B!$7W2h?t3X$H$=$N4XO"J,Ln!$5~ETBg3X?tM}2r@O8&5f=j!$(B1989$BG/!%(B
$B2r@b5-;vEy(B $B!JFbMF$K$D$$$F$O(B
$B!V%Q%:%k$d$iJY6/$d$i!W(B
$B$b$4;2>H2<$5$$!#!K(B
- $B>>0fCN8J!$MhEh=(<#(B,
$B!V%^%k%3%UO":?$N40`z%7%_%e%l!<%7%g%s!W(B, $B%7%_%e%l!<%7%g%s(B,
vol. 26 (2007$BG/(B), no. 2 (6$B7n(B), pp. 101--106.
- $B5\Be(B $BN4J?!$>>0f(B $BCN8J!$!V$3$3$^$G2r$1$k@0?t7W2h!W(B,
$B%7%9%F%`(B/$B>pJs(B/$B@)8f!$(Bvol. 50 (2006), no. 9, pp. 363--368.
-
$B>>0fCN8J(B, $B!V%9!<%Q!<%3%s%T%e!<%F%#%s%0%3%s%F%9%H(B2005$B!W(B, $B?t3X%;%_%J!<(B, vol. 45, NO. 1, 2006$BG/(B1$B7n9f(B, pp. 58--61.
- $B5\Be(B $BN4J?!$>>0f(B $BCN8J!$(B
$B!V%9%]!<%D%9%1%8%e!<%j%s%0!=L$2r7hLdBj$rCf?4$K!=!W(B, $B%*%Z%l!<%7%g%s%:!&%j%5!<%A!$(Bvol. 50 (2005), no. 2, pp. 119--124.
- $BMhEh=(<#(B, $B>>0fCN8J(B,
$B!V40`z$K%5%s%W%j%s%0$7$h$&!*!W(B
$BBh0lOC!VMZ$+$J$k2a5n$+$i!W(B, $B%*%Z%l!<%7%g%s%:!&%j%5!<%A!$(Bvol. 50 (2005), no. 3, pp. 169--174.
$BBhFsOC!VE7$HCO$N694V$G!W(B, $B%*%Z%l!<%7%g%s%:!&%j%5!<%A!$(Bvol. 50 (2005), no. 4, pp. 264--269.
$BBh;0OC!V=*$j$"$kL$Mh!W(B, $B%*%Z%l!<%7%g%s%:!&%j%5!<%A!$(Bvol. 50 (2005), no. 5, pp. 329--334.
-
$BMhEh=(<#(B, $B>>0fCN8J(B, $B!VJ?9U>uBV$rC5$9!'%^%k%3%UO":?!?(BCFTP$B!W(B, $B?t3X%;%_%J!<(B, vol. 43, NO. 8, 2004$BG/(B8$B7n9f(B, pp. 42--46.
-
$B>>0fCN8J(B, $BEOJUN4M5(B, $B!V%*!<%/%7%g%s$N@_7WM}O@$H(BOR$B!W(B, $B%*%Z%l!<%7%g%s%:!&%j%5!<%A(B, (1), vol. 48, No. 7, 2003$BG/(B7$B7n9f(B, pp. 516--521; (2), vol. 48, No. 8, 2003$BG/(B8$B7n9f(B, pp. 574--579.
-
$B>>0fCN8J(B, $B!V#M#F@>M75-!W(B, $B?t3X%;%_%J!<(B, Vol. 40, N0. 11, 2001$BG/(B11$B7n9f(B, pp. 56--57. ($B!V:#7n$N#M#F!WM%=(:nIJ>^^(B)
-
$B>>0fCN8J(B, $B!V7HBSEEOC$O$I$&$7$F$D$J$,$k$N$+(B--$B7HBSEEOC%M%C%H%o!<%/$ND:E@:L?'LdBj!W(B, $B?t3X%;%_%J!<(B, Vol. 40, N0. 9, 2001$BG/(B9$B7n9f(B, pp. 56--59.
-
$B>>0fCN8J(B, $B!V7h$aJ}$r7h$a$kFq$+$7$5(B($B>e!&2<(B)$B!W(B, $B?t3X%;%_%J!<(B; $B>e(B, Vol. 40, N0. 2, 2001$BG/(B2$B7n9f(B, pp. 50--54;$B2<(B, Vol. 40, N0. 3, 2001$BG/(B3$B7n9f(B, pp. 52--55.
-
$B>>0fCN8J(B, $B!V(BArrow $B$N0lHL2DG=@-DjM}$N>ZL@$N2r@b!W(B, $B%*%Z%l!<%7%g%s%:!&%j%5!<%A(B, Vol. 46 (2001), pp. 93--97.
-
$B>>0fCN8J(B, $BJBLZ@?(B, $B!V(BFarkas $B$NJdBj$N=iEyE*>ZL@!W(B, $B%*%Z%l!<%7%g%s%:!&%j%5!<%A(B, Vol. 45 (2000), pp. 528--530.
-
$B>>0fCN8J(B, $B!VH>@5DjCM7W2h$rMQ$$$?:GBg%+%C%HLdBj$N(B.878$B6a;w2rK!!W(B, $B%*%Z%l!<%7%g%s%:!&%j%5!<%A(B, Vol. 45 (2000), pp. 140--145.
-
$B5\BeN4J?(B, $B>>0fCN8J(B, $B!V(B1993$BG/(BJ$B%j!<%0$N:F%9%1%8%e!<%j%s%0!W(B, $B%*%Z%l!<%7%g%s%:!&%j%5!<%A(B, Vol. 45 (2000), pp. 81--83.
-
$B>>0fCN8J(B, $B!VAjJd%9%i%C%/DjM}$+$iF~$C$F$_$?$i!W(B, $B%*%Z%l!<%7%g%s%:!&%j%5!<%A(B, Vol. 44 (1999), page 667.
-
$B>>0fCN8J(B, $B!V(B2$B!_(Bn $B7?AP9TNs%2!<%`$N(B Nash $B6Q9UE@$r5a$a$k?^2rK!!W(B, $B%*%Z%l!<%7%g%s%:!&%j%5!<%A(B, Vol. 44 (1999), pp. 665--666.
-
$B>>0fCN8J(B, $B!V%9%]!<%D$N%9%1%8%e!<%j%s%0!W(B, $B%*%Z%l!<%7%g%s%:!&%j%5!<%A(B, Vol. 44 (1999), pp. 141--146.
-
$B>>0fCN8J(B, $B>>0fBY;R(B, $B!V566b2_$rC5$=$&!W(B, $B%*%Z%l!<%7%g%s%:!&%j%5!<%A(B, Vol. 41 (1996), pp. 141--144.
-
$B>>0fCN8J(B, $B!VAH9g$;:GE,2=$K$*$1$k:G6a$NF08~$K$D$$$F!W(B, $BEE5$3X2qO@J8;o#BItLg;o(B, Vol. 114-B (1994), pp. 327--330.
$BLu=q(B
-
$B>>0fCN8J(B($B6&Lu(B), $B!V7P1D2J3X#O#RMQ8lBg;vE5!W(B, $B?9B<1QE5(B,$BEa:,70(B,$B0KM}@5IW(B, $B4FLu(B, $BD+AR=qE9(B, ISBN:4254121318, 1999$BG/(B1$B7n(B (726 P).
(Encyclopedia of Operations Research and Management Science,
Saul I. Gass (Editor), Carl M. Harris (Editor), 800 pages, Springer, ISBN 0792395905, May 31, 1996.)
-
$B>>0fCN8J(B, $B>>0fBY;RLu(B, $B!V%M%C%H%o!<%/%U%m!O(B, $B0KM}@5IW(B,$B:#Ln9@(B,$BEa:,70(B $B4FLu(B, $BD+AR=qE9(B, ISBN: 4254121024, 1995$BG/(B10$B7n(B (682 P).
(Handbooks in Operations Research and Management Science, 1: Optimization,
G. L. Nemhauser, A. H. G. Rinnooy Kan, M. J. Todd (Editors),
724 pages, Elsevier Science Pub. Co., ISBN: 0444872841, 1st reprint 1994 edition (August 1, 1989).
$BCx=q(B
- $BMhEh=(<#(B, $B>>0fCN8J(B, $B!V(BCFTP$B$rMQ$$$?%Q!<%U%'%/%H%5%s%W%j%s%0!W(B;
$B!V3NN(E*>pJs=hM}$HE}7WNO3X!W(B, $BNW;~JL:}!&?tM}2J3X(B SGC$B%i%$%V%i%j(B50, $B-7>O(B4$B@a(B, pp. 80--89, $BEDCfOBG7JTCx(B, $B%5%$%(%s%9
$B!V%*%Z%l!<%7%g%s%:!&%j%5!<%A!W(B, $B?92mIW(B, $B>>0fCN8J(B, $BD+AR=PHG(B, 2004$BG/(B6$B7n(B (263 P).