Yoshio Okamoto

2009
29	EE	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
28	EE	Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno: On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints. COCOON 2008: 458-467
27	EE	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
26	EE	Tobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno: Improved Bounds for Wireless Localization. SWAT 2008: 77-89
25	EE	Yoshio Okamoto: Traveling Sales Person with Few Inner Points. Encyclopedia of Algorithms 2008
24	EE	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)
23	EE	Yoshio Okamoto: Local topology of the free complex of a two-dimensional generalized convex shelling. Discrete Mathematics 308(17): 3836-3846 (2008)
22	EE	Yoshio Okamoto: Fair cost allocations under conflicts - a game-theoretic point of view - . Discrete Optimization 5(1): 1-18 (2008)
21	EE	Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara: Counting the number of independent sets in chordal graphs. J. Discrete Algorithms 6(2): 229-242 (2008)
2007
20	EE	Heidi Gebauer, Yoshio Okamoto: Fast Exponential-Time Algorithms for the Forest Counting in Graph Classes. CATS 2007: 63-69
19	EE	Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff: Moving Vertices to Make Drawings Plane. Graph Drawing 2007: 101-112
18	EE	Yoshio Okamoto, Takeaki Uno: A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization. ISAAC 2007: 609-620
17	EE	Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff: Moving Vertices to Make Drawings Plane CoRR abs/0706.1002: (2007)
16	EE	Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno: Matroid representation of clique complexes. Discrete Applied Mathematics 155(15): 1910-1929 (2007)
15	EE	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
14	EE	Michael Hoffmann, Yoshio Okamoto: The minimum weight triangulation problem with few inner points. Comput. Geom. 34(3): 149-158 (2006)
13	EE	Sonoko Moriyama, Yoshio Okamoto: The Even Outdegree Conjecture for Acyclic PLCP-Cubes in Dimension Five. IEICE Transactions 89-D(8): 2402-2404 (2006)
12	EE	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	EE	Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara: Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs. WG 2005: 433-444
10	EE	Kenji Kashiwabara, Masataka Nakamura, Yoshio Okamoto: The affine representation theorem for abstract convex geometries. Comput. Geom. 30(2): 129-144 (2005)
2004
9	EE	Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger: The Traveling Salesman Problem with Few Inner Points. COCOON 2004: 268-277
8	EE	Michael Hoffmann, Yoshio Okamoto: The Minimum Weight Triangulation Problem with Few Inner Points. IWPEC 2004: 200-212
7	EE	Thomas Bietenhader, Yoshio Okamoto: Core Stability of Minimum Coloring Games. WG 2004: 389-401
6	EE	Yoshio Okamoto: Traveling salesman games with the Monge property. Discrete Applied Mathematics 138(3): 349-369 (2004)
2003
5	EE	Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno: Matroid Representation of Clique Complexes. COCOON 2003: 192-201
4	EE	Yoshio Okamoto: Fair Cost Allocations under Conflicts - A Game-Theoretic Point of View. ISAAC 2003: 686-695
3	EE	Paz Carmi, Thomas Erlebach, Yoshio Okamoto: Greedy Edge-Disjoint Paths in Complete Graphs. WG 2003: 143-155
2	EE	Kenji Kashiwabara, Yoshio Okamoto: A greedy algorithm for convex geometries. Discrete Applied Mathematics 131(2): 449-465 (2003)
1	EE	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	Thomas Bietenhader	[7]
2	Kevin Buchin	[24] [27]
3	Maike Buchin	[24] [27]
4	Jaroslaw Byrka	[24] [27]
5	Paz Carmi	[3]
6	Tobias Christ	[26]
7	Vladimir G. Deineko	[9] [12]
8	Thomas Erlebach	[3]
9	Heidi Gebauer	[20] [29]
10	Xavier Goaoc	[17] [19]
11	Michael Hoffmann	[8] [9] [12] [14] [26]
12	Kenji Kashiwabara	[2] [5] [10] [16]
13	Shuji Kijima	[28]
14	Masashi Kiyomi	[28]
15	Jan Kratochvíl	[17] [19]
16	Sonoko Moriyama	[13]
17	Masataka Nakamura	[1] [10]
18	Martin Nöllenburg	[24] [27]
19	Yota Otachi	[15]
20	Chan-Su Shin	[17] [19]
21	Rodrigo I. Silveira	[24] [27]
22	Ryuhei Uehara	[11] [21]
23	Takeaki Uno	[5] [11] [16] [18] [21] [26] [28]
24	Gerhard J. Woeginger	[9] [12]
25	Alexander Wolff	[17] [19] [24] [27]
26	Koichi Yamazaki	[15]

Colors in the list of coauthors