Mathematical Approaches to Reliable Exact Computation and Its Theoretical Guarantee

• Project/Area Number: 24700008
• Research Category: Grant-in-Aid for Young Scientists (B)
• Allocation Type: Multi-year Fund
• Research Field: Fundamental theory of informatics
• Research Institution: The University of Electro-Communications
• Principal Investigator: Okamoto Yoshio 電気通信大学, 情報理工学(系)研究科, 准教授 (00402660)
• Project Period (FY): 2012-04-01 – 2016-03-31
• Project Status: Completed (Fiscal Year 2015)
• Budget Amount: ¥4,420,000 (Direct Cost: ¥3,400,000、Indirect Cost: ¥1,020,000); Fiscal Year 2014: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000); Fiscal Year 2013: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000); Fiscal Year 2012: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
• Keywords: アルゴリズム / 計算理論 / 離散数学 / アルゴリズム理論

Outline of Final Research Achievements

Results on theory of algorithms and computational complexity with exact theoretical guarantees have been obtained, including those below. (1) Relationship among several problems with respect to exponential-time complexity has been revealed, which opened up a new direction in the field. (2) Improvement has been obtained for finding the maximum and the minimum by unreliable comparisons. (3) The labeled token swapping problem has been shown to be NP-complete, 4-approximable for general graphs and 2-approximable for trees.

Research Products

• [Journal Article] A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares (2016)
  • Author(s): Takehiro Ito, Shin-ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno,
  • Journal Title: Computational Geometry: Theory and Applications Volume: 51 Pages: 25-39
  • DOI: 10.1016/j.comgeo.2015.10.004
  • NAID: 120005954496
  • Peer Reviewed
• [Journal Article] On the treewidth of toroidal grids (2016)
  • Author(s): Yoshio Okamoto, Masashi Kiyomi, and Yota Otachi
  • Journal Title: Discrete Applied Mathematics Volume: 198 Pages: 303-306
  • DOI: 10.1016/j.dam.2015.06.027
  • Peer Reviewed
• [Journal Article] Computing the L1 Geodesic Diameter and Center of a Polygonal Domain (2016)
  • Author(s): Sang Won Bae, Matias Korman, Joseph Mitchell, Yoshio Okamoto, Valentin Polishchuk, and Haitao Wang
  • Journal Title: Proceedings of 33rd International Symposium on Theoretical Aspects of Computer Science (STACS 2016) Volume: ---
  • DOI: 10.4230/LIPIcs.STACS.2016.14
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Extended formulations for sparsity matroids (2016)
  • Author(s): Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh, Shuji Kijima, and Yoshio Okamoto
  • Journal Title: Mathematical Programming Volume: 印刷中 Issue: 1-2 Pages: 565-574
  • DOI: 10.1007/s10107-015-0936-8
  • Peer Reviewed
• [Journal Article] Computing the Geodesic Centers of a Polygonal Domain (2016)
  • Author(s): Sang Won Bae, Matias Korman, and Yoshio Okamoto
  • Journal Title: Computational Geometry: Theory and Applications Volume: 印刷中 Pages: 3-9
  • DOI: 10.1016/j.comgeo.2015.10.009
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] On problems as hard as CNF-SAT (2016)
  • Author(s): Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, and Magnus Wahlström
  • Journal Title: ACM Transactions on Algorithms Volume: 印刷中
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Efficient Stabilization of Cooperative Matching Games (2016)
  • Author(s): Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
  • Journal Title: Proceedings of 15th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2016) Volume: 印刷中
  • Peer Reviewed
• [Journal Article] Tight Exact and Approximate Algorithmic Results on Token Swapping (2016)
  • Author(s): ask others Tillmann Miltzow, Lothar Narins, Yoshio Okamoto, Günter Rote, Antonis Thomas, Takeaki Uno
  • Journal Title: arXiv:1602.05150 [cs.CC] Volume: ---
  • Int'l Joint Research
• [Journal Article] Computing the L1 geodesic diameter and center of a simple polygon in linear time. (2015)
  • Author(s): S. W. Bae, M. Korman, Y. Okamoto, and H. Wang.
  • Journal Title: Computational Geometry: Theory and Applications Volume: 48(6) Issue: 6 Pages: 495-505
  • DOI: 10.1016/j.comgeo.2015.02.005
  • Peer Reviewed / Int'l Joint Research / Acknowledgement Compliant
• [Journal Article] Swapping Labeled Tokens on Graphs (2015)
  • Author(s): Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno
  • Journal Title: Theoretical Computer Science Volume: 印刷中 Pages: 81-94
  • DOI: 10.1016/j.tcs.2015.01.052
  • Peer Reviewed / Open Access / Acknowledgement Compliant
• [Journal Article] Free edge lengths in plane graphs (2015)
  • Author(s): Zachary Abel, Robert Connelly, Sarah Eisenstat, Radoslav Fulek, Filip Morić, Yoshio Okamoto, Tibor Szabó, and Csaba Tóth
  • Journal Title: Discrete & Computational Geometry Volume: 54 Issue: 1 Pages: 259-289
  • DOI: 10.1007/s00454-015-9704-z
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Submodularity of minimum-cost spanning tree games (2014)
  • Author(s): Masayuki Kobayashi, Yoshio Okamoto
  • Journal Title: Networks Volume: 63 Issue: 3 Pages: 231-238
  • DOI: 10.1002/net.21540
  • Peer Reviewed
• [Journal Article] Computational Complexity and an Integer Programming Model of Shakashaka (2014)
  • Author(s): Erik D. Demaine, Yoshio Okamoto, Ryuhei Uehara, Yushi Uno
  • Journal Title: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Volume: E97.A Issue: 6 Pages: 1213-1219
  • DOI: 10.1587/transfun.E97.A.1213
  • NAID: 130004770851
  • ISSN: 0916-8508, 1745-1337
  • Peer Reviewed
• [Journal Article] A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks (2014)
  • Author(s): Takehiro Ito, Shin-ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
  • Journal Title: Theoretical Computer Science Volume: 544 Pages: 14-31
  • DOI: 10.1016/j.tcs.2014.04.014
  • NAID: 120005893622
  • Peer Reviewed
• [Journal Article] Free edge lengths in plane graphs (2014)
  • Author(s): Zachary Abel, Robert Connelly, Sarah Eisenstat, Radoslav Fulek, Filip Morić, Yoshio Okamoto, Tibor Szabó, Csaba Tóth
  • Journal Title: Proceedings of 30th Annual Symposium on Computational Geometry Volume: 無 Pages: 426-435
  • DOI: 10.1145/2582112.2582172
  • Peer Reviewed
• [Journal Article] Weight Balancing on Boundaries and Skeletons (2014)
  • Author(s): Luis Barba, Otfried Cheong, Jean-Lou De Carufel, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot, Tianhao Wang:
  • Journal Title: Proceedings of 30th Symposium on Computational Geometry Volume: 30 Pages: 436-443
  • DOI: 10.1145/2582112.2582142
  • NAID: 110009804829
  • Peer Reviewed / Acknowledgement Compliant
• [Journal Article] Computing the L_1 Geodesic Diameter and Center of a Simple Polygon in Linear Time (2014)
  • Author(s): Sang Won Bae, Matias Korman, Yoshio Okamoto, Haitao Wang
  • Journal Title: Lecture Notes in Computer Science Volume: 8392 Pages: 120-131
  • DOI: 10.1007/978-3-642-54423-1_11
  • ISBN: 9783642544224, 9783642544231
  • Peer Reviewed
• [Journal Article] Semantic Word Cloud Representations: Hardness and Approximation Algorithms (2014)
  • Author(s): Lukas Barth, Sara Irina Fabrikant, Stephen G. Kobourov, Anna Lubiw, Martin Nollenburg, Yoshio Okamoto, Sergey Pupyrev, Claudio Squarcella, Torsten Ueckerdt, and Alexander Wolff
  • Journal Title: Lecture Notes in Computer Science Volume: 8392 Pages: 514-525
  • DOI: 10.1007/978-3-642-54423-1_45
  • ISBN: 9783642544224, 9783642544231
  • Peer Reviewed
• [Journal Article] Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set (2014)
  • Author(s): Takashi Horiyama, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, and Yukiko Yamauchi
  • Journal Title: Lecture Notes in Computer Science Volume: 8496 Pages: 235-244
  • DOI: 10.1007/978-3-319-07890-8_20
  • NAID: 120005850326
  • ISBN: 9783319078892, 9783319078908
  • Peer Reviewed
• [Journal Article] Swapping Labeled Tokens on Graphs (2014)
  • Author(s): Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, and Takeaki Uno
  • Journal Title: Lecture Notes in Computer Science Volume: 8496 Pages: 369-380
  • DOI: 10.1007/978-3-319-07890-8_31
  • ISBN: 9783319078892, 9783319078908
  • Peer Reviewed
• [Journal Article] Minimum-Cost b-Edge Dominating Sets on Trees (2014)
  • Author(s): Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
  • Journal Title: Lecture Notes in Computer Science Volume: 8889 Pages: 195-207
  • DOI: 10.1007/978-3-319-13075-0_16
  • ISBN: 9783319130743, 9783319130750
  • Peer Reviewed / Acknowledgement Compliant
• [Journal Article] Free edge lengths in plane graphs (2014)
  • Author(s): Zachary Abel, Robert Connelly, Sarah Eisenstat, Radoslav Fulek, Filip Morić, Yoshio Okamoto, Tibor Szabó, and Csaba Tóth
  • Journal Title: Proceedings of 30th Annual Symposium on Computational Geometry Volume: 未定
  • Peer Reviewed
• [Journal Article] Weight balancing on boundaries and skeletons (2014)
  • Author(s): Luis Barba, Otfried Cheong, Jean-Lou De Carufel, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, Janos Pach, Yuan Tang, Takeshi Tokuyama, and Sander Verdonschot, Tianhao Wang
  • Journal Title: Proceedings of 30th Annual Symposium on Computational Geometry Volume: 未定
  • NAID: 110009804829
  • Peer Reviewed
• [Journal Article] Computational complexity and an integer programming model of Shakashaka (2014)
  • Author(s): Erik D. Demaine, Yoshio Okamoto, Ryuhei Uehara, and Yushi Uno
  • Journal Title: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Volume: 未定
  • NAID: 130004770851
  • Peer Reviewed
• [Journal Article] Extended formulations for sparsity matroids (2014)
  • Author(s): Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh, Shuji Kijima, and Yoshio Okamoto
  • Journal Title: ArXiv Preprint Volume: 1403.7272
• [Journal Article] Approximating the path-distance-width for AT-free graphs and graphs in related classes (2013)
  • Author(s): Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, and Koichi Yamazaki
  • Journal Title: Discrete Applied Mathematics Volume: -- Pages: 69-77
  • DOI: 10.1016/j.dam.2012.11.015
  • Peer Reviewed
• [Journal Article] The complexity of the stamp folding problem (2013)
  • Author(s): Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito, and Yoshio Okamoto
  • Journal Title: Theoretical Computer Science Volume: -- Pages: 13-19
  • DOI: 10.1016/j.tcs.2012.08.006
  • Peer Reviewed
• [Journal Article] Exact and fixed-parameter algorithms for metro-line crossing minimization problems (2013)
  • Author(s): Yoshio Okamoto, Yuichi Tatsu, and Yushi Uno
  • Journal Title: Lecture Notes in Computer Science Volume: 8242 Pages: 520-521
  • Peer Reviewed
• [Journal Article] Computational complexity and an integer programming model of Shakashaka (2013)
  • Author(s): Erik D. Demaine, Yoshio Okamoto, Ryuhei Uehara, Yushi Uno
  • Journal Title: Proceedings of CCCG 2013 Volume: なし
  • NAID: 130004770851
  • Peer Reviewed
• [Journal Article] General Constructions of Rational Secret Sharing with Expected Constant-Round Reconstruction (2013)
  • Author(s): Akinori Kawachi, Yoshio Okamoto, Keisuke Tanaka, Kenji Yasunaga
  • Journal Title: IACR Cryptology ePrint Archive Volume: 2013/874
• [Journal Article] ペンシルパズル「シャカシャカ」の計算複雑さと整数計画モデル (2013)
  • Author(s): Erik Demaine, 岡本吉央，上原隆平，宇野裕之
  • Journal Title: 信学技法 Volume: 113(14) Pages: 43-48
• [Journal Article] グラフを通したパズル・ゲームの一般化 (2013)
  • Author(s): 岡本 吉央
  • Journal Title: オペレーションズ・リサーチ Volume: 53(3) Pages: 161-166
  • NAID: 110009594408
• [Journal Article] 費用2種類の施設配置ゲームの仁とシャープレイ値の計算について (2013)
  • Author(s): 並河 雄紀，岡本 吉央，大舘 陽太
  • Journal Title: 情報処理学会研究報告 アルゴリズム Volume: 2013-AL-143(3) Pages: 1-8
  • NAID: 110009550136
• [Journal Article] Querying two boundary points for shortest paths in a polygonal domain (2012)
  • Author(s): Sang Won Bae
  • Journal Title: Computational Geometry: Theory and Applications Volume: 45 Issue: 7 Pages: 284-293
  • DOI: 10.1016/j.comgeo.2012.01.012
  • Peer Reviewed
• [Journal Article] Vertex angle and crossing angle resolution of leveled tree drawings (2012)
  • Author(s): Walter Didimo
  • Journal Title: Information Processing Letters Volume: 112 Issue: 16 Pages: 630-635
  • DOI: 10.1016/j.ipl.2012.05.006
  • Peer Reviewed
• [Journal Article] Minimum and maximum against k lies (2012)
  • Author(s): Michael Hoffmann, Jiri Matousek, Yoshio Okamoto, and Philipp Zumstein
  • Journal Title: Chicago Journal of Theoretical Computer Science Volume: 2012 Issue: 1 Pages: 1-10
  • DOI: 10.4086/cjtcs.2012.002
  • NAID: 110008004173
  • Peer Reviewed
• [Journal Article] Reverse preferential spread in complex networks (2012)
  • Author(s): H.Toyoizumi, S.Tani, N.Miyoshi and Y. Okamoto
  • Journal Title: Physical Review E Volume: Vol.86 Issue: 2 Pages: 21103-21103
  • DOI: 10.1103/physreve.86.021103
  • Peer Reviewed
• [Journal Article] On bipartite powers of bigraphs (2012)
  • Author(s): Yoshio Okamoto, Yota Otachi, and Ryuhei Uehara
  • Journal Title: Discrete Mathematics & Theoretical Computer Science Volume: 14 Pages: 11-20
  • NAID: 120005147908
  • Peer Reviewed
• [Journal Article] Efficient enumeration of the directed binary perfect phylogenies from incomplete data (2012)
  • Author(s): Masashi Kiyomi, Yoshio Okamoto, and Toshiki Saitoh
  • Journal Title: Lecture Notes in Computer Science Volume: 7276 Pages: 248-259
  • DOI: 10.1007/978-3-642-30850-5_22
  • NAID: 110009588447
  • ISBN: 9783642308499, 9783642308505
  • Peer Reviewed
• [Journal Article] A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares (2012)
  • Author(s): Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, and Yushi Uno
  • Journal Title: Lecture Notes in Computer Science Volume: 7357 Pages: 24-35
  • DOI: 10.1007/978-3-642-31155-0_3
  • NAID: 120005954496
  • ISBN: 9783642311543, 9783642311550
  • Peer Reviewed / Open Access
• [Journal Article] On problems as hard as CNF-SAT (2012)
  • Author(s): Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, and Magnus Wahlström
  • Journal Title: Proceedings of 27th IEEE Conference on Computational Complexity Volume: -- Pages: 74-84
  • DOI: 10.1109/ccc.2012.36
  • Peer Reviewed
• [Journal Article] A 4.31-approximation for the geometric unique coverage problem on unit disks (2012)
  • Author(s): Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, and Yushi Uno
  • Journal Title: Lecture Notes in Computer Science Volume: 7676 Pages: 372-381
  • DOI: 10.1007/978-3-642-35261-4_40
  • NAID: 120005893622
  • ISBN: 9783642352607, 9783642352614
  • Peer Reviewed
• [Journal Article] Universal point subsets for planar graphs (2012)
  • Author(s): Patrizio Angelini, Carla Binucci, William Evans, Ferran Hurtado, Giuseppe Liotta Tamara Mchedlidze, Henk Meijer, and Yoshio Okamoto
  • Journal Title: Lecture Notes in Computer Science Volume: 7676 Pages: 423-432
  • DOI: 10.1007/978-3-642-35261-4_45
  • ISBN: 9783642352607, 9783642352614
  • Peer Reviewed
• [Journal Article] Area bounds of rectilinear polygons realized by angle sequences (2012)
  • Author(s): Sang Won Bae, Yoshio Okamoto, and Chan-Su Shin
  • Journal Title: Lecture Notes in Computer Science Volume: 7676 Pages: 629-638
  • DOI: 10.1007/978-3-642-35261-4_65
  • ISBN: 9783642352607, 9783642352614
  • Peer Reviewed
• [Journal Article] 不完全データと矛盾しない有向二値完全系統樹を列挙する効率的手法 (2012)
  • Author(s): 清見 礼，岡本 吉央，斎藤 寿樹
  • Journal Title: 信学技法 Volume: 112(93) Pages: 17-24
  • NAID: 110009588447
• [Journal Article] 施設配置ゲームにおける仁・シャープレイ値の計算について (2012)
  • Author(s): 並河 雄紀，岡本 吉央，大舘 陽太
  • Journal Title: 信学技法 Volume: 112(272) Pages: 25-32
  • NAID: 110009636909
• [Journal Article] 『計算機科学者のためのゲーム理論入門』シリーズについて (2012)
  • Author(s): 横尾 真，岩崎 敦，櫻井 祐子，岡本 吉央
  • Journal Title: コンピュータ ソフトウェア Volume: 29
  • NAID: 10030311272
  • Peer Reviewed
• [Journal Article] 『計算機科学者のためのゲーム理論入門』シリーズ第1回 非協力ゲーム（基礎編） (2012)
  • Author(s): 横尾 真，岩崎 敦，櫻井 祐子，岡本 吉央
  • Journal Title: コンピュータ ソフトウェア Volume: 29
  • Peer Reviewed
• [Journal Article] 『計算機科学者のためのゲーム理論入門』シリーズ第2回 非協力ゲーム（発展編） (2012)
  • Author(s): 横尾 真，岩崎 敦，櫻井 祐子，岡本 吉央
  • Journal Title: コンピュータ ソフトウェア Volume: 29
  • Peer Reviewed
• [Journal Article] 『計算機科学者のためのゲーム理論入門』シリーズ第2回 メカニズムデザイン (2012)
  • Author(s): 横尾 真，岩崎 敦，櫻井 祐子，岡本 吉央
  • Journal Title: コンピュータ ソフトウェア Volume: 29
  • Peer Reviewed
• [Presentation] ネットワーク型交渉ゲームの安定化アルゴリズム (2016)
  • Author(s): 伊藤健洋，垣村尚徳，神山直之，小林佑輔，岡本吉央
  • Organizer: 第157回情報処理学会アルゴリズム研究会
  • Place of Presentation: 電気通信大学 (東京都調布市)
  • Year and Date: 2016-03-06
• [Presentation] Non-Planar Graph Drawing (2015)
  • Author(s): 岡本 吉央
  • Organizer: トポロジーとコンピュータ2015
  • Place of Presentation: 日本大学文理学部 (東京都世田谷区)
  • Year and Date: 2015-11-07
  • Invited
• [Presentation] 行列の分解と組合せ最適化問題の拡張定式化 (2015)
  • Author(s): 岡本 吉央
  • Organizer: RIMS共同研究「組合せ最適化セミナー」
  • Place of Presentation: 京都大学数理解析研究所 (京都府京都市)
  • Year and Date: 2015-07-23
  • Invited
• [Presentation] 木における最小費用b-辺支配集合問題 (2015)
  • Author(s): 伊藤健洋，垣村尚徳，神山直之，小林佑輔，岡本吉央
  • Organizer: 日本オペレーションズ・リサーチ学会2015年春季研究発表会
  • Place of Presentation: 東京理科大学
  • Year and Date: 2015-03-26
• [Presentation] Minimum-Cost b-Edge Dominating Sets on Trees (2015)
  • Author(s): Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
  • Organizer: 第152回情報処理学会アルゴリズム研究会
  • Place of Presentation: 電気通信大学
  • Year and Date: 2015-03-03
• [Presentation] 境界上の重みの釣合せ (2014)
  • Author(s): 河村彰星，岡本吉央，徳山豪
  • Organizer: 日本数学会2014年度秋季総合分科会
  • Place of Presentation: 広島大学
  • Year and Date: 2014-09-25
• [Presentation] Extended Formulations for Sparsity Matroids (2014)
  • Author(s): Yoshio Okamoto
  • Organizer: The fifth Cargese Workshop on Combinatorial Optimization
  • Place of Presentation: Institut d'Etudes Scientifiques de Cargese (フランス)
  • Year and Date: 2014-09-12
• [Presentation] Computing the Geodesic Centers of a Polygonal Domain (2014)
  • Author(s): Sang Won Bae, Matias Korman, Yoshio Okamoto
  • Organizer: 26th Canadian Conference on Computational Geometry
  • Place of Presentation: ダルハウジー大学（カナダ）
  • Year and Date: 2014-08-11
• [Presentation] Computing the Geodesic Centers of a Polygonal Domain (2014)
  • Author(s): Sang Won Bae, Matias Korman, Yoshio Okamoto
  • Organizer: 17th Korea-Japan Joint Workshop on Algorithms and Computation
  • Place of Presentation: 沖縄コンベンションセンター
  • Year and Date: 2014-07-13
• [Presentation] Extended Formulations for Sparsity Matroids (2014)
  • Author(s): Yoshio Okamoto
  • Organizer: 7th Combinatorial Algorithms Day
  • Place of Presentation: ETH Zurich (スイス)
  • Year and Date: 2014-06-30
• [Presentation] Swapping Labeled Tokens on Graphs (2014)
  • Author(s): Yoshio Okamoto
  • Organizer: The Japanese-Swiss Workshop on Combinatorics and Computational Geometry
  • Place of Presentation: 東京大学
  • Year and Date: 2014-06-05
  • Invited
• [Presentation] グラフ上のラベル付きトークン整列問題 (2014)
  • Author(s): 山中克久，エリック ドメイン，伊藤健洋，川原純，清見礼，岡 本吉央，斎藤寿樹，鈴木顕，内澤啓，宇野毅明
  • Organizer: 電子情報通信学会コンピュテーション研究会
  • Place of Presentation: 東北大学
  • Year and Date: 2014-04-24
• [Presentation] 疎性マトロイドの拡張定式化 (2014)
  • Author(s): 岩田覚，神山直之，加藤直樹，来嶋秀治，岡本吉央
  • Organizer: 研究集会「最適化：モデリングとアルゴリズム」
  • Place of Presentation: 政策研究大学院大学 （東京都）
• [Presentation] 平面グラフにおける辺長の自由性 (2014)
  • Author(s): 岡本吉央
  • Organizer: 日本数学会2014年度年会
  • Place of Presentation: 学習院大学 (東京都）
  • Invited
• [Presentation] Theory of Computation and Its View to Science (2013)
  • Author(s): Yoshio Okamoto
  • Organizer: KAIST Computer Science & WebST Colloquium Fall 2013
  • Place of Presentation: KAIST （韓国）
  • Invited
• [Presentation] On the treewidth of toroidal grids (2013)
  • Author(s): Masashi Kiyomi, Yoshio Okamoto and Yota Otachi
  • Organizer: 16th Japan Conference on Discrete and Computational Geometry and Graphs
  • Place of Presentation: 東京理科大学 (東京都)
• [Presentation] The inverse barycenter problem (2013)
  • Author(s): Luis Barba, Jean-Lou De Carufel, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot and Tianhao Wang
  • Organizer: 16th Japan Conference on Discrete and Computational Geometry and Graphs
  • Place of Presentation: 東京理科大学 (東京都)
• [Presentation] 計算複雑性にまつわる10の誤解 (2013)
  • Author(s): 岡本吉央
  • Organizer: オペレーションズリサーチ学会北海道支部サマースクール2013
  • Place of Presentation: 利尻町営ホテル利尻 (北海道)
  • Invited
• [Presentation] ペンシルパズル「シャカシャカ」の計算複雑さと整数計画モデル (2013)
  • Author(s): Erik Demaine, 岡本吉央，上原隆平，宇野裕之
  • Organizer: 電子情報通信学会コンピュテーション研究会
  • Place of Presentation: 神戸大学 （兵庫県）
• [Presentation] Geometric Weight Balancing (2013)
  • Author(s): Luis Barba, Jean Lou De Carufel, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot and Tianhao Wang
  • Organizer: 6th Annual Meeting of Asian Association for Algorithms and Computation
  • Place of Presentation: ホテル松島大観荘 (宮城県)
• [Presentation] Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data (2013)
  • Author(s): Yoshio Okamoto
  • Organizer: Shonan Meeting ``Parameterized Complexity and the Understanding, Design and Analysis of Heuristics''
  • Place of Presentation: 湘南村センター (神奈川県)
• [Presentation] Geometric Weight Balancing (2013)
  • Author(s): Yoshio Okamoto
  • Organizer: 6th Combinatorial Algorithms Day
  • Place of Presentation: ETH Zurich (スイス)
• [Presentation] Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data (2013)
  • Author(s): Yoshio Okamoto
  • Organizer: Dagstuhl Seminar 13391 ``Algorithm Engineering''
  • Place of Presentation: Schloss Dagstuhl (ドイツ)
• [Presentation] 費用2種類の施設配置ゲームの仁とシャープレイ値の計算について
  • Author(s): 並河 雄紀，岡本 吉央，大舘 陽太
  • Organizer: 情報処理学会第143回アルゴリズム研究発表会
  • Place of Presentation: 飯坂温泉伊勢谷（福島県）
• [Presentation] 施設配置ゲームにおける仁・シャープレイ値の計算について
  • Author(s): 並河 雄紀，岡本 吉央，大舘 陽太
  • Organizer: 電子情報通信学会コンピュテーション研究会
  • Place of Presentation: 東北大学（宮城県）
• [Presentation] 不完全データと矛盾しない有向二値完全系統樹を列挙する効率的手法
  • Author(s): 清見 礼，岡本 吉央，斎藤 寿樹
  • Organizer: 電子情報通信学会コンピュテーション研究会
  • Place of Presentation: 北海道大学（北海道）
• [Presentation] うそはうそであると見抜けるアルゴリズム
  • Author(s): 岡本 吉央
  • Organizer: 日本オペレーションズ・リサーチ学会関西支部講演会「続・娯楽のOR」
  • Place of Presentation: 大阪府立大学（大阪府）
  • Invited
• [Presentation] シャカシャカと整数計画法
  • Author(s): 岡本 吉央
  • Organizer: 組合せゲーム・パズル第8回ミニ研究集会
  • Place of Presentation: 電気通信大学（東京都）
• [Presentation] Improved Approximation for Geometric Unique Coverage Problem
  • Author(s): Yoshio Okamoto
  • Organizer: Dagstuhl Seminar "Computational Geometry"
  • Place of Presentation: Schloss Dagstuhl （ドイツ）
• [Presentation] Improved Approximation for Geometric Unique Coverage Problem
  • Author(s): Yoshio Okamoto
  • Organizer: 5th Combinatorial Algorithms Day
  • Place of Presentation: ETH Zurich （スイス）
• [Presentation] Two (open) problems: simple, fun, and hopefully solvable
  • Author(s): Yoshio Okamoto
  • Organizer: Fields Workshop on Discrete and Computational Geometry
  • Place of Presentation: Carleton University （カナダ）
  • Invited
• [Presentation] 最適化×計算限界＝（算法設計＋問題構造）×（計算上界＋計算下界）
  • Author(s): 岡本 吉央
  • Organizer: ELCミニ研究集会 (B01)
  • Place of Presentation: 京都大学（京都府）
• [Presentation] コア安定性の計算理論
  • Author(s): 岡本 吉央
  • Organizer: 科研費基盤(S)キックオフシンポジウム「持続可能な発展のための資源配分メカニズム設計理論の構築」
  • Place of Presentation: JR博多シティ（福岡県）
  • Invited
• [Presentation] A 4.31-approximation for the geometric unique coverage problem on unit disks
  • Author(s): Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, and Yushi Uno
  • Organizer: 23rd International Symposium on Algorithms and Computation (ISAAC 2012)
  • Place of Presentation: National Taiwan University （台湾）
• [Presentation] Universal point subsets for planar graphs
  • Author(s): Patrizio Angelini, Carla Binucci, William Evans, Ferran Hurtado, Giuseppe Liotta Tamara Mchedlidze, Henk Meijer, and Yoshio Okamoto
  • Organizer: 23rd International Symposium on Algorithms and Computation (ISAAC 2012)
  • Place of Presentation: National Taiwan University （台湾）
• [Presentation] Area bounds of rectilinear polygons realized by angle sequences
  • Author(s): Sang Won Bae, Yoshio Okamoto, and Chan-Su Shin
  • Organizer: 23rd International Symposium on Algorithms and Computation (ISAAC 2012)
  • Place of Presentation: National Taiwan University （台湾）
• [Presentation] On problems as hard as CNF-SAT
  • Author(s): Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, and Magnus Wahlström
  • Organizer: 27th IEEE Conference on Computational Complexity (CCC 2012)
  • Place of Presentation: Universidade do Porto （ポルトガル）
• [Presentation] Efficient enumeration of the directed binary perfect phylogenies from incomplete data
  • Author(s): Masashi Kiyomi, Yoshio Okamoto, and Toshiki Saitoh
  • Organizer: 11th International Symposium on Experimental Algorithms (SEA 2012)
  • Place of Presentation: LaBRI （フランス）
• [Presentation] A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares
  • Author(s): Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, and Yushi Uno
  • Organizer: 13th Scandinavian Symposium and Workshops on Algorithms Theory (SWAT 2012)
  • Place of Presentation: University of Helsinki （フィンランド）
• [Book] 応用数理ハンドブック (2013)
  • Author(s): 日本応用数理学会 (監修)，薩摩順吉，大石進一，杉原正顯 (編集)， 岡本吉央 他224名 (執筆)
  • Total Pages: 685
  • Publisher: 朝倉書店