[ Japanese / English ]

Researchers

Project Leader

   Kazuo Iwama (Kyoto University)

Advisory Committee

   Bernard Chazelle (Princeton University)
   Josep Diaz (Universitat Politecnica de Catalunya)
   Yasuyoshi Inagaki (Aichi Prefectural University)
   Akira Maruoka (Ishinomaki Senshu University)

Steering Committee

   Takao Asano (Chuo University)
   Tetsuo Asano (Japan Advanced Institute of Science and Technology)
   Hiro Ito (Kyoto University)
   Kazuo Iwama (Kyoto University)
   Takeaki Uno (National Institute of Informatics)
   Naoki Katoh (Kyoto University)
   Kouichi Sakurai (Kyushu University)
   Kokichi Sugihara (University of Tokyo)
   Eiji Takimoto (Tohoku University)
   Keisuke Tanaka (Tokyo Institute of Technology)
   Takeshi Tokuyama (Tohoku University)
   Takao Nishizeki (Tohoku University)
   Tomio Hirata (Nagoya University)
   Takashi Horiyama (Saitama University)
   Kazuhisa Makino (University of Tokyo)
   Masafumi Yamashita (Kyushu University)
   Osamu Watanabe (Tokyo Institute of Technology)

Category A: Model Research

A01: Modeling of Decision Making Based on Online Prediction
   Eiji Takimoto (Tohoku University)
   Yoshifumi Sakai (Tohoku University)
   Kazuyuki Amano (Gunma University)
A02: Computation-Theoretical Design of Data Mining and Knowledge Extraction Models
   Takeshi Tokuyama (Tohoku University)
   Akiyoshi Shioura (Tohoku University)
   Ken-ichi Kawarabayashi (National Institute of Informatics)
A03: Models for Representing Boolean Functions and their Application to Symbolic Algorithms
   Yasuhiko Takenaga (University of Electro-Communications)
A04: Designing Exponential Size Polynomial Time Neighborhoods in Combinatorial Optimization
   Hisao Tamaki (Meiji University)
   Yukihiro Iguchi (Meiji University)
A05: Research on Analysis of Hardware Algorithms
   Naofumi Takagi (Nagoya University)
   Kazuyoshi Takagi (Nagoya University)
A06: Computational Complexity and Approximability of Geometric Location Problems
   Naoki Katoh (Kyoto University)
   Akihisa Tamura (Keio University)
   Makoto Ohsaki (Kyoto University)
   Atsushi Takizawa (Kyoto University)
A07: Research on the Power of Feasible Quantum Computers
   Shigeru Yamashita (Nara Institute of Science and Technology)
   Masaki Nakanishi (Nara Institute of Science and Technology)
A08: A Study on Resource Allocation Problem in Dynamic Networks
   Satoshi Fujita (Hiroshima University)
   Koji Nakano (Hiroshima University)
   Yasuhiko Morimoto (Hiroshima University)
A09: Development of Algorithms for Implicit Representations
   Ayumi Shinohara (Tohoku University)
   Masayuki Takeda (Kyushu University)
   Shinichi Shimozono (Kyushu Institute of Technology)
   Hiroshi Sakamoto (Kyushu Institute of Technology)
A10: Combinatorial Optimization Models for Mobile Objects
   Eiji Miyano (Kyushu Institute of Technology)
   Hideo Hirose (Kyushu Institute of Technology)
   Yuichi Asahiro (Kyushu Sangyo University)

Category B: Lower-Bound Research

B01: Analysis of Discrete Structures by Probabilistic and Linear Algebra Methods
   Toshiya Itoh (Tokyo Institute of Technology)
   Shuichi Ueno (Tokyo Institute of Technology)
B02: The Design and Analysis of Cryptographic Protocols Based on Complexity Theory
   Keisuke Tanaka (Tokyo Institute of Technology)
   Osamu Watanabe (Tokyo Institute of Technology)
   Seinosuke Toda (Nihon University)
   Akinori Kawachi (Tokyo Institute of Technology)
B03: On the Optimization of Quantum Logic Circuits
   Tetsurou Nishino (University of Electro-Communications)
   Kazuo Ohta (University of Electro-Communications)
   Jun Tarui (University of Electro-Communications)
   Noboru Kunihiro (University of Electro-Communications)
B04: Circuit Complexity Lower Bounds and Its Applications
   Tatsuie Tsukiji (Tokyo Denki University)
   Zhi-Zhong Chen (Tokyo Denki University)
   Akihiro Matsuura (Tokyo Denki University)
B05: Structural Analysis of Discrete Systems Based on Boolean Theory with Application to their Complexity Analysis
   Kazuhisa Makino (University of Tokyo)
B06: A Computational Approach to the Application and Limitation of Sidechannel Attacks against Cryptosystems
   Kouichi Sakurai (Kyushu University)
   Tsuyoshi Takagi (Future University-Hakodate)
   Toshihiro Tabata (Okayama University)
   Yasuyuki Sakai (Mitsubishi Electric)

Category C: Upper-Bound Research

C01: Graph Drawing Algorithms and their Applications to Web Searching
   Takao Nishizeki (Tohoku University)
   Xiao Zhou (Tohoku University)
   Kazuyuki Miura (Fukushima University)
   Yasuhito Asano (Tokyo Denki University)
   Takehiro Ito (Tohoku University)
C02: Construction of Robust Algorithms Based on the Fusion of Discrete and Continuous Structures
   Kokichi Sugihara (University of Tokyo)
   Kazuo Murota (University of Tokyo)
   Hiroshi Imai (University of Tokyo)
   Tomomi Matsui (Chuo University)
   Satoru Iwata (Kyoto University)
   Yasuaki Oishi (University of Tokyo)
   Yoshihiro Kanno (University of Tokyo)
   Tetsushi Nishida (University of Tokyo)
   Shinji Imahori (University of Tokyo)
C03: Algorithmic Study on the Trade-off Between Social Utility and Personal Utility on Networks
   Takao Asano (Chuo University)
   Toshimasa Watanabe (Hiroshima University)
   Keiko Imai (Chuo University)
C04: A theoretical Approach to Practical Efficient Enumeration Algorithms
   Takeaki Uno (National Institute of Informatics)
   Shin-ichi Nakano (Gunma University)
   Yasuko Matsui (Tokai University)
   Yoshio Okamoto (Toyohashi University of Technology)
C05: Analysis of Computational Complexities of Computer-Vision Related Problems with Proposal of Efficient Algorithms
   Tetsuo Asano (Japan Advanced Institute of Science and Technology)
   Ryuhei Uehara (Japan Advanced Institute of Science and Technology)
   Koji Obokata (Ichinoseki National College of Technology)
   Mitsuo Motoki (Japan Advanced Institute of Science and Technology)
   Yasuyuki Kawamura (Ishikawa National College of Technology)
C06: Design of Approximation Algorithms for the Problems with Graph Structures
   Hiroshi Nagamochi (Kyoto University)
   Yushi Uno (Osaka Prefecture University)
   Yoshiyuki Karuno (Kyoto Institute of Technology)
C07: Discrete Optimization Problems with Respect to Web Contents Utilization
   Shigeru Masuyama (Toyohashi University of Technology)
   Kyoji Umemura (Toyohashi University of Technology)
   Shin-ichi Nakayama (University of Tokushima)
   Hirotoshi Honma (Kushiro National College of Technology)
   Shin Aida (Toyohashi University of Technology)
   Toshimasa Ishii (Otaru University of Commerce)
C08: Study of Approximation Algorithms
   Tomio Hirata (Nagoya University)
   Koichi Wada (Nagoya Institute of Technology)
   Toshihiro Fujito (Toyohashi University of Technology)
   Takao Ono (Nagoya University)
C09: Research on Models and Algorithms for Network Problems
   Hiro Ito (Kyoto University)
   Kazuo Iwama (Kyoto University)
   Toshimitsu Masuzawa (Osaka University)
   Shuichi Miyazaki (Kyoto University)
   Takashi Horiyama (Saitama University)
   Suguru Tamaki (Kyoto University)
   Masaki Yamamoto (Kyoto University)
C10: Studies on Metaheuristics as Basic Algorithms of Informatics
   Toshihide Ibaraki (Kwansei Gakuin University)
   Satoru Fujishige (Kyoto University)
   Mutsunori Yagiura (Nagoya University)
   Koji Nonobe (Hosei University)
   Hiroyoshi Miwa (Kwansei Gakuin University)
   Shunji Umetani (University of Electro-Communications)
   Hiroshi Fujiwara (Kwansei Gakuin University)
   Eiji Chiba (Kwansei Gakuin University)
C11: Space-Efficient Algorithms for Large-Scale Data Processing
   Kunihiko Sadakane (Kyushu University)
   Masafumi Yamashita (Kyushu University)
   Hirotaka Ono (Kyushu University)