 | 2009 |
|---|
| 9 |       | Masashi Kiyomi,
Toshiki Saitoh,
Ryuhei Uehara:
Reconstruction of Interval Graphs.
COCOON 2009: 106-115 |
| 8 | | Toshiki Saitoh,
Katsuhisa Yamanaka,
Masashi Kiyomi,
Ryuhei Uehara:
Random Generation and Enumeration of Proper Interval Graphs.
WALCOM 2009: 177-189 |
| 2008 |
|---|
| 7 | | Shuji Kijima,
Masashi Kiyomi,
Yoshio Okamoto,
Takeaki Uno:
On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints.
COCOON 2008: 458-467 |
| 2006 |
|---|
| 6 | | Masashi Kiyomi,
Shuji Kijima,
Takeaki Uno:
Listing Chordal Graphs and Interval Graphs.
WG 2006: 68-77 |
| 5 | | Masashi Kiyomi,
Takeaki Uno:
Generating Chordal Graphs Included in Given Graphs.
IEICE Transactions 89-D(2): 763-770 (2006) |
| 2005 |
|---|
| 4 | | Timothy Furtak,
Masashi Kiyomi,
Takeaki Uno,
Michael Buro:
Generalized Amazons is PSPACE-Complete.
IJCAI 2005: 132-137 |
| 3 | | Masashi Kiyomi,
Takeaki Uno,
Tomomi Matsui:
Efficient Algorithms for the Electric Power Transaction Problem.
WINE 2005: 602-611 |
| 2004 |
|---|
| 2 | | Takeaki Uno,
Masashi Kiyomi,
Hiroki Arimura:
LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets
FIMI 2004 |
| 2000 |
|---|
| 1 | | Masashi Kiyomi,
Tomomi Matsui:
Integer Programming Based Algorithms for Peg Solitaire Problems.
Computers and Games 2000: 229-240 |
