 | 2011 |
|---|
| 8 |       | Masaki Yamamoto,
Shuji Kijima,
Yasuko Matsui:
A polynomial-time perfect sampler for the Q-Ising with a vertex-independent noise.
J. Comb. Optim. 22(3): 392-408 (2011) |
| 2010 |
|---|
| 7 | | Katsuhisa Yamanaka,
Shin-Ichi Nakano,
Yasuko Matsui,
Ryuhei Uehara,
Kento Nakada:
Efficient enumeration of all ladder lotteries and its application.
Theor. Comput. Sci. 411(16-18): 1714-1722 (2010) |
| 6 | | Yasuko Matsui,
Ryuhei Uehara,
Takeaki Uno:
Enumeration of the perfect sequences of a chordal graph.
Theor. Comput. Sci. 411(40-42): 3635-3641 (2010) |
| 2009 |
|---|
| 5 | | Masaki Yamamoto,
Shuji Kijima,
Yasuko Matsui:
A Polynomial-Time Perfect Sampler for the Q-Ising with a Vertex-Independent Noise.
COCOON 2009: 328-337 |
| 2008 |
|---|
| 4 | | Yasuko Matsui,
Ryuhei Uehara,
Takeaki Uno:
Enumeration of Perfect Sequences of Chordal Graph.
ISAAC 2008: 859-870 |
| 2004 |
|---|
| 3 | | 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) |
| 2001 |
|---|
| 2 | | Yasuko Matsui,
Tomomi Matsui:
NP-completeness for calculating power indices of weighted majority games.
Theor. Comput. Sci. 263(1-2): 305-310 (2001) |
| 1995 |
|---|
| 1 | | Yasuko Matsui,
Tomomi Matsui:
Enumeration Algorithm for the Edge Coloring Problem on Bipartite Graphs.
Combinatorics and Computer Science 1995: 18-26 |
Data released under the ODC-BY 1.0 license — See also our legal information page