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

Design and Analysis of Algorithms for Insufficient Information

Research Project

Project/Area Number 19200001
Research Category

Grant-in-Aid for Scientific Research (A)

Allocation TypeSingle-year Grants
Section一般
Research Field Fundamental theory of informatics
Research InstitutionKyoto University

Principal Investigator

IWAMA Kazuo  Kyoto University, 情報学研究科, 教授 (50131272)

Co-Investigator(Kenkyū-buntansha) KATOH Naoki  京都大学, 工学研究科, 教授 (40145826)
ITO Hiro  京都大学, 情報学研究科, 准教授 (50283487)
MIYAZAKI Shuichi  京都大学, 学術情報メディアセンター, 准教授 (00303884)
TAMAKI Suguru  京都大学, 情報学研究科, 助教 (40432413)
杉原 厚吉  東京大学, 情報理工学系研究科, 教授 (40144117)
徳山 豪  東北大学, 情報科学研究科, 教授 (40312631)
山下 雅史  九州大学, システム情報科学研究院, 教授 (00135419)
渡辺 治  東京工業大学, 情報理工学研究科, 教授 (80158617)
Co-Investigator(Renkei-kenkyūsha) SUGIHARA Kokichi  明治大学, 研究・知財戦略機構, 特任教授 (40144117)
TOKUYAMA Takeshi  東北大学, 情報科学研究科, 教授 (40312631)
YAMASHITA Masafumi  九州大学, システム情報科学研究院, 教授 (00135419)
WATANABE Osamu  東京工業大学, 情報理工学研究科, 教授 (80158617)
HORIYAMA Takashi  埼玉大学, 理工学研究科, 准教授 (60314530)
Project Period (FY) 2007 – 2009
Project Status Completed (Fiscal Year 2009)
Budget Amount *help
¥33,410,000 (Direct Cost: ¥25,700,000、Indirect Cost: ¥7,710,000)
Fiscal Year 2009: ¥14,430,000 (Direct Cost: ¥11,100,000、Indirect Cost: ¥3,330,000)
Fiscal Year 2008: ¥14,430,000 (Direct Cost: ¥11,100,000、Indirect Cost: ¥3,330,000)
Fiscal Year 2007: ¥4,550,000 (Direct Cost: ¥3,500,000、Indirect Cost: ¥1,050,000)
Keywordsアルゴリズム理論 / 理論的性能保証 / アルゴリズム / 計算困難問題 / 情報の補填 / 数理モデル化 / ロバスト計算 / 確率アルゴリズム / 性質検査
Research Abstract

One of the main challenge in modern algorithm design is to cope with insufficient information (to complement information). In this study, we rigorously discuss the desirable property of such algorithms and try to construct a framework for it including design techniques and evaluation method. As a result, we obtain efficient algorithms in various fields such as online, network, matching, randomized, geometric and distributed algorithms.

Report

(5 results)
  • 2009 Annual Research Report   Self-evaluation Report ( PDF )   Final Research Report ( PDF )
  • 2008 Annual Research Report
  • 2007 Annual Research Report
  • Research Products

    (104 results)

All 2010 2009 2008 2007

All Journal Article (37 results) (of which Peer Reviewed: 36 results) Presentation (59 results) Book (8 results)

  • [Journal Article] The hitting and cover times of Metropolis walks.2010

    • Author(s)
      Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita.
    • Journal Title

      Theor. Comput. Sci. 411(16-18)

      Pages: 1889-1894

    • NAID

      120005293255

    • Related Report
      2009 Final Research Report
    • Peer Reviewed
  • [Journal Article] Average-case analysis for the MAX-2SAT problem.2010

    • Author(s)
      Osamu Watanabe, Masaki Yamamoto
    • Journal Title

      Theor. Comput. Sci. 411(16-18)

      Pages: 1685-1697

    • NAID

      10018162837

    • Related Report
      2009 Final Research Report
    • Peer Reviewed
  • [Journal Article] Query-Number Preserving Reductions and Linear Lower Bounds for Testing2010

    • Author(s)
      Y.Yoshida, H.Ito
    • Journal Title

      IEICE Transactions. on Information and Systems E93-D(2)

      Pages: 233-240

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] The Complexity of the Hajos Calculus for Planar Graphs2010

    • Author(s)
      K.Iwama, K.Seto, S.Tamaki
    • Journal Title

      Theoretical Computer Science 411(7-9)

      Pages: 1182-1191

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] The Planar Hajos Calculus for Bounded Degree Graphs2010

    • Author(s)
      K.Iwama, K.Seto, S.Tamaki
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E93-A(6)

    • NAID

      10026864512

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] 確率的検査可能証明と近似不可能性2010

    • Author(s)
      玉置卓
    • Journal Title

      電子情報通信学会 知識ベース 6群2編7章2節

    • Related Report
      2009 Annual Research Report
  • [Journal Article] A Geometric Spanner of Segments2010

    • Author(s)
      Jinhui Xu, Yang Yang, Yongding Zhu, Naoki Katoh
    • Journal Title

      Int.J.Comput. Geometry Appl. 20(1)

      Pages: 43-67

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Finding Most Likely Solutions.2009

    • Author(s)
      Mikael Onsjo, Osamu Watanabe
    • Journal Title

      Theory Comput. Syst. 45(4)

      Pages: 926-942

    • Related Report
      2009 Final Research Report
    • Peer Reviewed
  • [Journal Article] Fast Enumeration Algorithms for Non-crossing Geometric Graphs.2009

    • Author(s)
      Naoki Katoh, Shin-ichi Tanigawa.
    • Journal Title

      Discrete & Computational Geometry 42(3)

      Pages: 443-468

    • Related Report
      2009 Final Research Report
    • Peer Reviewed
  • [Journal Article] Consistent Digital Rays.2009

    • Author(s)
      Jinhee Chun, Matias Korman, Martin Nollenburg, Takeshi Tokuyama.
    • Journal Title

      Discrete & Computational Geometry 42(3)

      Pages: 359-378

    • NAID

      110006782076

    • Related Report
      2009 Final Research Report
    • Peer Reviewed
  • [Journal Article] An improved approximation lower bound for finding almost stable maximum matchings.2009

    • Author(s)
      Koki Hamada, Kazuo Iwama, Shuichi Miyazaki
    • Journal Title

      Inf. Process. Lett. 109(18)

      Pages: 1036-1040

    • NAID

      120006338071

    • Related Report
      2009 Final Research Report
    • Peer Reviewed
  • [Journal Article] Arc-disjoint in-trees in directed graphs.2009

    • Author(s)
      Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa
    • Journal Title

      Combinatorica 29(2)

      Pages: 197-214

    • NAID

      120002317413

    • Related Report
      2009 Final Research Report
    • Peer Reviewed
  • [Journal Article] Using eventually consistent compasses to gather memory-less mobile robots with limited visibility.2009

    • Author(s)
      Samia Souissi, Xavier Defago, Masafumi Yamashita
    • Journal Title

      TAAS 4(1)

      Pages: 27-27

    • Related Report
      2009 Final Research Report
    • Peer Reviewed
  • [Journal Article] Takeshi Tokuyama. Consistent Digital Rays2009

    • Author(s)
      Jinhee Chun, Matias Korman, Martin Nollenburg
    • Journal Title

      Discrete & Computational Geometry 42 (3)

      Pages: 359-378

    • Related Report
      2009 Self-evaluation Report
    • Peer Reviewed
  • [Journal Article] Atsushi Takizawa. Arc-disjoint in-trees in directed graphs2009

    • Author(s)
      Naoyuki Kamiyama, Naoki Katoh
    • Journal Title

      Combinatorica 29 (2)

      Pages: 197-214

    • Related Report
      2009 Self-evaluation Report
    • Peer Reviewed
  • [Journal Article] Negation-Limited Complexity of Parity and Inverters2009

    • Author(s)
      K.Iwama, H.Morizumi, J.Tarui
    • Journal Title

      Algorithmica 54(2)

      Pages: 256-267

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Improving the Competitive Ratio of the Online OVSF Code Assignment Problem2009

    • Author(s)
      S.Miyazaki, K.Okamoto
    • Journal Title

      Algorithms 2(2)

      Pages: 953-972

    • NAID

      120006338074

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] An Improved Approximation Lower Bound for Finding Almost Stable Maximum Matchings2009

    • Author(s)
      K.Hamada, K.Iwama, S.Miyazaki
    • Journal Title

      Information Processing Letters 109(18)

      Pages: 1036-1040

    • NAID

      120006338071

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Enumeration of isolated cliques and pseudo-cliques2009

    • Author(s)
      H.Ito, K.Iwama
    • Journal Title

      ACM Transactions on Algorithms 5(4)

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Fast Enumeration Algorithms for Non-crossing Geometric Graphs2009

    • Author(s)
      Naoki Katoh, Shin-ichi Tanigawa
    • Journal Title

      Discrete & Computational Geometry 42(3)

      Pages: 443-468

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Enumerating edge constrained triangulations and edge-constrained non-crossing geometrec spanning trees2009

    • Author(s)
      Naoki Katoh, Shin-ichi Tanigawa
    • Journal Title

      Discrete Applied Mathematics 157(17)

      Pages: 3569-3585

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths2009

    • Author(s)
      Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa
    • Journal Title

      Discrete Applied Mathematics 157(17)

      Pages: 3665-3677

    • NAID

      120002317412

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Online Removable Square Packing.2008

    • Author(s)
      Xin Han, Kazuo Iwama, Guochuan Zhang
    • Journal Title

      Theory Comput. Syst. 43(1)

      Pages: 38-55

    • Related Report
      2009 Final Research Report
    • Peer Reviewed
  • [Journal Article] A (2-c1/√<N>)-Approximation Algorithm for the stable Marriage Problem2008

    • Author(s)
      K. Iwama, S. Miyazaki, N. Yaiauchi
    • Journal Title

      Algorithmica 51(3)

      Pages: 342-356

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Online Removable Square Packing2008

    • Author(s)
      X, Han, K. Iwama, G. Zhang
    • Journal Title

      Theory of Computing Systems 43(1)

      Pages: 38-55

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Randomized Competitive Analysis for Two Server Problems2008

    • Author(s)
      W. Bein, K. Iwama, J. Kawahara
    • Journal Title

      Algorithms 1

      Pages: 30-42

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] New Graph Calculi for Planar Non-3-Colorable Graphs2008

    • Author(s)
      Y. Hanatani, T. Horyama, K. Iwama, S. Tamaki
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E91-A(9)

      Pages: 2301-2307

    • NAID

      10026851334

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Online chasing problems for regular polygons2008

    • Author(s)
      H. Fujiwara, K. Iwama, K. Yonezawa
    • Journal Title

      Information Processing Letters 108(3)

      Pages: 155-159

    • NAID

      110006404233

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Reductions for monotone Boolean circuits2008

    • Author(s)
      K. Iwama, H. Morizumi, J. Tarui
    • Journal Title

      Theoretical Computer Science 408(2-3)

      Pages: 208-212

    • NAID

      110004751004

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Enumerating Constrained Non-crossing Minimally Rigid Frameworks2008

    • Author(s)
      D. Avis, N. Katoh, M. Ohsaki, I. Streinu, S. Tanisawa
    • Journal Title

      Discrete & Computational Geometry 40(1)

      Pages: 31-46

    • NAID

      120001493154

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Max-Stretch Reduction for Tree Spanners2008

    • Author(s)
      K. Iwama, A. Lingas, M. Okita
    • Journal Title

      Algorithmica 50(2)

      Pages: 223-235

    • NAID

      110004075938

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Improved approximation results for the stable marriage problem2007

    • Author(s)
      M. M. Halldorsson, K. Iwama, S. Miyazaki. H. Yanagisawa
    • Journal Title

      ACM Transactions on Algorithms 3(3)

      Pages: 1-18

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Exploiting partial knowledge of satisfying assignments2007

    • Author(s)
      K. Iwama, S. Tamaki
    • Journal Title

      Discrete Applied Mathematics 155(12)

      Pages: 1596-1603

    • NAID

      110003191894

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Improved algorithms for quantum identification of Boolean oracles2007

    • Author(s)
      A. Ambainis, K. Iwama, A. Kawachi, R. Raymond, S. Yamashita
    • Journal Title

      Theor. Comput. Sci. 378(1)

      Pages: 41-53

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Randomized Algorithms for 3-SAT2007

    • Author(s)
      T. Hofmeister, U. Schoening, R. Schuler, O. Watanabe
    • Journal Title

      Theory Comput. Syst. 40(3)

      Pages: 249-262

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Winning Ways of Weighted Poset Games2007

    • Author(s)
      H. Ito, G. Nakamura, S. Takata
    • Journal Title

      Akiyama-Chvatal Festschrift, Supplement of Graphs and Combinatorics 23

      Pages: 291-306

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Semi-Distance Codes and Steiner Systems2007

    • Author(s)
      H. Ito, M. Kobayashi, G. Nakamura
    • Journal Title

      Akiyama-Chvatal Festschrift, Supplement of Graphs and Combinatorics 23

      Pages: 283-290

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Presentation] An Exact Algorithm for the Boolean Connectivity Problem for k-CNF.2010

    • Author(s)
      K. Makino, S. Tamaki, M. Yamamoto
    • Organizer
      13th International Conference on Theory and Applications of Satisfiability Testing
    • Place of Presentation
      Edinburgh, Scotland
    • Year and Date
      2010-07-11
    • Related Report
      2009 Final Research Report
  • [Presentation] Zone Diagrams in Euclidean Spaces and in Other Normed Spaces.2010

    • Author(s)
      Akitoshi Kawamura, Jiri Matousek, Takeshi Tokuyama
    • Organizer
      26th Annual Symposium on Computational Geometry
    • Place of Presentation
      Snowbird, Utah.
    • Year and Date
      2010-06-15
    • Related Report
      2009 Final Research Report
  • [Presentation] Distance k-Sectors Exist.2010

    • Author(s)
      Keiko Imai, Akitoshi Kawamura, Jiri Matousek, Daniel Reem, Takeshi Tokuyama
    • Organizer
      26th Annual Symposium on Computational Geometry
    • Place of Presentation
      Snowbird, Utah.
    • Year and Date
      2010-06-15
    • Related Report
      2009 Final Research Report
  • [Presentation] A Rooted-Forest Partition with Uniform Vertex Demand2010

    • Author(s)
      Naoki Katoh, Shin-ichi Tanigawa
    • Organizer
      WALCOM 2010
    • Place of Presentation
      Dhaka, Bangladesh
    • Year and Date
      2010-02-12
    • Related Report
      2009 Annual Research Report
  • [Presentation] Quantum Counterfeit Coin Problems2010

    • Author(s)
      K.Iwama, H.Nishimura, R.Raymond, J.Teruyama
    • Organizer
      13th workshop on Quantum Information Processing(QIP 2010)
    • Place of Presentation
      ETH Zurich
    • Year and Date
      2010-01-21
    • Related Report
      2009 Annual Research Report
  • [Presentation] A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic2009

    • Author(s)
      Naoyuki Kamiyama, Naoki Katoh
    • Organizer
      ISAAC 2009
    • Place of Presentation
      Hawaii, USA
    • Year and Date
      2009-12-18
    • Related Report
      2009 Annual Research Report
  • [Presentation] : A Proof of the Molecular Conjecture2009

    • Author(s)
      Naoki Katoh
    • Organizer
      ISAAC 2009
    • Place of Presentation
      Hawaii, USA
    • Year and Date
      2009-12-17
    • Related Report
      2009 Annual Research Report
  • [Presentation] On the Infinitesimal Rigidity of Bar-and-Slider Frameworks2009

    • Author(s)
      Naoki Katoh, Shin-ichi Tanigawa
    • Organizer
      ISAAC 2009
    • Place of Presentation
      Hawaii, USA
    • Year and Date
      2009-12-16
    • Related Report
      2009 Annual Research Report
  • [Presentation] Enumeration of Polyominoes for p4 Tiling.2009

    • Author(s)
      T. Horiyama, M. Samejima
    • Organizer
      21st Canadian Conference on Computational Geometry
    • Place of Presentation
      Vancouver, Canada
    • Year and Date
      2009-08-17
    • Related Report
      2009 Final Research Report
  • [Presentation] Quantum Queries on Permutations with a Promise2009

    • Author(s)
      R.Freivalds, K.Iwama
    • Organizer
      14th International Conference on Implementation and Application of Automata(CIAA 2009)
    • Place of Presentation
      Sydney, Australia
    • Year and Date
      2009-07-17
    • Related Report
      2009 Annual Research Report
  • [Presentation] Enumerating Non-3-colorable Planar Graphs by the Hajo's Calculus2009

    • Author(s)
      K.Iwama, K.Seto, S.Tamaki
    • Organizer
      12th Korea-Japan Joint Workshop on Algorithms and Computation(WAAC 2009)
    • Place of Presentation
      Seoul, Korea
    • Year and Date
      2009-07-04
    • Related Report
      2009 Annual Research Report
  • [Presentation] A proof of the molecular conjecture.2009

    • Author(s)
      Naoki Katoh, Shin-ichi Tanigawa
    • Organizer
      25th Annual ACM Symposium on Computational Geometry
    • Place of Presentation
      Aarhus University, Denmark
    • Year and Date
      2009-06-10
    • Related Report
      2009 Final Research Report
  • [Presentation] A proof of the molecular conjecture2009

    • Author(s)
      Naoki Katoh, Shin-ichi Tanigawa
    • Organizer
      Symposium on Computational Geometry 2009
    • Place of Presentation
      Aarhus University, Denmark
    • Year and Date
      2009-06-10
    • Related Report
      2009 Annual Research Report
  • [Presentation] An improved constant-time approximation algorithm for maximum matchings.2009

    • Author(s)
      Yuichi Yoshida, Masaki Yamamoto, Hiro Ito.
    • Organizer
      41st ACM Symposium on Theory of Computing
    • Place of Presentation
      Bethesda, Maryland
    • Year and Date
      2009-05-31
    • Related Report
      2009 Final Research Report
  • [Presentation] An Improved Constant-Time Approximation Algorithm for Maximum Matchings2009

    • Author(s)
      Y. Yoshida, M. Yamamoto, H. Ito.
    • Organizer
      41st ACM Symposium on Theory of Computing
    • Place of Presentation
      Bethesda
    • Year and Date
      2009-05-31
    • Related Report
      2009 Self-evaluation Report
  • [Presentation] An Improved Comstant-Time Approximation Algorithm for Maximum Matchings2009

    • Author(s)
      Y.Yoshida, M.Yamamoto, H.Ito
    • Organizer
      41st ACM Symposium on Theory of Computing(STOC 2009)
    • Place of Presentation
      Bethesda, Maryland
    • Year and Date
      2009-05-31
    • Related Report
      2009 Annual Research Report
  • [Presentation] Constant-Time Approximations Using Minimum Value Search for Independent Sets and Matchings2009

    • Author(s)
      Y.Yoshida, M.Yamamoto, H.Ito
    • Organizer
      2nd Asian Association for Algorithms and Computation(AAAC 2009)
    • Place of Presentation
      Hangzhou, China
    • Year and Date
      2009-04-11
    • Related Report
      2009 Annual Research Report
  • [Presentation] The Planar Hajos Calculus for Bounded Degree Graphs2009

    • Author(s)
      K.Iwama, K.Seto, S.Tamaki
    • Organizer
      2nd Asian Association for Algorithms and Computation(AAAC 2009)
    • Place of Presentation
      Hangzhou, China
    • Year and Date
      2009-04-11
    • Related Report
      2009 Annual Research Report
  • [Presentation] Quantum Query Complexity of Boolean Functions with Small On-Sets2008

    • Author(s)
      Ambainis, Iwama, Nakanishi, Nisimura, Raymond, Tani, Yamashita
    • Organizer
      19th International Symposium on Algorithms and Computation
    • Place of Presentation
      Gold Coast, Australia
    • Year and Date
      2008-12-17
    • Related Report
      2008 Annual Research Report
  • [Presentation] Improving the Competitive Ratio of the Online OVSF Code Assignment Problem2008

    • Author(s)
      S. Miyazaki, K. Okamoto
    • Organizer
      19th International Symposium on Algorithms and Computation
    • Place of Presentation
      Gold Coast, Australia
    • Year and Date
      2008-12-15
    • Related Report
      2008 Annual Research Report
  • [Presentation] Randomized Competitive Analysis for Two-Server Problems.2008

    • Author(s)
      Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara
    • Organizer
      16th Annual European Symposium on Algorithms
    • Place of Presentation
      Universitat Karlsruhe, Germany
    • Year and Date
      2008-09-15
    • Related Report
      2009 Final Research Report
  • [Presentation] Randomized Competitive Analysis for Two-Server Problems2008

    • Author(s)
      W. Bein, K. Iwama, J. Kawahara
    • Organizer
      16th Annual European Symposium on Algorithms
    • Place of Presentation
      Karlsruhe, Germany
    • Year and Date
      2008-09-15
    • Related Report
      2008 Annual Research Report
  • [Presentation] The Minimum Weight In-Tree Cover Problem2008

    • Author(s)
      Naoyuki Kamiyama, Naoki Katoh
    • Organizer
      MCO 2008
    • Place of Presentation
      Metz, France
    • Year and Date
      2008-09-09
    • Related Report
      2008 Annual Research Report
  • [Presentation] On k-Connectivity Testing in Degree-Bounded Graphs2008

    • Author(s)
      Y. Yoshida, H. Ito
    • Organizer
      1st Asian Association for Algorithms and Computation
    • Place of Presentation
      Hong Kong
    • Year and Date
      2008-07-27
    • Related Report
      2008 Annual Research Report
  • [Presentation] Property Testing on k-Vertex-Connectivity of Graphs.2008

    • Author(s)
      Yuichi Yoshida, Hiro Ito.
    • Organizer
      35th International Colloquium on Automata, Languages and Programming
    • Place of Presentation
      Reykjavik, Iceland
    • Year and Date
      2008-07-07
    • Related Report
      2009 Final Research Report
  • [Presentation] Polynomial-Time Construction of Linear Network Coding.2008

    • Author(s)
      Kazuo Iwama, Harumichi Nishimura, Mike Paterson, Rudy Raymond, Shigeru Yamashita
    • Organizer
      35th International Colloquium on Automata, Languages and Programming
    • Place of Presentation
      Reykjavik, Iceland
    • Year and Date
      2008-07-07
    • Related Report
      2009 Final Research Report
  • [Presentation] Polynonmial-Time Construction of Linear Network Coding2008

    • Author(s)
      K. Iwama, H. Nishimura, M. Paterson, R. Raymond, S. Yainashita
    • Organizer
      35th International Colloquium on Automata, Languages and Programming
    • Place of Presentation
      Reykjavik, Iceland
    • Year and Date
      2008-07-07
    • Related Report
      2008 Annual Research Report
  • [Presentation] Property Testing on $k$-Vertex-Connectivity of Graphs2008

    • Author(s)
      Y. Yoshida, H. Ito
    • Organizer
      35th International Colloquium on Automata, Languases and Prosramining
    • Place of Presentation
      Reykjavik, Iceland
    • Year and Date
      2008-07-07
    • Related Report
      2008 Annual Research Report
  • [Presentation] The Hospitals/Residents Problem with Quota Lower Bounds2008

    • Author(s)
      K. Hamada, K. Iwama, S. Miyazaki
    • Organizer
      MATCH-UP (Satellite workshop of ICALP 2008)
    • Place of Presentation
      Reykjavik, Iceland
    • Year and Date
      2008-07-06
    • Related Report
      2008 Annual Research Report
  • [Presentation] Geometric Spanner of Objects under L1 Distance2008

    • Author(s)
      Y. Zhu, J. Xu, Y. Yang, N. Katoh, S. Tanigawa
    • Organizer
      COCOON 2008
    • Place of Presentation
      Dalian, China
    • Year and Date
      2008-06-28
    • Related Report
      2008 Annual Research Report
  • [Presentation] Covering Directed Graphs by In-Trees2008

    • Author(s)
      Naoyuki Kamiyama, Naoki Katoh
    • Organizer
      COCOON 2008
    • Place of Presentation
      Dalian, China
    • Year and Date
      2008-06-28
    • Related Report
      2008 Annual Research Report
  • [Presentation] Average-Case Competitive Analyses for One-Way Trading2008

    • Author(s)
      H. Fujiwara, K. Iwama, Y. Sekiguchi
    • Organizer
      14th Annual International Computing and Combinatorics Conference
    • Place of Presentation
      Dalian, China
    • Year and Date
      2008-06-27
    • Related Report
      2008 Annual Research Report
  • [Presentation] Fast enumeration algorithms for non-erossing geometricgraphs2008

    • Author(s)
      Naoki Katoh, Shin-ichi Tanigawa
    • Organizer
      Symposium on Computational Geometry 2008
    • Place of Presentation
      MD, USA
    • Year and Date
      2008-06-11
    • Related Report
      2008 Annual Research Report
  • [Presentation] SAT, UNSAT and Coloring2008

    • Author(s)
      K. Iwama
    • Organizer
      11th International Symposium on the Theory and Applications of Satisfiability Testins
    • Place of Presentation
      Guangzhou, China
    • Year and Date
      2008-05-13
    • Related Report
      2008 Annual Research Report
  • [Presentation] The Complexity of the Hajos Calculus for Planar Graphs2008

    • Author(s)
      K. Iwama, S. Tamaki
    • Organizer
      1st Asian Association for Algorithms and Computation
    • Place of Presentation
      Hong Kong
    • Year and Date
      2008-04-27
    • Related Report
      2008 Annual Research Report
  • [Presentation] Inapproximability of stable Roommates Problem with Triple Rooms2008

    • Author(s)
      K. Iwama, S. Miyazaki, K. Okamoto
    • Organizer
      1st Asian Association for Algorithms and Computation
    • Place of Presentation
      Hong Kong
    • Year and Date
      2008-04-26
    • Related Report
      2008 Annual Research Report
  • [Presentation] Multi-Commodity Source Location Problems and Price of Greed2008

    • Author(s)
      H. Ito, M. Paterson, K. Sugihara
    • Organizer
      WALCOM 2008
    • Place of Presentation
      Dhaka, Bangladesh
    • Year and Date
      2008-02-08
    • Related Report
      2007 Annual Research Report
  • [Presentation] Arc-disjoint in-trees in directed graphs2008

    • Author(s)
      N. Kamiyama, N. Katoh, A. Takizawa
    • Organizer
      SODA 2008
    • Place of Presentation
      California, USA
    • Year and Date
      2008-01-21
    • Related Report
      2007 Annual Research Report
  • [Presentation] Unbounded-error classical and quantum communication complexity2007

    • Author(s)
      K. Iwama, H. Nishimura, R. Raymond, S. Yamashita
    • Organizer
      ISAAC 2007
    • Place of Presentation
      Sendai, Japan
    • Year and Date
      2007-12-17
    • Related Report
      2007 Annual Research Report
  • [Presentation] A Randomized Algorithm for Two Servers in Cross Polytope Spaces2007

    • Author(s)
      W. Bein, K. Iwama, J. Kawahara, L. Larmore, J. Oravec
    • Organizer
      WAOA 2007
    • Place of Presentation
      Eilat, Israel
    • Year and Date
      2007-10-12
    • Related Report
      2007 Annual Research Report
  • [Presentation] Snaky is a Winner with One Handicap2007

    • Author(s)
      H. Ito, H. Miyagawa
    • Organizer
      HERCMA 2007
    • Place of Presentation
      Athens, Greece
    • Year and Date
      2007-09-20
    • Related Report
      2007 Annual Research Report
  • [Presentation] Restricted Edge Contractions in Triangulations of the Sphere with Boundary.2007

    • Author(s)
      Masaki Moriguchi, Kokichi Sugihara
    • Organizer
      19th Canadian Conference on Computational Geometry
    • Place of Presentation
      Ottawa, Canada
    • Year and Date
      2007-08-22
    • Related Report
      2009 Final Research Report
  • [Presentation] Optimal Resource Augmentations for Online Knapsack2007

    • Author(s)
      K. Iwama, G. Zhang
    • Organizer
      APPROX 2007
    • Place of Presentation
      NJ, USA
    • Year and Date
      2007-08-22
    • Related Report
      2007 Annual Research Report
  • [Presentation] Approximation Algorithms for the Sex-Equal Stable Marriage Problem.2007

    • Author(s)
      Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
    • Organizer
      10th Algorithms and Data Structures Symposium
    • Place of Presentation
      Halifax, Nova Scotia
    • Year and Date
      2007-08-15
    • Related Report
      2009 Final Research Report
  • [Presentation] Approximation Algorithms for the Sex-Equal Stable Marriage Problem2007

    • Author(s)
      K. Iwama, S. Miyazaki, H. Yanagisawa
    • Organizer
      WADS 2007
    • Place of Presentation
      Halifax, Canada
    • Year and Date
      2007-08-15
    • Related Report
      2007 Annual Research Report
  • [Presentation] Stable Roommates Problem with Triple Rooms2007

    • Author(s)
      K. Iwama, S. Miyazaki, K. Okamoto
    • Organizer
      WAAC 2007
    • Place of Presentation
      Gwangju, Korea
    • Year and Date
      2007-08-09
    • Related Report
      2007 Annual Research Report
  • [Presentation] Properties of Symmetric Incentive Compatible Auctions2007

    • Author(s)
      X. Deng, K. Iwama, Q. Qi, A. W. Sun, T. Tasaka
    • Organizer
      COCOON 2007
    • Place of Presentation
      Alberta, Canada
    • Year and Date
      2007-07-17
    • Related Report
      2007 Annual Research Report
  • [Presentation] An Improved Exact Algorithm for Cubic Graph TSP2007

    • Author(s)
      K. Iwama, T. Nakashima
    • Organizer
      COCOON 2007
    • Place of Presentation
      Alberta, Canada
    • Year and Date
      2007-07-16
    • Related Report
      2007 Annual Research Report
  • [Presentation] Unbounded-Error One-Way Classical and Quantum Communication Complexity2007

    • Author(s)
      K. Iwama, H. Nishimura, R. Raymond, S. Yamashita
    • Organizer
      ICALP 2007
    • Place of Presentation
      Wroclaw, Poland
    • Year and Date
      2007-07-09
    • Related Report
      2007 Annual Research Report
  • [Presentation] Winning Ways of Weighted Poset Games2007

    • Author(s)
      H. Ito, G. Nakamura, S. Takata
    • Organizer
      KyotoCGGT2007
    • Place of Presentation
      Kyoto, Japan
    • Year and Date
      2007-06-15
    • Related Report
      2007 Annual Research Report
  • [Presentation] Transformating Graphs with the Same Graphic Sequences2007

    • Author(s)
      S. Bereg, H. Ito
    • Organizer
      KyotoCGGT2007
    • Place of Presentation
      Kyoto, Japan
    • Year and Date
      2007-06-12
    • Related Report
      2007 Annual Research Report
  • [Presentation] A Tight Bound on Online Buffer Management for Two-port Shared-Memory Switches2007

    • Author(s)
      K. Kobayashi, S. Miyazaki, Y. Okabe
    • Organizer
      SPAA 2007
    • Place of Presentation
      CA, USA
    • Year and Date
      2007-06-11
    • Related Report
      2007 Annual Research Report
  • [Presentation] Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents2007

    • Author(s)
      S. Das, P. Flocchini, N. Santoro, M. Yamashita
    • Organizer
      SIROCCO 2007
    • Place of Presentation
      Castiglioncello, Italy
    • Year and Date
      2007-06-08
    • Related Report
      2007 Annual Research Report
  • [Presentation] Strip Packing vs. Bin Packing2007

    • Author(s)
      X, Han, K. Iwama, D. Ye, G. Zhang
    • Organizer
      AAIM 2007
    • Place of Presentation
      OR, USA
    • Year and Date
      2007-06-08
    • Related Report
      2007 Annual Research Report
  • [Presentation] Drawing Borders Efficiently2007

    • Author(s)
      K. Iwama, E. Miyano, H. Ono
    • Organizer
      FUN 2007
    • Place of Presentation
      Castiglioncello, Italy
    • Year and Date
      2007-06-04
    • Related Report
      2007 Annual Research Report
  • [Presentation] A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection2007

    • Author(s)
      W. Bein, J. Correa, X. Han
    • Organizer
      ESCAPE 2007
    • Place of Presentation
      Hangzhou, China
    • Year and Date
      2007-04-08
    • Related Report
      2007 Annual Research Report
  • [Presentation] Truthful Auctions with Limited Range of Bids2007

    • Author(s)
      T. Horiyama, K. Iwama, D. Sumita
    • Organizer
      5th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications
    • Place of Presentation
      Sendai, Japan
    • Year and Date
      2007-04-04
    • Related Report
      2007 Annual Research Report
  • [Presentation] A 1.875-Approximation Algorithm for the Stable Marriage Problem2007

    • Author(s)
      K. Iwama, S. Miyazaki, N. Yamauchi
    • Organizer
      18th ACM-SIAM Symposium on Discrete Algorithms
    • Place of Presentation
      New Orleans
    • Year and Date
      2007-01-09
    • Related Report
      2009 Self-evaluation Report
  • [Presentation] Harmonic Algorithm for 3-Dimensional Strip Packing Problem2007

    • Author(s)
      N. Bansal, X. Han, K. Iwama, M. Sviridenko, G. Zhang
    • Organizer
      18th Annual ACM-SIAM Symposium on Discrete Algorithms
    • Place of Presentation
      New Orleans
    • Year and Date
      2007-01-07
    • Related Report
      2009 Self-evaluation Report
  • [Book] パズル・ゲームで楽しむ数学-娯楽数学の世界2010

    • Author(s)
      伊藤大雄
    • Total Pages
      180
    • Publisher
      森北出版
    • Related Report
      2009 Annual Research Report
  • [Book] Encyclopedia of Optimization: Voronoi Diagrams in Facility Location2009

    • Author(s)
      Kokichi Sugihara
    • Publisher
      Springer
    • Related Report
      2009 Final Research Report
  • [Book] Encyclopedia of Optimization: Combinatorial Optimization Algorithms in Resource Allocation Problems2009

    • Author(s)
      Naoki Katoh
    • Publisher
      Springer
    • Related Report
      2009 Final Research Report
  • [Book] Encyclopedia of Algorithms: Local Search Algorithms for kSAT.2008

    • Author(s)
      Kazuo Iwama
    • Publisher
      Springer
    • Related Report
      2009 Final Research Report
  • [Book] Encyclopedia of Algorithms: Stable Marriage with Ties and Incomplete Lists2008

    • Author(s)
      Kazuo Iwama, Shuichi Miyazaki
    • Publisher
      Springer
    • Related Report
      2009 Final Research Report
  • [Book] Encyclopedia of Algorithms2008

    • Author(s)
      Ming-Yang Kao (Ed. )
    • Total Pages
      1166
    • Publisher
      Springer
    • Related Report
      2008 Annual Research Report
  • [Book] オンラインアルゴリズムとストリームアルゴリズム(アルゴリズム・サイエンスシリーズ5数理技法編)2007

    • Author(s)
      徳山 豪
    • Total Pages
      224
    • Publisher
      共立出版
    • Related Report
      2007 Annual Research Report
  • [Book] へんな立体-脳が鍛えられる「立体だまし絵」づくり2007

    • Author(s)
      杉原 厚吉
    • Total Pages
      141
    • Publisher
      誠文堂新光社
    • Related Report
      2007 Annual Research Report

URL: 

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

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi