• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Advances in Theory and Design Principles of Counting AlgorithmsBased on Polyhedral Combinatorics

Research Project

Project/Area Number 21700009
Research Category

Grant-in-Aid for Young Scientists (B)

Allocation TypeSingle-year Grants
Research Field Fundamental theory of informatics
Research InstitutionThe University of Electro-Communications (2011)
Japan Advanced Institute of Science and Technology (2010)
Tokyo Institute of Technology (2009)

Principal Investigator

OKAMOTO Yoshio  電気通信大学, 大学院・情報理工学研究科, 准教授 (00402660)

Project Period (FY) 2009 – 2011
Project Status Completed (Fiscal Year 2011)
Budget Amount *help
¥4,160,000 (Direct Cost: ¥3,200,000、Indirect Cost: ¥960,000)
Fiscal Year 2011: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2010: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2009: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Keywordsアルゴリズム / 離散数学 / 凸多面体 / グラフ / 離散幾何
Research Abstract

Results on counting problems for graphs, counting problems for discrete and computational geometry, and their applications to optimization problems were obtained. For example, the computational complexity of counting the dominating sets in a graph was investigated from the perspective of graph classes, and a polynomial-time algorithm to find a global optimal solution to the distance function maximization was developed by efficiently enumerating all local optimal solutions. These results were presented in refereed international journals and refereed international conferences.

Report

(4 results)
  • 2011 Annual Research Report   Final Research Report ( PDF )
  • 2010 Annual Research Report
  • 2009 Annual Research Report
  • Research Products

    (126 results)

All 2013 2012 2011 2010 2009 Other

All Journal Article (61 results) (of which Peer Reviewed: 51 results,  Open Access: 1 results) Presentation (61 results) (of which Invited: 5 results) Book (4 results)

  • [Journal Article] The complexity of the stamp folding problem2013

    • 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

    • Related Report
      2011 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Approximating the path-distance-width for AT-free graphs and graphs in related classes2013

    • 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

    • Related Report
      2011 Annual Research Report
    • Peer Reviewed
  • [Journal Article] グラフを通したパズル・ゲームの一般化2013

    • Author(s)
      岡本 吉央
    • Journal Title

      オペレーションズ・リサーチ

      Volume: 58(3) Pages: 161-166

    • NAID

      110009594408

    • Related Report
      2011 Annual Research Report
  • [Journal Article] 費用2種類の施設配置ゲームの仁とシャープレイ値の計算について2013

    • Author(s)
      並河 雄紀,岡本 吉央,大舘 陽太
    • Journal Title

      情報処理学会研究報告アルゴリズム

      Volume: 2013-AL-143(3) Pages: 1-8

    • NAID

      110009550136

    • Related Report
      2011 Annual Research Report
  • [Journal Article] On bipartite powers of bigraphs2012

    • Author(s)
      Yoshio Okamoto, Yota Otachi, and Ryuhei Uehara
    • Journal Title

      Discrete Mathematics & Theoretical Computer Science

      Volume: 14(2) Pages: 11-20

    • NAID

      120005147908

    • URL

      http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2132

    • Related Report
      2011 Annual Research Report 2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Reverse preferential spread in complex networks2012

    • Author(s)
      Hiroshi Toyoizumi, Seiichi Tani, Naoto Miyoshi, and Yoshio Okamoto
    • Journal Title

      Physical Review E

      Volume: 86 Pages: 21103-21103

    • URL

      http://dx.doi.org/10.1103/PhysRevE.86.021103

    • Related Report
      2011 Annual Research Report 2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Minimum and maximum against k lies2012

    • Author(s)
      Michael Hoffmann, Jiri Matousek, Yoshio Okamoto, and Philipp Zumstein
    • Journal Title

      Chicago Journal of Theoretical Computer Science 2012

      Volume: Article 2 Pages: 1-10

    • NAID

      110008004173

    • URL

      http://dx.doi.org/10.4086/cjtcs.2012.002

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Vertex angle and crossing angle resolution of leveled tree drawings2012

    • Author(s)
      Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Yoshio Okamoto, and Andreas Spillner
    • Journal Title

      Information Processing Letters

      Volume: 112 Pages: 630-635

    • NAID

      110008900060

    • URL

      http://dx.doi.org/10.1016/j.ipl.2012.05.006

    • Related Report
      2011 Annual Research Report 2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Querying two boundary points for shortest paths in a polygonal domain2012

    • Author(s)
      Sang Won Bae and Yoshio Okamoto
    • Journal Title

      Computational Geometry: Theory and Applications

      Volume: 45 Pages: 284-293

    • URL

      http://dx.doi.org/10.1016/j.comgeo.2012.01.012

    • Related Report
      2011 Annual Research Report 2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Drawing (complete) binary tanglegrams: Hardness, approximation2012

    • Author(s)
      Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nollenburg, Yoshio Okamoto, Rodrigo I. Silveira, and Alexander Wolff
    • Journal Title

      fixed-parameter tractability. Algorithmica

      Volume: 62 Pages: 309-332

    • URL

      http://dx.doi.org/10.1007/s00453-010-9456-3

    • Related Report
      2011 Final Research Report
    • 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

    • URL

      http://dx.doi.org/10.1007/978-3-642-35261-4_65

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Giuseppe Liotta Tamara Mchedlidze, Henk Meijer, and Yoshio Okamoto2012

    • Author(s)
      Patrizio Angelini, Carla Binucci, William Evans, Ferran Hurtado
    • Journal Title

      Universal point subsets for planar graphs. Lecture Notes in Computer Science

      Volume: 7676 Pages: 423-432

    • URL

      http://dx.doi.org/10.1007/978-3-642-35261-4_45

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] A4.31-approximation for the geometric unique coverage problem on unit disks2012

    • 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

    • URL

      http://dx.doi.org/10.1007/978-3-642-35261-4_40

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] On problems as hard as CNF-SAT2012

    • Author(s)
      Marek Cygan, Holger Dell, Daniel Lokshtanov, Daniel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, and Magnus Wahlstrom
    • Journal Title

      Proceedings of27th IEEE Conference onComputational Complexity (CCC 2012)

      Pages: 74-84

    • URL

      http://dx.doi.org/10.1109/CCC.2012.36

    • Related Report
      2011 Final Research Report
    • 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

    • NAID

      120005954496

    • URL

      http://dx.doi.org/10.1007/978-3-642-31155-0_3

    • Related Report
      2011 Final Research Report
    • 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

    • NAID

      110009588447

    • URL

      http://dx.doi.org/10.1007/978-3-642-30850-5_22

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Drawing (complete) binary tanglegrams: Hardness, approximation, fixed-parameter tractability2012

    • Author(s)
      Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, and Alexander Wolff
    • Journal Title

      Algorithmica

      Volume: 62 Issue: 1-2 Pages: 309-332

    • DOI

      10.1007/s00453-010-9456-3

    • Related Report
      2011 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Minimum and maximum against k lies2012

    • 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

    • Related Report
      2011 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Efficient enumeration of the directed binary perfect phylogenies from incomplete data2012

    • 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
    • Related Report
      2011 Annual Research Report
    • Peer Reviewed
  • [Journal Article] A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares2012

    • 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
    • Related Report
      2011 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] On problems as hard as CNF-SAT2012

    • 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

    • Related Report
      2011 Annual Research Report
    • Peer Reviewed
  • [Journal Article] A 4.31-approximation for the geometric unique coverage problem on unit disks2012

    • 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
    • Related Report
      2011 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Universal point subsets for planar graphs2012

    • 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
    • Related Report
      2011 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Area bounds of rectilinear polygons realized by angle sequences2012

    • 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
    • Related Report
      2011 Annual Research Report
    • Peer Reviewed
  • [Journal Article] 不完全データと矛盾しない有向二値完全系統樹を列挙する効率的手法2012

    • Author(s)
      清見 礼,岡本 吉央,斎藤 寿樹
    • Journal Title

      信学技法

      Volume: 112(93) Pages: 17-24

    • NAID

      110009588447

    • Related Report
      2011 Annual Research Report
  • [Journal Article] 施設配置ゲームにおける仁・シャープレイ値の計算について2012

    • Author(s)
      並河 雄紀,岡本 吉央,大舘 陽太
    • Journal Title

      信学技法

      Volume: 112(272) Pages: 25-32

    • NAID

      110009636909

    • Related Report
      2011 Annual Research Report
  • [Journal Article] 『計算機科学者のためのゲーム理論入門』シリーズについて2012

    • Author(s)
      横尾 真,岩崎 敦,櫻井 祐子,岡本 吉央
    • Journal Title

      コンピュータ ソフトウェア

      Volume: 29

    • NAID

      10030311272

    • Related Report
      2011 Annual Research Report
    • Peer Reviewed
  • [Journal Article] 『計算機科学者のためのゲーム理論入門』シリーズ第1回 非協力ゲーム(基礎編)2012

    • Author(s)
      横尾 真,岩崎 敦,櫻井 祐子,岡本 吉央
    • Journal Title

      コンピュータ ソフトウェア

      Volume: 29

    • Related Report
      2011 Annual Research Report
    • Peer Reviewed
  • [Journal Article] 『計算機科学者のためのゲーム理論入門』シリーズ第2回 非協力ゲーム(発展編)2012

    • Author(s)
      横尾 真,岩崎 敦,櫻井 祐子,岡本 吉央
    • Journal Title

      コンピュータ ソフトウェア

      Volume: 29

    • Related Report
      2011 Annual Research Report
    • Peer Reviewed
  • [Journal Article] 『計算機科学者のためのゲーム理論入門』シリーズ第3回 メカニズムデザイン2012

    • Author(s)
      横尾 真,岩崎 敦,櫻井 祐子,岡本 吉央
    • Journal Title

      コンピュータ ソフトウェア

      Volume: 29

    • Related Report
      2011 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Hardness results and an exact exponential algorithm for the spanning tree congestion problem2011

    • Author(s)
      Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, and Takeaki Uno
    • Journal Title

      Journal of Graph Algorithms and Applications

      Volume: 15 Pages: 727-751

    • NAID

      120003752202

    • URL

      http://jgaa.info/accepted/2011/OkamotoOtachiUeharaUno

    • Related Report
      2011 Annual Research Report 2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] The t-pebbling number is eventually linear in t2011

    • Author(s)
      Michael Hoffmann, Jiri Matousek, Yoshio Okamoto, and Philipp Zumstein
    • Journal Title

      The Electronic Journal of Comb

      Volume: 18(1) Pages: 153-153

    • URL

      http://www.combinatorics.org/Volume_18/Abstracts/v18i1p153.html

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Adaptive algorithms for planar convex hull problems2011

    • Author(s)
      Hee-Kap Ahn and Yoshio Okamoto
    • Journal Title

      IEICE Transactions on Information and Systems

      Volume: E94-D Pages: 182-189

    • NAID

      130000453877

    • URL

      http://dx.doi.org/10.1587/transinf.E94.D.182

    • Related Report
      2011 Annual Research Report 2011 Final Research Report 2010 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Apolynomial-time-delaypolynomial-space algorithm for enumeration problems in multi-criteria optimization.2011

    • Author(s)
      Yoshio Okamoto and Takeaki Uno
    • Journal Title

      European Journal of Operational Research

      Volume: 210 Pages: 48-56

    • URL

      http://dx.doi.org/10.1016/j.ejor.2010.10.008

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Submodular fractional programming for balanced clustering2011

    • Author(s)
      Yoshinobu Kawahara, Kiyohito Nagano, and Yoshio Okamoto
    • Journal Title

      Pattern Recognition Letters

      Volume: 32 Pages: 235-243

    • URL

      http://dx.doi.org/10.1016/j.patrec.2010.08.008

    • Related Report
      2011 Final Research Report 2010 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Approximability of the path-distance-width for AT-free graphs2011

    • Author(s)
      Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, and Koichi Yamazaki
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 6986 Pages: 271-282

    • URL

      http://dx.doi.org/10.1007/978-3-642-25870-1_25

    • Related Report
      2011 Annual Research Report 2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Dominating set counting in graph classes2011

    • Author(s)
      Shuji Kijima, Yoshio Okamoto, and Takeaki Uno
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 6842 Pages: 13-24

    • URL

      http://dx.doi.org/10.1007/978-3-642-22685-4_2

    • Related Report
      2011 Annual Research Report 2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Hardness results and an exact exponential algorithm for the spanning tree congestion problem2011

    • Author(s)
      Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, and Takeaki Uno
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 6648 Pages: 452-462

    • NAID

      120003752202

    • URL

      http://dx.doi.org/10.1007/978-3-642-20877-5_44

    • Related Report
      2011 Annual Research Report 2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] A polynomial-time-delay polynomial-space algorithm for enumeration problems in multi-criteria optimization2011

    • Author(s)
      Yoshio Okamoto and Takeaki Uno
    • Journal Title

      European Journal of Operational Research

      Volume: 210 Issue: 1 Pages: 48-56

    • DOI

      10.1016/j.ejor.2010.10.008

    • Related Report
      2011 Annual Research Report
    • Peer Reviewed
  • [Journal Article] The t-pebbling number is eventually linear in t2011

    • Author(s)
      Michael Hoffmann, Jiri Matousek, Yoshio Okamoto, Philipp Zumstein
    • Journal Title

      The Electronic Journal of Combinatorics

      Volume: 18(1) Pages: 4-4

    • Related Report
      2011 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Not all saturated 3-forests are tight2011

    • Author(s)
      Heidi Gebauer, Anna Gundert, Robin A. Moser, and Yoshio Okamoto
    • Journal Title

      arXiv Preprint

      Volume: 1109.3390 Pages: 5-5

    • Related Report
      2011 Annual Research Report
  • [Journal Article] レベル付き木の描画における頂点角解像度と交差角解像度2011

    • Author(s)
      ワルター ディディモ,ミヒャエル カウフマン,ジウセッペ リオッタ,岡本 吉央,アンドレアス シュピルナー
    • Journal Title

      電子情報通信学会コンピュテーション研究会技術研究報告

      Volume: 111(256) Pages: 33-38

    • NAID

      110008900060

    • Related Report
      2011 Annual Research Report
  • [Journal Article] Hardness results and an exact exponential algorithm for the spanning tree congestion problem2011

    • Author(s)
      岡本 吉央,大舘 陽太,上原 隆平,宇野 毅明
    • Journal Title

      情報処理学会アルゴリズム研究会研究報告

      Volume: 2011-AL-136(5) Pages: 1-8

    • NAID

      120003752202

    • Related Report
      2011 Annual Research Report
  • [Journal Article] 間違えても大丈夫な凸包構成アルゴリズム2011

    • Author(s)
      岡本 吉央,ステファン ランガマン
    • Journal Title

      情報処理学会アルゴリズム研究会研究報告

      Volume: 2011-AL-135(8) Pages: 1-3

    • NAID

      110008583106

    • Related Report
      2011 Annual Research Report
  • [Journal Article] Approximating the path-distance-width for k-cocomparability graphs2011

    • Author(s)
      大舘 陽太,斎藤 寿樹,山中 克久,来嶋 秀治,岡本 吉央,小野 廣隆,宇野 裕之,山崎 浩一
    • Journal Title

      数理解析研究所講究録

      Volume: 1744 Pages: 60-66

    • Related Report
      2011 Annual Research Report
  • [Journal Article] 最小費用全域木ゲーム2011

    • Author(s)
      岡本 吉央
    • Journal Title

      オペレーションズ・リサーチ

      Volume: 56(1) Pages: 47-48

    • NAID

      110008007163

    • Related Report
      2011 Annual Research Report
  • [Journal Article] A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets2010

    • Author(s)
      Ondrej Bilka, Kevin Buchin, Radoslav Fulek, Masashi Kiyomi, Yoshio Okamoto, Shin-ichi Tanigawa, and Csaba D. Toth
    • Journal Title

      The Electronic Journal of Combinatorics

      Volume: 17

    • URL

      http://www.combinatorics.org/Volume_17/Abstracts/v17i1n35.html

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] On listing, sampling, and counting the chordal graphs with edge constraints.2010

    • Author(s)
      Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, and Takeaki Uno
    • Journal Title

      Theoretical Computer Science

      Volume: 411 Pages: 2591-2601

    • URL

      http://dx.doi.org/10.1016/j.tcs.2010.03.024

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] Improved bounds for wireless localization2010

    • Author(s)
      Tobias Christ, Michael Hoffmann, Yoshio Okamoto, and Takeaki Uno
    • Journal Title

      Algorithmica

      Volume: 57 Pages: 499-516

    • URL

      http://dx.doi.org/10.1007/s00453-009-9287-2

    • Related Report
      2011 Final Research Report 2010 Annual Research Report 2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] The geodesic diameter of polygonal domains2010

    • Author(s)
      Sang Won Bae, Matias Korman, and Yoshio Okamoto
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 6346 Pages: 500-511

    • NAID

      110008000709

    • URL

      http://dx.doi.org/10.1007/978-3-642-15775-2_43

    • Related Report
      2011 Final Research Report 2010 Annual Research Report 2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Adaptive algorithms for planar convex hull problems2010

    • Author(s)
      Hee-Kap Ahn and Yoshio Okamoto
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 6213 Pages: 316-326

    • NAID

      130000453877

    • URL

      http://dx.doi.org/10.1007/978-3-642-14553-7_30

    • Related Report
      2011 Final Research Report 2010 Annual Research Report 2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Minimum and maximum against k lies2010

    • Author(s)
      Michael Hoffmann, Jiri Matousek, Yoshio Okamoto, and Philipp Zumstein
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 6139 Pages: 139-149

    • NAID

      110008004173

    • URL

      http://dx.doi.org/10.1007/978-3-642-13731-0_14

    • Related Report
      2011 Final Research Report 2010 Annual Research Report 2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Counting the number of matchings in chordal and chordal bipartite graph classes2010

    • Author(s)
      Yoshio Okamoto, Ryuhei Uehara, and Takeaki Uno
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 5911 Pages: 296-307

    • NAID

      110007338417

    • URL

      http://dx.doi.org/10.1007/978-3-642-11409-0_26

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] On listing, sampling, and counting the chordal graphs with edge constraints2010

    • Author(s)
      Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno
    • Journal Title

      Theoretical Computer Science

      Volume: 411 Pages: 2591-2601

    • Related Report
      2010 Annual Research Report
    • Peer Reviewed
  • [Journal Article] A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets2010

    • Author(s)
      Ondrej Bilka, Kevin Buchin, Radoslav Fulek, Masashi Kiyomi, Yoshio Okamoto, Shin-ichi Tanigawa, Csaba D.Toth
    • Journal Title

      The Electronic Journal of Combinatorics

      Volume: 17

    • Related Report
      2010 Annual Research Report
    • Peer Reviewed
  • [Journal Article] On listing, sampling, and counting the chordal graphs with edge Constraints2010

    • Author(s)
      Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno
    • Journal Title

      Theoretical Computer Science

      Volume: 411 Pages: 2591-2601

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Counting the number of matchings in chordal and chordal bipartite graphs2010

    • Author(s)
      Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 5911 Pages: 296-307

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Untangling a planar graph2009

    • Author(s)
      Xavier Goaoc, Jan Kratochvil, Yoshio Okamoto, Chan-Su Shin, Andreas Spillner, andAlexander Wolff.
    • Journal Title

      Discrete& Computational Geometry

      Volume: 42 Pages: 542-569

    • URL

      http://dx.doi.org/10.1007/s00454-008-9130-6

    • Related Report
      2011 Final Research Report
    • Peer Reviewed
  • [Journal Article] The Holt-Klee condition for oriented matroids2009

    • Author(s)
      Komei Fukuda, Sonoko Moriyama, and Yoshio Okamoto
    • Journal Title

      European Journal of Combinatorics

      Volume: 30 Pages: 1854-1867

    • URL

      http://dx.doi.org/10.1016/j.ejc.2008.12.012

    • Related Report
      2011 Final Research Report 2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Querying two boundary points for shortest paths in a polygonal domain2009

    • Author(s)
      Sang Won Bae and Yoshio Okamoto
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 5878 Pages: 1054-1063

    • URL

      http://dx.doi.org/10.1007/978-3-642-10631-6_106

    • Related Report
      2011 Final Research Report 2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Untangling a planar graph2009

    • Author(s)
      Xavier Goaoc, Jan Kratochvil, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff
    • Journal Title

      Discrete & Computational Geometry

      Volume: 42 Pages: 542-569

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Presentation] Area bounds of rectilinear polygons realized by angle sequences2012

    • 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 (台湾)
    • Year and Date
      2012-12-21
    • Related Report
      2011 Final Research Report
  • [Presentation] 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
    • Organizer
      23rd International Symposium on Algorithms and Computation (ISAAC 2012)
    • Place of Presentation
      National Taiwan University (台湾)
    • Year and Date
      2012-12-20
    • Related Report
      2011 Final Research Report
  • [Presentation] A4.31-approximation for the geometric unique coverage problem on unit disks2012

    • Author(s)
      Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, and Yushi Uno
    • Organizer
      23rd International Symposium onAlgorithms and Computation (ISAAC2012)
    • Place of Presentation
      NationalTaiwan University (台湾)
    • Year and Date
      2012-12-20
    • Related Report
      2011 Final Research Report
  • [Presentation] 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
    • Organizer
      13th Scandinavian Symposium and Workshop on Algorithm Theory (SWAT2012)
    • Place of Presentation
      University ofHelsinki (フィンランド)
    • Year and Date
      2012-07-04
    • Related Report
      2011 Final Research Report
  • [Presentation] On problems as hard as CNF-SAT2012

    • Author(s)
      Marek Cygan, Holger Dell, Daniel Lokshtanov, Daniel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, and Magnus Wahlstrom
    • Organizer
      27th IEEE Conference on Computational Complexity (CCC 2012)
    • Place of Presentation
      University of Porto (ポルトガル)
    • Year and Date
      2012-06-26
    • Related Report
      2011 Final Research Report
  • [Presentation] Efficient enumeration of the directed binary perfect phylogenies from incomplete data2012

    • Author(s)
      Masashi Kiyomi, Yoshio Okamoto, and Toshiki Saitoh
    • Organizer
      11th International Symposium on Experimental Algorithms (SEA 2012)
    • Place of Presentation
      LaBRi (フランス)
    • Year and Date
      2012-06-08
    • Related Report
      2011 Final Research Report
  • [Presentation] Dominating set counting in graph classes2011

    • Author(s)
      Shuji Kijima, Yoshio Okamoto, and Takeaki Uno
    • Organizer
      17th Annual International Computing and Combinatorics Conference (COCOON2011)
    • Place of Presentation
      Double Tree by Hilton Hotel Dallas-Richardson (アメリカ)
    • Year and Date
      2011-08-14
    • Related Report
      2011 Final Research Report
  • [Presentation] Approximabilityof the path-distance-width for AT-free graphs2011

    • Author(s)
      Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, and Koichi Yamazaki
    • Organizer
      37th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2011)
    • Place of Presentation
      Tepla Monastery (チェコ)
    • Year and Date
      2011-06-22
    • Related Report
      2011 Final Research Report
  • [Presentation] Hardness results and an exact exponential algorithm for the spanning tree congestion problem2011

    • Author(s)
      Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, and Takeaki Uno
    • Organizer
      8th Annual Conference on Theory and Applications of Models of Computation (TAMC 2011)
    • Place of Presentation
      電気通信大学(東京都)
    • Related Report
      2011 Final Research Report
  • [Presentation] Hardness results and an exact exponential algorithm for the spanning tree congestion problem2011

    • Author(s)
      Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, and Takeaki Uno
    • Organizer
      8th Annual Conference on Theory and Applications of Models of Computation (TAMC 2011)
    • Place of Presentation
      電気通信大学(東京都)
    • Related Report
      2011 Annual Research Report
  • [Presentation] How to make a picturesque maze2010

    • Author(s)
      Yoshio Okamoto
    • Organizer
      Dagstuhl Seminar 10461 "Schematization in Cartography, Visualization, and Computational Geometry"
    • Place of Presentation
      Schloss Dagstuhl(ドイツ)
    • Year and Date
      2010-11-16
    • Related Report
      2010 Annual Research Report
  • [Presentation] The geodesic diameter of polygonal domains2010

    • Author(s)
      Yoshio Okamoto
    • Organizer
      Dutch Computational Geometry Day 2010
    • Place of Presentation
      Eindhoven University of Technology(オランダ)
    • Year and Date
      2010-11-11
    • Related Report
      2010 Annual Research Report
  • [Presentation] The geodesic diameter of polygonal domains2010

    • Author(s)
      Sang Won Bae, Matias Korman, and Yoshio Okamoto
    • Organizer
      18th Annual European Symposium on Algorithms (ESA 2010)
    • Place of Presentation
      Liverpool University (イギリス)
    • Year and Date
      2010-09-07
    • Related Report
      2011 Final Research Report
  • [Presentation] Counting the number of dominating sets in graph classes2010

    • Author(s)
      Yoshio Okamoto
    • Organizer
      The 13^<th> Japan-Korea Joint Workshop on Algorithms and Computation
    • Place of Presentation
      金沢市文化ホール(石川県)
    • Year and Date
      2010-07-23
    • Related Report
      2010 Annual Research Report
  • [Presentation] Counting the number of dominating sets in graph classes2010

    • Author(s)
      Yoshio Okamoto
    • Organizer
      13^<th> Japan-Korea Joint Workshop on Algorithms and Computation
    • Place of Presentation
      金沢市民ホール
    • Year and Date
      2010-07-23
    • Related Report
      2009 Annual Research Report
  • [Presentation] The geodesic diameter of polygonal domains2010

    • Author(s)
      Yoshio Okamoto
    • Organizer
      4^<th> Combinatorial Algorithms Day
    • Place of Presentation
      ETH Zurich(スイス)
    • Year and Date
      2010-06-30
    • Related Report
      2010 Annual Research Report
  • [Presentation] Minimum and maximum against k lies2010

    • Author(s)
      Michael Hoffmann, Jiri Matousek, Yoshio Okamoto, and Philipp Zumstein
    • Organizer
      12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2010)
    • Place of Presentation
      Studentsamskipnaden i Bergen (ノルウェー)
    • Year and Date
      2010-06-22
    • Related Report
      2011 Final Research Report
  • [Presentation] 重み付きグラフにおける石移動ゲームについて2010

    • Author(s)
      岡本吉央
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      北陸先端科学技術大学院大学(石川県)
    • Year and Date
      2010-05-19
    • Related Report
      2010 Annual Research Report
  • [Presentation] Counting the number of dominating sets in graph classes2010

    • Author(s)
      岡本吉央
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      立命館大学(滋賀県)
    • Year and Date
      2010-04-22
    • Related Report
      2010 Annual Research Report
  • [Presentation] Counting the number of dominating sets in graph classes2010

    • Author(s)
      岡本吉央
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      立命館大学
    • Year and Date
      2010-04-22
    • Related Report
      2009 Annual Research Report
  • [Presentation] The geodesic diameter of polygonal domains2010

    • Author(s)
      岡本吉央
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      国立情報学研究所
    • Year and Date
      2010-03-12
    • Related Report
      2009 Annual Research Report
  • [Presentation] 嘘を含む比較による最小値最大値発見アルゴリズム2010

    • Author(s)
      岡本吉央
    • Organizer
      2009年度冬のLAシンポジウム
    • Place of Presentation
      京都大学理学研究科
    • Year and Date
      2010-02-03
    • Related Report
      2009 Annual Research Report
  • [Presentation] 嘘を含む比較による最小値最大値発見アルゴリズム2010

    • Author(s)
      岡本吉央
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      九州大学西新プラザ
    • Year and Date
      2010-01-25
    • Related Report
      2009 Annual Research Report
  • [Presentation] Adaptive algorithms for planar convex hull problems2010

    • Author(s)
      Hee-Kap Ahn and Yoshio Okamoto
    • Organizer
      4th International Frontiers of Algorithmics Workshop (FAW 2010)
    • Place of Presentation
      Wuhan Univeristy(中国)
    • Related Report
      2011 Final Research Report
  • [Presentation] Querying two boundary points for shortest paths in a polygonal domain2009

    • Author(s)
      Sang Won Bae and Yoshio Okamoto
    • Organizer
      20th International Symposium onAlgorithms and Computation (ISAAC2009)
    • Place of Presentation
      Ala MoanaHotel (アメリカ)
    • Year and Date
      2009-12-18
    • Related Report
      2011 Final Research Report
  • [Presentation] Querying two boundary points for shortest paths in a polygonal domain2009

    • Author(s)
      Yoshio Okamoto
    • Organizer
      20th International Symposium on Algorithms and Computation
    • Place of Presentation
      アラモワナ・ホテル(アメリカ)
    • Year and Date
      2009-12-18
    • Related Report
      2009 Annual Research Report
  • [Presentation] A tight lower bound for convexly independent subsets of the Minkowskisums of planar point sets2009

    • Author(s)
      Yoshio Okamoto
    • Organizer
      Japan Conference on Computational Geometry and Graphs
    • Place of Presentation
      金沢市文化ホール
    • Year and Date
      2009-11-11
    • Related Report
      2009 Annual Research Report
  • [Presentation] アルゴリズムに対する10の誤解-ソーティングを巡って2009

    • Author(s)
      岡本吉央
    • Organizer
      KSMAP合宿in明日香村
    • Place of Presentation
      関西大学明日香文化研究所
    • Year and Date
      2009-10-11
    • Related Report
      2009 Annual Research Report
  • [Presentation] 協力ゲーム理論におけるアルゴリズム2009

    • Author(s)
      岡本吉央
    • Organizer
      第8回情報科学技術フォーラム
    • Place of Presentation
      東北工業大学
    • Year and Date
      2009-09-02
    • Related Report
      2009 Annual Research Report
  • [Presentation] A provably efficient algorithm for the multicriteria linear programming2009

    • Author(s)
      Yoshio Okamoto
    • Organizer
      20^<th> International Symposium on Mathematical Programming
    • Place of Presentation
      University of Chicago(アメリカ)
    • Year and Date
      2009-08-26
    • Related Report
      2009 Annual Research Report
  • [Presentation] How to make a picturesque maze2009

    • Author(s)
      Yoshio Okamoto, Ryuhei Uehara
    • Organizer
      21st Canadian Conference on Computational Geometry
    • Place of Presentation
      ブリティッシュ・コロンビア大学(カナダ)
    • Year and Date
      2009-08-18
    • Related Report
      2009 Annual Research Report
  • [Presentation] 固定パラメータ・アルゴリズムの設計法2009

    • Author(s)
      岡本吉央
    • Organizer
      京都大学数理解析研究所共同研究「組合せ最適化セミナー」
    • Place of Presentation
      東京工業大学
    • Year and Date
      2009-07-27
    • Related Report
      2009 Annual Research Report
  • [Presentation] Querying two boundary points for shortest paths in a polygonal domain2009

    • Author(s)
      Yoshio Okamoto
    • Organizer
      2009年夏のLAシンポジウム
    • Place of Presentation
      かんぽの宿 松島
    • Year and Date
      2009-07-23
    • Related Report
      2009 Annual Research Report
  • [Presentation] Discrete geometry of multi-criteria optimzation problems2009

    • Author(s)
      Yoshio Okamoto
    • Organizer
      Canada-Japan Workshop on Discrete and Computational Geometry
    • Place of Presentation
      東京大学
    • Year and Date
      2009-07-14
    • Related Report
      2009 Annual Research Report
  • [Presentation] Counting the number of matchings in chordal and chordal bipartite graph classes2009

    • Author(s)
      岡本吉央
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      北海道大学
    • Year and Date
      2009-06-29
    • Related Report
      2009 Annual Research Report
  • [Presentation] Counting the number of matchings in chordal and chordal bipartite graph classes2009

    • Author(s)
      Yoshio Okamoto, Ryuhei Uehara, and Takeaki Uno
    • Organizer
      35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009)
    • Place of Presentation
      Montpellier (フランス)
    • Year and Date
      2009-06-26
    • Related Report
      2011 Final Research Report
  • [Presentation] Adaptive algorithms for planar convex hull problems2009

    • Author(s)
      Yoshio Okamoto
    • Organizer
      Dagstuhl Seminar 09171 "Adaptive, Output Sensitive, Online and Parameterized Algorithms"
    • Place of Presentation
      Schloss Dagstuhl(ドイツ)
    • Year and Date
      2009-04-22
    • Related Report
      2009 Annual Research Report
  • [Presentation] 間違えても大丈夫な凸包構成アルゴリズム

    • Author(s)
      岡本 吉央,ステファン ランガマン
    • Organizer
      第135回情報処理学会アルゴリズム研究会
    • Place of Presentation
      秋田県立大学(秋田県)
    • Related Report
      2011 Annual Research Report
  • [Presentation] Hardness results and an exact exponential algorithm for the spanning tree congestion problem

    • Author(s)
      岡本 吉央,大舘 陽太,上原 隆平,宇野 毅明
    • Organizer
      第136回情報処理学会アルゴリズム研究会
    • Place of Presentation
      函館市中央図書館(北海道)
    • Related Report
      2011 Annual Research Report
  • [Presentation] レベル付き木の描画における頂点角解像度と交差角解像度

    • Author(s)
      ワルター ディディモ,ミヒャエル カウフマン,ジウセッペ リオッタ,岡本 吉央,アンドレアス シュピルナー
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      東北大学(宮城県)
    • Related Report
      2011 Annual Research Report
  • [Presentation] 組合せ最適化理論における高次元離散幾何的アプローチ:歴史と展望

    • Author(s)
      岡本 吉央
    • Organizer
      第58回幾何学シンポジウム
    • Place of Presentation
      山口大学(山口県)
    • Related Report
      2011 Annual Research Report
    • Invited
  • [Presentation] 列挙の基本と基礎的なアルゴリズム

    • Author(s)
      岡本 吉央
    • Organizer
      列挙学校
    • Place of Presentation
      湘南国際村センター(神奈川県)
    • Related Report
      2011 Annual Research Report
    • Invited
  • [Presentation] 2と3の違い

    • Author(s)
      岡本 吉央
    • Organizer
      名古屋工業大学情報フロンティアセミナー
    • Place of Presentation
      名古屋工業大学(愛知県)
    • Related Report
      2011 Annual Research Report
    • Invited
  • [Presentation] コア安定性の計算理論

    • Author(s)
      岡本 吉央
    • Organizer
      科研費基盤(S)キックオフシンポジウム「持続可能な発展のための資源配分メカニズム設計理論の構築」
    • Place of Presentation
      JR博多シティ(福岡県)
    • Related Report
      2011 Annual Research Report
    • Invited
  • [Presentation] 最適化×計算限界=(算法設計+問題構造)×(計算上界+計算下界)

    • Author(s)
      岡本 吉央
    • Organizer
      ELCミニ研究集会 (B01)
    • Place of Presentation
      京都大学(京都府)
    • Related Report
      2011 Annual Research Report
  • [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 (カナダ)
    • Related Report
      2011 Annual Research Report
  • [Presentation] Improved Approximation for Geometric Unique Coverage Problems

    • Author(s)
      Yoshio Okamoto
    • Organizer
      5th Combinatorial Algorithms Day
    • Place of Presentation
      ETH Zurich (スイス)
    • Related Report
      2011 Annual Research Report
  • [Presentation] Improved Approximation for Geometric Unique Coverage Problems

    • Author(s)
      Yoshio Okamoto
    • Organizer
      Dagstuhl Seminar "Computational Geometry"
    • Place of Presentation
      Schloss Dagstuhl (ドイツ)
    • Related Report
      2011 Annual Research Report
  • [Presentation] シャカシャカと整数計画法

    • Author(s)
      岡本 吉央
    • Organizer
      組合せゲーム・パズル第8回ミニ研究集会
    • Place of Presentation
      電気通信大学(東京都)
    • Related Report
      2011 Annual Research Report
  • [Presentation] うそはうそであると見抜けるアルゴリズム

    • Author(s)
      岡本 吉央
    • Organizer
      日本オペレーションズ・リサーチ学会関西支部講演会
    • Place of Presentation
      大阪府立大学
    • Related Report
      2011 Annual Research Report
    • Invited
  • [Presentation] 不完全データと矛盾しない有向二値完全系統樹を列挙する効率的手法

    • Author(s)
      清見 礼,岡本 吉央,斎藤 寿樹
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      北海道大学(北海道)
    • Related Report
      2011 Annual Research Report
  • [Presentation] 施設配置ゲームにおける仁・シャープレイ値の計算について

    • Author(s)
      並河 雄紀,岡本 吉央,大舘 陽太
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      東北大学(宮城県)
    • Related Report
      2011 Annual Research Report
  • [Presentation] 費用2種類の施設配置ゲームの仁とシャープレイ値の計算について

    • Author(s)
      並河 雄紀,岡本 吉央,大舘 陽太
    • Organizer
      情報処理学会第143回アルゴリズム研究発表会
    • Place of Presentation
      飯坂温泉伊勢谷(福島県)
    • Related Report
      2011 Annual Research Report
  • [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 (台湾)
    • Related Report
      2011 Annual Research Report
  • [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 (台湾)
    • Related Report
      2011 Annual Research Report
  • [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 (台湾)
    • Related Report
      2011 Annual Research Report
  • [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 (ポルトガル)
    • Related Report
      2011 Annual Research Report
  • [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 (フランス)
    • Related Report
      2011 Annual Research Report
  • [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 Algorithm Theory (SWAT 2012)
    • Place of Presentation
      University of Helsinki (フィンランド)
    • Related Report
      2011 Annual Research Report
  • [Presentation] Approximability of the path-distance-width for AT-free graphs

    • Author(s)
      Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, and Koichi Yamazaki
    • Organizer
      37th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2011)
    • Place of Presentation
      Tepl&#225; Monastery (チェコ)
    • Related Report
      2011 Annual Research Report
  • [Presentation] Dominating set counting in graph classes

    • Author(s)
      Shuji Kijima, Yoshio Okamoto, and Takeaki Uno
    • Organizer
      17th Annual International Computing and Combinatorics Conference (COCOON 2011)
    • Place of Presentation
      DoubleTree by Hilton Hotel Dallas - Richardson (アメリカ)
    • Related Report
      2011 Annual Research Report
  • [Book] 離散数学のすすめ2010

    • Author(s)
      伊藤大雄,宇野裕之(編著),岡本吉央,他21名(共著)
    • Publisher
      現代数学社
    • Related Report
      2011 Final Research Report
  • [Book] 「離散体積計算から見た組合せ数学入門」2010

    • Author(s)
      M.ベック,S.ロビンス(著),岡本吉央(訳)
    • Total Pages
      267
    • Publisher
      シュプリンガー・ジャパン
    • Related Report
      2011 Final Research Report
  • [Book] 離散体積計算による組合せ数学入門2010

    • Author(s)
      M.ベック, S.ロビンス(岡本吉央訳)
    • Publisher
      シュプリンガー・ジャパン
    • Related Report
      2010 Annual Research Report
  • [Book] 離散体積計算による組合せ数学入門2010

    • Author(s)
      M.ベック, S.ロビンス(翻訳:岡本吉央)
    • Total Pages
      267
    • Publisher
      シュプリンガー・ジャパン
    • Related Report
      2009 Annual Research Report

URL: 

Published: 2009-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi