Tomomi Matsui

2006
30	EE	Yuichiro Miyamoto, Tomomi Matsui: Approximation Algorithms for Minimum Span Channel Assignment Problems. AAIM 2006: 334-342
29	EE	Nobutomo Fujiwara, Shinji Imahori, Tomomi Matsui, Ryuhei Miyashiro: Constructive Algorithms for the Constant Distance Traveling Tournament Problem. PATAT 2006: 135-146
28	EE	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)
27	EE	Ryuhei Miyashiro, Tomomi Matsui: Semidefinite programming based approaches to the break minimization problem. Computers & OR 33: 1975-1982 (2006)
26	EE	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	EE	Shuji Kijima, Tomomi Matsui: Polynomial time perfect sampling algorithm for two-rowed contingency tables. Random Struct. Algorithms 29(2): 243-256 (2006)
2005
24	EE	Yuichiro Miyamoto, Tomomi Matsui: Perfectness and Imperfectness of the kth Power of Lattice Graphs. AAIM 2005: 233-242
23	EE	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	EE	Yuichiro Miyamoto, Tomomi Matsui: Multicoloring unit disk graphs on triangular lattice points. SODA 2005: 895-896
21	EE	Masashi Kiyomi, Takeaki Uno, Tomomi Matsui: Efficient Algorithms for the Electric Power Transaction Problem. WINE 2005: 602-611
20	EE	Shuji Kijima, Tomomi Matsui: Approximate/perfect samplers for closed Jackson networks. Winter Simulation Conference 2005: 862-868
19	EE	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	EE	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	EE	Tomomi Matsui, Mitsuo Motoki, Naoyuki Kamatani: Polynomial Time Approximate Sampler for Discretized Dirichlet Distribution. ISAAC 2003: 676-685
2002
15	EE	Ryuhei Miyashiro, Hideya Iwasaki, Tomomi Matsui: Characterizing Feasible Pattern Sets with a Minimum Number of Breaks. PATAT 2002: 78-99
2001
14	EE	Tomomi Matsui, Takahiro Watanabe: Sealed Bid Mulit-object Auctions with Necessary Bundles and Its Application to Spectrum Auctions. PRIMA 2001: 78-92
13	EE	Shiro Matuura, Tomomi Matsui: 63-Approximation Algorithm for MAX DICUT. RANDOM-APPROX 2001: 138-146
12	EE	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	EE	Masashi Kiyomi, Tomomi Matsui: Integer Programming Based Algorithms for Peg Solitaire Problems. Computers and Games 2000: 229-240
10	EE	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	EE	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	EE	Tomomi Matsui, Sunao Tamura: Adjacency on Combinatorial Polyhedra. Discrete Applied Mathematics 56(2-3): 311-321 (1995)
4	EE	Maiko Shigeno, Yasufumi Saruwatari, Tomomi Matsui: An Algorithm for Fractional Assignment Problems. Discrete Applied Mathematics 56(2-3): 333-343 (1995)
3	EE	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	EE	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)

Coauthor Index

1	Greg Aloupis	[17]
2	Tetsuo Asano	[9] [10]
3	Thomas Fevens	[17]
4	Nobutomo Fujiwara	[29]
5	Yoshiko Ikebe	[1] [2]
6	Shinji Imahori	[29]
7	Hideya Iwasaki	[15]
8	Satoru Iwata	[7]
9	Naoyuki Kamatani	[16]
10	Shuji Kijima	[20] [25]
11	Masashi Kiyomi	[11] [21]
12	Stefan Langerman	[17]
13	Dennis K. J. Lin	[28]
14	Michiyo Matsui	[28]
15	Yasuko Matsui	[6] [12] [18]
16	Shiro Matuura	[13]
17	S. Thomas McCormick	[7]
18	Antonio Mesa	[17]
19	Yuichiro Miyamoto	[22] [24] [30]
20	Ryuhei Miyashiro	[15] [19] [23] [26] [27] [29]
21	Mitsuo Motoki	[16]
22	Yoko Ono	[18]
23	David Rappaport	[17]
24	Yasufumi Saruwatari	[4]
25	Maiko Shigeno	[4]
26	Ayami Suzuka	[23] [26]
27	Takenori Takahashi	[28]
28	Akihisa Tamura	[1] [2]
29	Sunao Tamura	[5]
30	Takeshi Tokuyama	[9] [10]
31	Godfried T. Toussaint	[17]
32	Takeaki Uno	[21]
33	Takahiro Watanabe	[14]
34	Shu Yamada	[28]
35	Akiko Yoshise	[23] [26]

Colors in the list of coauthors