Masashi Kiyomi

	2012
20		Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh: Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data. SEA 2012: 248-259
19		Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh: Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data CoRR abs/1203.3284: (2012)
	2011
18		Yosuke Okayama, Masashi Kiyomi, Ryuhei Uehara: On covering of any point configuration by disjoint unit disks. CCCG 2011
17		Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Tsuyoshi Ito, Masashi Kiyomi, Stefan Langerman, Ryuhei Uehara, Takeaki Uno: Algorithmic Folding Complexity. Graphs and Combinatorics 27(3): 341-351 (2011)
16		Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara: Voronoi Game on a Path. IEICE Transactions 94-D(6): 1185-1189 (2011)
	2010
15		Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara: Bipartite Permutation Graphs Are Reconstructible. COCOA (2) 2010: 362-373
14		Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara: Reconstruction Algorithm for Permutation Graphs. WALCOM 2010: 125-135
13		Ondrej Bílka, Kevin Buchin, Radoslav Fulek, Masashi Kiyomi, Yoshio Okamoto, Shin-ichi Tanigawa, Csaba D. Tóth: A Tight Lower Bound for Convexly Independent Subsets of the Minkowski Sums of Planar Point Sets. Electr. J. Comb. 17(1): (2010)
12		Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara: Random Generation and Enumeration of Proper Interval Graphs. IEICE Transactions 93-D(7): 1816-1823 (2010)
11		Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno: On listing, sampling, and counting the chordal graphs with edge constraints. Theor. Comput. Sci. 411(26-28): 2591-2601 (2010)
10		Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara: Reconstruction of interval graphs. Theor. Comput. Sci. 411(43): 3859-3866 (2010)
	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

Coauthor Index

1	Hiroki Arimura	[2]
2	Ondrej Bílka	[13]
3	Kevin Buchin	[13]
4	Michael Buro	[4]
5	Jean Cardinal	[17]
6	Erik D. Demaine	[17]
7	Martin L. Demaine	[17]
8	Radoslav Fulek	[13]
9	Timothy Furtak	[4]
10	Shinji Imahori	[17]
11	Tsuyoshi Ito	[17]
12	Shuji Kijima	[6] [7] [11]
13	Stefan Langerman	[17]
14	Tomomi Matsui	[1] [3]
15	Yoshio Okamoto	[7] [11] [13] [19] [20]
16	Yosuke Okayama	[18]
17	Toshiki Saitoh	[8] [9] [10] [12] [14] [15] [16] [19] [20]
18	Shin-ichi Tanigawa	[13]
19	Csaba D. Tóth	[13]
20	Ryuhei Uehara	[8] [9] [10] [12] [14] [15] [16] [17] [18]
21	Takeaki Uno	[2] [3] [4] [5] [6] [7] [11] [17]
22	Katsuhisa Yamanaka	[8] [12]

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page