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

Studies on Algorithms for Insufficient Spatial Information

Research Project

Project/Area Number 22240001
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  京都大学, 情報学研究科, 教授 (50131272)

Co-Investigator(Kenkyū-buntansha) AVIS David  京都大学, 情報学研究科, 教授 (90584110)
MIYAZAKI Shuichi  京都大学, 学術情報メディアセンター, 准教授 (00303884)
TAMAKI Suguru  京都大学, 情報学研究科, 助教 (40432413)
伊藤 大雄  京都大学, 情報学研究科, 准教授 (50283487)
Co-Investigator(Renkei-kenkyūsha) ITO Hiro  電気通信大学, 情報理工学研究科, 教授 (50283487)
KATOH Naoki  京都大学, 工学研究科, 教授 (40145826)
TOKUYAMA Takeshi  東北大学, 情報科学研究科, 教授 (40312631)
YAMASHITA Masafumi  九州大学, システム情報科学研究院, 教授 (00135419)
WATANABE Osamu  東京工業大学, 情報理工学研究科, 教授 (80158617)
HORIYAMA Takashi  埼玉大学, 理工学研究科, 准教授 (60314530)
KAWAHARA Jun  奈良先端科学技術大学院大学, 情報科学研究科, 助教 (20572473)
MORIZUMI Hiroki  島根大学, 総合理工学研究科, 助教 (50463782)
Project Period (FY) 2010 – 2012
Project Status Completed (Fiscal Year 2012)
Budget Amount *help
¥49,790,000 (Direct Cost: ¥38,300,000、Indirect Cost: ¥11,490,000)
Fiscal Year 2012: ¥15,860,000 (Direct Cost: ¥12,200,000、Indirect Cost: ¥3,660,000)
Fiscal Year 2011: ¥15,860,000 (Direct Cost: ¥12,200,000、Indirect Cost: ¥3,660,000)
Fiscal Year 2010: ¥18,070,000 (Direct Cost: ¥13,900,000、Indirect Cost: ¥4,170,000)
Keywordsアルゴリズム理論 / グラフ問題 / アルゴリズム的ゲーム理論 / 乱化計算 / アルゴリズム / 計算困難問題 / 情報の補填 / 数理モデル化 / 理論的性能保証 / 劣線形時間 / 乱化アルゴリズム / 分散アルゴリズム / 准線形時間
Research Abstract

One of the main challenge in modern algorithm design is to copewith insufficient information. In this study, we try to construct a general framework fordesign and evaluation of algorithms that can cope with insufficient spatial information. Asa result, we give design and analysis of such algorithms for various problems in severalfields such as graph problems, algorithmic game theory and randomized computationtheory.

Report

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

    (69 results)

All 2013 2012 2011 2010 Other

All Journal Article (23 results) (of which Peer Reviewed: 23 results) Presentation (40 results) (of which Invited: 1 results) Book (4 results) Remarks (2 results)

  • [Journal Article] Families of polytopal digraphs that do not satisfy the shelling property2013

    • Author(s)
      David Avis, Hiroyuki Miyata, Sonoko Moriyama
    • Journal Title

      Comput. Geom.

      Volume: 46(3) Issue: 3 Pages: 382-393

    • DOI

      10.1016/j.comgeo.2012.10.005

    • Related Report
      2012 Annual Research Report 2012 Final Research Report
    • Peer Reviewed
  • [Journal Article] Is Valiant-Vazirani's isolation probabilityimprovable?2013

    • Author(s)
      Holger Dell, Valentine Kabanets,Dieter van Melkebeek, Osamu Watanabe
    • Journal Title

      Computational Complexity

      Volume: 22(2) Issue: 2 Pages: 345-383

    • DOI

      10.1007/s00037-013-0059-7

    • Related Report
      2012 Final Research Report
    • Peer Reviewed
  • [Journal Article] Rooted-tree decompositions with matroid constraints and infinitesimal rigidity of frameworks with boundaries2013

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

      SIAM J. Discrete Math.

      Volume: 27 Issue: 1 Pages: 155-185

    • DOI

      10.1137/110846944

    • Related Report
      2012 Final Research Report
    • Peer Reviewed
  • [Journal Article] A satisfiability algorithm and average-case hardness for formulas over the full binary basis2013

    • Author(s)
      Kazuhisa Seto, Suguru Tamaki
    • Journal Title

      Computational Complexity

      Volume: 22(2) Issue: 2 Pages: 245-274

    • DOI

      10.1007/s00037-013-0067-7

    • NAID

      120005474485

    • Related Report
      2012 Annual Research Report 2012 Final Research Report
    • Peer Reviewed
  • [Journal Article] Quantum counterfeit coin problems2013

    • Author(s)
      K. Iwama, H. Nishimura, R. Raymond, J. Teruyama
    • Journal Title

      Theoretical Computer Science 456

      Volume: 456 Pages: 329-352

    • DOI

      10.1016/j.tcs.2012.05.039

    • Related Report
      2012 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Derandomizing HSSW Algorithm for 3-SAT2013

    • Author(s)
      Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
    • Journal Title

      Algorithmica

      Volume: 未定 Issue: 2 Pages: 112-124

    • DOI

      10.1007/s00453-012-9741-4

    • Related Report
      2012 Annual Research Report
    • Peer Reviewed
  • [Journal Article] The Gathering Problem for Two Oblivious Robots with Unreliable Compasses2012

    • Author(s)
      Taisuke Izumi
    • Journal Title

      SIAM Journal on Computing

      Volume: 41(1) Issue: 1 Pages: 26-46

    • DOI

      10.1137/100797916

    • Related Report
      2012 Final Research Report
    • Peer Reviewed
  • [Journal Article] Improved Constant-Time Approximation Algorithms for Maximum Matchings and Other Optimization Problems2012

    • Author(s)
      Yuichi Yoshida, Masaki Yamamoto, Hiro Ito
    • Journal Title

      SIAM J. Comput.

      Volume: 41(4) Issue: 4 Pages: 1074-1093

    • DOI

      10.1137/110828691

    • Related Report
      2012 Annual Research Report 2012 Final Research Report
    • Peer Reviewed
  • [Journal Article] Improved approximation bounds for the Student-Project Allocation problem with preferences over projects2012

    • Author(s)
      Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
    • Journal Title

      J. Discrete Algorithms

      Volume: 13 Pages: 59-66

    • DOI

      10.1016/j.jda.2012.02.001

    • NAID

      120006338072

    • Related Report
      2012 Annual Research Report
    • Peer Reviewed
  • [Journal Article] An Almost Optimal Algorithm for Winkler's Sorting Pairs in Bins2012

    • Author(s)
      H.ITO, J.TERUYAMA, Y.YOSHIDA
    • Journal Title

      Progress in Informatics

      Volume: 9 Pages: 3-7

    • Related Report
      2011 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Property Testing on k-Vertex-Connectivity of Graphs2012

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

      Algorithmica

      Volume: 62(3-4) Issue: 3-4 Pages: 701-712

    • DOI

      10.1007/s00453-010-9477-y

    • NAID

      10030998706

    • Related Report
      2011 Annual Research Report
    • Peer Reviewed
  • [Journal Article] A randomized algorithm for two servers in cross polytope spaces2011

    • Author(s)
      Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara, Lawrence L. Larmore, James A.Oravec
    • Journal Title

      Theor.Comput. Sci.

      Volume: 412(7) Issue: 7 Pages: 563-572

    • DOI

      10.1016/j.tcs.2010.08.022

    • Related Report
      2012 Final Research Report
    • Peer Reviewed
  • [Journal Article] A Proof of the Molecular Conjecture2011

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

      Discrete and Computational Geometry

      Volume: 45 Issue: 4 Pages: 645-700

    • DOI

      10.1007/s00454-011-9348-6

    • NAID

      110007227536

    • Related Report
      2012 Final Research Report
    • Peer Reviewed
  • [Journal Article] An exact algorithm for the Boolean connectivity problem for k-CNF2011

    • Author(s)
      K.Makino, S.Tamaki, M.Yamamoto
    • Journal Title

      Theor.Comput.Sci.

      Volume: 412(35) Issue: 35 Pages: 4613-4618

    • DOI

      10.1016/j.tcs.2011.04.041

    • NAID

      120003338848

    • Related Report
      2011 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Arrangements of n Points whose Incident-Line-Numbers are at most n/22011

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

      Graphs and Combinatorics

      Volume: 27(3) Issue: 3 Pages: 321-326

    • DOI

      10.1007/s00373-011-1023-4

    • Related Report
      2011 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Average-case competitive analyses for one-way trading2011

    • Author(s)
      Hiroshi Fujiwara, Kazuo Iwama, Yoshiyuki Sekiguchi
    • Journal Title

      J.Comb.Optim.

      Volume: 21(1) Pages: 83-107

    • NAID

      120007100508

    • Related Report
      2010 Annual Research Report
    • Peer Reviewed
  • [Journal Article] A randomized algorithm for two servers in cross polytope spaces2011

    • Author(s)
      Wolfgang W.Bein, Kazuo Iwama, Jun Kawahara, Lawrence L.Larmore, James A.Oravec
    • Journal Title

      Theor.Comput.Sci.

      Volume: 412(7) Pages: 563-572

    • Related Report
      2010 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Distance k-sectors exist2010

    • Author(s)
      Keiko Imai, Akitoshi Kawamura, Jiri Matousek, Daniel Reem, Takeshi Tokuyama
    • Journal Title

      Comput. Geom.

      Volume: 43(9) Issue: 9 Pages: 713-720

    • DOI

      10.1016/j.comgeo.2010.05.001

    • NAID

      110008004168

    • Related Report
      2012 Final Research Report
    • Peer Reviewed
  • [Journal Article] Approximation algorithms for the sex-equal stable marriage problem2010

    • Author(s)
      Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
    • Journal Title

      ACM Transactions on Algorithms

      Volume: 7(1) Issue: 1 Pages: 2-2

    • DOI

      10.1145/1868237.1868239

    • NAID

      120006338075

    • Related Report
      2012 Final Research Report 2010 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Weighted random popular matchings2010

    • Author(s)
      Toshiya Itoh, Osamu Watanabe
    • Journal Title

      Random Struct.Algorithms

      Volume: 37(4) Issue: 4 Pages: 477-494

    • DOI

      10.1002/rsa.20316

    • NAID

      110006343680

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

    • Author(s)
      Kazuo Iwama, Kazuhisa Seto, Suguru Tamaki
    • Journal Title

      IEICE Transactions

      Volume: 93-A(6) Pages: 1000-1007

    • NAID

      10026864512

    • Related Report
      2010 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Online knapsack with resource augmentation2010

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

      Inf.Process.Lett.

      Volume: 110(22) Pages: 1016-1020

    • Related Report
      2010 Annual Research Report
    • Peer Reviewed
  • [Journal Article] On the Boolean connectivity problem for Horn relations2010

    • Author(s)
      Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
    • Journal Title

      Discrete Applied Mathematics

      Volume: 158(18) Pages: 2024-2030

    • Related Report
      2010 Annual Research Report
    • Peer Reviewed
  • [Presentation] Base Location Problems for Base-Monotone Regions2013

    • Author(s)
      Jinhee Chun, Takashi Horiyama,Takehiro Ito, Natsuda Kaothanthong,Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno
    • Organizer
      WALCOM
    • Place of Presentation
      Kharagpur, India
    • Year and Date
      2013-02-15
    • Related Report
      2012 Final Research Report
  • [Presentation] Constant-Time Algorithms for Sparsity Matroids2012

    • Author(s)
      Hiro Ito, Shin-ichi Tanigawa, Yuichi Yoshida
    • Organizer
      ICALP
    • Place of Presentation
      Coventry, United Kingdom
    • Year and Date
      2012-07-10
    • Related Report
      2012 Final Research Report
  • [Presentation] Reconstructing Strings from Substrings with Quantum Queries2012

    • Author(s)
      Richard Cleve, Kazuo Iwama, Francois Le Gall, Harumichi Nishimura, Seiichiro Tani,Junichi Teruyama, Shigeru Yamashita
    • Organizer
      SWAT
    • Place of Presentation
      Helsinki, Finland
    • Year and Date
      2012-07-06
    • Related Report
      2012 Final Research Report
  • [Presentation] Computing All MOD-Functions Simultaneously2012

    • Author(s)
      Evgeny Demenkov, Alexander S. Kulikov,Ivan Mihajlin, Hiroki Morizumi
    • Organizer
      CSR
    • Place of Presentation
      Nizhny Novgorod, Russia
    • Year and Date
      2012-07-06
    • Related Report
      2012 Final Research Report
  • [Presentation] Approximability of stable Matching Problems2012

    • Author(s)
      Kazuo Iwama
    • Organizer
      WALCOM 2012
    • Place of Presentation
      Dhaka, Bangladesh(招待講演)
    • Year and Date
      2012-02-12
    • Related Report
      2011 Annual Research Report
  • [Presentation] Linear programming, width-1 CSPs, and robust satisfaction2012

    • Author(s)
      G.Kun, R.O'Donnell, S.Tamaki, Y.Yoshida, Y.Zhou
    • Organizer
      ITCS 2012
    • Place of Presentation
      Cambridge, MA, USA
    • Year and Date
      2012-01-10
    • Related Report
      2011 Annual Research Report
  • [Presentation] Linear programming programming, width-1 CSPs, and robust satisfaction.2012

    • Author(s)
      Gabor Kun, Ryan O'Donnell, Suguru Tamaki, Yuichi Yoshida, Yuan Zhou
    • Organizer
      ITCS
    • Place of Presentation
      Cambridge, USA
    • Year and Date
      2012-01-09
    • Related Report
      2012 Final Research Report
  • [Presentation] Constant-Time Algorithms for Sparsity Matroids2012

    • Author(s)
      H.Ito, S.Tanigawa, Y.Yoshida
    • Organizer
      ICALP 2012
    • Place of Presentation
      University of Warwick, UK(発表確定)
    • Related Report
      2011 Annual Research Report
  • [Presentation] Reconstructing Strings from Substrings with Quantum Queries2012

    • Author(s)
      Cleve, Iwama, Le Gall, Nishimura, Tani, Teruvama, Yamashita
    • Organizer
      SWAT 2012
    • Place of Presentation
      Helsinki, Finland(発表確定)
    • Related Report
      2011 Annual Research Report
  • [Presentation] A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis2012

    • Author(s)
      K.Seto, S.Tamaki
    • Organizer
      CCC 2012
    • Place of Presentation
      Porto, Portugal(発表確定)
    • Related Report
      2011 Annual Research Report
  • [Presentation] Algorithms and Complexity of Generalized River Crossing Problems2012

    • Author(s)
      H.Ito, S.Langerman, Y.Yoshida
    • Organizer
      FUN 2012
    • Place of Presentation
      Venice, Italy(発表確定)
    • Related Report
      2011 Annual Research Report
  • [Presentation] Constant-Time Approximation Algorithms for the Knapsack Problem2012

    • Author(s)
      H.Ito, S.Kiyoshima, Y.Yoshida
    • Organizer
      TAMC 2012
    • Place of Presentation
      Beijing, China(発表確定)
    • Related Report
      2011 Annual Research Report
  • [Presentation] Verifying Nash Equilibria in PageRank Games on Undirected Web Graphs2011

    • Author(s)
      David Avis, Kazuo Iwama, Daichi Paku
    • Organizer
      ISAAC
    • Place of Presentation
      Yokohama, Japan
    • Year and Date
      2011-12-07
    • Related Report
      2012 Final Research Report
  • [Presentation] Verifying Nash Equilibria in PageRank Games on Undirected Web Graphs2011

    • Author(s)
      D.Avis, K.Iwama, D.Paku
    • Organizer
      ISAAC 2011
    • Place of Presentation
      Yokohama, Japan
    • Year and Date
      2011-12-07
    • Related Report
      2011 Annual Research Report
  • [Presentation] The Hospitals/Residents Problem with Quota Lower Bounds2011

    • Author(s)
      Koki Hamada, Kazuo Iwama, Shuichi Miyazaki
    • Organizer
      ESA
    • Place of Presentation
      Saarbrucken, Germany
    • Year and Date
      2011-09-05
    • Related Report
      2012 Final Research Report
  • [Presentation] The Hospitals/Residents Problem with Quota Lower Bounds2011

    • Author(s)
      K.Hamada, K.Iwama, S.Mivazaki
    • Organizer
      ESA 2011
    • Place of Presentation
      Saarbrucken, Germany
    • Year and Date
      2011-09-05
    • Related Report
      2011 Annual Research Report
  • [Presentation] Derandomizing HSSW Algorithm for 3-SAT2011

    • Author(s)
      K.Makino, S.Tamaki, M.Yamamoto
    • Organizer
      COCOON 2011
    • Place of Presentation
      Dallas, Texas, USA
    • Year and Date
      2011-08-14
    • Related Report
      2011 Annual Research Report
  • [Presentation] Helly Numbers of Polyominoes2011

    • Author(s)
      J.Cardinal, H.Ito, M.Korman, S.Langerman
    • Organizer
      CCCG 2011
    • Place of Presentation
      Toronto, Canada
    • Year and Date
      2011-08-12
    • Related Report
      2011 Annual Research Report
  • [Presentation] Complexity of the Stamp Folding Problem2011

    • Author(s)
      T.Umesato, T.Saitoh, R.Uehara, H.Ito
    • Organizer
      COCOA 2011
    • Place of Presentation
      Zhangjiajie, China
    • Year and Date
      2011-08-05
    • Related Report
      2011 Annual Research Report
  • [Presentation] Evaluations of Hash Distributed A* in Optimal Sequence Alignment2011

    • Author(s)
      Yoshikazu Kobayashi, Akihiro Kishimoto,Osamu Watanabe
    • Organizer
      IJCAI
    • Place of Presentation
      Barcelona,Spain
    • Year and Date
      2011-07-22
    • Related Report
      2012 Final Research Report
  • [Presentation] Improved Approximation Bounds for the Student-Project Allocation Problem with Preferences over Projects2011

    • Author(s)
      K.Iwama, S.Miyazaki, H.Yanagisawa
    • Organizer
      TAMC 2011
    • Place of Presentation
      Tokyo, Japan
    • Year and Date
      2011-05-25
    • Related Report
      2011 Annual Research Report
  • [Presentation] Improved Randomized Algorithms for 3-SAT2010

    • Author(s)
      Kazuo Iwama, Kazuhisa Seto, Tadashi Takai, Suguru Tamaki
    • Organizer
      ISAAC 2010
    • Place of Presentation
      Jeju Island, Korea
    • Year and Date
      2010-12-15
    • Related Report
      2010 Annual Research Report
  • [Presentation] Quantum Counterfeit Coin Problems2010

    • Author(s)
      Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama
    • Organizer
      ISAAC 2010
    • Place of Presentation
      Jeju Island, Korea
    • Year and Date
      2010-12-15
    • Related Report
      2010 Annual Research Report
  • [Presentation] Improving the Competitive Ratios of the Seat Reservation Problem2010

    • Author(s)
      Shuichi Miyazaki, Kazuya Okamoto
    • Organizer
      IFIP TCS 2010
    • Place of Presentation
      Brisbane, Australia
    • Year and Date
      2010-09-23
    • Related Report
      2010 Annual Research Report
  • [Presentation] Testing Outerplanarity of Bounded Degree Graphs2010

    • Author(s)
      Yuichi Yoshida, Hiro Ito
    • Organizer
      APPROX-RANDOM 2010
    • Place of Presentation
      UPC Barcelona, Spain
    • Year and Date
      2010-09-09
    • Related Report
      2010 Annual Research Report
  • [Presentation] A Query Efficient Non-adaptive Long Code Test with Perfect Completeness2010

    • Author(s)
      Suguru Tamaki, Yuichi Yoshida
    • Organizer
      APPROX-RANDOM 2010
    • Place of Presentation
      UPC Barcelona, Spain
    • Year and Date
      2010-09-09
    • Related Report
      2010 Annual Research Report
  • [Presentation] A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties2010

    • Author(s)
      Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
    • Organizer
      ESA
    • Place of Presentation
      Liverpool, United Kingdom
    • Year and Date
      2010-09-08
    • Related Report
      2012 Final Research Report
  • [Presentation] A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties2010

    • Author(s)
      Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
    • Organizer
      ESA 2010
    • Place of Presentation
      Liverpool, UK
    • Year and Date
      2010-09-08
    • Related Report
      2010 Annual Research Report
  • [Presentation] Those ubiquitous cut polyhedra2010

    • Author(s)
      David Avis
    • Organizer
      CCCG 2010
    • Place of Presentation
      University of Manitoba, Winnipeg, Canada
    • Year and Date
      2010-08-09
    • Related Report
      2010 Annual Research Report
  • [Presentation] On the computational power of oblivious robots:forming a series of geometric patterns2010

    • Author(s)
      Shantanu Das, Paola Flocchini, Nicola Santoro, Masafumi Yamashita
    • Organizer
      PODC
    • Place of Presentation
      Zurich, Switzerland
    • Year and Date
      2010-07-27
    • Related Report
      2012 Final Research Report
  • [Presentation] An Exact Algorithm for the Boolean Connectivity Problem for k-CNF2010

    • Author(s)
      Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
    • Organizer
      SAT 2010
    • Place of Presentation
      Edinburgh, Scotland, UK
    • Year and Date
      2010-07-11
    • Related Report
      2010 Annual Research Report
  • [Presentation] Zone diagrams in Euclidean spaces and in other normed spaces2010

    • Author(s)
      Akitoshi Kawamura, Jiri Matousek,Takeshi Tokuyama
    • Organizer
      Symposium on Computational Geometry
    • Place of Presentation
      Utah, USA
    • Year and Date
      2010-06-15
    • Related Report
      2012 Final Research Report
  • [Presentation] Recovering Strings in Oracles: Quantum and Classic

    • Author(s)
      Kazuo Iwama
    • Organizer
      Developments in Language Theory 2012
    • Place of Presentation
      Taipei, Taiwan
    • Related Report
      2012 Annual Research Report
    • Invited
  • [Presentation] Reconstructing Strings from Substrings with Quantum Queries

    • Author(s)
      Richard Cleve, Kazuo Iwama, Francois Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita
    • Organizer
      SWAT 2012
    • Place of Presentation
      Helsinki, Finland
    • Related Report
      2012 Annual Research Report
  • [Presentation] Algorithms and Complexity of Generalized River Crossing Problems

    • Author(s)
      Hiro Ito, Stefan Langerman, Yuichi Yoshida
    • Organizer
      FUN 2012
    • Place of Presentation
      Venice, Italy
    • Related Report
      2012 Annual Research Report
  • [Presentation] Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs

    • Author(s)
      Mitsuru Kusumoto, Yuichi Yoshida, Hiro Ito
    • Organizer
      ICNC 2012
    • Place of Presentation
      Okinawa, Japan
    • Related Report
      2012 Annual Research Report
  • [Presentation] Constant-Time Algorithms for Sparsity Matroids

    • Author(s)
      Hiro Ito, Shin-ichi Tanigawa, Yuichi Yoshida
    • Organizer
      ICALP 2012
    • Place of Presentation
      University of Warwick, UK
    • Related Report
      2012 Annual Research Report
  • [Presentation] Constant-Time Approximation Algorithms for the Knapsack Problem

    • Author(s)
      Hiro Ito, Susumu Kiyoshima, Yuichi Yoshida
    • Organizer
      TAMC 2012
    • Place of Presentation
      Beijing, China
    • Related Report
      2012 Annual Research Report
  • [Presentation] Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues

    • Author(s)
      Suguru Tamaki, Yuichi Yoshida
    • Organizer
      APPROX-RANDOM 2012
    • Place of Presentation
      Boston, USA
    • Related Report
      2012 Annual Research Report
  • [Presentation] A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis

    • Author(s)
      Kazuhisa Seto, Suguru Tamaki
    • Organizer
      IEEE Conference on Computational Complexity 2012
    • Place of Presentation
      Porto, Portugal
    • Related Report
      2012 Annual Research Report
  • [Book] 離散数学のすすめ2010

    • Author(s)
      伊藤 大雄, 宇野 裕之
    • Total Pages
      325
    • Publisher
      現代数学社
    • Related Report
      2012 Final Research Report
  • [Book] 適応的分散アルゴリズム2010

    • Author(s)
      増澤 利光, 山下 雅史
    • Total Pages
      307
    • Publisher
      共立出版
    • Related Report
      2012 Final Research Report
  • [Book] 離散数学のすすめ2010

    • Author(s)
      伊藤大雄, 宇野裕之編著
    • Total Pages
      325
    • Publisher
      現代数学社
    • Related Report
      2010 Annual Research Report
  • [Book] Special Issue on Matching Under Preferences2010

    • Author(s)
      David Manlove, Robert W.Irving, Kazuo Iwama (eds.)
    • Total Pages
      220
    • Publisher
      Springer
    • Related Report
      2010 Annual Research Report
  • [Remarks]

    • URL

      http://www.lab2.kuis.kyoto-u.ac.jp/~iwama/index-j.html

    • Related Report
      2012 Final Research Report
  • [Remarks] 岩間一雄

    • URL

      http://www.lab2.kuis.kyoto-u.ac.jp/~iwama/index-j.html

    • Related Report
      2012 Annual Research Report

URL: 

Published: 2010-08-23   Modified: 2019-07-29  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi