Yasuko Matsui's Home Page

Welcome to Yasuko Matsui's Home Page!

Japanese page is here.

Yasuko Matsui
Professor

Department of Mathematical Sciences, School of Science, Tokai University
Address: 4-1-1,Kitakaname,Hiratsuka,Kanagawa,259-1292,Japan
TEL: 0463-58-1211 ext. 3651
E-mail: ``yasuko AT tokai-u.jp''
!!! My old address ``yasuko AT ss.u-tokai.ac.jp'' is NOT AVAILABLE, since August 15th, 2010. Sorry. !!!

Education

[3/2001] Dr. of Engineering, Management Science, Tokyo University of Science, Japan.
Thesis Title:``Enumeration Algorithms for Edge Coloring Problems and Weighted Majority Games''
[3/1994] M. of Engineering, Management Science, Tokyo University of Science, Japan

Employment

[4/2014-] Professor of Dept. of Mathematical Sciences, Tokai University
[4/2006-] Associate Professor of Dept. of Mathematical Sciences, Tokai University
[4/1998-3/2006] Assistant Professor of Dept. of Mathematical Sciences, Tokai University
[7/1994-3/1998] Assistant Professor of Dept. of Mathematics, Tokyo Metropolitan University

Personal Activities

Manager of ``Combinatorial Mathematics Seminar'', Tokyo, Japan.
Manager of ``Combinatorial Optimization Seminar'', Tokyo, Japan.
The Operations Research Society of Japan, Member.Directer(2016-)
The Mathematical Society of Japan, Member.
Japanese Society of Computational Statistics, Member.
The Institute of Electronics, Information and Communication Engineers (IEICE), Member.
Information Processing Society of Japan, Member.
Mathematical Optimization Society, Member.
The Society of Japanese Women Scientists, Member.
[2005-]Mathematical Review, Reviewer.

Manuscripts

[1] Finding all the edge colorings in bipartite graphs

Yasuko Yoshida and Tomomi Matsui,T.IEE Japan, Vol.114-C(1994),pp.444--449.(in Japanese)

[2] Enumeration algorithm of the edge colorings in bipartite graphs

Yasuko Matsui and Tomomi Matsui, Lecture Notes in Computer Science,Springer-Verlag,Vol.1120(1995),pp.18--26.

[3] Finding all maximal common independent sets of matroids

Yasuko Matsui and Tomomi Matsui, Proceedings of Korea-Japan Joint Workshop on Algorithms and Computation, KAIST,Taejon,Korea(1996),pp 54--58.

[4] A simple and fast algorithm for enumerating all edge colorings of a bipartite graph

Yasuko Matsui and Takeaki Uno, Proceedings of Korea-Japan Joint Workshop on Algorithms and Computation, KAIST,Taejon,Korea(1996),pp 81--87.

[5] Complexity results for calculating power indices of weighted majority games

Yasuko Matsui, Proceedings of International Conference on Nonlinear Analysis and Convex Analysis(NACA98), World Scientific(1998)261--265.

[6] A Survey of Algorithms for Calculating Power Indices of Weighted Majority Games

Tomomi Matsui and Yasuko Matsui, Journal of Operations Research Society of Japan Vol.43, No.1(2000)71--86.

[7] NP-completeness for Calculating Power Indices of Weighted Majority Games

Yasuko Matsui and Tomomi Matsui, Theoritical Computer Science A, Vol.263(2001)305--310.

[8] Random generation of 2x2x...xJ contingency tables

Tomomi Matsui, Yasuko Matsui and Yoko Ono,Theor. Comput. Sci. 326(1-3)(2004)117-135.

[9] On the Enumeration of Bipartite Minimum Edge Colorings

Yasuko Matsui and Takeaki Uno, Graph Theory in Paris, Proceedings of a Conference in Memory of Claude Berge, Trends in Mathematics, Birkhaeuser Boston Inc.(2006) 271--285.

[10] Enumeration of Perfect Sequences of Chordal Graph

Yasuko Matsui, Ryuhei Uehara, and Takeaki Uno, Lecture Notes in Computer Science,(The 19th International Symposium, ISAAC 2008, Proceedings),5369,859--870,Springer(2008).

[11] An Algorithm for Enumerating All Clique Trees and Perfect Sequences of Chordal Graph

Yasuko Matsui and Hisayuki Hara, Abstracts of IASC2008, Pacifico Yokohama(2008),201.

[12]Efficient Enumeration of Pseudoline Arrangements,

Katsuhisa Yamanaka, Shin-ichi Nakano, Yasuko Matsui, Ryuhei Uehara and Kento Nakada, Proc. of 25th European Workshop on Computational Geometry (EuroCG), 143-146,2009.(Belgium, Brussels, 16-18th/Mar/2009).

[13]Efficient enumeration of all ladder lotteries and its application

Katsuhisa Yamanaka, Shin-ichi Nakano, Yasuko Matsui, Ryuhei Uehara, and K. Nakada, Theoritical Computer Science,411,1714-1722,Elsevier(2009).

[14]A Polynomial-Time Perfect Sampler for the Q-Ising with a Vertex-Independent Noise

Masaki Yamamoto, Shuji Kijima and Yasuko Matsui, Lecture Notes in Computer Science,(The 15th International Computing and Combinatorics Conference (COCOON 2009)), 5609,328--337,Springer(2009).

[15]A Polynomial-Time Perfect Sampler for the Q-Ising with a Vertex-Independent Noise

Masaki Yamamoto, Shuji Kijima and Yasuko Matsui, Journal of Combinatorial Optimization, to appear.

DOI: 10.1007/s10878-010-9309-7

[16]Independence complexes of multipartite graphs, posets and regular cell complexes

Masahiro Hachimori, Kazuhiro Kawamura and Yasuko Matsui, subimitted.

[17]Network Majority on Tree Topological Network

R.B.Bapat, S.Fujita, S.Legay, Y.Manoussakis, Y.Matsui, T.Sakuma and Z.Tuza,Electronic Notes in Discrete Mathematics,54,79--84, Elsevier(2016).

[18]Safe Sets in some classes of graphs

R.\'Agueda, N.Cohen, S.Fujita, S.Legay, Y.Manoussakis, Y.Matsui, L.Montero, R.Naserasr, Y.Otachi, T.Sakuma, Z.Tuza and T.Xu,Combinatorial Optimization and Applications: 10th International Conference,COCOA 2016 Hong Kong, China, December 16-18,2016 Proceedings,Lecture Notes in Computer Science (LNCS)10043,241-253,Springer(2016).