Algorithmic exact approach to game theory on graphs and networks

• Project/Area Number: 18710130
• Research Category: Grant-in-Aid for Young Scientists (B)
• Allocation Type: Single-year Grants
• Research Field: Social systems engineering/Safety system
• Research Institution: Tokyo Institute of Technology (2007-2008); Toyohashi University of Technology (2006)
• Principal Investigator: OKAMOTO Yoshio Tokyo Institute of Technology, 大学院・情報理工学研究科, 特任准教授 (00402660)
• Project Period (FY): 2006 – 2008
• Project Status: Completed (Fiscal Year 2008)
• Budget Amount: ¥3,800,000 (Direct Cost: ¥3,500,000、Indirect Cost: ¥300,000); Fiscal Year 2008: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000); Fiscal Year 2007: ¥1,200,000 (Direct Cost: ¥1,200,000); Fiscal Year 2006: ¥1,300,000 (Direct Cost: ¥1,300,000)
• Keywords: OR / アルゴリズム理論 / 組合せ最適化 / ゲーム理論 / アルゴリズム / グラフ / ネットワーク / 計算幾何 / オペレーションズ・リサーチ / 多主体意思決定 / 公平配分問題

Research Abstract

グラフ・ネットワークに関わる協力ゲーム理論について,アルゴリズム理論・計算理論の観点から精緻な議論を行った.特に,最小彩色ゲームと呼ばれる費用分担問題に対して,今までに提案された公平な費用分担の中のいくつかが効率よく計算できることを示した.それに加えて,コア安定性問題に対する計算量理論的な解析も行った.さらに,最小費用全域木ゲームと呼ばれる費用分担問題に対して,公平費用分担が効率よく計算できるための十分条件である劣モジュラ性を満たす場合の考察をした.

Research Products

• [Journal Article] Counting the number of matchings in chordal and chordal bipartite graph classes (2010)
  • Author(s): Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno
  • Journal Title: Lecture Notes in Computer Science 5911 Pages: 296-307
  • NAID: 110007338417
  • Peer Reviewed
• [Journal Article] Untangling a planar graph. (2009)
  • Author(s): Xavier Goaoc, Jan Kratochvil, Yoshio Okamoto, Chan-Su Shin, Andreas Spillner, Alexander Wolff
  • Journal Title: Discrete & Computational Geometry 42 Pages: 542-569
  • Peer Reviewed
• [Journal Article] The Holt-Klee condition for oriented matroids. (2009)
  • Author(s): Komei Fukuda, Sonoko Moriyama, Yoshio Okamoto
  • Journal Title: European Journal of Combinatorics 30 Pages: 1854-1867
  • Peer Reviewed
• [Journal Article] Fast exponential-time algorithms for the forest counting and the Tutte polynomial computation. (2009)
  • Author(s): Heidi Gebauer, Yoshio Okamoto
  • Journal Title: International Journal of Foundations of Computer Science 20 Pages: 25-44
  • Peer Reviewed
• [Journal Article] Fast exponential-time algorithms for the forest counting and Tutte polynomial computation in graph classes (2009)
  • Author(s): Heidi Gebauer, Yoshio Okamoto
  • Journal Title: International Journal of Foundations of Computer Science 20 Pages: 25-44
  • Peer Reviewed
• [Journal Article] Untangling a planar graph (2009)
  • Author(s): Xavier Goaoc, Jan Kratochvil, Yoshio Okamoto, Chan-Su Shin, Andreas Spillner, Alexander Wolff
  • Journal Title: Discrete & Computational Geometry 42 Pages: 542-569
  • Peer Reviewed
• [Journal Article] The Holt-Klee condition for oriented matroids (2009)
  • Author(s): Komei Fukuda, Sonoko Moriyama, Yoshio Okamoto
  • Journal Title: European Journal of Combinatorics 30 Pages: 1854-1867
  • Peer Reviewed
• [Journal Article] Drawing (complete) binary tanglegrams : Hardness, approximation and fixed-parameter tractability (2009)
  • Author(s): Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nollenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff
  • Journal Title: Lecture Notes in Computer Science 5417 Pages: 324-335
  • Peer Reviewed
• [Journal Article] Querying two boundary points for shortest paths in a polygonal domain (2009)
  • Author(s): Sang Won Bae, Yoshio Okamoto
  • Journal Title: Lecture Notes in Computer Science 5878 Pages: 1054-1063
  • Peer Reviewed
• [Journal Article] Local topology of the free complex of a two-dimensional generalized convex shelling. (2008)
  • Author(s): Yoshio Okamoto
  • Journal Title: Discrete Mathematics 308 Pages: 3836-3846
  • Peer Reviewed
• [Journal Article] Counting the number of independent sets in chordal graphs. (2008)
  • Author(s): Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara
  • Journal Title: Journal of Discrete Algorithms 6 Pages: 229-242
  • NAID: 120001063231
  • Peer Reviewed
• [Journal Article] Fair cost allocations under conflicts - a game-theoretic point of view. (2008)
  • Author(s): Yoshio Okamoto
  • Journal Title: Discrete Optimization 5 Pages: 1-18
  • Peer Reviewed
• [Journal Article] Counting the number of independent sets in chordal graphs (2008)
  • Author(s): Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara
  • Journal Title: Journal of Discrete Algorithms 6 Pages: 229-242
  • NAID: 120001063231
  • Peer Reviewed
• [Journal Article] Local topology of the free complex of a two-dimensional generalized convex shelling (2008)
  • Author(s): Yoshio Okamoto
  • Journal Title: Discrete Mathematics 308 Pages: 3836-3846
  • Peer Reviewed
• [Journal Article] On listing, sampling, and counting the chordal graphs with edge constraints (2008)
  • Author(s): Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno
  • Journal Title: Lecture Notes in Computer Science 5092 Pages: 458-467
  • Peer Reviewed
• [Journal Article] Improved bounds for wireless localization (2008)
  • Author(s): Tobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno
  • Journal Title: Lecture Notes in Computer Science 5124 Pages: 77-89
  • Peer Reviewed
• [Journal Article] Fair cost allocations under conflicts : a game-theoretic point of view (2008)
  • Author(s): Yoshio Okamoto
  • Journal Title: Discrete Optimization 5 Pages: 1-18
  • Peer Reviewed
• [Journal Article] Moving vertices to make drawings plane (2008)
  • Author(s): Xavier Goaoc, Jan Kratochvil, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff
  • Journal Title: Lecture Notes in Computer Science 4875 Pages: 101-112
  • Peer Reviewed
• [Journal Article] Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs. (2007)
  • Author(s): Yota Otachi, Yoshio Okamoto, Koichi Yamazaki
  • Journal Title: Discrete Applied Mathematics 155 Pages: 2383-2390
  • Peer Reviewed
• [Journal Article] Matroid representation of clique complexes (2007)
  • Author(s): Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno
  • Journal Title: Discrete Applied Mathematics 155 Pages: 1910-1929
  • Peer Reviewed
• [Journal Article] Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs (2007)
  • Author(s): Yota Otachi, Yoshio Okamoto, Koichi Yamazaki
  • Journal Title: Discrete Applied Mathematics 155 Pages: 2383-2390
  • Peer Reviewed
• [Journal Article] A polynomial-time-delay polynomial-space algorithm for enumeration problems in multi-criteria optimization (2007)
  • Author(s): Yoshio Okamoto, Takeaki Uno
  • Journal Title: Lecture Notes in Computer Science 4835 Pages: 609-620
  • Peer Reviewed
• [Journal Article] Fast exponential-time algorithms for the forest counting in graph classes (2007)
  • Author(s): Heidi Gebauer, Yoshio Okamoto
  • Journal Title: Conferences in Research and Practice in Information Technology 65 Pages: 63-69
  • NAID: 110004824073
• [Journal Article] The even outdegree conjecture for acyclic PLCP-cubes in dimension five. (2006)
  • Author(s): Sonoko Moriyama, Yoshio Okamoto
  • Journal Title: IEICE Transactions on Information and Systems E89-D Pages: 2402-2404
  • NAID: 110007538527
  • Peer Reviewed
• [Journal Article] Core stability of minimum coloring games. (2006)
  • Author(s): Thomas Bietenhader, Yoshio Okamoto
  • Journal Title: Mathematics of Operations Research 31 Pages: 418-431
  • Peer Reviewed
• [Journal Article] The minimum weight triangulation problem with few inner points. (2006)
  • Author(s): Michael Hoffmann, Yoshio Okamoto
  • Journal Title: Computational Geometry: Theory and Applications 34 Pages: 149-158
  • Peer Reviewed
• [Journal Article] The even outdegree conjecture for acyclic PLCP-cubes in dimension five (2006)
  • Author(s): Sonoko Moriyama, Yoshio Okamoto
  • Journal Title: IEICE Transactions on Information and Systems E89-D Pages: 2402-2404
  • NAID: 110007538527
• [Journal Article] Core stability of minimum coloring games (2006)
  • Author(s): Thomas Bietenhader, Yoshio Okamoto
  • Journal Title: Mathematics of Operations Research 31 Pages: 418-431
• [Journal Article] The minimum weight triangulation problem with few inner points (2006)
  • Author(s): Michael Hoffmann, Yoshio Okamoto
  • Journal Title: Computational Geometry : Theory and Applications 34 Pages: 149-158
• [Presentation] The geodesic diameter of polygonal domains (2010)
  • Author(s): 岡本吉央
  • Organizer: コンピュテーション研究会
  • Place of Presentation: 国立情報学研究所
  • Year and Date: 2010-03-12
• [Presentation] 嘘を含む比較による最小値最大値発見アルゴリズム (2010)
  • Author(s): 岡本吉央
  • Organizer: 2009年度冬のLAシンポジウム
  • Place of Presentation: 京都大学理学研究科
  • Year and Date: 2010-02-03
• [Presentation] 嘘を含む比較による最小値最大値発見アルゴリズム (2010)
  • Author(s): 岡本吉央
  • Organizer: コンピュテーション研究会
  • Place of Presentation: 九州大学西新プラザ
  • Year and Date: 2010-01-25
• [Presentation] Querying two boundary points for shortest paths in a polygonal domain. (2009)
  • Author(s): ang Won Bae, Yoshio Okamoto
  • Organizer: 20th International Symposium on Algorithms and Computation (ISAAC 2009)
  • Place of Presentation: Ala Moana Hotel, Hawaii, USA
  • Year and Date: 2009-12-18
• [Presentation] Querying two boundary points for shortest paths in a polygonal domain (2009)
  • Author(s): Yoshio Okamoto
  • Organizer: 20^<th> International Symposium on Algorithms and Computation
  • Place of Presentation: アラモワナ・ホテル(アメリカ)
  • Year and Date: 2009-12-18
• [Presentation] On the geodesic diameter in polygonal domains. (2009)
  • Author(s): Sang Won Bae, Matias Korman, Yoshio Okamoto
  • Organizer: Japan Conference on Computational Geometry and Graphs (JCCGG 2009)
  • Place of Presentation: 金沢市文化ホール
  • Year and Date: 2009-11-11
• [Presentation] A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets. (2009)
  • Author(s): Kevin Buchin, Radoslav Fulek, Masashi Kiyomi, Yoshio Okamoto, Shin-ichi Tanigawa, Csaba D. Toth
  • Organizer: Japan Conference on Computational Geometry and Graphs (JCCGG 2009)
  • Place of Presentation: 金沢市文化ホール
  • Year and Date: 2009-11-11
• [Presentation] A tight lower bound for convexly independent subsets of the Minkowskisums of planar point sets (2009)
  • Author(s): Yoshio Okamoto
  • Organizer: Japan Conference on Computational Geometry and Graphs
  • Place of Presentation: 金沢市文化ホール
  • Year and Date: 2009-11-11
• [Presentation] アルゴリズムに対する10の誤解-ソーティングを巡って (2009)
  • Author(s): 岡本吉央
  • Organizer: KSMAP合宿in明日香村
  • Place of Presentation: 関西大学明日香文化研究所
  • Year and Date: 2009-10-11
• [Presentation] 協力ゲーム理論におけるアルゴリズム (2009)
  • Author(s): 岡本吉央
  • Organizer: 第8回情報科学技術フォーラム
  • Place of Presentation: 東北工業大学
  • Year and Date: 2009-09-02
• [Presentation] A provably efficient algorithm for the multicriteria linear programming. (2009)
  • Author(s): Yoshio Okamoto, Takeaki Uno
  • Organizer: 20th International Symposium on Mathematical Programming (ISMP 2009)
  • Place of Presentation: University of Chicago, IL, USA
  • Year and Date: 2009-08-26
• [Presentation] A provably efficient algorithm for the multicriteria linear programming (2009)
  • Author(s): Yoshio Okamoto
  • Organizer: 20^<th> International Symposium on Mathematical Programming
  • Place of Presentation: University of Chicago(アメリカ)
  • Year and Date: 2009-08-26
• [Presentation] How to make a picturesque maze. (2009)
  • Author(s): Yoshio Okamoto, Ryuhei Uehara
  • Organizer: 21st Canadian Conference on Computational Geometry (CCCG 2009)
  • Place of Presentation: University of British Columbia, Canada
  • Year and Date: 2009-08-18
• [Presentation] How to make a picturesque maze (2009)
  • Author(s): Yoshio Okamoto
  • Organizer: 21^<st> Canadian Conference on Computational Geometry
  • Place of Presentation: ブリティッシュ・コロンビア大学(カナダ)
  • Year and Date: 2009-08-18
• [Presentation] 固定パラメータ・アルゴリズムの設計法 (2009)
  • Author(s): 岡本吉央
  • Organizer: 京都大学数理解析研究所共同研究「組合せ最適化セミナー」
  • Place of Presentation: 東京工業大学
  • Year and Date: 2009-07-27
• [Presentation] Querying two boundary points for shortest paths in a polygonal domain (2009)
  • Author(s): Yoshio Okamoto
  • Organizer: 2009年夏のLAシンポジウム
  • Place of Presentation: かんぽの宿 松島
  • Year and Date: 2009-07-23
• [Presentation] Discrete geometry of multi-criteria optimization problems. (2009)
  • Author(s): Yoshio Okamoto
  • Organizer: Canada-Japan Workshop on Discrete and Computational Geometry
  • Place of Presentation: 東京大学
  • Year and Date: 2009-07-14
• [Presentation] Discrete geometry of multi-criteria optimization problems (2009)
  • Author(s): Yoshio Okamoto
  • Organizer: Canada-Japan Workshop on Discrete and Computational Geometry
  • Place of Presentation: 東京大学
  • Year and Date: 2009-07-14
• [Presentation] Counting the number of matchings in chordal and chordal bipartite graph classes (2009)
  • Author(s): 岡本吉央
  • Organizer: 電子情報通信学会コンピュテーション研究会
  • Place of Presentation: 北海道大学
  • Year and Date: 2009-06-29
• [Presentation] Counting the number of matchings in chordal and chordal bipartite graph classes. (2009)
  • Author(s): Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno
  • Organizer: 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009)
  • Place of Presentation: Centre Rabelais, Montpellier, France
  • Year and Date: 2009-06-26
• [Presentation] Adaptive algorithms for planar convex hull problems (2009)
  • Author(s): Yoshio Okamoto
  • Organizer: Dagstuhl Seminar 09171 "Adaptive, Output Sensitive, Online and Parameterized Algorithms"
  • Place of Presentation: Schloss Dagstuhi(ドイツ)
  • Year and Date: 2009-04-22
• [Presentation] Adaptive algorithms for the planar convex hull problems. (2009)
  • Author(s): Hee-Kap Ahn, Yoshio Okamoto
  • Organizer: 2nd AAAC Annual Meeting
  • Place of Presentation: Hangzhou Huajia SHAN Resort, Hangzhou, People Republic of China
  • Year and Date: 2009-04-11
• [Presentation] Natural wireless localization is NP-hard. (2009)
  • Author(s): Tobias Christ, Michael Hoffmann, Yoshio Okamoto
  • Organizer: 25th European Workshop on Computational Geometry (EuroCG 2009)
  • Place of Presentation: Universite Libre de Bruxelles, Brussels, Belgium
  • Year and Date: 2009-03-17
• [Presentation] フロベニウス数のはなし (2009)
  • Author(s): 岡本吉央
  • Organizer: 第5回組合せ論若手研究集会
  • Place of Presentation: 慶應義塾大学矢上キャンパス
  • Year and Date: 2009-02-05
• [Presentation] 絵画的迷路の作り方 (2009)
  • Author(s): 岡本吉央
  • Organizer: 2008年度冬のLAシンポジウム
  • Place of Presentation: 京都大学数理解析研究所
  • Year and Date: 2009-02-02
• [Presentation] 木分解とグラフ・アルゴリズム(最適化と数え上げ) (2008)
  • Author(s): 岡本吉央
  • Organizer: 第11回情報論的学習理論ワークショップ(IBIS2008)
  • Place of Presentation: 仙台国際センター
  • Year and Date: 2008-10-30
• [Presentation] Adaptive computational geometry. (2008)
  • Author(s): Hee-Kap Ahn, Yoshio Okamoto
  • Organizer: RIMS Workshop on Computational Geometry and Discrete Mathematics
  • Place of Presentation: 京都大学
  • Year and Date: 2008-10-18
• [Presentation] Adaptive computational geometry (2008)
  • Author(s): Yoshio Okamoto
  • Organizer: Kyoto RIMS Workshop on Computational Geometry and Discrete Mathematics
  • Place of Presentation: 京都大学数理解析研究所
  • Year and Date: 2008-10-18
• [Presentation] Drawing binary tanglegrams. (2008)
  • Author(s): Yoshio Okamoto
  • Organizer: RIMS Workshop on Acceleration and Visualization of Computation for Enumeration Problems
  • Place of Presentation: 京都大学
  • Year and Date: 2008-09-30
• [Presentation] Drawing binary tanglegrams (2008)
  • Author(s): Yoshio Okamoto
  • Organizer: Kyoto RIMS Workshop on Acceleration and Visualization of Computation for Enumeration Problems
  • Place of Presentation: 京都大学数理解析研究所
  • Year and Date: 2008-09-30
• [Presentation] binary tanglegrams: Hardness, approximation, fixed-parameter tractability. (2008)
  • Author(s): Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Marin Nollenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff
  • Organizer: 16th International Symposium on Graph Drawing (GD 2008)
  • Place of Presentation: Aldemar Knossos Royal Village Hotel, Hersonissos, Crete, Greece
  • Year and Date: 2008-09-24
• [Presentation] ナッシュ均衡計算の複雑さ (2008)
  • Author(s): 岡本吉央
  • Organizer: 第5回日本オペレーションズ・リサーチ学会中部支部シンポジウム「インターネット時代のゲーム理論」
  • Place of Presentation: 第二豊田ビル(名古屋)
  • Year and Date: 2008-09-05
• [Presentation] Tutte多項式計算の厳密アルゴリズム (2008)
  • Author(s): 岡本吉央
  • Organizer: 日本オペレーションズ・リサーチ学会「計算と最適化」研究部会
  • Place of Presentation: 産業技術大学院大学
  • Year and Date: 2008-08-02
• [Presentation] On algorithmic enumeration of higher-order Delaunay triangulations. (2008)
  • Author(s): Yusuke Abe, Yoshio Okamoto
  • Organizer: 11th Japan-Korea Joint Workshop on Algorithms and Computation
  • Place of Presentation: 九州大学
  • Year and Date: 2008-07-20
• [Presentation] Improved bounds for wireless localization. (2008)
  • Author(s): Tobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno
  • Organizer: 11th Scandinavian Workshop on Algorithm Theory (SWAT 2008)
  • Place of Presentation: Scandic Opalen Conference Center, Goteborg, Sweden
  • Year and Date: 2008-07-02
• [Presentation] Submodularity of minimum- cost spanning tree games. (2008)
  • Author(s): Masayuki Kobayashi, Yoshio Okamoto
  • Organizer: 1st AAAC Annual Meeting
  • Place of Presentation: University of Hong Kong
  • Year and Date: 2008-04-26
• [Presentation] Submodularity of minimum-cost spanning tree games (2008)
  • Author(s): Yoshio Okamoto
  • Organizer: 1^<st> AAAC Annual Meeting
  • Place of Presentation: University of Hong Kong(香港)
  • Year and Date: 2008-04-26
• [Presentation] 組合せ最適化理論の三次元描像 (2008)
  • Author(s): 岡本吉央
  • Organizer: 第21回回路とシステム軽井沢ワークショップ
  • Place of Presentation: 軽井沢プリンスホテルウエスト
  • Year and Date: 2008-04-21
• [Presentation] On listing, sampling, and counting the chordal graphs with edge constraints. (2008)
  • Author(s): Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno
  • Organizer: 14th Annual International Computing and Combinatorics Conference (COCOON 2008)
  • Place of Presentation: Mercure Teda Dalian Hotel, Dalian, People Republic of China
• [Presentation] A polynomial-time-delay polynomial- space algorithm for enumeration problems in multi-criteria optimization. (2007)
  • Author(s): Yoshio Okamoto, Takeaki Uno
  • Organizer: 18th International Symposium on Algorithms and Computation (ISAAC 2007)
  • Place of Presentation: 仙台エクセルホテル東急
  • Year and Date: 2007-12-19
• [Presentation] A polynomial-time-delay polynomial-space algorithm for enumeration problems in multi-criteria optimization (2007)
  • Author(s): Yoshio Okamoto
  • Organizer: 18^<th> International Symposium on Algorithms and Computation
  • Place of Presentation: 仙台エクセルホテル東急
  • Year and Date: 2007-12-19
• [Presentation] Moving vertices to make drawings plane. (2007)
  • Author(s): Xavier Goaoc, Jan Kratochvil, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff
  • Organizer: 15th International Symposium on Graph Drawing (GD 2007)
  • Place of Presentation: Swiss-Grand Resort & Spa Bondi Beach, Sydney, Australia
  • Year and Date: 2007-09-24
• [Presentation] Moving vertices to make drawings plane (2007)
  • Author(s): Yoshio Okamoto
  • Organizer: 15^<th> International Conference on Graph Drawing
  • Place of Presentation: Swiss-Grand Resort & Spa Bondi Beach, オーストラリア
  • Year and Date: 2007-09-24
• [Presentation] Hardness of separating a bicolored point set by spheres. (2007)
  • Author(s): Yoshio Okamoto
  • Organizer: 6th Slovenian International Conference on Graph Theory
  • Place of Presentation: Best Western Kompas Hotel Bled, Slovenia
  • Year and Date: 2007-06-25
• [Presentation] Hardness of separating a bicolored point set by spheres (2007)
  • Author(s): Yoshio Okamoto
  • Organizer: 6^<th> Slovenian International Conference on Graph Theory
  • Place of Presentation: Best Western Kompas Hotel Bled, スロベニア
  • Year and Date: 2007-06-25
• [Presentation] Separating a bicolored point set by spheres. (2007)
  • Author(s): Yoshio Okamoto, Hideki Tsubouchi
  • Organizer: Kyoto International Conference on Computational Geometry and Graph Theory in honor of Jin Akiyama and Vasek Chvatal on their 60th birthdays.
  • Place of Presentation: 京都大学
  • Year and Date: 2007-06-11
• [Presentation] Separating a bicolored point set by spheres (2007)
  • Author(s): Yoshio Okamoto
  • Organizer: Kyoto International Conference on Computational Geometry and Graph Theory
  • Place of Presentation: 京都大学
  • Year and Date: 2007-06-11
• [Presentation] A provably efficient algorithm for the multi-criteria linear programming. (2007)
  • Author(s): Yoshio Okamoto, Takeaki Uno
  • Organizer: 5th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications
  • Place of Presentation: 東北大学
  • Year and Date: 2007-04-03
• [Presentation] A provably efficient algorithm for the multi-criteria linear programming (2007)
  • Author(s): Yoshio Okamoto
  • Organizer: 5^<th> Hungarian-Japanese Symposium on Discrete Mathematics and Applications
  • Place of Presentation: 東北大学
  • Year and Date: 2007-04-03
• [Presentation] Fast exponential-time algorithms for the forest counting in graph classes. (2007)
  • Author(s): Heidi Gebauer, Yoshio Okamoto
  • Organizer: 13th Computing: The Australasian Theory Symposium (CATS 2007)
  • Place of Presentation: University of Ballarat, Ballarat, Australia
  • Year and Date: 2007-02-01
• [Presentation] Fast exponential-time algorithms for the forest counting in graph classes (2006)
  • Author(s): Heidi Gebauer, Yoshio Okamoto
  • Organizer: ICALP'06 Affiliated Workshop "Improving Exponential Time Algorithms. "
  • Place of Presentation: S. Servolo, Venice, Italy
  • Year and Date: 2006-07-16
• [Presentation] Algorithms for the full Steiner tree problem. (2006)
  • Author(s): Takehiro Ito, Yoshio Okamoto, Takeshi Tokuyama
  • Organizer: ICALP'06 Affiliated Workshop "Improving Exponential Time Algorithms. "
  • Place of Presentation: S. Servolo, Venice, Italy
  • Year and Date: 2006-07-16
• [Book] Encyclopedia of Algorithms (2008)
  • Author(s): Ming-Yang Kao(編).Ybshio Okamoto(分担執筆), 分担執筆者他多数
  • Total Pages: 1166
  • Publisher: Springer