dblp.uni-trier.dewww.uni-trier.de

Yoshio Okamoto Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

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

Coauthor Index

1Thomas Bietenhader [7] [13]
2Kevin Buchin [25] [28]
3Maike Buchin [25] [28]
4Jaroslaw Byrka [25] [28]
5Paz Carmi [3]
6Tobias Christ [27]
7Vladimir G. Deineko [9] [12]
8Thomas Erlebach [3]
9Heidi Gebauer [21] [30]
10Xavier Goaoc [18] [20]
11Michael Hoffmann [8] [9] [12] [15] [27]
12Kenji Kashiwabara [2] [5] [10] [17]
13Shuji Kijima [29]
14Masashi Kiyomi [29]
15Jan Kratochvíl [18] [20]
16Sonoko Moriyama [14]
17Masataka Nakamura [1] [10]
18Martin Nöllenburg [25] [28]
19Yota Otachi [16]
20Chan-Su Shin [18] [20]
21Rodrigo I. Silveira [25] [28]
22Ryuhei Uehara [11] [22]
23Takeaki Uno [5] [11] [17] [19] [22] [27] [29]
24Gerhard J. Woeginger [9] [12]
25Alexander Wolff [18] [20] [25] [28]
26Koichi Yamazaki [16]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)