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

Ito Hiro  伊藤 大雄

ORCIDConnect your ORCID iD *help
… Alternative Names

ITO Hiro  伊藤 大雄

Less
Researcher Number 50283487
Other IDs
External Links
Affiliation (Current) 2022: 電気通信大学, 大学院情報理工学研究科, 教授
Affiliation (based on the past Project Information) *help 2016 – 2021: 電気通信大学, 大学院情報理工学研究科, 教授
2012 – 2016: 電気通信大学, 情報理工学(系)研究科, 教授
2015: 電気通信大学, 情報理工学研究科, 教授
2013: 電気通信大学, 大学院・情報理工学研究科, 教授
2012 – 2013: 電気通信大学, 情報理工学研究科, 教授 … More
2011: 京都大学, 大学院・情報学研究科, 准教授
2006 – 2011: Kyoto University, Graduate School of Informatics, Professor
2008: Kyoto University, 大学院・情報学研究科, 准教授
2001 – 2006: 京都大学, 情報学研究科, 助教授
1998 – 2001: 豊橋技術科学大学, 工学部, 講師 Less
Review Section/Research Field
Principal Investigator
Fundamental theory of informatics / Science and Engineering / 計算機科学 / Theory of informatics / Basic Section 60010:Theory of informatics-related
Except Principal Investigator
Fundamental theory of informatics / Theory of informatics / Science and Engineering / Software / 計算機科学
Keywords
Principal Investigator
グラフ / 定数時間アルゴリズム / アルゴリズム / ネットワーク / グラフアルゴリズム / 性質検査 / インターネット / 連結度 / 劣線形時間アルゴリズム / 近似アルゴリズム … More / 列挙 / 孤立 / クリーク / オンラインアルゴリズム / 計算複雑さ / 離散アルゴリズム / ケーキ分割問題 / 一般化将棋 / 多項式時間アルゴリズム / 配置問題 / ルーチング / graphs / networks / the Internet / location problems / 階層構造 / 複雑ネットワーク / 漸進型アルゴリズム / 情報基礎 / モデル化 / 高信頼性ネットワーク / 表計算 / 罫線描画 / k枝連結性 / プロパティテスト / 安定マッチング問題 / P2Pネットワーク / 耐故障 / 最大被覆供給点配置問題 / クラスタリング / 合意最大化問題 / k-連結性 / プロパティテスティング / 無線ネットワーク / TDMAスケジューリング / スパニングツリー / 平均ストレッチ / クリーク発見問題 / 単位円盤グラフ / 供給点配置問題 / 耐故障性 / 自己安定アルゴリズム / 最小頂点被覆問題 / コンパクトルーティング / 伸張度削減問題 / タスクスケジュール / 自己安定プロトコル / 線形時間アルゴリズム / 列挙アルゴリズム / 多項式時間算法 / ゴスパー曲線 / コスパー曲線 / アルゴリズム理論 / 定数時間 / 乱択 / マトロイド / ナップザック問題 / ユニットディスクグラフ / FPT / 下界値 / 組合せゲーム・パズル / グラフ理論 / 公平分割 / 一般化将棋問題 / じゃんけん / 川渡り問題 / 組合せゲーム / ジャンケン / 三並べ / 連結性 / エクスパンション / 最短経路 / 迂回 / ハイパーグラフ / 凸多角形 / 3カット / ファイル転送 / 最短路 / shortest path / routing / hypergraphs / convex polygons / コミュニティ / 連結度増大問題 / 領域グラフ / 枝連結度 / 多項式時問アルゴリズム / H-彩色問題 / NP完全 / connectivity / enumeration / cliques / communities / ビッグデータ / 超有限性 / スケールフリー / ボードパズル / 超有限 / 分割信託 / 孤立クリーク / 一般化ボードパズル / 分割神託 / 競合比 / 幾何学 / ゲーム・パズル / 折り紙 … More
Except Principal Investigator
アルゴリズム / 計算困難問題 / 数理モデル化 / 理論的性能保証 / 近似アルゴリズム / 離散アルゴリズム / 計算量理論 / 情報の補填 / 深さ優先探索 / NP完全問題 / 離散最適化 / アルゴリズム理論 / 確率アルゴリズム / 性質検査 / 劣線形時間 / 最大クリーク / 極大クリーク / 時間計算量 / 分枝限定法 / 近似解法 / 多項式時間的可解性 / 列挙 / インターネット / ネットワークアルゴリズム / 工学的評価基準 / Discrete Optimization / 離散システム / 社会的評価基準 / ランダマイズド・アルゴリズム / 計算限界 / 品質保証・性能保証 / 国際研究者交流 / 多国籍 / 国際交流 / 若手の育成 / 研究の活性化 / 理論と応用の協調 / 啓発活動 / 研究者の協調 / ロバスト計算 / グラフ問題 / アルゴリズム的ゲーム理論 / 乱化計算 / 乱化アルゴリズム / 分散アルゴリズム / 准線形時間 / ゲーム情報学 / And-Or木の探索 / ゲーム・パズルの複雑さ / ゲーム木のモデル / 評価関数 / パズルの計算複雑性 / And-Or木 / 計算理論 / 理論計算機科学 / グラフ彩色 / 制約充足問題 / 定数時間検査 / 劣線形時間計算 / グラフ / 定数時間 / 調和解析 / グラフアルゴリズム / 疑似クリーク / 近似解 / 整列 / 計算機実験 / データマイニング / グラフ・ネットワーク / 高度情報通信網 / ネットワーク設計 / 並列グラフアルゴリズム / 離散幾何学 / 分散負荷問題 / コーパスからの知識獲得 / 専用計算機回路 / 移動体通信 / 高度通信網 / 並列処理 / 分散処理 / テキスト自動要約 / 構文解析 / GLR構文解析 / LC構文解析 / データ再配置問題 / 静的負荷分散 / 離散構造 / 効率的アルゴリズム / 並列LR構文解析 / UGLR構文解析 / ハムサンドイッチ定理の拡張 / 舞台照明問題 / 画像の傷の修復 / 計算幾何学 / Graph and Networks / Communication Network / Network Design / Parallel Graph Algorithms / Discrete Geometry / Distributed Load Balancing Problem / Knowledge-Acquisition from Corpus / Special-Porpose hardware / 結婚安定問題 / オンラインアルゴリズム / 充足可能性問題 / 安定結婚問題 / ネットワークルーティング / レンタルスキー問題 / 平均的競合比 / 最悪競合比 / 経路ループ回避 / コンパクトルーティング / 格子状ネットワーク / 伸張係数 / 安定マッチング / Discrete Algorithms / Stable Marriage Problems / Approximation Algorithms / Online Algorithms / Satisfiability Problems / Computational Complexity / Network Algorithms / 列挙アルゴリズム / マッチングアルゴリズム / SATアルゴリズム / 孤立クリーク / 最小頂点被覆問題 / マッチング / Discrete Algorithm / Quality for Engineering / Network Algorithm / Enumeration Algorithm / Matching Algorithm / SAT Algorithm / Approximation Algorithm / 分枝限定 / 遅延 / 多項式時間 / 最大独立節点集合 / 厳密解法 / 分枝限定アルゴリズム / 実働評価 / 符号理論 / 時間計算量解析 / 実働化評価 Less
  • Research Projects

    (19 results)
  • Research Products

    (331 results)
  • Co-Researchers

    (46 People)
  •  Development of the sublinear-time paradigmPrincipal Investigator

    • Principal Investigator
      伊藤 大雄
    • Project Period (FY)
      2020 – 2022
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Review Section
      Basic Section 60010:Theory of informatics-related
    • Research Institution
      The University of Electro-Communications
  •  効率的な最大および極大クリーク抽出アルゴリズムの開発と応用

    • Principal Investigator
      富田 悦次
    • Project Period (FY)
      2017 – 2021
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Theory of informatics
    • Research Institution
      The University of Electro-Communications
  •  Sublinear-Time ParadigmPrincipal Investigator

    • Principal Investigator
      Ito Hiro
    • Project Period (FY)
      2015 – 2018
    • Research Category
      Grant-in-Aid for Challenging Exploratory Research
    • Research Field
      Theory of informatics
    • Research Institution
      The University of Electro-Communications
  •  Much faster algorithms for finding maximum and maximal cliques and their applications

    • Principal Investigator
      TOMITA Etsuji
    • Project Period (FY)
      2013 – 2017
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Theory of informatics
    • Research Institution
      The University of Electro-Communications
  •  Approximate Computing to Cope with Imperfect Information from Growing Data Size

    • Principal Investigator
      IWAMA KAZUO
    • Project Period (FY)
      2013 – 2015
    • Research Category
      Grant-in-Aid for Scientific Research (A)
    • Research Field
      Theory of informatics
    • Research Institution
      Kyoto University
  •  Studies on Limits of Computation via Information and Coding Theory

    • Principal Investigator
      Kawarabayashi Kenichi
    • Project Period (FY)
      2012 – 2016
    • Research Category
      Grant-in-Aid for Scientific Research on Innovative Areas (Research in a proposed research area)
    • Review Section
      Science and Engineering
    • Research Institution
      National Institute of Informatics
  •  A new paradigm of game analysesPrincipal Investigator

    • Principal Investigator
      Ito Hiro
    • Project Period (FY)
      2012 – 2015
    • Research Category
      Grant-in-Aid for Challenging Exploratory Research
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      The University of Electro-Communications
  •  Game informatics: Search of And-Or tree and Computational Complexity of games and puzzles

    • Principal Investigator
      IWATA Shigeki
    • Project Period (FY)
      2011 – 2013
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Software
    • Research Institution
      The University of Electro-Communications
  •  Studies on Algorithms for Insufficient Spatial Information

    • Principal Investigator
      IWAMA Kazuo
    • Project Period (FY)
      2010 – 2012
    • Research Category
      Grant-in-Aid for Scientific Research (A)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Kyoto University
  •  Hypervelocity information extraction from huge informationsPrincipal Investigator

    • Principal Investigator
      ITO Hiro
    • Project Period (FY)
      2009 – 2011
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Kyoto University
  •  Design and Analysis of Algorithms for Insufficient Information

    • Principal Investigator
      IWAMA Kazuo
    • Project Period (FY)
      2007 – 2009
    • Research Category
      Grant-in-Aid for Scientific Research (A)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Kyoto University
  •  Research on techniques for algorithmic super-compression of huge dataPrincipal Investigator

    • Principal Investigator
      ITO Hiro
    • Project Period (FY)
      2006 – 2008
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Kyoto University
  •  新世代の計算限界-その解明と打破-

    • Principal Investigator
      IWAMA Kazuo
    • Project Period (FY)
      2004 – 2008
    • Research Category
      Grant-in-Aid for Scientific Research on Priority Areas
    • Review Section
      Science and Engineering
    • Research Institution
      Kyoto University
  •  Research on modeling and algorithms for network problemsPrincipal Investigator

    • Principal Investigator
      ITO Hiro
    • Project Period (FY)
      2004 – 2007
    • Research Category
      Grant-in-Aid for Scientific Research on Priority Areas
    • Review Section
      Science and Engineering
    • Research Institution
      Kyoto University
  •  Studies on Diarete Algorithms with Guaranteed Quality based on Engineering Criteria

    • Principal Investigator
      IWAMA Kazuo
    • Project Period (FY)
      2004 – 2006
    • Research Category
      Grant-in-Aid for Scientific Research (B)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Kyoto University
  •  Research on Modeling of the Internet Problems and Efficient AlgorithmsPrincipal Investigator

    • Principal Investigator
      ITO Hiro
    • Project Period (FY)
      2004 – 2005
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Kyoto University
  •  Algorithms on Graphs, Networks, and Discrete GeomertyPrincipal Investigator

    • Principal Investigator
      ITO Hiroo
    • Project Period (FY)
      2002 – 2003
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      計算機科学
    • Research Institution
      KYOTO UNIVERSITY
  •  High Quality Discrete Algorithms Based on Engineering Criteria

    • Principal Investigator
      IWAMA Kazuo
    • Project Period (FY)
      2001 – 2003
    • Research Category
      Grant-in-Aid for Scientific Research (B)
    • Research Field
      計算機科学
    • Research Institution
      Kyoto University
  •  Discrete Optimization Problems with Graph and Network Structures and Their Efficient Solution Methods

    • Principal Investigator
      MASUYAMA Shigeru
    • Project Period (FY)
      1998 – 2000
    • Research Category
      Grant-in-Aid for Scientific Research on Priority Areas (B)
    • Research Institution
      Toyohashi University of Technology

All 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 Other

All Journal Article Presentation Book

  • [Book] ビッグデータ・マネジメント~データサイエンティストのためのデータ利活用術と事例2014

    • Author(s)
      伊藤大雄 他35名
    • Total Pages
      240
    • Publisher
      NTS
    • Data Source
      KAKENHI-PROJECT-24650006
  • [Book] パズル・ゲームで楽しむ数学2010

    • Author(s)
      伊藤大雄
    • Total Pages
      164
    • Publisher
      森北出版
    • Data Source
      KAKENHI-PROJECT-21500014
  • [Book] 離散数学のすすめ2010

    • Author(s)
      伊藤大雄, 宇野裕之編著
    • Total Pages
      325
    • Publisher
      現代数学社
    • Data Source
      KAKENHI-PROJECT-22240001
  • [Book] パズル・ゲームで楽しむ数学-娯楽数学の世界2010

    • Author(s)
      伊藤大雄
    • Total Pages
      180
    • Publisher
      森北出版
    • Data Source
      KAKENHI-PROJECT-19200001
  • [Book] 離散数学のすすめ2010

    • Author(s)
      伊藤 大雄, 宇野 裕之
    • Total Pages
      325
    • Publisher
      現代数学社
    • Data Source
      KAKENHI-PROJECT-22240001
  • [Book] 離散数学のすすめ2010

    • Author(s)
      伊藤大雄・宇野裕之
    • Publisher
      現代数学社
    • Data Source
      KAKENHI-PROJECT-21500014
  • [Book] 理系への数学484号 : 離散数学のすすめ01 離散数学へのいざない2007

    • Author(s)
      伊藤大雄
    • Publisher
      現代数学社
    • Data Source
      KAKENHI-PROJECT-16092215
  • [Book] 理系への数学485号 : 離散数学のすすめ02 最短路問題2007

    • Author(s)
      伊藤大雄
    • Publisher
      現代数学社
    • Data Source
      KAKENHI-PROJECT-16092215
  • [Book] 理系への数学492号 離散数学のすすめ12 ケーキ分割問題2007

    • Author(s)
      伊藤大雄
    • Publisher
      現代数学社
    • Data Source
      KAKENHI-PROJECT-16092215
  • [Journal Article] Sublinear Computation Paradigm: Constant-Time Algorithms and Sublinear Progressive Algorithms2022

    • Author(s)
      Kyohei Chiba and Hiro Ito
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

      Volume: E105-A Issue: 3 Pages: 131-141

    • DOI

      10.1587/transfun.2021eai0003

      10.1587/transfun.2021EAI0003

    • NAID

      130008165438

    • ISSN
      0916-8508, 1745-1337
    • Language
      English
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-20K11671
  • [Journal Article] Decrease and reset for power‐down2021

    • Author(s)
      James Andro-Vasko, Wolfgang Bein, Hiro Ito, Shoji Kasahara, and Jun Kawahara
    • Journal Title

      Energy Systems, Springer

      Volume: September

    • DOI

      10.1007/s12667-021-00475-3

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-20K11671
  • [Journal Article] <i>K</i><sub>3</sub> Edge Cover Problem in a Wide Sense2020

    • Author(s)
      Chiba Kyohei、Belmonte Remy、Ito Hiro、Lampis Michael、Nagao Atsuki、Otachi Yota
    • Journal Title

      Journal of Information Processing

      Volume: 28 Issue: 0 Pages: 849-858

    • DOI

      10.2197/ipsjjip.28.849

    • NAID

      130007956350

    • ISSN
      1882-6652
    • Language
      English
    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-20K11671, KAKENHI-PROJECT-18K11157, KAKENHI-PROJECT-18H04091
  • [Journal Article] Flat Folding a Strip with Parallel or Nonacute Zigzag Creases with Mountain-Valley Assignment2020

    • Author(s)
      Demaine Erik D.、Demaine Martin L.、Ito Hiro、Nara Chie、Shirahama Izumi、Tachi Tomohiro、Tomura Mizuho
    • Journal Title

      Journal of Information Processing

      Volume: 28 Issue: 0 Pages: 825-833

    • DOI

      10.2197/ipsjjip.28.825

    • NAID

      130007956335

    • ISSN
      1882-6652
    • Language
      English
    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-20K03726, KAKENHI-PROJECT-20K11671
  • [Journal Article] Energy efficiency and renewable energy management with multi-state power-down system2019

    • Author(s)
      James Andro-Vasko, Wolfgang Bein, and Hiro Ito
    • Journal Title

      Information

      Volume: 10(2)

    • DOI

      10.3390/info10020044

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-15K11985
  • [Journal Article] Generalized shogi, chess, and xiangqui are constant-time testable2019

    • Author(s)
      Hiro Ito, Atsuki Nagao, and Teagun Park
    • Journal Title

      IEICE Transactions

      Volume: (採録決定)

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-15K11985
  • [Journal Article] Modulation-Adaptive Link-Disjoint Path Selection Model for 1+1 Protected Elastic Optical Networks2019

    • Author(s)
      Yuto Kishi, Nattapong Kitsuwan, Hiro Ito, Bijoy Chand Chatterjee, and Eiji Oki,
    • Journal Title

      IEEE Access

      Volume: 7 Pages: 25422-25437

    • DOI

      10.1109/access.2019.2901018

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-15K11985
  • [Journal Article] Cookie Clicker2019

    • Author(s)
      Erik D. Demaine, Hiro Ito, Stefan Langerman, Jayson Lynch, Mikhail Rudoy, Kai Xiao
    • Journal Title

      Graphs and Combinatorics

      Volume: (採録決定)

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-15K11985
  • [Journal Article] Bumpy pyramid folding2018

    • Author(s)
      Abel Zachary R.、Demaine Erik D.、Demaine Martin L.、Ito Hiro、Snoeyink Jack、Uehara Ryuhei
    • Journal Title

      Computational Geometry

      Volume: 75 Pages: 22-31

    • DOI

      10.1016/j.comgeo.2018.06.007

    • NAID

      120006676394

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-15K11985, KAKENHI-PROJECT-20K20311
  • [Journal Article] Transforming Graphs with the Same Graphic Sequence2017

    • Author(s)
      Hiro Ito and Sergey Bereg
    • Journal Title

      Journal of Information Processing

      Volume: 25 Issue: 0 Pages: 627-633

    • DOI

      10.2197/ipsjjip.25.627

    • NAID

      130005990901

    • ISSN
      1882-6652
    • Language
      English
    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-15K11985
  • [Journal Article] A Much Faster Algorithm for Finding a Maximum Clique with Computational Experiments2017

    • Author(s)
      Etsuji Tomita, Sora Matsuzaki, Atsuki Nagao, Hiro Ito, Mitsuo Wakatsuki
    • Journal Title

      Journal of Information Processing

      Volume: 25 Issue: 0 Pages: 667-677

    • DOI

      10.2197/ipsjjip.25.667

    • NAID

      130005990921

    • ISSN
      1882-6652
    • Language
      English
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-17K00006, KAKENHI-PROJECT-15K11985, KAKENHI-PROJECT-25330009
  • [Journal Article] Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares2017

    • Author(s)
      Zach Abel, Brad Ballinger, Erik Demaine, Martin Demaine, Jeff Erickson, Adam Hesterberg, Hiro Ito, Irina Kostitsyna, Jayson Lynch, and Ryuhei Uehara
    • Journal Title

      Journal of Information Processing

      Volume: 25 Issue: 0 Pages: 610-615

    • DOI

      10.2197/ipsjjip.25.610

    • NAID

      130005990898

    • ISSN
      1882-6652
    • Language
      English
    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-15K11985, KAKENHI-PROJECT-20K20311
  • [Journal Article] A much faster branch-and-bound algorithm for finding a maximum clique2016

    • Author(s)
      Etsuji Tomita, Kohei Yoshida, Takuro Hatta, Atsuki Nagao, Hiro Ito and Mitsuo Wakatsuki
    • Journal Title

      Proceedings of the 10th International Frontiers of Algorithmics Workshop (FAW2016), LNCS, Springer

      Volume: 未定 Pages: 215-226

    • DOI

      10.1007/978-3-319-39817-4_21

    • NAID

      120006847403

    • Peer Reviewed / Acknowledgement Compliant / Open Access
    • Data Source
      KAKENHI-PROJECT-24650006, KAKENHI-PROJECT-25330009, KAKENHI-PROJECT-15K11985
  • [Journal Article] Folding a Paper Strip to Minimize Thickness2016

    • Author(s)
      Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, and Yushi Uno
    • Journal Title

      Journal of Discrete Algorithms

      Volume: 36 Pages: 18-26

    • DOI

      10.1016/j.jda.2015.09.003

    • NAID

      120006380546

    • Peer Reviewed / Acknowledgement Compliant / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26330009, KAKENHI-PLANNED-24106004, KAKENHI-PROJECT-24650006, KAKENHI-PROJECT-15K11985
  • [Journal Article] Single-Player and Two-Player Buttons & Scissors Games2016

    • Author(s)
      Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffman, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Loffler, Christiane Schmidt, Ryuhei Uehara, Yushi Uno and Aaron Williams
    • Journal Title

      Proceedings of the 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG^2 2015), LNCS, Springer

      Volume: 未定

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-24650006
  • [Journal Article] Single-Player and Two-Player Buttons & Scissors Games2016

    • Author(s)
      Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffman, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Loffler, Christiane Schmidt, Ryuhei Uehara, Yushi Uno and Aaron Williams
    • Journal Title

      roceedings of the 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG^2 2015), LNCS, Springer

      Volume: 未定

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-15K11985
  • [Journal Article] Constant-time algorithms for complex networks2016

    • Author(s)
      Hiro Ito
    • Journal Title

      Proceedings of the Asian-Pacific World Congress on Computer Science 2016 (APWConCS 2016), IEEE Computer Society

      Volume: 1

    • Peer Reviewed / Acknowledgement Compliant / Open Access
    • Data Source
      KAKENHI-PROJECT-15K11985
  • [Journal Article] How to solve the cake-cutting problem in sublinear time2016

    • Author(s)
      Hiro Ito and Takahiro Ueda
    • Journal Title

      Proceedings of the 8th International Conference on Fun with Algorithms (FUN2016)

      Volume: 未定

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-24650006
  • [Journal Article] ow to solve the cake-cutting problem in sublinear time2016

    • Author(s)
      Hiro Ito and Takahiro Ueda
    • Journal Title

      Proceedings of the 8th International Conference on Fun with Algorithms (FUN2016)

      Volume: 未定

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-15K11985
  • [Journal Article] Number of ties and undefeated signs on a generalized janken2016

    • Author(s)
      Hiro Ito and Yoshinao Shiono
    • Journal Title

      Proceedings of the 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG^2 2015), LNCS, Springer

      Volume: 未定

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-15K11985
  • [Journal Article] Number of ties and undefeated signs on a generalized janken2016

    • Author(s)
      Hiro Ito and Yoshinao Shiono
    • Journal Title

      Proceedings of the 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG^2 2015), LNCS, Springer

      Volume: 未定

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-24650006
  • [Journal Article] Every property is testable on a natural class of scale-free multigraphs2016

    • Author(s)
      Hiro Ito
    • Journal Title

      Proceedings of the 24th European Symposium of Algorithms (ESA 2016), LIPICS

      Volume: 57

    • DOI

      10.4230/LIPIcs.ESA.2016.51

    • Peer Reviewed / Acknowledgement Compliant / Open Access
    • Data Source
      KAKENHI-PROJECT-15K11985
  • [Journal Article] How to solve the cake-cutting problem in sublinear time2016

    • Author(s)
      Hiro Ito and Takahiro Ueda
    • Journal Title

      Proceedings of the 8th International Conference on Fun with Algorithms (FUN2016), LIPICS, Vol. 49 (ISBN 978-3-95977-005-7)

      Volume: 49

    • DOI

      10.4230/LIPIcs.FUN.2016.21

    • Peer Reviewed / Acknowledgement Compliant / Open Access
    • Data Source
      KAKENHI-PROJECT-15K11985
  • [Journal Article] Folding a Paper Strip to Minimizing Thickness2015

    • Author(s)
      Erik D. DEMAINE, David EPPSTEIN, Adam HESTERBERG, Hiro ITO, Anna LUBIW, Ryuhei UEHARA, Yushi UNO
    • Journal Title

      Proceeding of Workshop on Algorithms and Computation 2015 (WALCOM 2015)

      Volume: 8973 Pages: 113-124

    • DOI

      10.1007/978-3-319-15612-5_11

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-24650006
  • [Journal Article] Testing outerplanarity of bounded degree graphs2015

    • Author(s)
      Hiro Ito and Yuichi Yoshida
    • Journal Title

      Algorithmica

      Volume: 印刷中 Pages: 1-20

    • DOI

      10.1007/s00453-014-9897-1

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-26730009, KAKENHI-PLANNED-24106003
  • [Journal Article] Generalized river crossing problems2015

    • Author(s)
      Hiro Ito, Stefan Langerman, and Yuichi Yoshida
    • Journal Title

      Theory Computing Systems

      Volume: 56 Pages: 418-435

    • DOI

      10.1007/s00224-014-9562-8

    • Peer Reviewed / Acknowledgement Compliant / Open Access
    • Data Source
      KAKENHI-PLANNED-24106003, KAKENHI-PROJECT-24650006
  • [Journal Article] Cannibal Animal Games: a new variant of Tic-Tac-Toe2015

    • Author(s)
      J. Cardinal, S. Collette, H. Ito, H. Sakaidani, M. Korman, S. Langerman, and P. Taslakian.
    • Journal Title

      Journal of Information Processing

      Volume: 23(3) Issue: 3 Pages: 265-271

    • DOI

      10.2197/ipsjjip.23.265

    • NAID

      130005070057

    • ISSN
      1882-6652
    • Language
      English
    • Peer Reviewed / Acknowledgement Compliant / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PUBLICLY-15H00855, KAKENHI-PLANNED-24106003, KAKENHI-PROJECT-24650006
  • [Journal Article] Computational complexity of inverse word search problem2015

    • Author(s)
      Hiro Ito and Shinnosuke Seki
    • Journal Title

      Proceedings of the 12th International Symposium on Operations Research & Its Applications (ISORA 2015), IET Digital Library

      Volume: なし Pages: 41-44

    • DOI

      10.1049/cp.2015.0607

    • Peer Reviewed / Acknowledgement Compliant / Open Access
    • Data Source
      KAKENHI-PROJECT-15K11985, KAKENHI-PROJECT-24650006
  • [Journal Article] Cannibal animal games: a new variant of tic-tac-toe2015

    • Author(s)
      Jean CARDINAL, Sebastien COLETTE, ITO Hiro, Matias KORMAN, Stefan LANGERMAN, SAKIDANI Hikaru, Perouz TASLAKIAN
    • Journal Title

      Journal of Information Processing

      Volume: 掲載予定

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-24650006
  • [Journal Article] Generalized shogi and chess are constant-time tastable2015

    • Author(s)
      Hiro Ito, Atsuki Nagao, and Teagun Park
    • Journal Title

      Proceedings of the 12th International Symposium on Operations Research & Its Applications (ISORA 2015), IET Digital Library

      Volume: なし Pages: 1-6

    • DOI

      10.1049/cp.2015.0601

    • Peer Reviewed / Acknowledgement Compliant / Open Access
    • Data Source
      KAKENHI-PROJECT-15K11985, KAKENHI-PROJECT-24650006
  • [Journal Article] How to solve the cake-cutting problem in sublinear time2015

    • Author(s)
      Hiro Ito and Takahiro Ueda
    • Journal Title

      arXiv

      Volume: なし

    • Acknowledgement Compliant / Open Access
    • Data Source
      KAKENHI-PROJECT-24650006
  • [Journal Article] Bumpy Pyramid Folding2014

    • Author(s)
      Zachary ABEL, Erik D. DEMAINE, Martin DEMAINE, Hiro ITO, Jack SNOEYINK and Ryuhei UEHARA
    • Journal Title

      The 26th Canadian Conference on Computational Geometry (CCCG 2014)

      Volume: なし Pages: 258-266

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-24650006
  • [Journal Article] Helly Numbers of Polyominoes2013

    • Author(s)
      Jean Cardinal, Hiro Ito, Matias Korman, and Stefan Langerman
    • Journal Title

      Graphs and Combinatorics

      Volume: Vol.29 Pages: 1221-1234

    • DOI

      10.1007/s00373-012-1203-x

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500037, KAKENHI-PLANNED-24106003
  • [Journal Article] On computational complexity of graph inference from counting2013

    • Author(s)
      Szilard Zsolt Fazekas, Hiro Ito, Yasushi Okuno, Shinnosuke Seki, and Kei Taneishi
    • Journal Title

      Natural Computing

      Volume: 未定

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-24650006
  • [Journal Article] Constant-time approximation algorithms for the optimum branching problem on sparse graphs2013

    • Author(s)
      Mitsuru Kusumoto, Yuichi Yoshida, and Hiro Ito
    • Journal Title

      International Journal of Networking and Computing

      Volume: 3 Pages: 201-216

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500037
  • [Journal Article] How to generalize janken --- rock-paper-scissors-king-flea2013

    • Author(s)
      Hiro Ito
    • Journal Title

      Proceedings of TJJCCGG 2012, LNCS, Springer

      Volume: 8296 Pages: 85-94

    • DOI

      10.1007/978-3-642-45281-9_8

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-24650006
  • [Journal Article] 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

    • NAID

      110008583107

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21700009, KAKENHI-PROJECT-23500013, KAKENHI-PROJECT-23500037, KAKENHI-PLANNED-24106003, KAKENHI-PROJECT-24220003, KAKENHI-PROJECT-24700008, KAKENHI-PROJECT-24700130, KAKENHI-PLANNED-24106004, KAKENHI-PLANNED-24106005
  • [Journal Article] Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs2013

    • Author(s)
      Mitsuru Kusumoto, Yuichi Yoshida and Hiro Ito
    • Journal Title

      International Journal of Networking and Computing

      Volume: 3(2)

    • NAID

      130005475364

    • Peer Reviewed
    • Data Source
      KAKENHI-PLANNED-24106003
  • [Journal Article] Complexity of the stamp folding problem,2013

    • Author(s)
      Takuya Umesao, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito, Yoshio Okamoto
    • Journal Title

      Theoretical Computer Science

      Volume: 未定

    • NAID

      110008583107

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-24650006
  • [Journal Article] Helly numbers of polyominoes2013

    • Author(s)
      Jean Cardinal, Hiro Ito, Matias Korman, Stefan Langerman
    • Journal Title

      Graphs and Combinatorics

      Volume: 29 Pages: 1221-1234

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-24650006
  • [Journal Article] How to generalize janken --- rock-paper-scissors-king-flea2013

    • Author(s)
      Hiro Ito
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 8296 Pages: 85-94

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500037
  • [Journal Article] On computational complexity of graph inference from counting2013

    • Author(s)
      Szilard Zsolt Fazekas, Hiro Ito, Yasushi Okuno, Shinnosuke Seki, and Kei Taneishi
    • Journal Title

      Natural Computing

      Volume: Vol.12 Pages: 589-603

    • DOI

      10.1007/s11047-012-9349-2

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500037, KAKENHI-PLANNED-24106003
  • [Journal Article] Constant-time algorithms for sparsity matroids2012

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

      Lecture Notes in Computer Science (Proc.ICALP 2012)

      Volume: (採録決定)

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500014
  • [Journal Article] Constant-time algorithms for sparsity matroids2012

    • Author(s)
      Hiro Ito Shin-ichi Tanigawa, Yuichi Yoshida
    • Journal Title

      Proc. of The 39th International Colloquium on Automata, Language and Programming (ICALP 2012) (1), LNCS

      Volume: 7391 Pages: 498-509

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500037
  • [Journal Article] Property testing on k-vertex connectivity of graphs2012

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

      Algorithmica

      Volume: 62 Pages: 701-712

    • NAID

      10030998706

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500014
  • [Journal Article] Property Testing on k-Vertex-Connectivity of Graphs2012

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

      Algorithmica

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

    • DOI

      10.1007/s00453-010-9477-y

    • NAID

      10030998706

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22240001
  • [Journal Article] Constant-time algorithms for sparsity matroids, The 39th International Colloquium on Automata, Language and Programming(ICALP 2012)2012

    • Author(s)
      ITO Hiro TANIGAWA Shin-ichi, YOSHIDA Yuichi
    • Journal Title

      The 39th International Colloquium on Automata, Language and Programming(ICALP 2012)

      Volume: (to appear)

    • Data Source
      KAKENHI-PROJECT-21500014
  • [Journal Article] Constant-time approximation algorithms for the knapsack problem2012

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

      Lecture Notes in Computer Science (Proc.TAMC 2012)

      Volume: (採録決定)

    • NAID

      110008689181

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500014
  • [Journal Article] Algorithms and complexity of generalized river crossing problems2012

    • Author(s)
      Hiro Ito, Stefan Langerman, Yuichi Yoshida
    • Journal Title

      Proc. of The 6th International Conference on Fun with Algorithms (FUN2012), LNCS, Springer

      Volume: 7288

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-24650006
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22240001
  • [Journal Article] Constant-time approximation algorithms for the knapsack problem2012

    • Author(s)
      Hiro Ito, Susumu Kiyoshima, Yuichi Yoshida
    • Journal Title

      Proc. of The 9th Annual Conference on Theory and Applications of Models of Computation (TAMC 2012), LNCS

      Volume: 7287 Pages: 131-142

    • NAID

      110008689181

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500037
  • [Journal Article] KASAHARA Shoji, and KAWAHARA Jun, An online algorithm optimally self-tuning to congestion for power management problems, Proceedings of the 9th Workshop on Approximation and Online Algorithms(WAOA 2011)2012

    • Author(s)
      Wolfgang BEIN, HATTA Naoki, Nelson HERNANDEZ-CONS, ITO Hiro
    • Journal Title

      LNCS

      Volume: #7164 Pages: 35-48

    • Data Source
      KAKENHI-PROJECT-21500014
  • [Journal Article] Property testing on k-vertex connectivity of graphs2012

    • Author(s)
      YOSHIDA Yuichi and ITO Hiro
    • Journal Title

      Algorithmica

      Volume: Vol.62, No.3-4 Pages: 701-712

    • NAID

      10030998706

    • Data Source
      KAKENHI-PROJECT-21500014
  • [Journal Article] Constant-Time Algorithms for Sparsity Matroids2012

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

      SIAM Journal on Computing

      Volume: 41(4) Pages: 1074-1093

    • DOI

      10.1137/110828691

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22240001, KAKENHI-PROJECT-23700025, KAKENHI-PLANNED-24106003, KAKENHI-PROJECT-24800082, KAKENHI-PLANNED-24106008
  • [Journal Article] Constant-time algorithms for sparsity matroids2012

    • Author(s)
      Hiro Ito, Shin-ichi Tanigawa, Yuich Yoshida
    • Journal Title

      Proc. of The 39th International Colloquium on Automata, Language and Programming (ICALP 2012) (1), LNCS, Springer

      Volume: 7391

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-24650006
  • [Journal Article] An Almost Optimal Algorithm for Winkler's Sorting Pairs in Bins2012

    • Author(s)
      ITO Hiro, TERUYAMA Junichi, and YOSHIDA Yuichi
    • Journal Title

      Progress in Informatics

      Volume: No.9 Pages: 3-7

    • Data Source
      KAKENHI-PROJECT-21500014
  • [Journal Article] Constant-time approximation algorithms for the knapsack problem2012

    • Author(s)
      ITO Hiro, KIYOSHIMA Susumu, YOSHIDA Yuichi
    • Journal Title

      LNCS

      Volume: #7287 Pages: 131-142

    • NAID

      110008689181

    • Data Source
      KAKENHI-PROJECT-21500014
  • [Journal Article] Algorithms and complexity of generalized river crossing problems2012

    • Author(s)
      Hiro Ito, Stefan Langerman, Yuichi Yoshida
    • Journal Title

      Proc. of The 6th International Conference on Fun with Algorithms (FUN 2012), LNCS

      Volume: 7288 Pages: 235-244

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500037
  • [Journal Article] Constant-time approximation algorithms for the optimum branching problem on sparse graphs,2012

    • Author(s)
      Mitsuo Kusumoto, Yuichi Yoshida, Hiro Ito
    • Journal Title

      Proceedings of ICNC'12

      Volume: なし

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-24650006
  • [Journal Article] An online algorithm optimally self-tuning to congestion for power management problems2012

    • Author(s)
      W.Bein, N.Hatta, N.HERNANDEZ-CONS, H.Ito, S.Kasaharam, J.Kawahara
    • Journal Title

      Lecture Notes in Computer Science (Proc.WAOA 2011)

      Volume: 7,164 Pages: 35-48

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500014
  • [Journal Article] PSPACE-completeness of the weighted poset game, Proceedings of the 10th International Symposium on Operations Research and Its Applications(ISORA 2011)2011

    • Author(s)
      ITO Hiro and TAKATA Satoshi
    • Journal Title

      Lecture Notes in Operations Research

      Volume: #14 Pages: 89-93

    • Data Source
      KAKENHI-PROJECT-21500014
  • [Journal Article] Testing outerplanarity of bounded degree graphs2011

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

      Lecture Notes of Computer Science (Proc.RANDOM2010)

      Volume: 6302 Pages: 642-655

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500014
  • [Journal Article] Complexity of the stamp folding problem, Proceedings of The 5th Annual International Conference on Combinatorial Optimization and Applications(COCOA 2011)2011

    • Author(s)
      UMESATO Takuya, SAITOH Toshiki, UEHARA Ryuhei, and ITO Hiro
    • Journal Title

      LNCS

      Volume: #6831 Pages: 311-321

    • Data Source
      KAKENHI-PROJECT-21500014
  • [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 Pages: 321-326

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500014
  • [Journal Article] PSPACE-completeness of the weighted poset game2011

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

      Lecture Notes in Operations Research (Proc.ISORA 2011)

      Volume: 14 Pages: 89-93

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500014
  • [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) Pages: 321-326

    • DOI

      10.1007/s00373-011-1023-4

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22240001
  • [Journal Article] KOBAYASHI Midori and NAKAMURA Gisaku, Arrangements of n points whose incident-line-numbers are at most n/2, Special Issue of JCCGG20092011

    • Author(s)
      AKIYAMA Jin, ITO Hiro
    • Journal Title

      Graphs and Combinatorics

      Volume: Vol.27, No.3 Pages: 321-326

    • Data Source
      KAKENHI-PROJECT-21500014
  • [Journal Article] Po-Ru LOH, Shelly MANBER and Omari STEPHENS, Making polygons by simple folds and one straight cut, Proceedings of the China-Japan Joint Conference on Computational Geometry, Graphs and Applications(CGGA 2010)2011

    • Author(s)
      Erik D. DEMAINE, Martin L. DEMAINE, Andrea HAWKSLEY, ITO Hiro
    • Journal Title

      LNCS

      Volume: #7033 Pages: 27-43

    • Data Source
      KAKENHI-PROJECT-21500014
  • [Journal Article] Testing k-edge-connectivity of digraphs2010

    • Author(s)
      YOSHIDA Yuichi and ITO Hiro
    • Journal Title

      Journal of System Science and Complexity

      Volume: Vol.23 Pages: 91-101

    • NAID

      110006343677

    • Data Source
      KAKENHI-PROJECT-21500014
  • [Journal Article] Testing outer planarity of bounded degree graphs, Proceedings of the 14th Intl. Workshop on Randomization and Computation(RANDOM 2010)2010

    • Author(s)
      YOSHIDA Yuichi and ITO Hiro
    • Journal Title

      LNCS

      Volume: #6302 Pages: 642-655

    • Data Source
      KAKENHI-PROJECT-21500014
  • [Journal Article] Testing k-edge-connectivity of digraphs2010

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

      Journal of System Science and Complexity 23

      Pages: 91-101

    • NAID

      110006343677

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500014
  • [Journal Article] Tractability and intractability of problems on unit disk graphs parameterized by domain area, Proceedings of the 9th International Symposium on Operations Research and Its Applications(ISORA 2010)2010

    • Author(s)
      ITO Hiro and KADOSHITA Masakazu
    • Journal Title

      Lecture Notes in Operations Research

      Volume: #12 Pages: 120-127

    • Data Source
      KAKENHI-PROJECT-21500014
  • [Journal Article] Query-number preserving reductions and linear lower bounds for testing2010

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

      IEICE Transactions E93-D(2)

      Pages: 233-240

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500014
  • [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) Pages: 713-720

    • DOI

      10.1016/j.comgeo.2010.05.001

    • NAID

      110008004168

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22240001
  • [Journal Article] Query-number preserving reductions and linear lower bounds for testing2010

    • Author(s)
      YOSHIDA Yuichi and ITO Hiro
    • Journal Title

      IEICE Transactions

      Volume: Vol.E93-D, No.2 Pages: 233-240

    • Data Source
      KAKENHI-PROJECT-21500014
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19200001
  • [Journal Article] Tractability and intractability of problems on unit disk graphs parameterized by domain area2010

    • Author(s)
      H.Ito, M.Kadoshita
    • Journal Title

      Lecture Notes in Operations Research (Proc.ISORA2010)

      Volume: 12 Pages: 120-127

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500014
  • [Journal Article] Weighted random popular matchings2010

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

      Random Struct.Algorithms

      Volume: 37(4) Pages: 477-494

    • DOI

      10.1002/rsa.20316

    • NAID

      110006343680

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22240001
  • [Journal Article] Enumeration of isolated cligues and pseudo-cliaues2009

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

      ACM Transactions on Algorithms

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18500012
  • [Journal Article] An improved constant-time approximation algorithm for maximum matchings2009

    • Author(s)
      Y.Toshida, M.Yamamoto, H.Ito
    • Journal Title

      Proceedings of the 41st ACM Symposium on Theory of Computing (STOC 2010)

      Pages: 225-234

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500014
  • [Journal Article] Enumeration of isolated cliques and pseudo-cliques2009

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

      ACM Transactions on Algorithms 5(4)

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19200001
  • [Journal Article] Multi-Commodity Source Location Problems and the Price of Greed2009

    • Author(s)
      H. Ito, M. Paterson, K. Sugihara
    • Journal Title

      Journal of Graph Algorithms and Applications 13

      Pages: 55-73

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18500012
  • [Journal Article] Enumeration of isolated cliques and pseudo-cliques2009

    • Author(s)
      ITO Hiro and IWAMA Kazuo
    • Journal Title

      ACM Transactions on Algorithms

      Volume: Vol.5, Issue 4 Pages: 40-40

    • Data Source
      KAKENHI-PROJECT-21500014
  • [Journal Article] Enumeration of isolated cliques and pseudo-cliques2009

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

      ACM Transactions on Algorithms 5(4)

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500014
  • [Journal Article] Multi-commodity source location problems and price of greed2008

    • Author(s)
      H. Ito, M. Paterson, K. Sugihara
    • Journal Title

      Proceedings of the Second Workshop on Algorithms and Computation, LNCS 4921

      Pages: 169-179

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18500012
  • [Journal Article] Property testing on k-vertex connectivity of graphs2008

    • Author(s)
      Yuichi YOSHIDA and Hiro ITO
    • Journal Title

      Proceedings of the 31th International Colloquium on Automata, Language and Programming (ICALP 2008), LNCS, #5125, Springer 5125

      Pages: 539-550

    • NAID

      10030998706

    • Data Source
      KAKENHI-PROJECT-18500012
  • [Journal Article] Inferring pedigrees from genetic distances2008

    • Author(s)
      Hiro ITO, Kazuo IWAMA, and Takeyuki TAMURA
    • Journal Title

      IEICE Transactions Vol. E91-D, No. 2

      Pages: 162-169

    • NAID

      110003206417

    • Data Source
      KAKENHI-PROJECT-18500012
  • [Journal Article] Inferring pedigrees from genetic distances2008

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

      IEICE Transactions E91-D(2)

      Pages: 162-169

    • NAID

      110003206417

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18500012
  • [Journal Article] Multi-commodity source location problems and price of greed2008

    • Author(s)
      Hiro ITO, Mike PATERSON, and Kenya SUGIHARA
    • Journal Title

      Proceedings of the Second Workshop on Algorithms and Computation (WALCOM2008) 4921

    • Data Source
      KAKENHI-PROJECT-18500012
  • [Journal Article] Property testing on k-vertex connectivity of graphs2008

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

      Proceedings of the 31th International Colloquium on Automata, Language and Programming (ICALP 5125

      Pages: 539-550

    • NAID

      10030998706

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18500012
  • [Journal Article] Maximum -cover source location problems with objective edge-connectivity three2008

    • Author(s)
      Kenya SUGIHARA and Hiro ITO
    • Journal Title

      Mathematical Methods of Operations Research 10.1007

    • NAID

      110004735372

    • Data Source
      KAKENHI-PROJECT-18500012
  • [Journal Article] Transforming graphs with the same degree sequences2008

    • Author(s)
      Sergey BEREG and Hiro ITO
    • Journal Title

      Proceedings of Kyoto International Conference on Computational Geometry and Graph Theory --- in honor of Jin Akiyama and Vasek Chvatal on their 60th birthdays 4535

      Pages: 25-32

    • Data Source
      KAKENHI-PROJECT-18500012
  • [Journal Article] Semi-distance codes and Steigner systems2007

    • Author(s)
      H.Ito, K.Midori, N.Gisaku
    • Journal Title

      Akiyama-Chvatal Festschrift, Supplement of Graph and Combinatorics (掲載確定)

    • Data Source
      KAKENHI-PROJECT-18500012
  • [Journal Article] Impossibility of transformation of vertex labeled simple graphs preserving the cut-size order2007

    • Author(s)
      H.Ito
    • Journal Title

      Proc.the China-Japan Joint Conference on Discrete Geometry and Graph Theory (CJCDGCGT2005) (掲載予定)

    • Data Source
      KAKENHI-PROJECT-16092215
  • [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 (掲載予定)

    • Data Source
      KAKENHI-PROJECT-16092215
  • [Journal Article] Winning ways of weighted poset games, Akiyama -Chvatal Festschrift2007

    • Author(s)
      Hiro ITO, Gisaku NAKAMURA, and Satoshi TAKATA
    • Journal Title

      Supplement of"Graphs and Combinatorics"

    • Data Source
      KAKENHI-PROJECT-18500012
  • [Journal Article] Transformting graphs with the same graphic sequences2007

    • Author(s)
      S.Bereg, H.Ito
    • Journal Title

      Kyoto International Conference on Computational Geometry and Graph Theory (掲載確定)

    • Data Source
      KAKENHI-PROJECT-18500012
  • [Journal Article] Infinite series of generalized Gospher space filling curves2007

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

      Proceedings of the China-Japan Joint Conference on Discrete Geometry and Graph Theory, LNCS, Springer 4381

      Pages: 1-9

    • Data Source
      KAKENHI-PROJECT-18500012
  • [Journal Article] Adaptive Timeliness of Consensus in Presence of Crash and Timing Fault2007

    • Author(s)
      T.Izumi, A.Saitoh, T.Masuzawa
    • Journal Title

      Journal of Parallel and Distributed Computing (掲載予定)

    • Data Source
      KAKENHI-PROJECT-16092215
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16092215
  • [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 (to appear)

    • Data Source
      KAKENHI-PROJECT-16300002
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19200001
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19200001
  • [Journal Article] Snaky is a winner with one handicap2007

    • Author(s)
      H. Ito, H. Miyagawa
    • Journal Title

      8th Hellenic European Conference on Computer Mathematics and its Applications

      Pages: 25-26

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18500012
  • [Journal Article] Winning Ways of Weighted Poset Games2007

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

      Akiyama-Chvata1 Festschrift, Supplement of Graphs and Combinatorics 23

      Pages: 291-306

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16092215
  • [Journal Article] Adaptive timeliness of consensus in presence of crash and timing faults2007

    • Author(s)
      T. Izumi, A. Saitoh, T. Masuzawa
    • Journal Title

      Journal of Parallel and Distributed Computing 67(6)

      Pages: 41-53

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16092215
  • [Journal Article] Winning ways of weghted poset gammes2007

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

      Akiyama-Chvatal Festschrift, Supplement of Graph and Combinatorics (掲載確定)

    • Data Source
      KAKENHI-PROJECT-18500012
  • [Journal Article] Transforming graphs with the same graphic sequences2007

    • Author(s)
      Sergey BEREG and Hiro ITO
    • Journal Title

      Kyoto International Conference on Computational Geometry and Graph Theory --- in honor of Jin Akiyama and Vasek Chvatal on their 60th birthdays

      Pages: 11-15

    • Data Source
      KAKENHI-PROJECT-18500012
  • [Journal Article] Impossibility of transformation of vertex labeled simple graphs preserving the cut-size order2007

    • Author(s)
      H.Ito
    • Journal Title

      Proceedings of the China-Japan Joint Conference on Discrete Geometry and Graph Theory, LNCS, Springer 4381

      Pages: 59-69

    • Data Source
      KAKENHI-PROJECT-18500012
  • [Journal Article] Infinite series of generalized Gospher space filling curves2007

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

      Proc.the China-Japan Joint Conference on Discrete Geometry and Graph Theory (CJCDGCGT2005) (掲載予定)

    • Data Source
      KAKENHI-PROJECT-16092215
  • [Journal Article] Adaptive timeliness of consensus in presence of crash and timing faults2007

    • Author(s)
      Taisuke Izumi, Akinori Saitoh, Toshimitsu Masuzawa
    • Journal Title

      Journal of Parallel and Distributed Computing Vol. 67, No. 6

      Pages: 648-658

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16092215
  • [Journal Article] Semi-distance codes and Steiner systems, Akiyama-Chvatal Festschrift2007

    • Author(s)
      Hiro ITO, Midori KOBAYASHI, and Gisaku NAKAMURA
    • Journal Title

      Supplement of "Graphs and Combinatorics

      Pages: 283-290

    • Data Source
      KAKENHI-PROJECT-18500012
  • [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 (掲載予定)

    • Data Source
      KAKENHI-PROJECT-16092215
  • [Journal Article] Maximum-Cover Source-Location Problem with Object Edge-Connectivity Three2006

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

      Proc.Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2006)

      Pages: 131-136

    • NAID

      110004735372

    • Data Source
      KAKENHI-PROJECT-16092215
  • [Journal Article] Two Equivalent Measures on Weighted Hypergraphs2006

    • Author(s)
      H.Ito, H.Nagamochi
    • Journal Title

      Discrete Applied Mathematics 154・16

      Pages: 2330-2334

    • Data Source
      KAKENHI-PROJECT-16092101
  • [Journal Article] Harary's Generalized Ticktacktoe2006

    • Author(s)
      H. Ito
    • Journal Title

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

      Pages: 458-469

    • NAID

      110007384396

    • Description
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16300002
  • [Journal Article] Maximum-cover source-location problems2006

    • Author(s)
      Kenya Sugihara, Hiro Ito
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E88-A(採録決定)

    • Data Source
      KAKENHI-PROJECT-16500010
  • [Journal Article] Efficient methods of determining DNA probe sequence2006

    • Author(s)
      Hiro Ito, Kazuo Iwama, Takeyuki Tamura
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E88-A(採録決定)

    • Data Source
      KAKENHI-PROJECT-16500010
  • [Journal Article] Maximum-cover source location problems2006

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

      IEICE Transactions Vol. E88-A(未定(採録決定))

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16500010
  • [Journal Article] Maximum-cover source-location problem with object edge-connectivity three2006

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

      Proceedings of CTW2006 Workshop on Graphs and Combinatorics

      Pages: 131-136

    • NAID

      110004735372

    • Data Source
      KAKENHI-PROJECT-18500012
  • [Journal Article] Efficient Methods for Determining DNA Probe Orders2006

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

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E89-A(5)

      Pages: 1292-1298

    • NAID

      110007502843

    • Description
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16300002
  • [Journal Article] Two Equivalent Measures on Weighted Hypergraphs2006

    • Author(s)
      H., Ito, H., Nagamochi
    • Journal Title

      Discrete Applied Mathematics vol.154/16

      Pages: 2330-2334

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16300002
  • [Journal Article] Harary's generalized ticktacktoe2006

    • Author(s)
      Hiro Ito
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences J88-A(採録決定)

    • NAID

      110007384396

    • Data Source
      KAKENHI-PROJECT-16500010
  • [Journal Article] Harary's Generalized Ticktacktoe2006

    • Author(s)
      H.Ito
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences vol. J89-A, no.6

      Pages: 458-469

    • NAID

      110007384396

    • Data Source
      KAKENHI-PROJECT-16092215
  • [Journal Article] Harary's Generalized Ticktacktoe2006

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

      TRICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences vol.89, no. 6

      Pages: 458-469

    • NAID

      110007384396

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16300002
  • [Journal Article] Maximum-Cover Source-Location Problems2006

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

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences vol. E89-A, no.5

      Pages: 1370-1377

    • Data Source
      KAKENHI-PROJECT-16092215
  • [Journal Article] Efficient Methods for Determining DNA Probe Orders2006

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

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E88-A(掲載予定)

    • NAID

      110007502843

    • Data Source
      KAKENHI-PROJECT-16300002
  • [Journal Article] Two Equivalent Measures on Weighted Hypergraphs2006

    • Author(s)
      H.Ito, H.Nagamochi
    • Journal Title

      Discrete Applied Mathematics (掲載予定)

    • Data Source
      KAKENHI-PROJECT-16092215
  • [Journal Article] Maximum-Cover Source-Location Problems2006

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

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences vol.E89-A, no.5

      Pages: 1370-1377

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16092215
  • [Journal Article] Maximum-Cover Source Location Problems2006

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

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences vol.89, no. 5

      Pages: 1370-1377

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16300002
  • [Journal Article] Harary's Generalized Ticktacktoe2006

    • Author(s)
      H.Ito
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science E88-A(掲載予定)

    • NAID

      110007384396

    • Data Source
      KAKENHI-PROJECT-16300002
  • [Journal Article] Two Equivalent Measures on Weighted Hypergraphs2006

    • Author(s)
      H.Ito, H.Nagamochi
    • Journal Title

      Discrete Applied Mathematics vol. 154/16

      Pages: 2330-2334

    • Data Source
      KAKENHI-PROJECT-16092215
  • [Journal Article] Two Equivalent Measures on Weighted Hypergraphs2006

    • Author(s)
      H.Ito, H.Nagamochi
    • Journal Title

      Discrete Applied Mathematics (掲載予定)

    • Data Source
      KAKENHI-PROJECT-16300002
  • [Journal Article] Harary's generalized ticktacktoe2006

    • Author(s)
      H.Ito
    • Journal Title

      IEICE Transactions(in Japanese, to appear) Vol.J88-A, No.6

    • NAID

      110007384396

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16500010
  • [Journal Article] Efficient Methods for Determining DNA Probe Orders2006

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

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences vol.E89-A, no.5

      Pages: 1292-1298

    • NAID

      110007502843

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16092215
  • [Journal Article] Maximum-Cover Source Location Problems2006

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

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences vol.E88-A, no.5(掲載予定)

    • Data Source
      KAKENHI-PROJECT-16092215
  • [Journal Article] Bio-inspired replica density control in dynamic networks2006

    • Author(s)
      Tomoko Suzuki, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa
    • Journal Title

      Proceedings of the 2nd International Workshop on Biologically Inspired Approaches to Advanced Information Technology (Bio-ADIT 2006).

      Pages: 281-293

    • Data Source
      KAKENHI-PROJECT-16092215
  • [Journal Article] Harary's Generalized Ticktacktoe2006

    • Author(s)
      H.Ito
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences vol.E88-A, no.6(掲載予定)

    • NAID

      110007384396

    • Data Source
      KAKENHI-PROJECT-16092215
  • [Journal Article] Maximum-cover source location problems2006

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

      IEICE Transactions Vol.E88-A, No.5(to appear)

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16500010
  • [Journal Article] Maximum-Cover Source-Location Problem with Object Edge-Connectivity Three2006

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

      Proc. Cologne-Twente Workshop on Graphs and Combinatorial Optimization CTW2006

      Pages: 131-136

    • NAID

      110004735372

    • Data Source
      KAKENHI-PROJECT-16300002
  • [Journal Article] Maximum-Cover Source Location Problems2006

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

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E88-A(掲載予定)

    • Data Source
      KAKENHI-PROJECT-16300002
  • [Journal Article] Two equivalent measures on weighted hypergraphs2006

    • Author(s)
      H.Ito, H.Nagamochi
    • Journal Title

      Discrete Applied Mathematics 未定(採録決定)

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16500010
  • [Journal Article] Two Equivalent Measures on Weighted Hypergraphs2006

    • Author(s)
      H. Ito, and H. Nagamochi
    • Journal Title

      Discrete Applied Mathematics vol.154/16

      Pages: 2330-2334

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16092215
  • [Journal Article] Efficient Methods for Determining DNA Probe Orders2006

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

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences vol. E89-A, no.5

      Pages: 1292-1298

    • NAID

      110007502843

    • Data Source
      KAKENHI-PROJECT-16092215
  • [Journal Article] Two Equivalent Measures on Weighted Hypergraphs2006

    • Author(s)
      H.Ito, H.Nagamochi
    • Journal Title

      Discrete Applied Mathematics 154・16

      Pages: 2330-2334

    • Data Source
      KAKENHI-PROJECT-16300002
  • [Journal Article] Two Equivalent Measures on Weighted Hypergraphs2006

    • Author(s)
      H. Ito, H. Nagamochi
    • Journal Title

      Discrete Applied Mathematics 154(16)

      Pages: 2330-2334

    • Description
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16300002
  • [Journal Article] Efficient Methods for Determining DNA Probe Orders2006

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

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences vol.89, no. 5

      Pages: 1292-1298

    • NAID

      110007502843

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16300002
  • [Journal Article] Maximum-Cover Source Location Problems2006

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

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E89-A(5)

      Pages: 1370-1377

    • Description
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16300002
  • [Journal Article] Efficient Methods for Determining DNA Probe Orders2006

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

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences vol.E88-A, no.5(掲載予定)

    • NAID

      110007502843

    • Data Source
      KAKENHI-PROJECT-16092215
  • [Journal Article] Efficient methods of determining DNA probe sequences2006

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

      IEICE Transactions Vol.E88-A, No.5(to appear)

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16500010
  • [Journal Article] Chomp with Poison-Strewn Chocolates2005

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

      Proc.the 4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications

      Pages: 336-343

    • Data Source
      KAKENHI-PROJECT-16092215
  • [Journal Article] Three equivalent partial orders on graphs with real edge-weights drawn on a convex polygon2005

    • Author(s)
      H.Ito
    • Journal Title

      Proceedings of the Japan Conference on Discrete and Computational Geometry (JCDCG2004), LNCS 3742

      Pages: 123-130

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16500010
  • [Journal Article] Infinite Series of Generalized Gospher Space Filling Curves2005

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

      Abstracts of the China-Japan Conference on Discrete Geometry, Combinatorics, and Graph Theory (CJCDGCGT)

      Pages: 6-8

    • Data Source
      KAKENHI-PROJECT-16092215
  • [Journal Article] Single-backup-table schemes for shortest-path routing2005

    • Author(s)
      Hiro Ito, Kazuo Iwama, Yasuo Okabe, and Takuya Yoshihiro
    • Journal Title

      Theoretical Computer Science Vol. 333

      Pages: 347-353

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16092215
  • [Journal Article] Three equivalent partial orders on graphs with real edge weights drawn on a convex polygon2005

    • Author(s)
      H.Ito
    • Journal Title

      Lecture Notes in Computer Science Vol. 3742

      Pages: 123-130

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16500010
  • [Journal Article] Single-backup-table schemes for shortest-path routing2005

    • Author(s)
      H.Ito, K.Iwana, Y.Okabe, T.Yoshihiro
    • Journal Title

      Theoretical Computer Science 333

      Pages: 347-353

    • Data Source
      KAKENHI-PROJECT-16300002
  • [Journal Article] Linear-Time Enumeration of Isolated Cliques2005

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

      Proc.the 13th Annual European Symposium on Algorithms (ESA 2005)

      Pages: 119-130

    • Data Source
      KAKENHI-PROJECT-16092215
  • [Journal Article] Biologically inspired self-adaptation of mobile agent population2005

    • Author(s)
      Tomoko Suzuki, Taisuke Izumi, Fukuhito Ooshita, Toshimitsu Masuzawa
    • Journal Title

      Proceedings of the 3rd Workshop on Self-adaptive and Autonomic Computing (DEXA International Workshop)

      Pages: 170-174

    • Data Source
      KAKENHI-PROJECT-16092215
  • [Journal Article] Three equivalent partial orders on graphs with real edge-weights drawn on a convex polygon2005

    • Author(s)
      Hiro Ito
    • Journal Title

      Discrete and Computational Geometry, LNCS 3742

      Pages: 123-130

    • Data Source
      KAKENHI-PROJECT-16500010
  • [Journal Article] Self-adaptation of mobile agent population in dynamic networks : a biologically inspired approach2005

    • Author(s)
      Tomoko Suzuki, Taisuke Izumi, Fukuhito Ooshita, Toshimitsu Masuzawa
    • Journal Title

      Proceedings of the 2nd IEEE International Conference on Autonomic Computing (ICAC-05)

      Pages: 374-375

    • Data Source
      KAKENHI-PROJECT-16092215
  • [Journal Article] Single-backup-table schemes for shortest-path routing2005

    • Author(s)
      H.Ito, K.Iwama, Y.Okabe, T.Yoshihiro
    • Journal Title

      Theoretical Computer Science Vol.333

      Pages: 347-353

    • Data Source
      KAKENHI-PROJECT-16092215
  • [Journal Article] Single-backup-table scheme for shortest-path routing2005

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

      Theoretical Computer Science Vol. 333, Issue 3

      Pages: 347-353

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16500010
  • [Journal Article] Linear-time enumeration of isolated cliques2005

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

      Lecture Notes in Computer Science Vol. 3669

      Pages: 119-130

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16500010
  • [Journal Article] Chomp with poison-strewn chocolates2005

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

      Proceedings of 4th Japanese-Hungarian Symposium on Discrete Mathematics and its Applications, June 3--6, the Alfred Renyi Institute of Mathematics of the Hungarian Academy of Science 1053 Budapest

      Pages: 336-343

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16500010
  • [Journal Article] Transformation of Simple Graphs Preserving Cut-Size Order and Their Simpleness2005

    • Author(s)
      H.Ito
    • Journal Title

      Abstracts of the China-Japan Conference on Discrete Geometry, Combinatorics, and Graph Theory (CJCDGCGT)

      Pages: 12-14

    • Data Source
      KAKENHI-PROJECT-16092215
  • [Journal Article] Linear-time enumeration of isolated cliques2005

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

      Proceedings of 13th Annual European Symposium on Algorithms (ESA2005) LNCS #3669

      Pages: 119-130

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16500010
  • [Journal Article] Linear-Time Enumeration of Isolated Cliques2005

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

      Proc.13th Annual European Symposium on Algorithms 3669

      Pages: 119-130

    • Data Source
      KAKENHI-PROJECT-16092101
  • [Journal Article] Chomp with Poison-Strewn Chocolates2005

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

      Proc.4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications

      Pages: 336-343

    • Data Source
      KAKENHI-PROJECT-16300002
  • [Journal Article] Linear-time enumeration of isolated cliques2005

    • Author(s)
      Hiro Ito, Kazuo Iwama, Tsuyoshi Osumi
    • Journal Title

      Proceedings of 13th Annual European Symposium on Algorithms (ESA2005), LNCS 3669

      Pages: 119-130

    • Data Source
      KAKENHI-PROJECT-16500010
  • [Journal Article] Linear-Time Enumeration of Isolated Cliques2005

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

      Proc.13th Annual European Symposium on Algorithms 3669

      Pages: 119-130

    • Data Source
      KAKENHI-PROJECT-16300002
  • [Journal Article] Single-backup-table schemes for shortest-path routing2005

    • Author(s)
      H.Ito, K.Iwama, Y.Okabe, T.Yoshihiro
    • Journal Title

      Theoretical Computer Science Vol.333,Issue 3, March

      Pages: 347-353

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16500010
  • [Journal Article] Single-Backup-Table Schemes for Shortest-Path Routing2005

    • Author(s)
      H., Ito, K., Iwama, Y., Okabe, T., Yoshihiro
    • Journal Title

      Theoretical Computer Science vol.333, no. 3

      Pages: 347-353

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16300002
  • [Journal Article] Single-backup-table schemes for shortest-path routing2005

    • Author(s)
      H.Ito, K.Iwama, Y.Okabe, T.Yoshihiro
    • Journal Title

      Theoretical Computer Science Vol.333, Issue 3

      Pages: 347-353

    • Data Source
      KAKENHI-PROJECT-16500010
  • [Journal Article] A self-stabilizing link-coloring protocol resilient to Byzantine faluts in tree networks2004

    • Author(s)
      Yusuke Sakurai, Fukuhito Ooshita, Toshimitsu Masuzawa
    • Journal Title

      Proceedings of the 8th International Conference on Principles of Distributed Systems (OPODIS 2004)

      Pages: 196-206

    • Data Source
      KAKENHI-PROJECT-16092215
  • [Journal Article] Subdivision of the hierarchy of H-colorable graph classes by circuit graphs2004

    • Author(s)
      A.Uejima, H.Ito
    • Journal Title

      Proc.Workshop on Graphs and Combinatorial Optimization

      Pages: 232-236

    • Data Source
      KAKENHI-PROJECT-16300002
  • [Journal Article] NA-edge-connectivity augmentation problems by adding edges2004

    • Author(s)
      H.Miwa, H.Ito
    • Journal Title

      Journal of the Operations Reserch Society of Japan Vol.47,No.4

      Pages: 224-243

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16500010
  • [Journal Article] NA-Edge-Connectivity Augmentation Problems by Adding Edges2004

    • Author(s)
      H., Miwa, H., Ito
    • Journal Title

      Journal of the Operations Reserch Society of Japan vol.47, no. 4

      Pages: 224-243

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16300002
  • [Journal Article] Timed uniform consensus resilient to crash and timing faults2004

    • Author(s)
      Taisuke Izumi, Akinori Saitoh, Toshimitsu Masuzawa
    • Journal Title

      Proceedings of the International Conference on Dependable Systems and Networks (DSN 2004)

      Pages: 243-252

    • Data Source
      KAKENHI-PROJECT-16092215
  • [Journal Article] {overline C_7)-coloring problem2004

    • Author(s)
      A.Uejima, H.Ito, T.Tsukiji
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications an Computer Sciences Vol.E87-A, No.5

      Pages: 1243-1250

    • Data Source
      KAKENHI-PROJECT-16500010
  • [Journal Article] Imperfectness of Data for STS-Based Physical Mapping2004

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

      Exploring New Frontiers of Theoretical Informatics (Proceedings of TCS2004)

      Pages: 279-292

    • Data Source
      KAKENHI-PROJECT-16500010
  • [Journal Article] overline{C_7}-coloring problem2004

    • Author(s)
      A.Uejima, H.Ito, T.Tsukiji
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics Vol.E87-A,No.5

      Pages: 1243-1250

    • Data Source
      KAKENHI-PROJECT-16092215
  • [Journal Article] C_7-coloring problem2004

    • Author(s)
      A., Uejima, H., Ito, T., Tsukiji
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences vol.87, no. 5

      Pages: 1243-1250

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16300002
  • [Journal Article] C_7-coloring problem2004

    • Author(s)
      A. Uejima, H. Ito, T. Tsukiji
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E87-A(5)

      Pages: 1243-1250

    • Description
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16300002
  • [Journal Article] NA-edge-connectivity augmentation problems by adding edges2004

    • Author(s)
      H.Miwa, H.Ito
    • Journal Title

      Journal of the operations Research Society of Japan Vol. 47, No. 4

      Pages: 224-243

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16500010
  • [Journal Article] NA-edge-connectivity augmentation problems by adding edges2004

    • Author(s)
      Hiroyoshi Miwa, Hiro Ito
    • Journal Title

      Journal of the Operations Reserch Society of Japan Vol.47,No.4

      Pages: 224-243

    • Data Source
      KAKENHI-PROJECT-16092215
  • [Journal Article] NA-Edge-Connectivity Augmentation Problems by Adding Edges2004

    • Author(s)
      H. Miwa, H. Ito
    • Journal Title

      Journal of the Operations Reserch Society of Japan 47(4)

      Pages: 224-243

    • Description
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16300002
  • [Journal Article] NA-edge-connectivity augmentation problems by adding edges2004

    • Author(s)
      M.Miwa, H.Ito
    • Journal Title

      Journal of the Operations Research Society of Japan Vol.47, No.4

      Pages: 224-243

    • Data Source
      KAKENHI-PROJECT-16500010
  • [Journal Article] Imperfectness of data for STS-based physical mapping2004

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

      J.- J.Levy, E.W.Mayr, and J.C.Mitchell (Eds.), Exploring New Frontiers of Theoretical Informatics (Proceedings of TCS2004), KLUWER

      Pages: 279-292

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16500010
  • [Journal Article] Subdivision of the hierarchy of H-colorable graph classes by circulant graphs2004

    • Author(s)
      A.Uejima, H.Ito
    • Journal Title

      CTW2004 Workshop on Graphs and Combinatorial Optimization

      Pages: 232-236

    • Data Source
      KAKENHI-PROJECT-16500010
  • [Journal Article] Subdivision of the hierarchy of H-colorable graph classes by circulant graphs2004

    • Author(s)
      A.Uejima, H.Ito
    • Journal Title

      CTW04 Workshop on Graphs and Combinatorial Optimization

      Pages: 232-236

    • Data Source
      KAKENHI-PROJECT-16092215
  • [Journal Article] Imperfectness of Data for STS-Based Physical Mapping2004

    • Author(s)
      Hiro Ito, Kazuo Iwama, Takeyuki Tamura
    • Journal Title

      IFIP World Computer Congress

      Pages: 279-292

    • Data Source
      KAKENHI-PROJECT-16092215
  • [Journal Article] Enumeration of isolated cliques and pseudo -cliques

    • Author(s)
      Hiro ITO and Kazuo IWAMA
    • Journal Title

      ACM Transactions on Algorithms to appear

    • Data Source
      KAKENHI-PROJECT-18500012
  • [Journal Article] Testing k-edge-connectivity of digraphs

    • Author(s)
      Yuichi YOSHIDA and Hiro ITO
    • Journal Title

      Journal of System Science and Complexity to appear

    • NAID

      110006343677

    • Data Source
      KAKENHI-PROJECT-18500012
  • [Journal Article] Property testing on k-vertex connectivity of graphs

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

      Algorithmica

      Volume: (採録決定)

    • NAID

      10030998706

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500014
  • [Journal Article] Two equivalent measures on weighted hypergraphs

    • Author(s)
      Hiro Ito, Hiroshi Nagamochi
    • Journal Title

      Discrete Applied Mathematics (採録決定)

    • Data Source
      KAKENHI-PROJECT-16500010
  • [Journal Article] An improved constant-time approximation algorithm for maximum matchings

    • Author(s)
      YOSHIDA Yuichi, YAMAMOTO Masaki, and ITO Hiro
    • Journal Title

      Proceedings of the 41st ACM Symposium on Theory of Computing(STOC 2009)

      Pages: 225-234

    • Data Source
      KAKENHI-PROJECT-21500014
  • [Journal Article] Two equivalent measures on weighted hypergraphs

    • Author(s)
      H.Ito, H.Nagamochi
    • Journal Title

      Discrete Applied Mathematics, The Special Issue to Celebrate the Retirement of Professor Ibaraki. (to appear)

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16500010
  • [Presentation] 最大クリーク抽出アルゴリズムMCTのさらなる高速化2021

    • Author(s)
      柳澤士朗, 富田悦次, 片山謙吾, 金原一歩, 戸田貴久, 伊藤大雄, 若月光夫, 西野哲朗
    • Organizer
      電子情報通信学会 コンピュテーション研究会
    • Data Source
      KAKENHI-PROJECT-17K00006
  • [Presentation] 平行山谷付き平坦折り問題2020

    • Author(s)
      伊藤大雄
    • Organizer
      折り紙の科学を基盤とするアート・数理 および工学への応用研究
    • Invited
    • Data Source
      KAKENHI-PROJECT-20K11671
  • [Presentation] 最大クリーク抽出アルゴリズムMCTの高速化(その2)2019

    • Author(s)
      松崎空良, 富田悦次, 長尾篤樹, 伊藤大雄, 若月光夫, 西野哲朗,片山謙吾,金原一歩
    • Organizer
      冬のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-17K00006
  • [Presentation] 階層構造に基づく複雑ネットワーク生成モデルの超有限性2018

    • Author(s)
      東園和樹, 伊藤大雄
    • Organizer
      電子通信学会コンピューテーション研究会
    • Data Source
      KAKENHI-PROJECT-15K11985
  • [Presentation] 最大クリーク抽出アルゴリズムMCTの高速化2018

    • Author(s)
      松崎空良, 富田悦次, 長尾篤樹, 伊藤大雄, 若月光夫, 西野哲朗
    • Organizer
      情報処理学会数理モデル化と問題解決研究会
    • Data Source
      KAKENHI-PROJECT-17K00006
  • [Presentation] 近似最大クリーク抽出アルゴリズムIKLS の反復回数に対する適切な制御方法2018

    • Author(s)
      長尾篤樹, 松崎空良, 富田悦次, 伊藤大雄, 若月光夫, 西野哲朗
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Data Source
      KAKENHI-PROJECT-17K00006
  • [Presentation] 広義K_3辺被覆問題2017

    • Author(s)
      千葉恭平, ベルモント レミー, 伊藤大雄, 長尾篤樹
    • Organizer
      電子通信学会コンピューテーション研究会
    • Data Source
      KAKENHI-PROJECT-15K11985
  • [Presentation] Packing polyominoes into a rectangle is constant-time testable2017

    • Author(s)
      Hiro Ito and Yoshihiro Takeda
    • Organizer
      The 20th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG^3 2017)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-15K11985
  • [Presentation] K_3 edge cover in a wide sense2017

    • Author(s)
      Kyohei Chiba, Hiro Ito, and Atsuki Nagao
    • Organizer
      The 20th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG^3 2017)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-15K11985
  • [Presentation] Efficient algorithms for finding maximum and maximal cliques2017

    • Author(s)
      EtsujiTomita
    • Organizer
      北海道大学大学院情報科学研究科情報理工学専攻講演会
    • Invited
    • Data Source
      KAKENHI-PROJECT-17K00006
  • [Presentation] 物理的バケットソート2016

    • Author(s)
      John Iacono, 伊藤大雄, *長尾篤樹, 西野順二, David Rappaport
    • Organizer
      コンピューテーション研究会
    • Place of Presentation
      奈良先端科学技術大学院大学(奈良県・生駒市)
    • Data Source
      KAKENHI-PROJECT-15K11985
  • [Presentation] Every Property Is Testable on a Natural Class of Scale-Free Multigraphs2016

    • Author(s)
      Hiro Ito
    • Organizer
      ESA'2016
    • Place of Presentation
      Aarhus
    • Year and Date
      2016-08-22
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-24106003
  • [Presentation] 最大クリーク抽出アルゴリズムMCSの高速化2016

    • Author(s)
      吉田幸平,八田拓郎,富田悦次,長尾篤樹,伊藤大雄,若月 光夫
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      電気通信大学(東京都調布市)
    • Year and Date
      2016-03-06
    • Data Source
      KAKENHI-PROJECT-25330009
  • [Presentation] 2種類のアイテムに限定した物理的バケットソート2016

    • Author(s)
      長尾篤樹, 吉澤修平, 伊藤大雄
    • Organizer
      コンピューテーション研究会
    • Place of Presentation
      東北大学(宮城県・仙台市)
    • Data Source
      KAKENHI-PROJECT-15K11985
  • [Presentation] 最大クリーク抽出アルゴリズムの高速化2015

    • Author(s)
      八田拓郎,富田悦次, 伊藤大雄,若月光夫
    • Organizer
      夏のLAシンポジウム
    • Place of Presentation
      ゆのくに天祥(石川県加賀市)
    • Year and Date
      2015-07-14
    • Data Source
      KAKENHI-PROJECT-25330009
  • [Presentation] 複雑ネットワークの定数時間検査2015

    • Author(s)
      伊藤 大雄
    • Organizer
      OR学会関西支部研究講演会「ビッグデータに挑むアルゴリズム理論」
    • Place of Presentation
      大阪 (日本)
    • Year and Date
      2015-06-27
    • Invited
    • Data Source
      KAKENHI-PLANNED-24106003
  • [Presentation] Constant-time tester on a natural class of scale-free multigraphs2015

    • Author(s)
      Hiro Ito
    • Organizer
      International Workshop on Innovative Algorithms for Big Data
    • Place of Presentation
      Kyoto (Japan)
    • Year and Date
      2015-09-14
    • Invited / Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-24106003
  • [Presentation] Generalized shogi and chess are constant-time tastable2015

    • Author(s)
      Hiro Ito, Atsuki Nagao, and Teagun Park
    • Organizer
      The 12th International Symposium on Operations Research & Its Applications (ISORA 2015)
    • Place of Presentation
      Luoyang, China
    • Year and Date
      2015-08-21
    • Invited / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-15K11985
  • [Presentation] Generalized shogi and chess are constant-time tastable2015

    • Author(s)
      Hiro Ito, Atsuki Nagao, and Teagun Park
    • Organizer
      The 12th International Symposium on Operations Research & Its Applications (ISORA 2015)
    • Place of Presentation
      龍門, 中国
    • Year and Date
      2015-08-21
    • Invited / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-24650006
  • [Presentation] Algorithms for Sublinear-Time Assignment for the Cake Cutting Problem2014

    • Author(s)
      Takahiro Ueda and Hiro Ito
    • Organizer
      AAAC2014 (The 7th Annual Meeting of Asian Association for Algorithms and Computation)
    • Place of Presentation
      杭州市, 中国
    • Data Source
      KAKENHI-PROJECT-24650006
  • [Presentation] On a generalization of river crossing problems2013

    • Author(s)
      Hiro Ito, Stefan Langerman, Yuichi Yoshida
    • Organizer
      The 6th International Meeting of Asian Association for Algorithms and Computation (AAAC2013)
    • Place of Presentation
      松島(宮城県)
    • Data Source
      KAKENHI-PROJECT-24650006
  • [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
    • Data Source
      KAKENHI-PROJECT-22240001
  • [Presentation] 劣線形時間ケーキ分割アルゴリズム2013

    • Author(s)
      上田孝弘, 伊藤大雄
    • Organizer
      電子情報通信学会 コンピューテーション研究会
    • Place of Presentation
      沖縄産業支援センター(那覇市)
    • Data Source
      KAKENHI-PROJECT-24650006
  • [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
    • Data Source
      KAKENHI-PROJECT-22240001
  • [Presentation] サブリニアタイムアルゴリズムの基礎技術2012

    • Author(s)
      伊藤大雄
    • Organizer
      RAMPシンポジウム
    • Place of Presentation
      東北大学
    • Invited
    • Data Source
      KAKENHI-PROJECT-24650006
  • [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(発表確定)
    • Data Source
      KAKENHI-PROJECT-22240001
  • [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(発表確定)
    • Data Source
      KAKENHI-PROJECT-22240001
  • [Presentation] Constant-time approximation algorithms for the optimum branching problem on sparse graphs2012

    • Author(s)
      Mitsuru Kusumoto, Yuichi Yoshida, and Hiro Ito
    • Organizer
      Proceedings of the Workshop on Computational Complexity Analysis and Algorithm Design for Combinatorial Optimization Problems
    • Place of Presentation
      Okinawa, Japan
    • Data Source
      KAKENHI-PROJECT-23500037
  • [Presentation] Algorithms and complexity of generalized river crossing problems2012

    • Author(s)
      Hiro Ito, Stefan Langerman, Yuichi Yoshida
    • Organizer
      6th International Conference on Fun with Algorithms (FUN 2012)
    • Place of Presentation
      Venice, Italy
    • Data Source
      KAKENHI-PROJECT-23500037
  • [Presentation] Constant-time algorithms for sparsity matroids2012

    • Author(s)
      Hiro Ito, Shin-ichi Tanigawa, Yuichi Yoshida
    • Organizer
      39th International Colloquium on Automata, Language and Programming (ICALP 2012)
    • Place of Presentation
      University of Warwick, UK
    • Data Source
      KAKENHI-PROJECT-23500037
  • [Presentation] Constant-time approximation algorithms for the optimum branching problem on sparse graphs2012

    • Author(s)
      Mitsuru Kusumoto, Yuichi Yoshida, and Hiro Ito
    • Organizer
      Workshop on Computational Complexity Analysis and Algorithm Design for Combinatorial Optimization Problems (WCOP) in ICNC'12
    • Place of Presentation
      Okinawa, Japan
    • Data Source
      KAKENHI-PROJECT-23500037
  • [Presentation] Constant-time approximation algorithms for the knapsack problem2012

    • Author(s)
      Hiro Ito, Susumu Kiyoshima, Yuichi Yoshida
    • Organizer
      9th Annual Conference on Theory and Applications of Models of Computation (TAMC 2012)
    • Place of Presentation
      Beijing, China
    • Data Source
      KAKENHI-PROJECT-23500037
  • [Presentation] Improved Constant-Time Approximation Algorithms for Maximum Matchings and Other Optimization Problems2012

    • Author(s)
      Hiro Ito, Shin-ichi Tanigawa and Yuichi Yoshida
    • Organizer
      ICALP 2012
    • Place of Presentation
      Warwick, UK
    • Data Source
      KAKENHI-PLANNED-24106003
  • [Presentation] How to generalize janken --- rock-paper-scissors-king-flea2012

    • Author(s)
      Hiro Ito
    • Organizer
      Proceedings of TJJCCGG
    • Place of Presentation
      Bangkok, Thailand
    • Data Source
      KAKENHI-PROJECT-23500037
  • [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(発表確定)
    • Data Source
      KAKENHI-PROJECT-22240001
  • [Presentation] Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs2012

    • Author(s)
      Mitsuru Kusumoto and Yuichi Yoshida and Hiro Ito
    • Organizer
      ICNC 2012
    • Place of Presentation
      Okinawa, Japan
    • Data Source
      KAKENHI-PLANNED-24106003
  • [Presentation] 定数時間アルゴリズムとBDD, ERATO湊離散構造処理系プロジェクト2011

    • Author(s)
      伊藤大雄, 楠本充
    • Organizer
      2011年度初夏のワークショップ
    • Place of Presentation
      北大
    • Data Source
      KAKENHI-PROJECT-21500014
  • [Presentation] 定数時間アルゴリズムとその基本定理(前編)-密グラフモデルと正則性補題, ERATOセミナー2011

    • Author(s)
      伊藤大雄
    • Place of Presentation
      北大
    • Year and Date
      2011-08-23
    • Data Source
      KAKENHI-PROJECT-21500014
  • [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
    • Data Source
      KAKENHI-PROJECT-22240001
  • [Presentation] An Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems2011

    • Author(s)
      W. BEIN, HATTA Naoki, ITO Hiro, KAWAHARA Jun
    • Organizer
      信学技報電子情報通信学会コンピューテーション研究会(COMP)
    • Place of Presentation
      京都大学
    • Year and Date
      2011-04-22
    • Data Source
      KAKENHI-PROJECT-21500014
  • [Presentation] 定数時間アルゴリズムとBDD2011

    • Author(s)
      伊藤大雄, 楠本充
    • Organizer
      ERATO湊離散構造処理系プロジェクト2011年度初夏のワークショップ
    • Place of Presentation
      ERATO札幌オフィス(北大)
    • Year and Date
      2011-06-11
    • Data Source
      KAKENHI-PROJECT-21500014
  • [Presentation] TANIGAWA Shin-ichi, YOSHIDA Yuichi, Testing algorithms for(k, l)-sparsity and(k, l). edge-connected-orient ability2011

    • Author(s)
      ITO Hiro
    • Organizer
      The 7th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications
    • Place of Presentation
      京都大学数理解析研究所
    • Data Source
      KAKENHI-PROJECT-21500014
  • [Presentation] ナップサック問題に対する定数時間近似アルゴリズム2011

    • Author(s)
      伊藤大雄, 清島奨, 吉田悠一
    • Organizer
      信学技報電子情報通信学会コンピューテーション研究会(COMP)
    • Place of Presentation
      中央大学後楽園キャンパス
    • Year and Date
      2011-03-09
    • Data Source
      KAKENHI-PROJECT-21500014
  • [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
    • Data Source
      KAKENHI-PROJECT-22240001
  • [Presentation] 定数時間アルゴリズムとその基本定理(前編)---密グラフモデルと正則性補題2011

    • Author(s)
      伊藤大雄
    • Organizer
      ERATOセミナー
    • Place of Presentation
      ERATO札幌オフィス(北大)
    • Year and Date
      2011-08-23
    • Data Source
      KAKENHI-PROJECT-21500014
  • [Presentation] Constant-time algorithms and fundamental theorems2011

    • Author(s)
      ITO Hiro
    • Organizer
      Colloquium, Dept. Comput. Science
    • Place of Presentation
      Univ. Nevada, Las Vegas.
    • Year and Date
      2011-10-21
    • Data Source
      KAKENHI-PROJECT-21500014
  • [Presentation] Bubble sort with infinitely large bins2011

    • Author(s)
      伊藤大雄, 照山順一, 吉田悠一
    • Organizer
      LAシンポジウム
    • Place of Presentation
      京都大学
    • Year and Date
      2011-02-01
    • Data Source
      KAKENHI-PROJECT-21500014
  • [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
    • Data Source
      KAKENHI-PROJECT-19200001
  • [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
    • Data Source
      KAKENHI-PROJECT-19200001
  • [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
    • Data Source
      KAKENHI-PROJECT-22240001
  • [Presentation] An almost optimal algorithm for Winkler's sorting pairs in bins2010

    • Author(s)
      H.Ito, J.Teruyama, Y.Yoshida
    • Organizer
      電子情報通信学会コンピューテーション研究会
    • Place of Presentation
      九州大学西新プラザ
    • Year and Date
      2010-01-25
    • Data Source
      KAKENHI-PROJECT-21500014
  • [Presentation] An almost optimal algorithm for Winkler's sorting pairs in bins2010

    • Author(s)
      ITO Hiro, TERUYAMA Junichi, and YOSHIDA Yuichi
    • Organizer
      信学技報電子情報通信学会コンピューテーション研究会(COMP)
    • Place of Presentation
      九州大学西新プラザ
    • Year and Date
      2010-01-25
    • Data Source
      KAKENHI-PROJECT-21500014
  • [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
    • Data Source
      KAKENHI-PROJECT-22240001
  • [Presentation] An almost optimal algorithm for Winkler's sorting pairs in bins2010

    • Author(s)
      ITO Hiro, TERUYAMA Junichi, and YOSHIDA Yuichi
    • Organizer
      AAAC2010
    • Place of Presentation
      浦項(pohang),韓国
    • Data Source
      KAKENHI-PROJECT-21500014
  • [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
    • Data Source
      KAKENHI-PROJECT-19200001
  • [Presentation] Arrangements of n points whose incident-linenumbers are at most n/22009

    • Author(s)
      J.Akiyama, H.Ito, M.Kobayashi, G.Nakamura
    • Organizer
      JCCGG2009
    • Place of Presentation
      北陸先端科学技術大学院大学
    • Year and Date
      2009-11-11
    • Data Source
      KAKENHI-PROJECT-21500014
  • [Presentation] 無秩序の代償(price of anarchy)の理論への招待2009

    • Author(s)
      伊藤大雄
    • Organizer
      FIT2009
    • Place of Presentation
      東北工業大学 八木山キャンパス
    • Year and Date
      2009-09-02
    • Data Source
      KAKENHI-PROJECT-21500014
  • [Presentation] Constant-time approximations using minimum value search for independent sets and matchings2009

    • Author(s)
      Y.Yoshida, M.Yamamoto, H.Ito
    • Organizer
      The 2nd Annual Meeting of Asian Association for Algorithms and Computation (AAAC2009)
    • Place of Presentation
      Hangzhou(杭州),中国
    • Year and Date
      2009-04-11
    • Data Source
      KAKENHI-PROJECT-21500014
  • [Presentation] 最大独立集合と最大マッチングに対する定数時間近似アルゴリズムの改善2009

    • Author(s)
      吉田悠一, 山本真基, 伊藤大雄
    • Organizer
      電子情報通信学会総合大会
    • Place of Presentation
      愛媛大(松山市)
    • Data Source
      KAKENHI-PROJECT-21500014
  • [Presentation] 大規模ネットワーク問題のための定数時間アルゴリズム2009

    • Author(s)
      伊藤大雄
    • Organizer
      甲南大学 知的情報通信研究所 シンポジウム「ネットワークと情報処理」
    • Place of Presentation
      甲南大学
    • Year and Date
      2009-12-26
    • Data Source
      KAKENHI-PROJECT-21500014
  • [Presentation] ジョルダン閉曲線上の4点からは作れない四角形2009

    • Author(s)
      秋山仁, 伊藤大雄, 小林みどり, 中村義作
    • Organizer
      離散数学とその応用研究集会
    • Place of Presentation
      茨城大学工学部日立キャンパス
    • Year and Date
      2009-08-07
    • Data Source
      KAKENHI-PROJECT-21500014
  • [Presentation] 大規模ネットワーク問題のための定数時間アルゴリズム「ネットワークと情報処理」2009

    • Author(s)
      伊藤大雄
    • Organizer
      甲南大学知的情報通信研究所シンポジウム
    • Place of Presentation
      甲南大学
    • Year and Date
      2009-12-26
    • Data Source
      KAKENHI-PROJECT-21500014
  • [Presentation] Arrangements of eleven points in the plane, each with five incident lines2009

    • Author(s)
      J.Akiyama, H.Ito, M.Kobayashi, G.Nakamura
    • Organizer
      JCCGG2009
    • Place of Presentation
      北陸先端科学技術大学院大学
    • Year and Date
      2009-11-11
    • Data Source
      KAKENHI-PROJECT-21500014
  • [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
    • Data Source
      KAKENHI-PROJECT-19200001
  • [Presentation] 無秩序の代償(price of anarchy)の理論への招待「アルゴリズム・サイエンスにおけるゲーム理論の新展開」2009

    • Author(s)
      伊藤大雄
    • Organizer
      FIT 2009イベント企画
    • Place of Presentation
      東北工業大学八木山キャンパス
    • Data Source
      KAKENHI-PROJECT-21500014
  • [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
    • Data Source
      KAKENHI-PROJECT-19200001
  • [Presentation] Constant-time approximations using minimum value search for independent sets and matchings2009

    • Author(s)
      YOSHIDA Yuichi, YAMAMOTO Masaki, and ITO Hiro
    • Organizer
      Constant-time approximations using minimum value search for independent sets and matchings
    • Place of Presentation
      中国
    • Data Source
      KAKENHI-PROJECT-21500014
  • [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
    • Data Source
      KAKENHI-PROJECT-19200001
  • [Presentation] 無向グラフのk枝連結性の検査2008

    • Author(s)
      吉田悠一, 伊藤大雄
    • Organizer
      電子情報通信学会コンピューテーション研究会
    • Place of Presentation
      北陸先端科学技術大学院大学
    • Year and Date
      2008-06-16
    • Data Source
      KAKENHI-PROJECT-18500012
  • [Presentation] Constant time k-connectivity testing2008

    • Author(s)
      Yuichi YOSHIDA and Hiro ITO
    • Organizer
      Chinese Academy of Sciences - Kyoto University Joint Workshop on Mathematical Methods for InformaticsEngineering and Management
    • Place of Presentation
      Engineeringand Management, Beijing, China
    • Data Source
      KAKENHI-PROJECT-18500012
  • [Presentation] 無秩序の代償(price of anarchy)の理論入門, 第5回日本OR学会中部支部シンポジウム「インターネット時代のゲーム理論」2008

    • Author(s)
      伊藤大雄
    • Organizer
      第二豊田ビル(西館)8 階第1 会議室
    • Place of Presentation
      名古屋
    • Year and Date
      2008-09-05
    • Data Source
      KAKENHI-PROJECT-18500012
  • [Presentation] Constant time k-connectivity testing2008

    • Author(s)
      Y. Yoshida, H, Ito
    • Organizer
      Chinese Academy of Sciences-Kyoto University Joint Workshop on Mathematical Methods for Informatics
    • Place of Presentation
      Chinese Academy of Science,北京,中国
    • Year and Date
      2008-03-17
    • Data Source
      KAKENHI-PROJECT-18500012
  • [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
    • Data Source
      KAKENHI-PROJECT-19200001
  • [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
    • Data Source
      KAKENHI-PROJECT-19200001
  • [Presentation] Testing k-connectivity on Degree Bounded Graphs2008

    • Author(s)
      Yuichi YOSHIDA and Hiro ITO
    • Organizer
      Research Seminar on Connectivity of Graphs and Its Applications
    • Place of Presentation
      SATAKE Memorial Hall, Hiroshima University
    • Data Source
      KAKENHI-PROJECT-18500012
  • [Presentation] On k-connectivity testing in degree-bounded graphs2008

    • Author(s)
      Yuichi YOSHIDA and Hiro ITO
    • Organizer
      The First Annual Meeting of Asian Association for Algorithms and Computation (AAAC08)
    • Place of Presentation
      Hong Kong
    • Data Source
      KAKENHI-PROJECT-18500012
  • [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
    • Data Source
      KAKENHI-PROJECT-16092101
  • [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
    • Data Source
      KAKENHI-PROJECT-19200001
  • [Presentation] FPT algorithm for the Hamiltonian circuit problem on unit disk graphs parametrized by the area, OR50 Annual Conference (OR50)2008

    • Author(s)
      Hiro ITO and Masakazu KADOSHITA
    • Organizer
      Univ. of York
    • Place of Presentation
      York, UK
    • Data Source
      KAKENHI-PROJECT-18500012
  • [Presentation] Multi-Commodity Source Location Problems and Price of Greed2008

    • Author(s)
      H. Ito, M. Paterson, and K. Sugihara
    • Organizer
      WALCOM 2008
    • Place of Presentation
      Dhaka, Bangladesh
    • Year and Date
      2008-02-08
    • Data Source
      KAKENHI-PROJECT-16092215
  • [Presentation] Property Testing on k-Vertex-Connectivity of Graphs2008

    • Author(s)
      Yuichi Yoshida, Hiro Ito
    • Organizer
      ICALP 2008
    • Place of Presentation
      Iceland, regkjavik
    • Year and Date
      2008-07-09
    • Data Source
      KAKENHI-PROJECT-16092101
  • [Presentation] 21世紀のネットワーク最適化, ORセミナー「最適化とその実用」2008

    • Author(s)
      伊藤大雄
    • Organizer
      構造計画研究所 本所新館
    • Place of Presentation
      東京
    • Year and Date
      2008-08-28
    • Data Source
      KAKENHI-PROJECT-18500012
  • [Presentation] 無向グラフのk 枝連結性の検査, 信学技報, COM2008-222008

    • Author(s)
      吉田悠一, 伊藤大雄
    • Organizer
      電子情報通信学会コンピューテーション研究会(COMP)
    • Place of Presentation
      北陸先端科学技術大学院大学
    • Year and Date
      2008-06-16
    • Data Source
      KAKENHI-PROJECT-18500012
  • [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
    • Data Source
      KAKENHI-PROJECT-19200001
  • [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
    • Data Source
      KAKENHI-PROJECT-19200001
  • [Presentation] Multicommodity source location problems and price of greed, Research Seminar on Connectivity of Graphs and Its Applications2007

    • Author(s)
      Hiro ITO, Mike PATERSON, and Kenya SUGIHARA
    • Organizer
      SATAKE Memorial Holl
    • Place of Presentation
      Hiroshima University
    • Data Source
      KAKENHI-PROJECT-18500012
  • [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
    • Data Source
      KAKENHI-PROJECT-16092215
  • [Presentation] 有向グラフにおけるk枝連結性の検査2007

    • Author(s)
      吉田悠一, 伊藤大雄
    • Organizer
      電子情報通信学会コンピューテーション研究会
    • Place of Presentation
      北海道大学
    • Year and Date
      2007-06-29
    • Data Source
      KAKENHI-PROJECT-18500012
  • [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
    • Data Source
      KAKENHI-PROJECT-19200001
  • [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
    • Data Source
      KAKENHI-PROJECT-16092215
  • [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
    • Data Source
      KAKENHI-PROJECT-16092215
  • [Presentation] 有向グラフにおけるk 枝連結性の検査 信学技報, COM2007-18 (2007-06)2007

    • Author(s)
      吉田悠一, 伊藤大雄
    • Organizer
      電子情報通信学会コンピューテーション研究会(COMP)
    • Place of Presentation
      北大
    • Year and Date
      2007-06-29
    • Data Source
      KAKENHI-PROJECT-18500012
  • [Presentation] Optimal moves for gossiping among mobile agents2007

    • Author(s)
      Tomoko Suzuki, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa
    • Organizer
      SIROCCO 2007
    • Place of Presentation
      Castiglioncello, Italy
    • Year and Date
      2007-06-07
    • Data Source
      KAKENHI-PROJECT-16092215
  • [Presentation] 部の大きさの比が高々定数倍の孤立2部クリークの列挙2007

    • Author(s)
      宮川博光, 伊藤大雄, 岩間一雄
    • Organizer
      電子情報通信学会コンピューテーション研究会
    • Place of Presentation
      北海道大学
    • Year and Date
      2007-06-29
    • Data Source
      KAKENHI-PROJECT-18500012
  • [Presentation] Multicommodity source location problems and price of greed2007

    • Author(s)
      Hiro ITO, Mike PATERSON, and Kenya SUGIHARA
    • Organizer
      FIT2007
    • Place of Presentation
      中京大豊田キャンパス
    • Data Source
      KAKENHI-PROJECT-18500012
  • [Presentation] Multi-commodity source location problems and price of greed2007

    • Author(s)
      H. Ito, M. Paterson, K. Sugihara
    • Organizer
      第6回情報科学技術フォーラム(FIT2007)
    • Place of Presentation
      中京大学 豊田キャンパス
    • Year and Date
      2007-09-06
    • Data Source
      KAKENHI-PROJECT-18500012
  • [Presentation] 部の大きさの比が高々定数倍の孤立2部クリークの列挙, 信学技報, COM2007-18(2007-06)2007

    • Author(s)
      宮川博光, 伊藤大雄, 岩間一雄
    • Organizer
      電子情報通信学会コンピューテーション研究会(COMP)
    • Place of Presentation
      北大
    • Year and Date
      2007-06-29
    • Data Source
      KAKENHI-PROJECT-18500012
  • [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
    • Data Source
      KAKENHI-PROJECT-19200001
  • [Presentation] Maximum-Cover Source-Location Problem with Object Edge-Connectivity Three2006

    • Author(s)
      K., Sugihara, H., Ito
    • Organizer
      Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2006)
    • Place of Presentation
      Lambrecht, Germany
    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16300002
  • [Presentation] Maximum-Cover Source-Location Problem with Object Edge-Connectivity Three2006

    • Author(s)
      K. Sugihara, H. Ito
    • Organizer
      Cologne-Twente Workshop on Graphs and Combinatorial Optimization(CTW 2006)
    • Place of Presentation
      Lambrecht, Germany
    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16300002
  • [Presentation] Linear-Time Enumeration of Isolated Cliques2005

    • Author(s)
      H., Ito, K., Iwama, T., Osumi
    • Organizer
      The 13th Annual European Symposium on Algorithms (ESA 2005), LNCS 3669
    • Place of Presentation
      Spain
    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16300002
  • [Presentation] Infinite Series of Generalized Gospher Space Filling Curves2005

    • Author(s)
      J., Akiyama, H., Fukuda, H., Ito, G., Nakamura
    • Organizer
      The China-Japan Conference on Discrete Geometry, Combinatorics, and Graph Theory (CJCDGCGT)
    • Place of Presentation
      China
    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16300002
  • [Presentation] Infinite Series of Generalized Gospher Space Filling Curves2005

    • Author(s)
      J. Akiyama, H. Fukuda, H. Ito, G. Nakamura
    • Organizer
      The China-Japan Conference on Discrete Geometry, Combinatorics, and Graph Theory(CJCDGCGT)
    • Place of Presentation
      Xi'an, China
    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16300002
  • [Presentation] Transformation of Simple Graphs Preserving Cut-Size Order and Their Simpleness2005

    • Author(s)
      H. Ito
    • Organizer
      The China-Japan Conference on Discrete Geometry, Combinatorics, and Graph Theory(CJCDGCGT)
    • Place of Presentation
      Xi'an, China
    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16300002
  • [Presentation] Transformation of Simple Graphs Preserving Cut-Size Order and Their Simpleness2005

    • Author(s)
      H., Ito
    • Organizer
      The China-Japan Conference on Discrete Geometry, Combinatorics, and Graph Theory (CJCDGCGT)
    • Place of Presentation
      China
    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16300002
  • [Presentation] Linear-Time Enumeration of Isolated Cliques2005

    • Author(s)
      H. Ito, K. Iwama, T. Osumi
    • Organizer
      The 13th Annual European Symposium on Algorithms(ESA 2005)
    • Place of Presentation
      Palma de Mallorca, Spain
    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16300002
  • [Presentation] Chomp with Poison-Strewn Chocolates2005

    • Author(s)
      H. Ito, G. Nakamura, S. Takata
    • Organizer
      The 4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Apphcations
    • Place of Presentation
      Hungary
    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16300002
  • [Presentation] Chomp with Poison-Strewn Chocolates2005

    • Author(s)
      H., Ito, G., Nakamura, S., Takata
    • Organizer
      The 4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications
    • Place of Presentation
      Hungary
    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16300002
  • [Presentation] Linear-Time Enumeration of Isolated Cliques2005

    • Author(s)
      H. Ito, K. Iwama, and T. Osumi
    • Organizer
      ESA 2005
    • Place of Presentation
      Mallorca, Spain
    • Year and Date
      2005-10-03
    • Data Source
      KAKENHI-PROJECT-16092215
  • [Presentation] Transformation of Simple Graphs Preserving Cut-Size Order and Their Simpleness2005

    • Author(s)
      H. Ito
    • Organizer
      CJCDGCGT2005
    • Place of Presentation
      Xi'an, China
    • Year and Date
      2005-11-22
    • Data Source
      KAKENHI-PROJECT-16092215
  • [Presentation] Three equivalent partial orders on graphs with real edge-weights drawn on a convex polygon2004

    • Author(s)
      H., Ito
    • Organizer
      The Japan Conference on Discrete and Computational Geometry (JCDCG2004)
    • Place of Presentation
      Tokyo, Japan
    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16300002
  • [Presentation] Imperfectness of Data for STS-Based Physical Mapping2004

    • Author(s)
      H., Ito, K., Iwama, T., Tamura
    • Organizer
      The 3rd IFIT International Conference on Theoretical Computer Science (TCS2004)
    • Place of Presentation
      Toulouse, France
    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16300002
  • [Presentation] Subdivision of the Hierarchy of H-Colorable Graph Classes by Circulant Graphs2004

    • Author(s)
      A., Uejima, H., Ito
    • Organizer
      Workshop on Graphs and Combinatorial Optimization (CPW04)
    • Place of Presentation
      Germany
    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16300002
  • [Presentation] A self-stabilizing link-coloring protocol resilient to Byzantine faluts in tree networks2004

    • Author(s)
      Yusuke Sakurai, Fukuhito Ooshita, Toshimitsu Masuzawa
    • Organizer
      OPODIS 2004
    • Place of Presentation
      Grenoble, France
    • Year and Date
      2004-12-17
    • Data Source
      KAKENHI-PROJECT-16092215
  • [Presentation] Subdivision of the Hierarchy of H-Colorable Graph Classes by Circulant Graphs2004

    • Author(s)
      A. Uejima, H. Ito
    • Organizer
      Workshop on Graphs and Combinatorial Optimization(CTW04)
    • Place of Presentation
      Germany
    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16300002
  • [Presentation] Imperfectness of Data for STS-Based Physical Mapping2004

    • Author(s)
      H. Ito, K. Iwama, T. Tamura
    • Organizer
      The 3rd IFIP International Conference on Theoretical Computer Science(TC52004)
    • Place of Presentation
      Toulouse, France
    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16300002
  • [Presentation] Three equivalent partial orders on graphs with real edge-weights drawn on a convex polygon2004

    • Author(s)
      H. Ito
    • Organizer
      The Japan Conference on Discrete and Computational Geometry(JCDCG2004)
    • Place of Presentation
      Tokyo, Japan
    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16300002
  • [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
    • Data Source
      KAKENHI-PROJECT-22240001
  • [Presentation] 一般化川渡り問題のアルゴリズムと計算量

    • Author(s)
      伊藤大雄, Stefan LANGERMAN, 吉田悠一
    • Organizer
      離散数学1日研究集会 --- 秋山仁先生 東京理科大学着任記念
    • Place of Presentation
      東京理科大学
    • Data Source
      KAKENHI-PROJECT-24650006
  • [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
    • Data Source
      KAKENHI-PROJECT-22240001
  • [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
    • Data Source
      KAKENHI-PROJECT-22240001
  • [Presentation] 一般化川渡り問題の多項式時間可解性

    • Author(s)
      伊藤大雄, Stefan Langerman, 吉田悠一
    • Organizer
      組合せゲーム・パズル 第8回ミニ研究集会
    • Place of Presentation
      電気通信大学
    • Data Source
      KAKENHI-PROJECT-24650006
  • [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
    • Data Source
      KAKENHI-PROJECT-22240001
  • [Presentation] 異なる手の間に引分けのある一般化ジャンケンにおける引分け数と不敗手数

    • Author(s)
      伊藤大雄, 塩野芳直
    • Organizer
      組合せゲーム・パズル 第9回ミニ研究集会
    • Place of Presentation
      北陸先端科学技術大学院大学
    • Data Source
      KAKENHI-PROJECT-24650006
  • [Presentation] ビッグデータ時代の高速アルゴリズムと計算限界の理論

    • Author(s)
      伊藤大雄
    • Organizer
      情報オリンピック夏季セミナー
    • Place of Presentation
      国立女性教育会館(埼玉県比企郡)
    • Data Source
      KAKENHI-PROJECT-24650006
  • 1.  IWAMA Kazuo (50131272)
    # of Collaborated Projects: 11 results
    # of Collaborated Products: 37 results
  • 2.  MIYAZAKI Shuichi (00303884)
    # of Collaborated Projects: 6 results
    # of Collaborated Products: 0 results
  • 3.  HORIYAMA Takashi (60314530)
    # of Collaborated Projects: 6 results
    # of Collaborated Products: 1 results
  • 4.  TOKUYAMA Takeshi (40312631)
    # of Collaborated Projects: 4 results
    # of Collaborated Products: 5 results
  • 5.  TAMAKI Suguru (40432413)
    # of Collaborated Projects: 4 results
    # of Collaborated Products: 0 results
  • 6.  KATOH Naoki (40145826)
    # of Collaborated Projects: 3 results
    # of Collaborated Products: 0 results
  • 7.  YAMASHITA Masafumi (00135419)
    # of Collaborated Projects: 3 results
    # of Collaborated Products: 0 results
  • 8.  WATANABE Osamu (80158617)
    # of Collaborated Projects: 3 results
    # of Collaborated Products: 1 results
  • 9.  NAKAMURA Gisaku (20109200)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 4 results
  • 10.  FUKUDA Hiroshi (70238484)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 1 results
  • 11.  SUGIHARA Kokichi (40144117)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 1 results
  • 12.  AVIS David (90584110)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 13.  KAWAHARA Jun (20572473)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 14.  SETO Kazuhisa (20584056)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 15.  YOSHIDA Yuichi (50636967)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 6 results
  • 16.  TOMITA Etsuji (40016598)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 9 results
  • 17.  若月 光夫 (30251705)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 8 results
  • 18.  西野 哲朗 (10198484)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 4 results
  • 19.  MASUZAWA Toshimitsu (50199692)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 10 results
  • 20.  MORIZUMI Hiroki (50463782)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 21.  IWATA Shigeki (80102028)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 22.  TAKENAGA Yasuhoko (20236491)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 23.  KASAI Takumi (70027382)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 24.  Kawarabayashi Kenichi (40361159)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 25.  MASUYAMA Shigeru (60173762)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 26.  ICHIKAWA Shuichi (70262855)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 27.  OKABE Yasuo (20204018)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 28.  OKAMOTO Kazuya (60565018)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 29.  田中 圭介 (20334518)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 30.  櫻井 幸一 (60264066)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 31.  浅野 孝夫 (90124544)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 32.  浅野 哲夫 (90113133)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 33.  平田 富夫 (10144205)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 34.  上野 賢哉 (70586081)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 35.  MIWA Hiroyoshi
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 36.  大舘 陽太
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results
  • 37.  BELMONTE Remy
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results
  • 38.  伊藤 健洋
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 2 results
  • 39.  上原 隆平
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 4 results
  • 40.  岡本 吉央
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results
  • 41.  伊藤 孝行
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results
  • 42.  斎藤 寿樹
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results
  • 43.  Korman Matias
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results
  • 44.  山本 真基
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results
  • 45.  伊東 利哉
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results
  • 46.  奈良 知恵
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results

URL: 

Are you sure that you want to connect your ORCID iD to this researcher?
* This action can be performed only by the researcher themselves.

この研究者とORCID iDの連携を行いますか?
※ この処理は、研究者本人だけが実行できます。

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi