| 2009 | ||
|---|---|---|
| 40 | 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 157(9): 2078-2088 (2009) | |
| 39 | Yusuke Kuroki, Tomomi Matsui: An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors. Discrete Applied Mathematics 157(9): 2124-2135 (2009) | |
| 38 | Hiroo Saito, Tetsuya Fujie, Tomomi Matsui, Shiro Matuura: A study of the quadratic semi-assignment polytope. Discrete Optimization 6(1): 37-50 (2009) | |
| 37 | Hirotatsu Kobayashi, Tomomi Matsui: Successful Manipulation in Stable Marriage Model with Complete Preference Lists. IEICE Transactions 92-D(2): 116-119 (2009) | |
| 36 | Hadas Shachnai, Lisa Zhang, Tomomi Matsui: A note on generalized rank aggregation. Inf. Process. Lett. 109(13): 647-651 (2009) | |
| 2008 | ||
| 35 | Shuji Kijima, Tomomi Matsui: Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers. Annals OR 162(1): 35-55 (2008) | |
| 34 | Hadas Shachnai, Lisa Zhang, Tomomi Matsui: Exact algorithms for the master ring problem. Networks 52(2): 98-107 (2008) | |
| 33 | Shuji Kijima, Tomomi Matsui: Approximation Algorithm and Perfect Sampler for Closed Jackson Networks with Single Servers. SIAM J. Comput. 38(4): 1484-1503 (2008) | |
| 2006 | ||
| 32 | Yuichiro Miyamoto, Tomomi Matsui: Approximation Algorithms for Minimum Span Channel Assignment Problems. AAIM 2006: 334-342 | |
| 31 | Nobutomo Fujiwara, Shinji Imahori, Tomomi Matsui, Ryuhei Miyashiro: Constructive Algorithms for the Constant Distance Traveling Tournament Problem. PATAT 2006: 135-146 | |
| 30 | Shu Yamada, Michiyo Matsui, Tomomi Matsui, Dennis K. J. Lin, Takenori Takahashi: A general construction method for mixed-level supersaturated design. Computational Statistics & Data Analysis 50(1): 254-265 (2006) | |
| 29 | Ryuhei Miyashiro, Tomomi Matsui: Semidefinite programming based approaches to the break minimization problem. Computers & OR 33: 1975-1982 (2006) | |
| 28 | Masaru Iwasa, Hiroo Saito, Tomomi Matsui: Approximation Algorithms for the Single Allocation Problem in Hub-and-Spoke Networks. Electronic Notes in Discrete Mathematics 27: 51-52 (2006) | |
| 27 | Yusuke Kuroki, Tomomi Matsui: Randomized Approximation Algorithm for a Geometrical Multidimensional Assignment Problem. Electronic Notes in Discrete Mathematics 27: 63-64 (2006) | |
| 26 | Ayami Suzuka, Ryuhei Miyashiro, Akiko Yoshise, Tomomi Matsui: Dependent Randomized Rounding to the Home-Away Assignment Problem in Sports Scheduling. IEICE Transactions 89-A(5): 1407-1416 (2006) | |
| 25 | Shuji Kijima, Tomomi Matsui: Polynomial time perfect sampling algorithm for two-rowed contingency tables. Random Struct. Algorithms 29(2): 243-256 (2006) | |
| 2005 | ||
| 24 | Yuichiro Miyamoto, Tomomi Matsui: Perfectness and Imperfectness of the kth Power of Lattice Graphs. AAIM 2005: 233-242 | |
| 23 | Ayami Suzuka, Ryuhei Miyashiro, Akiko Yoshise, Tomomi Matsui: Semidefinite Programming Based Approaches to Home-Away Assignment Problems in Sports Scheduling. AAIM 2005: 95-103 | |
| 22 | Yuichiro Miyamoto, Tomomi Matsui: Multicoloring unit disk graphs on triangular lattice points. SODA 2005: 895-896 | |
| 21 | Masashi Kiyomi, Takeaki Uno, Tomomi Matsui: Efficient Algorithms for the Electric Power Transaction Problem. WINE 2005: 602-611 | |
| 20 | Shuji Kijima, Tomomi Matsui: Approximate/perfect samplers for closed Jackson networks. Winter Simulation Conference 2005: 862-868 | |
| 19 | Ryuhei Miyashiro, Tomomi Matsui: A polynomial-time algorithm to find an equitable home-away assignment. Oper. Res. Lett. 33(3): 235-241 (2005) | |
| 2004 | ||
| 18 | Tomomi Matsui, Yasuko Matsui, Yoko Ono: Random generation of 2 times 2 times ... times 2 times J contingency tables. Theor. Comput. Sci. 326(1-3): 117-135 (2004) | |
| 2003 | ||
| 17 | Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, David Rappaport, Godfried T. Toussaint: Computing the Similarity of two Melodies. CCCG 2003: 81-84 | |
| 16 | Tomomi Matsui, Mitsuo Motoki, Naoyuki Kamatani: Polynomial Time Approximate Sampler for Discretized Dirichlet Distribution. ISAAC 2003: 676-685 | |
| 2002 | ||
| 15 | Ryuhei Miyashiro, Hideya Iwasaki, Tomomi Matsui: Characterizing Feasible Pattern Sets with a Minimum Number of Breaks. PATAT 2002: 78-99 | |
| 2001 | ||
| 14 | Tomomi Matsui, Takahiro Watanabe: Sealed Bid Mulit-object Auctions with Necessary Bundles and Its Application to Spectrum Auctions. PRIMA 2001: 78-92 | |
| 13 | Shiro Matuura, Tomomi Matsui: 63-Approximation Algorithm for MAX DICUT. RANDOM-APPROX 2001: 138-146 | |
| 12 | Yasuko Matsui, Tomomi Matsui: NP-completeness for calculating power indices of weighted majority games. Theor. Comput. Sci. 263(1-2): 305-310 (2001) | |
| 2000 | ||
| 11 | Masashi Kiyomi, Tomomi Matsui: Integer Programming Based Algorithms for Peg Solitaire Problems. Computers and Games 2000: 229-240 | |
| 10 | Tetsuo Asano, Tomomi Matsui, Takeshi Tokuyama: On the Complexities of the Optimal Rounding Problems of Sequences and Matrices. SWAT 2000: 476-489 | |
| 9 | Tetsuo Asano, Tomomi Matsui, Takeshi Tokuyama: Optimal Roundings of Sequences and Matrices. Nord. J. Comput. 7(3): 241- (2000) | |
| 1998 | ||
| 8 | Tomomi Matsui: Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs. JCDCG 1998: 194-200 | |
| 7 | Satoru Iwata, Tomomi Matsui, S. Thomas McCormick: A fast bipartite network flow algorithm for selective assembly. Oper. Res. Lett. 22(4-5): 137-143 (1998) | |
| 1995 | ||
| 6 | Yasuko Matsui, Tomomi Matsui: Enumeration Algorithm for the Edge Coloring Problem on Bipartite Graphs. Combinatorics and Computer Science 1995: 18-26 | |
| 5 | Tomomi Matsui, Sunao Tamura: Adjacency on Combinatorial Polyhedra. Discrete Applied Mathematics 56(2-3): 311-321 (1995) | |
| 4 | Maiko Shigeno, Yasufumi Saruwatari, Tomomi Matsui: An Algorithm for Fractional Assignment Problems. Discrete Applied Mathematics 56(2-3): 333-343 (1995) | |
| 3 | Tomomi Matsui: The Minimum Spanning Tree Problem on a Planar Graph. Discrete Applied Mathematics 58(1): 91-94 (1995) | |
| 1994 | ||
| 2 | Tomomi Matsui, Akihisa Tamura, Yoshiko Ikebe: Algorithms for finding a Kth best valued assignment. Discrete Applied Mathematics 50(3): 283-296 (1994) | |
| 1993 | ||
| 1 | Yoshiko Ikebe, Tomomi Matsui, Akihisa Tamura: Adjacency of the Best and Second Best Valued Solutions in Combinatorial Optimization Problems. Discrete Applied Mathematics 47(3): 227-232 (1993) | |