Yoshio Okamoto

	2012
57		Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff: Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, Fixed-Parameter Tractability. Algorithmica 62(1-2): 309-332 (2012)
56		Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh: Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data CoRR abs/1203.3284: (2012)
55		Sang Won Bae, Yoshio Okamoto: Querying two boundary points for shortest paths in a polygonal domain. Comput. Geom. 45(7): 284-293 (2012)
	2011
54		Takao Asano, Shin-Ichi Nakano, Yoshio Okamoto, Osamu Watanabe: Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings Springer 2011
53		Shuji Kijima, Yoshio Okamoto, Takeaki Uno: Dominating Set Counting in Graph Classes. COCOON 2011: 13-24
52		Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno: Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem. TAMC 2011: 452-462
51		Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki: Approximability of the Path-Distance-Width for AT-free Graphs. WG 2011: 271-282
50		Heidi Gebauer, Anna Gundert, Robin A. Moser, Yoshio Okamoto: Not All Saturated 3-Forests Are Tight CoRR abs/1109.3390: (2011)
49		Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström: On Problems as Hard as CNFSAT CoRR abs/1112.2275: (2011)
48		Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein: The t-Pebbling Number is Eventually Linear in t. Electr. J. Comb. 18(1): (2011)
47		Yoshio Okamoto, Takeaki Uno: A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization. European Journal of Operational Research 210(1): 48-56 (2011)
46		Hee-Kap Ahn, Yoshio Okamoto: Adaptive Algorithms for Planar Convex Hull Problems. IEICE Transactions 94-D(2): 182-189 (2011)
45		Yoshinobu Kawahara, Kiyohito Nagano, Yoshio Okamoto: Submodular fractional programming for balanced clustering. Pattern Recognition Letters 32(2): 235-243 (2011)
	2010
44		Sang Won Bae, Matias Korman, Yoshio Okamoto: The Geodesic Diameter of Polygonal Domains. ESA (1) 2010: 500-511
43		Hee-Kap Ahn, Yoshio Okamoto: Adaptive Algorithms for Planar Convex Hull Problems. FAW 2010: 316-326
42		Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein: Minimum and Maximum against k Lies. SWAT 2010: 139-149
41		Tobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno: Improved Bounds for Wireless Localization. Algorithmica 57(3): 499-516 (2010)
40		Sang Won Bae, Matias Korman, Yoshio Okamoto: The Geodesic Diameter of Polygonal Domains CoRR abs/1001.0695: (2010)
39		Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein: Minimum and maximum against k lies CoRR abs/1002.0562: (2010)
38		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)
37		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)
	2009
36		Yoshio Okamoto, Ryuhei Uehara: How to make a picturesque maze. CCCG 2009: 137-140
35		Sang Won Bae, Yoshio Okamoto: Querying Two Boundary Points for Shortest Paths in a Polygonal Domain. ISAAC 2009: 1054-1063
34		Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno: Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes. WG 2009: 296-307
33		Sang Won Bae, Yoshio Okamoto: Querying Two Boundary Points for Shortest Paths in a Polygonal Domain CoRR abs/0911.5017: (2009)
32		Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Andreas Spillner, Alexander Wolff: Untangling a Planar Graph. Discrete & Computational Geometry 42(4): 542-569 (2009)
31		Komei Fukuda, Sonoko Moriyama, Yoshio Okamoto: The Holt-Klee condition for oriented matroids. Eur. J. Comb. 30(8): 1854-1867 (2009)
30		Heidi Gebauer, Yoshio Okamoto: Fast Exponential-Time Algorithms for the Forest Counting and the Tutte Polynomial Computation in Graph Classes. Int. J. Found. Comput. Sci. 20(1): 25-44 (2009)
	2008
29		Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno: On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints. COCOON 2008: 458-467
28		Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff: Drawing (Complete) Binary Tanglegrams. Graph Drawing 2008: 324-335
27		Tobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno: Improved Bounds for Wireless Localization. SWAT 2008: 77-89
26		Yoshio Okamoto: Traveling Sales Person with Few Inner Points. Encyclopedia of Algorithms 2008
25		Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff: Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability CoRR abs/0806.0920: (2008)
24		Yoshio Okamoto: Local topology of the free complex of a two-dimensional generalized convex shelling. Discrete Mathematics 308(17): 3836-3846 (2008)
23		Yoshio Okamoto: Fair cost allocations under conflicts - a game-theoretic point of view - . Discrete Optimization 5(1): 1-18 (2008)
22		Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara: Counting the number of independent sets in chordal graphs. J. Discrete Algorithms 6(2): 229-242 (2008)
	2007
21		Heidi Gebauer, Yoshio Okamoto: Fast Exponential-Time Algorithms for the Forest Counting in Graph Classes. CATS 2007: 63-69
20		Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff: Moving Vertices to Make Drawings Plane. Graph Drawing 2007: 101-112
19		Yoshio Okamoto, Takeaki Uno: A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization. ISAAC 2007: 609-620
18		Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff: Moving Vertices to Make Drawings Plane CoRR abs/0706.1002: (2007)
17		Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno: Matroid representation of clique complexes. Discrete Applied Mathematics 155(15): 1910-1929 (2007)
16		Yota Otachi, Yoshio Okamoto, Koichi Yamazaki: Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs. Discrete Applied Mathematics 155(17): 2383-2390 (2007)
	2006
15		Michael Hoffmann, Yoshio Okamoto: The minimum weight triangulation problem with few inner points. Comput. Geom. 34(3): 149-158 (2006)
14		Sonoko Moriyama, Yoshio Okamoto: The Even Outdegree Conjecture for Acyclic PLCP-Cubes in Dimension Five. IEICE Transactions 89-D(8): 2402-2404 (2006)
13		Thomas Bietenhader, Yoshio Okamoto: Core Stability of Minimum Coloring Games. Math. Oper. Res. 31(2): 418-431 (2006)
12		Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger: The traveling salesman problem with few inner points. Oper. Res. Lett. 34(1): 106-110 (2006)
	2005
11		Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara: Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs. WG 2005: 433-444
10		Kenji Kashiwabara, Masataka Nakamura, Yoshio Okamoto: The affine representation theorem for abstract convex geometries. Comput. Geom. 30(2): 129-144 (2005)
	2004
9		Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger: The Traveling Salesman Problem with Few Inner Points. COCOON 2004: 268-277
8		Michael Hoffmann, Yoshio Okamoto: The Minimum Weight Triangulation Problem with Few Inner Points. IWPEC 2004: 200-212
7		Thomas Bietenhader, Yoshio Okamoto: Core Stability of Minimum Coloring Games. WG 2004: 389-401
6		Yoshio Okamoto: Traveling salesman games with the Monge property. Discrete Applied Mathematics 138(3): 349-369 (2004)
	2003
5		Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno: Matroid Representation of Clique Complexes. COCOON 2003: 192-201
4		Yoshio Okamoto: Fair Cost Allocations under Conflicts - A Game-Theoretic Point of View. ISAAC 2003: 686-695
3		Paz Carmi, Thomas Erlebach, Yoshio Okamoto: Greedy Edge-Disjoint Paths in Complete Graphs. WG 2003: 143-155
2		Kenji Kashiwabara, Yoshio Okamoto: A greedy algorithm for convex geometries. Discrete Applied Mathematics 131(2): 449-465 (2003)
1		Yoshio Okamoto, Masataka Nakamura: The forbidden minor characterization of line-search antimatroids of rooted digraphs. Discrete Applied Mathematics 131(2): 523-533 (2003)

Coauthor Index

1	Hee-Kap Ahn	[43] [46]
2	Takao Asano	[54]
3	Sang Won Bae	[33] [35] [40] [44] [55]
4	Thomas Bietenhader	[7] [13]
5	Ondrej Bílka	[38]
6	Kevin Buchin	[25] [28] [38] [57]
7	Maike Buchin	[25] [28] [57]
8	Jaroslaw Byrka	[25] [28] [57]
9	Paz Carmi	[3]
10	Tobias Christ	[27] [41]
11	Marek Cygan	[49]
12	Vladimir G. Deineko	[9] [12]
13	Holger Dell	[49]
14	Thomas Erlebach	[3]
15	Komei Fukuda	[31]
16	Radoslav Fulek	[38]
17	Heidi Gebauer	[21] [30] [50]
18	Xavier Goaoc	[18] [20] [32]
19	Anna Gundert	[50]
20	Michael Hoffmann	[8] [9] [12] [15] [27] [39] [41] [42] [48]
21	Kenji Kashiwabara	[2] [5] [10] [17]
22	Yoshinobu Kawahara	[45]
23	Shuji Kijima	[29] [37] [51] [53]
24	Masashi Kiyomi	[29] [37] [38] [56]
25	Matias Korman	[40] [44]
26	Jan Kratochvíl	[18] [20] [32]
27	Daniel Lokshtanov	[49]
28	Dániel Marx	[49]
29	Jirí Matousek	[39] [42] [48]
30	Sonoko Moriyama	[14] [31]
31	Robin A. Moser	[50]
32	Kiyohito Nagano	[45]
33	Masataka Nakamura	[1] [10]
34	Shin-Ichi Nakano	[54]
35	Jesper Nederlof	[49]
36	Martin Nöllenburg	[25] [28] [57]
37	Hirotaka Ono	[51]
38	Yota Otachi	[16] [51] [52]
39	Ramamohan Paturi	[49]
40	Toshiki Saitoh	[51] [56]
41	Saket Saurabh	[49]
42	Chan-Su Shin	[18] [20] [32]
43	Rodrigo I. Silveira	[25] [28] [57]
44	Andreas Spillner	[32]
45	Shin-ichi Tanigawa	[38]
46	Csaba D. Tóth	[38]
47	Ryuhei Uehara	[11] [22] [34] [36] [52]
48	Takeaki Uno	[5] [11] [17] [19] [22] [27] [29] [34] [37] [41] [47] [52] [53]
49	Yushi Uno	[51]
50	Magnus Wahlström	[49]
51	Osamu Watanabe	[54]
52	Gerhard J. Woeginger	[9] [12]
53	Alexander Wolff	[18] [20] [25] [28] [32] [57]
54	Katsuhisa Yamanaka	[51]
55	Koichi Yamazaki	[16] [51]
56	Philipp Zumstein	[39] [42] [48]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page