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

ASAHIRO Yuichi  朝廣 雄一

ORCIDConnect your ORCID iD *help
Researcher Number 40304761
Other IDs
External Links
Affiliation (Current) 2025: 九州産業大学, 理工学部, 教授
Affiliation (based on the past Project Information) *help 2017 – 2024: 九州産業大学, 理工学部, 教授
2011 – 2016: 九州産業大学, 情報科学部, 教授
2010: 九州産業大学, 情報科学部, 准教授
2006 – 2008: 九州産業大学, 情報科学部, 准教授
2006: 九州工業大学, 情報科学部, 助教授 … More
2002 – 2006: Kyushu Sangyo University, Department of Social Information Systems, Faculty of Information Science, Associate Prof., 情報科学部, 助教授
2003: 九州産業大学, 情報科学部・社会情報システム学科, 助教授
2001: Kyushu Univ., Dept. Comput. Sci. and Commu. Eng., Research Assoc., システム情報科学研究院, 助手
2000 – 2001: 九州大学, 大学院・システム情報科学研究院, 助手
1999: 九州大学, 大学院・システム情報科学研究科, 助手
1998 – 1999: Kyushu Univ., Dept.of Computer Science and Communication Engi-neering, Research, システム情報科学研究科, 助手 Less
Review Section/Research Field
Principal Investigator
Fundamental theory of informatics / Theory of informatics / Basic Section 60010:Theory of informatics-related
Except Principal Investigator
計算機科学 / Science and Engineering / Sections That Are Subject to Joint Review: Basic Section60010:Theory of informatics-related , Basic Section60020:Mathematical informatics-related / Basic Section 60020:Mathematical informatics-related / Basic Section 60010:Theory of informatics-related
Keywords
Principal Investigator
アルゴリズム / 計算複雑さ / 組合せ最適化 / 組合せ最適化問題 / グラフ / 近似 / 組み合わせ最適化 / アルゴリズム理論 / 組み合わせ最適化問題 / 層状ネットワーク … More / オンラインアルゴリズム / 近似アルゴリズム / 直径 / 部分グラフ / 局所演算 / モデル化 / Jankovの定理 / 緩衝帯 / 仕事計画 / 移動動体 / 時間制約 / 移動経路 / NP完全性 / 経路探索 / 巡回経路 / 近似解法 / MAXSNP困難 / NP完全 / ロボット / 移動物体 … More
Except Principal Investigator
分散アルゴリズム / 情報セキュリティ / 暗号 / distributed algorithms / 確率的手法 / ランダムウォーク / アルゴリズム設計 / 計算困難性 / 計算容易性 / 解再構築 / 組合せ最適化問題 / local information / global information / probabilistic methods / stability / Huge distributed systems / ランダムウォー / 自己安定システム / 統計力学的手法 / 局所情報 / 大域情報 / 安定性 / 巨大分散システム / Public-Key Cryptography / Anonymity / Distributed Cryptography / Privacy Protection / Electronic Auction / Electronic Money / Information Security / Cryptography / 公開鍵暗号技術 / 匿名性 / 分散暗号 / プライバシー保護 / 電子入札 / 電子マネー / fast computation / elliptic curve / cryptanalysis / algorithm / public-key encryption / hyperelliptic curve / information security / cryptography / 梗塞演算 / モンゴメリー型 / 高速演算 / 楕円暗号 / 暗号解読 / アルゴリズム / 公開鍵暗号 / 超楕円曲線 / cluster processing / resource allocation problem / agreement problem / searching for intruders / autonomous mobile robots / distributed systems / スケジューリング / 合意問題 / 同期問題 / 計算時間下限 / クラスタ処理 / 資源配置問題 / 合意形成問題 / 侵入者発見問題 / 自律分散ロボット / 分散システム / the marching problem / distributed algorithm / distributed control / mobile robot / 全方向移動ロボット / 協調搬送問題 / 隊列移動問題 / 分散制御 / 群移動ロボット / NP困難性 / L還元可能性 / 近似保証 / MAXSNP困難性 / 回収個数最大化問題 / 計算複雑さ / MAXSNP困難 / 回収個数最適化問題 / 移動物体 / 解精度 / バンプ領域 / 近似アルゴリズム / オフライン計算 / 競合比解析 / オンライン計算 / 競合比 / オフラインモデル / オンラインモデル / 近似不可能性 / 近似可能性 / 最適化モデル / セルラオートマトン / 詰め込み問題 / 発見的アルゴリズム / エネルギー障壁問題 / 分子形態変化 / タイリング / 配列設計 / 分散計算 / 分子計算 Less
  • Research Projects

    (14 results)
  • Research Products

    (167 results)
  • Co-Researchers

    (19 People)
  •  (In)tractability of combinatorial optimization problems under change constraints from solutions

    • Principal Investigator
      宮野 英次
    • Project Period (FY)
      2024 – 2027
    • Research Category
      Grant-in-Aid for Scientific Research (B)
    • Review Section
      Basic Section 60010:Theory of informatics-related
      Basic Section 60020:Mathematical informatics-related
      Sections That Are Subject to Joint Review: Basic Section60010:Theory of informatics-related , Basic Section60020:Mathematical informatics-related
    • Research Institution
      Kyushu Institute of Technology
  •  層状ネットワークにおける段階的な最適化問題に関する研究Principal Investigator

    • Principal Investigator
      朝廣 雄一
    • Project Period (FY)
      2022 – 2026
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Review Section
      Basic Section 60010:Theory of informatics-related
    • Research Institution
      Kyushu Sangyo University
  •  Finding a good structure in a graph with modificationsPrincipal Investigator

    • Principal Investigator
      Asahiro Yuichi
    • Project Period (FY)
      2017 – 2023
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Theory of informatics
    • Research Institution
      Kyushu Sangyo University
  •  Research on combinatorial optimization problems for finding solutions with extended structuresPrincipal Investigator

    • Principal Investigator
      Asahiro Yuichi
    • Project Period (FY)
      2013 – 2016
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Theory of informatics
    • Research Institution
      Kyushu Sangyo University
  •  Global optimization by local optimization with walksPrincipal Investigator

    • Principal Investigator
      ASAHIRO Yuichi
    • Project Period (FY)
      2010 – 2012
    • Research Category
      Grant-in-Aid for Young Scientists (B)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Kyushu Sangyo University
  •  Studies on Job Scheduling Problems using BuffersPrincipal Investigator

    • Principal Investigator
      ASAHIRO Yuichi
    • Project Period (FY)
      2006 – 2008
    • Research Category
      Grant-in-Aid for Young Scientists (B)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Kyushu Sangyo University
  •  変移する要素間の関係を条件とする組合せ最適化モデル

    • Principal Investigator
      MIYANO Eiji
    • Project Period (FY)
      2004 – 2007
    • Research Category
      Grant-in-Aid for Scientific Research on Priority Areas
    • Review Section
      Science and Engineering
    • Research Institution
      Kyushu Institute of Technology
  •  動的に変化する空間内における高品質な経路の探索手法に関する研究Principal Investigator

    • Principal Investigator
      朝廣 雄一
    • Project Period (FY)
      2003 – 2005
    • Research Category
      Grant-in-Aid for Young Scientists (B)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Kyushu Sangyo University
  •  自律的分散型計算としての分子計算

    • Principal Investigator
      YAMASHITA Masafumi
    • Project Period (FY)
      2002 – 2006
    • Research Category
      Grant-in-Aid for Scientific Research on Priority Areas
    • Review Section
      Science and Engineering
    • Research Institution
      Kyushu University
  •  On the Stability of Huge-scale Distributed Systems - the Advent of the Era of Tera

    • Principal Investigator
      YAMASHITA Masafumi
    • Project Period (FY)
      2002 – 2005
    • Research Category
      Grant-in-Aid for Scientific Research (B)
    • Research Field
      計算機科学
    • Research Institution
      KYUSHU UNIVERSITY
  •  Theory of Distributed Cryptography and its application to Electronic Commerce Systems

    • Principal Investigator
      SAKURAI Kouichi
    • Project Period (FY)
      2000 – 2002
    • Research Category
      Grant-in-Aid for Scientific Research (B)
    • Research Field
      計算機科学
    • Research Institution
      KYUSHU UNIVERSITY
  •  Research on public-key cryptosystems from hyperelliptic-curves

    • Principal Investigator
      SAKURAI Kouichi
    • Project Period (FY)
      1999 – 2001
    • Research Category
      Grant-in-Aid for Scientific Research (B)
    • Research Field
      計算機科学
    • Research Institution
      Kyushu University
  •  Algorithm Engineering for Wide Area Distributed Systems

    • Principal Investigator
      YAMASHITA Masafumi
    • Project Period (FY)
      1998 – 2000
    • Research Category
      Grant-in-Aid for Scientific Research on Priority Areas (B)
    • Research Institution
      Kyushu University
  •  The Marching Problem for Autonomous Robots

    • Principal Investigator
      YAMASHITA Masafumi
    • Project Period (FY)
      1997 – 1998
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      計算機科学
    • Research Institution
      KYUSHU UNIVERSITY
      Hiroshima University

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

All Journal Article Presentation

  • [Journal Article] Minimum Algorithm Sizes for Self-stabilizing Gathering and Related Problems of Autonomous Mobile Robots (Extended Abstract)2023

    • Author(s)
      Yuichi Asahiro, Masafumi Yamashita
    • Journal Title

      Proc. 25th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2023), Lecture Notes in Computer Science

      Volume: 14310 Pages: 312-327

    • DOI

      10.1007/978-3-031-44274-2_23

    • ISBN
      9783031442735, 9783031442742
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22K11915, KAKENHI-PROJECT-17K00024
  • [Journal Article] Independent Set Under a Change Constraint from an Initial Solution2023

    • Author(s)
      Yuichi Asahiro, Hiroshi Eto, Kana Korenaga, Guohui Lin, Eiji Miyano, Reo Nonoue
    • Journal Title

      Proc of 13th International Conference on Algorithms and Complexity

      Volume: LNCS 13898 Pages: 37-51

    • DOI

      10.1007/978-3-031-30448-4_4

    • ISBN
      9783031304477, 9783031304484
    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-21K11755, KAKENHI-PROJECT-22K11915, KAKENHI-PROJECT-17K00024
  • [Journal Article] Compatibility of Convergence Algorithms for Autonomous Mobile Robots (Extended Abstract)2023

    • Author(s)
      Yuichi Asahiro, Masafumi Yamashita
    • Journal Title

      Proc. 30th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2023), Lecture Notes in Computer Science

      Volume: 13892 Pages: 149-164

    • DOI

      10.1007/978-3-031-32733-9_8

    • ISBN
      9783031327322, 9783031327339
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22K11915, KAKENHI-PROJECT-17K00024
  • [Journal Article] Approximation Algorithms for the Longest Run Subsequence Problem2023

    • Author(s)
      Yuichi Asahiro, Hiroshi Eto, Mingyang Gong, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Shunichi Tanaka
    • Journal Title

      Proc. 34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023)

      Volume: 2 Pages: 1-12

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00024
  • [Journal Article] Approximation Algorithms for the Longest Run Subsequence Problem2023

    • Author(s)
      Yuichi Asahiro, Hiroshi Eto, Mingyang Gong, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Shunichi Tanaka
    • Journal Title

      Proc. 34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023)

      Volume: 2 Pages: 1-12

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-22K11915
  • [Journal Article] Shortest Longest-Path Graph Orientations2023

    • Author(s)
      Asahiro Yuichi、Jansson Jesper、Melkman Avraham A.、Miyano Eiji、Ono Hirotaka、Xue Quan、Zakov Shay
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 14422 Pages: 141-154

    • DOI

      10.1007/978-3-031-49190-0_10

    • ISBN
      9783031491894, 9783031491900
    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-21K19765, KAKENHI-PROJECT-21K11755, KAKENHI-PROJECT-22K11915, KAKENHI-PROJECT-17K00024
  • [Journal Article] Corrigendum to “Complexity and approximability of the happy set problem” [Theor. Comput. Sci. 866 (2021) 123?144]2023

    • Author(s)
      Asahiro Yuichi、Eto Hiroshi、Hanaka Tesshu、Lin Guohui、Miyano Eiji、Terabaru Ippei
    • Journal Title

      Theoretical Computer Science

      Volume: 975 Pages: 114114-114114

    • DOI

      10.1016/j.tcs.2023.114114

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-21K11755, KAKENHI-PROJECT-22K11915
  • [Journal Article] Monotonic self-stabilization and its application to robust and adaptive pattern formation2022

    • Author(s)
      Yuichi Asahiro, Ichiro Suzuki, Masafumi Yamashita
    • Journal Title

      Theoretical Computer Science

      Volume: 934 Pages: 21-46

    • DOI

      10.1016/j.tcs.2022.08.011

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00024
  • [Journal Article] Upper and lower degree-constrained graph orientation with minimum penalty2022

    • Author(s)
      Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
    • Journal Title

      Theoretical Computer Science

      Volume: 900 Pages: 53-78

    • DOI

      10.1016/j.tcs.2021.11.019

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00024, KAKENHI-PROJECT-21K11755, KAKENHI-PROJECT-21K19765
  • [Journal Article] Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants2022

    • Author(s)
      Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima
    • Journal Title

      Proc. 33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022)

      Volume: -

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-22K11915
  • [Journal Article] Graph orientation with edge modifications2021

    • Author(s)
      Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Sandhya T.P.
    • Journal Title

      International Journal of Foundations of Computer Science

      Volume: 32 Issue: 02 Pages: 209-233

    • DOI

      10.1142/s012905412150012x

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00024, KAKENHI-PROJECT-17K00016, KAKENHI-PLANNED-20H05967, KAKENHI-PROJECT-17H01698
  • [Journal Article] How to pack directed acyclic graphs into small blocks2021

    • Author(s)
      Yuichi Asahiro, Tetsuya Furukawa, Keiichi Ikegami, Eiji Miyano, Tsuyoshi Yagita
    • Journal Title

      Discrete Applied Mathematics

      Volume: 288 Pages: 91-113

    • DOI

      10.1016/j.dam.2020.08.005

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17K00024, KAKENHI-PROJECT-17K00016
  • [Journal Article] Complexity and approximability of the happy set problem2021

    • Author(s)
      Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
    • Journal Title

      Theoretical Computer Science

      Volume: 866 Pages: 123-144

    • DOI

      10.1016/j.tcs.2021.03.023

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K21537, KAKENHI-PROJECT-17K00024, KAKENHI-PROJECT-21K11755
  • [Journal Article] Parameterized algorithms for the Happy Set problem2021

    • Author(s)
      Asahiro Yuichi、Eto Hiroshi、Hanaka Tesshu、Lin Guohui、Miyano Eiji、Terabaru Ippei
    • Journal Title

      Discrete Applied Mathematics

      Volume: 304 Pages: 32-44

    • DOI

      10.1016/j.dam.2021.07.005

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K21537, KAKENHI-PROJECT-17K00024, KAKENHI-PROJECT-21K11755
  • [Journal Article] Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem2020

    • Author(s)
      Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima
    • Journal Title

      Theoretical Computer Science

      Volume: 838 Pages: 238-249

    • DOI

      10.1016/j.tcs.2020.07.042

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00024, KAKENHI-PROJECT-17K00016, KAKENHI-PROJECT-17H01698
  • [Journal Article] Graph orientation with splits2020

    • Author(s)
      Yuichi Asahiro, Jeper Jansson, Eiji Miyano, Hesam Nikpey, Hirotaka Ono
    • Journal Title

      Theoretical Computer Science

      Volume: 844 Pages: 16-25

    • DOI

      10.1016/j.tcs.2020.07.013

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00024, KAKENHI-PROJECT-17K00016, KAKENHI-PROJECT-17H01698
  • [Journal Article] Parameterized Algorithms for the Happy Set Problem2020

    • Author(s)
      Asahiro Yuichi、Eto Hiroshi、Hanaka Tesshu、Lin Guohui、Miyano Eiji、Terabaru Ippei
    • Journal Title

      Proc. 14th International Conference and Workshops on Algorithms and Computation

      Volume: LNCS12049 Pages: 323-328

    • DOI

      10.1007/978-3-030-39881-1_27

    • ISBN
      9783030398804, 9783030398811
    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00016, KAKENHI-PROJECT-17K00024, KAKENHI-PROJECT-19K21537
  • [Journal Article] Graph Classes and Approximability of the Happy Set Problem2020

    • Author(s)
      Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 12273 Pages: 335-346

    • DOI

      10.1007/978-3-030-58150-3_27

    • ISBN
      9783030581497, 9783030581503
    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00024, KAKENHI-PROJECT-19K21537, KAKENHI-PROJECT-17K00016
  • [Journal Article] Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem2019

    • Author(s)
      Asahiro Yuichi、Jansson Jesper、Lin Guohui、Miyano Eiji、Ono Hirotaka、Utashima Tadatoshi
    • Journal Title

      Proc. 13th Annual International Conference on Combinatorial Optimization and Applications

      Volume: LNCS11949 Pages: 1-12

    • DOI

      10.1007/978-3-030-36412-0_1

    • ISBN
      9783030364113, 9783030364120
    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00016, KAKENHI-PROJECT-17K00024, KAKENHI-PROJECT-17H01698
  • [Journal Article] An Approximation Algorithm for the Maximum Induced Matching Problem on C5-Free Regular Graphs2019

    • Author(s)
      Yuichi Asahiro, Guohui Lin, Zhilong Liu, Eiji Miyano
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science

      Volume: E102-A(9) Pages: 1142-1149

    • NAID

      130007699570

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00024
  • [Journal Article] Experimental Evaluation of Approximation and Heuristic Algorithms for Maximum Distance-Bounded Subgraph Problems2019

    • Author(s)
      Asahiro Yuichi、Kubo Tomohiro、Miyano Eiji
    • Journal Title

      The Review of Socionetwork Strategies

      Volume: 13 Issue: 2 Pages: 143-161

    • DOI

      10.1007/s12626-019-00036-2

    • NAID

      120006840104

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-17K00016, KAKENHI-PROJECT-17K00024
  • [Journal Article] Graph Orientation with Edge Modifications2019

    • Author(s)
      Asahiro Yuichi、Jansson Jesper、Miyano Eiji、Ono Hirotaka、T. P. Sandhya
    • Journal Title

      Proc. 13th International Frontiers of Algorithmics Workshop

      Volume: LNCS11458 Pages: 38-50

    • DOI

      10.1007/978-3-030-18126-0_4

    • ISBN
      9783030181253, 9783030181260
    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00016, KAKENHI-PROJECT-17K00024, KAKENHI-PROJECT-17H01698
  • [Journal Article] Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems2018

    • Author(s)
      Yuichi Asahiro, Yuya Doi, Eiji Miyano, Kazuaki Samizo, Hirotaka Shimizu
    • Journal Title

      Algorithmica

      Volume: 80 Issue: 6 Pages: 1834-1856

    • DOI

      10.1007/s00453-017-0344-y

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-17K00024
  • [Journal Article] Graph orientation with splits2018

    • Author(s)
      Yuichi Asahiro, Jeper Jansson, Eiji Miyano, Hesam Nikpey, Hirotaka Ono
    • Journal Title

      Proc. 5th International Symposium on Combinatorial Optimization (ISCO2018), Lecture Notes in Computer Science

      Volume: 10856 Pages: 52-63

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00024
  • [Journal Article] Approximation Algorithms for Packing Directed Acyclic Graphs into Two-Size Blocks2018

    • Author(s)
      Asahiro Yuichi、Miyano Eiji、Yagita Tsuyoshi
    • Journal Title

      Proceedings of ICCSA 2018

      Volume: LNCS10961 Pages: 607-623

    • DOI

      10.1007/978-3-319-95165-2_43

    • ISBN
      9783319951645, 9783319951652
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17K00016, KAKENHI-PROJECT-17K00024
  • [Journal Article] Experimental evaluation of approximation algorithms for maximum distance-bounded subgraph problems2016

    • Author(s)
      Y. Asahiro, T. Kubo, E. Miyano
    • Journal Title

      Proc. Joint 8th International Conference on Soft Computing and Intelligent Systems and 17th International Symposium on Advanced Intelligent Systems

      Volume: - Pages: 892-897

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-25330018
  • [Journal Article] Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation2016

    • Author(s)
      Yuichi Asahiro, Jesper Jansson, Eiji Miyano, and Hirotaka Ono
    • Journal Title

      Theory of Computing Systems

      Volume: 58 Issue: 1 Pages: 60-93

    • DOI

      10.1007/s00224-014-9565-5

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-25330018, KAKENHI-PROJECT-26330017, KAKENHI-PROJECT-26540005, KAKENHI-PLANNED-24106004
  • [Journal Article] Regular induced subgraphs in bipartite and planar graphs2016

    • Author(s)
      Y. Asahiro, H. Eto, T. Ito, E. Miyano
    • Journal Title

      Proc. The 19th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2016)

      Volume: -

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-25330018
  • [Journal Article] An Improvement of the Greedy Algorithm for the (n^2-1)-Puzzle2015

    • Author(s)
      Kaede Utsunomiya and Yuichi Asahiro
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 9156 Pages: 457-473

    • DOI

      10.1007/978-3-319-21407-8_33

    • ISBN
      9783319214061, 9783319214078
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-25330018
  • [Journal Article] Graph Orientations Optimizing the Number of Light or Heavy Vertices2015

    • Author(s)
      Yuichi Asahiro, Jesper Jansson, Eiji Miyano, and Hirotaka Ono
    • Journal Title

      Journal of Graph Algorithms and Applications

      Volume: 19 Issue: 1 Pages: 441-465

    • DOI

      10.7155/jgaa.00371

    • Peer Reviewed / Acknowledgement Compliant / Open Access
    • Data Source
      KAKENHI-PROJECT-25330018, KAKENHI-PROJECT-26330017, KAKENHI-PROJECT-26540005, KAKENHI-PLANNED-24106004
  • [Journal Article] Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems2015

    • Author(s)
      Yuichi Asahiro, Yuya Doi, Eiji Miyano, and Hirotaka Shimizu
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 9486 Pages: 586-600

    • DOI

      10.1007/978-3-319-26626-8_43

    • ISBN
      9783319266251, 9783319266268
    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-25330018, KAKENHI-PROJECT-26330017
  • [Journal Article] Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree2014

    • Author(s)
      Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano
    • Journal Title

      Theoretical Computer Science

      Volume: 550 Pages: 21-35

    • DOI

      10.1016/j.tcs.2014.07.008

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PUBLICLY-25106504, KAKENHI-PROJECT-25330003, KAKENHI-PROJECT-25330018, KAKENHI-PROJECT-26330017
  • [Journal Article] Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation2014

    • Author(s)
      Yuichi Asahiro, Jesper Jansson, Eiji Miyano, and Hirotaka Ono
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 8447 Pages: 24-36

    • DOI

      10.1007/978-3-319-08001-7_3

    • ISBN
      9783319080000, 9783319080017
    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-25330018, KAKENHI-PROJECT-26330017
  • [Journal Article] Optimal approximability of bookmark assignments2013

    • Author(s)
      Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono
    • Journal Title

      Discrete Applied Mathematics

      Volume: 161(16-17) Issue: 16-17 Pages: 2361-2366

    • DOI

      10.1016/j.dam.2013.05.018

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21680001, KAKENHI-PROJECT-23500020, KAKENHI-PLANNED-24106004, KAKENHI-PROJECT-25330018
  • [Journal Article] Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree2013

    • Author(s)
      Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano
    • Journal Title

      Proceedings of the 19th International Symposium on Fundamentals of Computation Theory (FCT2013)

      Volume: 8070 Pages: 28-39

    • DOI

      10.1007/978-3-642-40164-0_6

    • ISBN
      9783642401633, 9783642401640
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500020, KAKENHI-PUBLICLY-25106504, KAKENHI-PROJECT-25330003, KAKENHI-PROJECT-25330018
  • [Journal Article] Inapproximability of Maximum <i>r</i>-Regular Induced Connected Subgraph Problems2013

    • Author(s)
      Yuichi Asahiro, Hiroshi Eto, and EijiMiyano
    • Journal Title

      IEICE Trans. Inf. & Syst.

      Volume: E96.D Issue: 3 Pages: 443-449

    • DOI

      10.1587/transinf.E96.D.443

    • NAID

      10031167429

    • ISSN
      0916-8532, 1745-1361
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22700019, KAKENHI-PROJECT-23500020
  • [Journal Article] NP-hardness of the Sorting Buffer Problem on the Uniform Metric2012

    • Author(s)
      Yuichi Asahiro, Kenichi Kawahara, and Eiji Miyano
    • Journal Title

      Discrete Applied Mathematics

      Volume: Volume 160 Issue: 10-11 Pages: 1453-1464

    • DOI

      10.1016/j.dam.2012.02.005

    • NAID

      110006881039

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22700019, KAKENHI-PROJECT-23500020
  • [Journal Article] Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty2012

    • Author(s)
      Y.Asahiro, J.Jansson, E.Miyano, H.Ono
    • Journal Title

      Proc.Computing : The Australasian Theory Symposium (CATS 2012), Conferences in Research and Practice in Information Technology

      Volume: 128 Pages: 139-146

    • NAID

      120006654963

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22700019
  • [Journal Article] Improved Inapproximability of Maximum r-Regular Induced Connected Subgraph Problems, Proc.2012

    • Author(s)
      Yuichi Asahiro, Hiroshi Eto, and Eiji Miyano
    • Journal Title

      The 15th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2012)

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22700019
  • [Journal Article] Graph Orientations Optimizing the Number of Light or Heavy Vertices2012

    • Author(s)
      Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
    • Journal Title

      ISCO 2012

      Volume: Vol.7422 Pages: 332-343

    • DOI

      10.1007/978-3-642-32147-4_30

    • ISBN
      9783642321467, 9783642321474
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21680001, KAKENHI-PROJECT-22700019
  • [Journal Article] Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty, Proc. Computing: The Australasian Theory Symposium (CATS 2012)2012

    • Author(s)
      Yuichi Asahiro, Jesper Jansson, Eiji Miyano, and Hirotaka Ono
    • Journal Title

      Conferences in Research and Practice in Information Technology

      Volume: Vol.128 Pages: 139-146

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22700019
  • [Journal Article] Inapproximability of Maximum r-Regular Induced Connected Subgraph Problems, Proc.2011

    • Author(s)
      Yuichi Asahiro, Hiroshi Eto, and Eiji Miyano
    • Journal Title

      The 2011 InternationalConference on Foundations of Computer Science (FCS)

      Pages: 102-107

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22700019
  • [Journal Article] Graph Orientation to Maximize the Minimum Weighted Outdegree2011

    • Author(s)
      Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
    • Journal Title

      Int. J. Found. Comput. Sci

      Volume: 22(3) Issue: 03 Pages: 583-601

    • DOI

      10.1142/s0129054111008246

    • NAID

      110007995568

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21680001, KAKENHI-PROJECT-22700019, KAKENHI-PROJECT-23500020
  • [Journal Article] Inapproximability of Maximum r-Regular Induced Connected Subgraph Problems2011

    • Author(s)
      Y.Asahiro, H.Eto, E.Miyano
    • Journal Title

      Proc.The 2011 International Conference on Foundations of Computer Science (FCS)

      Pages: 102-107

    • NAID

      10031167429

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22700019
  • [Journal Article] Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree2011

    • Author(s)
      Yuichi Asahiro, Eiji Miyano, Hirotaka Ono
    • Journal Title

      Discrete Applied Mathematics

      Volume: 159(7) Issue: 7 Pages: 498-508

    • DOI

      10.1016/j.dam.2010.11.003

    • NAID

      120004951590

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21680001, KAKENHI-PROJECT-22700019, KAKENHI-PROJECT-23500020
  • [Journal Article] Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree2011

    • Author(s)
      Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo
    • Journal Title

      J. Comb. Optim

      Volume: 22(1) Issue: 1 Pages: 78-96

    • DOI

      10.1007/s10878-009-9276-z

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21680001, KAKENHI-PROJECT-22700019, KAKENHI-PROJECT-23500020
  • [Journal Article] Competitive Algorithm for Online OVSF Code Assignment with Resource Augmentation, Proc.2011

    • Author(s)
      Yuichi Asahiro, Kenta Kanmera, and Eiji Miyano
    • Journal Title

      17th Annual International Conference on Computing and Combinatorics (COCOON 2011), Lecture Notes in Computer Science

      Volume: Vol.6842 Pages: 259-270

    • DOI

      10.1007/978-3-642-22685-4_24

    • ISBN
      9783642226847, 9783642226854
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22700019
  • [Journal Article] Approximating Maximum Diameter-Bounded Subgraphs2010

    • Author(s)
      Y.Asahiro, E.Miyano, K.Samizo
    • Journal Title

      Proc.The 9th Latin American Theoretical Informatics Symposium, Lecture Notes in Computer Science

      Volume: 6034 Pages: 616-627

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22700019
  • [Journal Article] Approximating Maximum Diameter-Bounded Subgraphs, Proc.2010

    • Author(s)
      Yuichi Asahiro, Eiji Miyano, and Kazuaki Samizo
    • Journal Title

      The9th Latin American Theoretical Informatics Symposium (LATIN), Lecture Notes in Computer Science

      Volume: Vol.6034 Pages: 616-627

    • DOI

      10.1007/978-3-642-12200-2_53

    • ISBN
      9783642121999, 9783642122002
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22700019
  • [Journal Article] Grasp and delivery for moving objects on broken lines2008

    • Author(s)
      Asahiro, Yuichi
    • Journal Title

      Theory of Computing Systems 42

      Pages: 289-305

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16092223
  • [Journal Article] Grasp and Delivery for Moving Objects on Broken Lines2008

    • Author(s)
      Y. Asahiro, E. Miyano and S. Shimoirisa
    • Journal Title

      Theory of Computing Systems Vol. 42

      Pages: 289-305

    • Data Source
      KAKENHI-PROJECT-18700015
  • [Journal Article] Grasp and Delivery for Moving Objects on Broken Lines2008

    • Author(s)
      Y. Asahiro, E. Miyano and S. Shimoirisa
    • Journal Title

      Theory of Computing Systems 42(3)

      Pages: 289-305

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18700015
  • [Journal Article] Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Outdegree2008

    • Author(s)
      Y. Asahiro, E. Miyano, and H. Ono
    • Journal Title

      Proc. Computing: The Australasian Theory Symposium(CATS), Conferences in Research and Practice in Information Technology Vol. 77

      Pages: 97-106

    • Data Source
      KAKENHI-PROJECT-18700015
  • [Journal Article] NP-Hardness of the Sorting Buffer Problem on the Uniform Metric2008

    • Author(s)
      Y. Asahiro, K. Kawahara, and E. Miyano
    • Journal Title

      Proc. The 2008 International Conference on Foundations of Computer Science(FCS)

      Pages: 137-143

    • NAID

      110006881039

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18700015
  • [Journal Article] NP-Hardness of the Sorting Buffer Problem on the Uniform Metric2008

    • Author(s)
      Y. Asahiro, K. Kawahara, and E. Miyano
    • Journal Title

      The 2008International Conference on Foundations of Computer Science(FCS)

      Pages: 137-143

    • NAID

      110006881039

    • Data Source
      KAKENHI-PROJECT-18700015
  • [Journal Article] Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree2008

    • Author(s)
      Asahiro, Yuichi
    • Journal Title

      Conference in Research and Practice in Information Technology 77

      Pages: 97-106

    • NAID

      120004951590

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16092223
  • [Journal Article] A Self-Stabilizing Marching Algorithm for a Group of Oblivious Robots2008

    • Author(s)
      Y. Asahiro, S. Fujita, I. Suzuki, and M. Yamashita
    • Journal Title

      Lecture Notes in Computer Science 5401

      Pages: 125-144

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18700015
  • [Journal Article] A Self-Stabilizing Marching Algorithm for a Group of Oblivious Robots2008

    • Author(s)
      Y. Asahiro, S. Fujita, I. Suzuki, and M. Yamashita
    • Journal Title

      The 12th International Conference on Principles of Distributed Systems (OPODIS),Lecture Notes in Computer Science Vol. 5401

      Pages: 125-144

    • Data Source
      KAKENHI-PROJECT-18700015
  • [Journal Article] Graph Orientation Algorithms to Minimize the Maximum Outdegree2007

    • Author(s)
      Y. Asahiro, E. Miyano, H. Ono, and K. Zenmyo
    • Journal Title

      International Journal of Foundations of Computer Science Vol. 18, No. 2

      Pages: 197-215

    • NAID

      120001364333

    • Data Source
      KAKENHI-PROJECT-18700015
  • [Journal Article] On approximation of bookmark assignments2007

    • Author(s)
      Asahiro, Yuichi
    • Journal Title

      Lecture Notes in Computer Science 4708

      Pages: 115-124

    • NAID

      120006654477

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16092223
  • [Journal Article] Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles2007

    • Author(s)
      Asahiro, Yuichi
    • Journal Title

      Proceedings of the 33^<rd> Conference on Current Trends in Theory and Practice of Informatics, Lecture Notes in Computer Science 4362

      Pages: 272-283

    • NAID

      110006163295

    • Data Source
      KAKENHI-PROJECT-16092223
  • [Journal Article] On Approximation of Bookmark Assignments2007

    • Author(s)
      Y. Asahiro, E. Miyano, T.Murata, H. Ono
    • Journal Title

      Lecture Notes in Computer Science 4708

      Pages: 97-106

    • NAID

      120006654477

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18700015
  • [Journal Article] 移動物体回収問題2007

    • Author(s)
      朝廣, 雄一
    • Journal Title

      電子情報通信学会誌 90・3

      Pages: 245-247

    • NAID

      110006240366

    • Data Source
      KAKENHI-PROJECT-16092223
  • [Journal Article] Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree2007

    • Author(s)
      Asahiro, Yuichi
    • Journal Title

      Lecture Notes in Computer Science 4508

      Pages: 167-177

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16092223
  • [Journal Article] Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree2007

    • Author(s)
      Y. Asahiro, J. Jansson, E. Miyano, H. Ono, K. Zenmyo
    • Journal Title

      Lecture Notes in Computer Science 4508

      Pages: 167-177

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18700015
  • [Journal Article] Graph orientation algorithms to minimize the maximum outdegree2007

    • Author(s)
      Asahiro, Yuichi
    • Journal Title

      International Journal of Foundation of Computer Science 18

      Pages: 197-215

    • NAID

      120001364333

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16092223
  • [Journal Article] Graph Orientation Algorithms to Minimize the Maximum Out degree2007

    • Author(s)
      Y. Asahiro, E. Miyano, H.Ono, K. Zenmyo
    • Journal Title

      International Journal of Foundations of Computer Science 18(2)

      Pages: 197-215

    • NAID

      120001364333

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18700015
  • [Journal Article] Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree2007

    • Author(s)
      Y. Asahiro, J. Jansson, E. Miyano, H. Ono, and K. Zenmyo
    • Journal Title

      Proc. 3rd International Conference on Algorithmic Aspects in Information and Management (AAIM), Lecture Notes in Computer Science Vol. 4508

      Pages: 167-177

    • Data Source
      KAKENHI-PROJECT-18700015
  • [Journal Article] On Approximation of Bookmark Assignments2007

    • Author(s)
      Y. Asahiro, E. Miyano, T. Murata, and H. Ono
    • Journal Title

      Proc. 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS), Lecture Notes in Computer Science Vol. 4708

      Pages: 115-124

    • NAID

      120006654477

    • Data Source
      KAKENHI-PROJECT-18700015
  • [Journal Article] How to Pack Directed Acyclic Graphs into Small Blocks2006

    • Author(s)
      Asahiro, Yuichi
    • Journal Title

      Proceedings of the 6^<th> International Conference on Algorithms and Complexity, Lecture Notes in Computer Science 3998

      Pages: 272-283

    • Data Source
      KAKENHI-PROJECT-16092223
  • [Journal Article] サイズ3の最小ブロック転送問題の近似困難性2006

    • Author(s)
      朝廣雄一, 他
    • Journal Title

      電気関係学会九州支部連合大会講演論文集 (CDROM)

    • NAID

      130004608674

    • Data Source
      KAKENHI-PROJECT-18700015
  • [Journal Article] How to Collect Balls Moving in the Euclidean Plane2006

    • Author(s)
      Y.Asahiro, et al.
    • Journal Title

      Discrete Applied Mathematics 154・16

      Pages: 2247-2262

    • Data Source
      KAKENHI-PROJECT-18700015
  • [Journal Article] How to pack directed acyclic graphs into small blocks2006

    • Author(s)
      Y.Asahiro, T.Furukawa, K.Ikegami, E.Miyano
    • Journal Title

      Proc. 6th International Conference on Algorithms and Compl exity(CIAC 2006), Lecture Notes in Computer Science 3998

      Pages: 272-283

    • Data Source
      KAKENHI-PROJECT-14085204
  • [Journal Article] Graph orientation algorithms to minimize the maximum outdegree2006

    • Author(s)
      Y.Asahiro, E.Miyano, H.Ono, K.Zenmyo
    • Journal Title

      Proc.Computing : The Australasian Theory Symposium (CATS), Conferences in Research and Practice in Information Technology 151

      Pages: 11-20

    • NAID

      120001364333

    • Data Source
      KAKENHI-PROJECT-15700021
  • [Journal Article] How to Collect Balls Moving in the Euclidean Plane2006

    • Author(s)
      Asahiro, Yuichi
    • Journal Title

      Discrete Applied Mathematics 154・16

      Pages: 2247-2262

    • Data Source
      KAKENHI-PROJECT-16092223
  • [Journal Article] Approximability and Non-approximability of the Minimum Block Transfer Problem2006

    • Author(s)
      Asahiro, Yuichi
    • Journal Title

      電子情報通信学会技術報告 105・679

      Pages: 17-24

    • NAID

      110004680201

    • Data Source
      KAKENHI-PROJECT-16092223
  • [Journal Article] サイクルグラフ上での地図作成問題に対する重み付き最近傍アルゴリズム2006

    • Author(s)
      朝廣雄一, 他
    • Journal Title

      電子情報通信学会技術研究報告 106・405

      Pages: 15-22

    • NAID

      110006163295

    • Data Source
      KAKENHI-PROJECT-18700015
  • [Journal Article] サイズ3の最小ブロック転送問題の近似困難性2006

    • Author(s)
      朝廣雄一, 古川哲也, 池上佳一, 宮野英次
    • Journal Title

      電気関係学会九州支部連合大会,予稿集 (CDROM)

    • NAID

      130004608674

    • Data Source
      KAKENHI-PROJECT-14085204
  • [Journal Article] How to Collect Balls Moving in the Euclidean Plane2006

    • Author(s)
      Y. Asahiro, T. Horiyama, K. Makino, H. Ono, T. Sakuma, and M. Yamashita
    • Journal Title

      Discrete Applied Mathematics Vol. 154, No. 16

      Pages: 2247-2262

    • Data Source
      KAKENHI-PROJECT-18700015
  • [Journal Article] How to pack directed acyclic graphs into small blocks2006

    • Author(s)
      Y.Asahiro, et al.
    • Journal Title

      Lecture Notes in Computer Science 3998

      Pages: 272-283

    • Data Source
      KAKENHI-PROJECT-18700015
  • [Journal Article] K-Collect Tours for Moving Objects with Release Times and Deadlines2005

    • Author(s)
      Y.Asahiro, E.Miyano, S.Shimoirisa
    • Journal Title

      Proc.9th World Multi-Conference on Systemics, Cybernetics and Informatics III

      Pages: 192-197

    • Data Source
      KAKENHI-PROJECT-15700021
  • [Journal Article] Simple Greedy Methods for DNA Word Design2005

    • Author(s)
      Asahiro, Yuichi
    • Journal Title

      Proceedings of the 9^<th> World Multi-Conference on Systems, Cybernetics and Informatics Vol.III

      Pages: 186-191

    • Data Source
      KAKENHI-PROJECT-16092223
  • [Journal Article] Pickup and Delivery for Moving Objects on Broken Lines2005

    • Author(s)
      Y.Asahiro, E.Miyano, S.Shimoirisa
    • Journal Title

      Proc.9th Italian Conference on Theoretical Computer Science, Lecture Notes in Computer Science 3701

      Pages: 36-50

    • Data Source
      KAKENHI-PROJECT-15700021
  • [Journal Article] Simple Greedy Methods for DNA Word Design2005

    • Author(s)
      Y.Asahiro
    • Journal Title

      Proc.SCI 2005 (印刷中)

    • Data Source
      KAKENHI-PROJECT-14085204
  • [Journal Article] k-Collect Tours for Moving Objects with Release Times and Deadlines2005

    • Author(s)
      Asahiro, Yuichi
    • Journal Title

      Proc of 9^<th> World Multi-Conference on Systemics, Cybernetics and Informatics (発表予定)

    • Data Source
      KAKENHI-PROJECT-16092223
  • [Journal Article] Hardness of Pickup and Delivery for Moving Objects on Broken Lines2005

    • Author(s)
      Asahiro, Yuichi
    • Journal Title

      電子情報通信学会技術報告 105・72

      Pages: 9-16

    • NAID

      110003206459

    • Data Source
      KAKENHI-PROJECT-16092223
  • [Journal Article] Simple Greedy Methods for DNA Word Design2005

    • Author(s)
      Y.Asahiro
    • Journal Title

      Multi-Conference on Systemics, Cybernetics and Informatics, 11

      Pages: 181-191

    • Data Source
      KAKENHI-PROJECT-14085204
  • [Journal Article] Collect Tours for Moving Objects with Release Times and Deadlines2005

    • Author(s)
      Asahiro, Yuichi
    • Journal Title

      電子情報通信学会技術研究報告 104・743

      Pages: 79-85

    • NAID

      10015530723

    • Data Source
      KAKENHI-PROJECT-16092223
  • [Journal Article] K-Collect Tours for Moving Objects with Release Times and Deadlines2005

    • Author(s)
      Y.Asahiro, E.Miyano, S.Shimoirisa
    • Journal Title

      Proc. Systemics, Cybernetics, and Informatics 2005 (to appear)

    • Data Source
      KAKENHI-PROJECT-15700021
  • [Journal Article] Pickup and Delivery for Moving Objects on Broken Lines2005

    • Author(s)
      Asahiro, Yuichi
    • Journal Title

      Proceedings of the 9^<th> Italian Conference on Theoretical Computer Science, Lecture Notes in Computer Science 3701

      Pages: 36-50

    • Data Source
      KAKENHI-PROJECT-16092223
  • [Journal Article] k-Collect Tours for Moving Objects with Release Times and Deadlines2005

    • Author(s)
      Asahiro, Yuichi
    • Journal Title

      Proceedings of the 9^<th> World Multi-Conference on Systems, Cybernetics and Informatics Vol.III

      Pages: 192-197

    • Data Source
      KAKENHI-PROJECT-16092223
  • [Journal Article] Collect Tours for Moving Objects with Release Times and Deadlines2005

    • Author(s)
      Yuichi Asahiro, Eiji Miyano, Shinichi Shimoirisa
    • Journal Title

      電子情報通信学会技術研究報告 104・743

      Pages: 79-85

    • NAID

      10015530723

    • Data Source
      KAKENHI-PROJECT-15700021
  • [Journal Article] 移動系における最大個数巡回アルゴリズム2004

    • Author(s)
      下入佐真一, 朝廣雄一, 宮野英次
    • Journal Title

      数理解析研究所講究録 1325

      Pages: 15-20

    • Data Source
      KAKENHI-PROJECT-15700021
  • [Journal Article] 作業時間制約付き移動物体回収問題のNP困難性2004

    • Author(s)
      下入佐真一, 朝廣雄一, 宮野英次
    • Journal Title

      作業時間制約付き移動物体回収問題のNP困難性 12-1A-01

    • NAID

      130004607706

    • Data Source
      KAKENHI-PROJECT-15700021
  • [Journal Article] How to Collect Balls Moving in the Euclidean Plane

    • Author(s)
      Y.Asahiro, T.Horiyama, K.Makino, H.Ono, T.Sakuma, M.Yamashita
    • Journal Title

      Discrete Applied Mathematics (to appear)

    • Data Source
      KAKENHI-PROJECT-15700021
  • [Journal Article] How to pack directed acyclic graphs into small blocks

    • Author(s)
      Y.Asahiro, T.Furukawa, K.Ikegami, E.Miyano
    • Journal Title

      Proc.6th International Conference on Algorithms and Complexity, Lecture Notes in Computer Science, (to appear)

    • Data Source
      KAKENHI-PROJECT-15700021
  • [Journal Article] Grasp and Delivery for Moving Objects on Broken Lines

    • Author(s)
      Y.Asahiro, et al.
    • Journal Title

      Theory of Computing Systems (to appear)

    • Data Source
      KAKENHI-PROJECT-18700015
  • [Presentation] 最長ラン部分文字列問題に対する近似アルゴリズム2023

    • Author(s)
      朝廣 雄一,江藤 宏,Mingyang Gong, Jesper Jansson,Guohui Lin, 宮野 英次,小野 廣隆,田中 駿一
    • Organizer
      情報処理学会アルゴリズム研究会
    • Data Source
      KAKENHI-PROJECT-22K11915
  • [Presentation] 変更制約付き最大独立集合問題2023

    • Author(s)
      朝廣 雄一,江藤 宏,是永 華奈,Guohui Lin, 宮野 英次,野々上 礼央
    • Organizer
      情報処理学会アルゴリズム研究会
    • Data Source
      KAKENHI-PROJECT-22K11915
  • [Presentation] 移動ロボット群による質関数が単調減少する隊列形成アルゴリズム2023

    • Author(s)
      朝廣 雄一,鈴木 一郎,山下 雅史
    • Organizer
      情報処理学会アルゴリズム研究会
    • Data Source
      KAKENHI-PROJECT-17K00024
  • [Presentation] 変更制約付き最大独立集合問題2023

    • Author(s)
      朝廣 雄一,江藤 宏,是永 華奈,Guohui Lin, 宮野 英次,野々上 礼央
    • Organizer
      情報処理学会アルゴリズム研究会
    • Data Source
      KAKENHI-PROJECT-17K00024
  • [Presentation] 移動ロボット群による質関数が単調減少する隊列形成アルゴリズム2023

    • Author(s)
      朝廣 雄一,鈴木 一郎,山下 雅史
    • Organizer
      情報処理学会アルゴリズム研究会
    • Data Source
      KAKENHI-PROJECT-22K11915
  • [Presentation] 最長ラン部分文字列問題に対する近似アルゴリズム2023

    • Author(s)
      朝廣 雄一,江藤 宏,Mingyang Gong, Jesper Jansson,Guohui Lin, 宮野 英次,小野 廣隆,田中 駿一
    • Organizer
      情報処理学会アルゴリズム研究会
    • Data Source
      KAKENHI-PROJECT-17K00024
  • [Presentation] 最長共通部分列関連問題の多項式時間同値性2022

    • Author(s)
      歌島侃勇, 朝廣雄一, ジャンソンジェスパー, リングオフイ, 宮野英次, 小野廣隆
    • Organizer
      2021年度冬のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-17K00024
  • [Presentation] 重複なし最長共通部分列に関する全列挙法を用いた評価2022

    • Author(s)
      戴銘紳, 朝廣雄一, 宮野英次
    • Organizer
      2022年度 電気・情報関係学会九州支部連合大会(第75回連合大会)
    • Data Source
      KAKENHI-PROJECT-22K11915
  • [Presentation] 最長共通部分列問題の多項式時間同値性と厳密アルゴリズム2021

    • Author(s)
      歌島侃勇, 朝廣雄一, Jesper Jansson, Guohui Lin, 宮野英次, 小野廣隆
    • Organizer
      九州地区における若手OR研究交流会
    • Data Source
      KAKENHI-PROJECT-17K00024
  • [Presentation] 出現数を限定した最長共通部分列問題の困難性2020

    • Author(s)
      歌島侃勇,朝廣雄一,Jesper Jansson,Guohui Lin,宮野英次,小野廣隆
    • Organizer
      2020年度 電気・情報関係学会九州支部連合大会(第73回連合大会)
    • Data Source
      KAKENHI-PROJECT-17K00024
  • [Presentation] グラフクラスに対するハッピー集合問題2020

    • Author(s)
      寺原一平,朝廣雄一,江藤宏,土中哲秀,Guohui Lin,宮野英次
    • Organizer
      2020年度 電気・情報関係学会九州支部連合大会(第73回連合大会)
    • Data Source
      KAKENHI-PROJECT-17K00024
  • [Presentation] 最大ハッピー集合問題に対する近似アルゴリズム2020

    • Author(s)
      朝廣雄一,江藤宏,土中哲秀,リングオフイ,宮野英次,寺原一平
    • Organizer
      電子情報通信学学会コンピューテーション研究会
    • Data Source
      KAKENHI-PROJECT-17K00024
  • [Presentation] 重複無し最長共通部分列問題の厳密アルゴリズム2020

    • Author(s)
      歌島侃勇, 朝廣雄一, ジャンソンジェスパー, リングオフイ, 宮野英次, 小野廣隆
    • Organizer
      2019年度冬のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-17K00024
  • [Presentation] 重複無し最長共通部分列問題に対する指数計算時間の上界2019

    • Author(s)
      歌島侃勇,朝廣雄一,ジャンソンジェスパー,リングオフィ,宮野英次,小野廣隆
    • Organizer
      2019年度 電気・情報関係学会九州支部連合大会(第72回連合大会)
    • Data Source
      KAKENHI-PROJECT-17K00024
  • [Presentation] 辺の追加と削除を伴うグラフ有向化問題2019

    • Author(s)
      朝廣雄一, ジャンソンジェスパー, 宮野英次, 小野廣隆, T.P. サディヤ
    • Organizer
      情報処理学会アルゴリズム研究会
    • Data Source
      KAKENHI-PROJECT-17K00024
  • [Presentation] On the approximability of the maximum induced matching problem on regular graphs2019

    • Author(s)
      Yuichi Asahiro, Guohui Lin, Zhilong Liu, and Eiji Miyano
    • Organizer
      The 12th Annual Meeting of the Asian Association for Algorithms and Computation
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00024
  • [Presentation] 最小ブロック転送問題について2018

    • Author(s)
      八木田剛,朝廣雄一,宮野英次
    • Organizer
      2017年度冬のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-17K00024
  • [Presentation] 有向非巡回グラフ分割問題の近似(不)可能性2018

    • Author(s)
      八木田 剛,朝廣 雄一,宮野 英次
    • Organizer
      電子情報通信学会 コンピューテーション研究会
    • Data Source
      KAKENHI-PROJECT-17K00024
  • [Presentation] 頂点分割を伴うグラフ有向化問題2018

    • Author(s)
      朝廣 雄一,ジャンソン ジェスパー,宮野 英次,ニクパイ ヘサム,小野 廣隆
    • Organizer
      情報処理学会アルゴリズム研究会
    • Data Source
      KAKENHI-PROJECT-17K00024
  • [Presentation] アクセス制限付きバッファをもつ再整列問題の計算困難性2017

    • Author(s)
      有木正, 朝廣雄一, 宮野英次
    • Organizer
      火の国情報シンポジウム2017
    • Place of Presentation
      鹿児島大学(鹿児島県鹿児島市)
    • Year and Date
      2017-03-01
    • Data Source
      KAKENHI-PROJECT-25330018
  • [Presentation] Approximation Algorithms for the Minimum Block Transfer Problem2017

    • Author(s)
      Yuichi Asahiro, Eiji Miyano and Tsuyoshi Yagita
    • Organizer
      The 10th Annual Meeting of Asian Association for Algorithms and Computation
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00024
  • [Presentation] 最小ブロック転送問題に対する(2-ε)近似アルゴリズム2017

    • Author(s)
      八木田剛, 朝廣雄一, 宮野英次
    • Organizer
      火の国情報シンポジウム2017
    • Place of Presentation
      鹿児島大学(鹿児島県鹿児島市)
    • Year and Date
      2017-03-01
    • Data Source
      KAKENHI-PROJECT-25330018
  • [Presentation] 距離限定部分グラフ探索問題に対する近似アルゴリズム2016

    • Author(s)
      朝廣雄一,土井悠也,志水宏宇,宮野英次
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      石川県教育会館(石川県金沢市)
    • Year and Date
      2016-06-24
    • Data Source
      KAKENHI-PROJECT-25330018
  • [Presentation] Approximation Algorithms to Find Maximum Distance-Bounded Subgraphs2016

    • Author(s)
      Yuichi Asahiro, Yuya Doi, Eiji Miyano, Hirotaka Shimizu
    • Organizer
      The 9th Annual Meeting of Asian Association for Algorithms and Computation
    • Place of Presentation
      Taipei, Taiwan
    • Year and Date
      2016-05-14
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-25330018
  • [Presentation] 高さを限定したDAGに対する最小ブロック転送問題2016

    • Author(s)
      朝廣雄一,八木田剛,宮野英次
    • Organizer
      平成28年度OR学会九州支部・若手OR交流会
    • Place of Presentation
      福岡工業大学(福岡県福岡市)
    • Year and Date
      2016-10-29
    • Data Source
      KAKENHI-PROJECT-25330018
  • [Presentation] ランダムグラフと平面グラフにおける直径限定部分グラフの探索2016

    • Author(s)
      朝廣雄一,久保智洸,宮野英次
    • Organizer
      平成28年度OR学会九州支部・若手OR交流会
    • Place of Presentation
      福岡工業大学(福岡県福岡市)
    • Year and Date
      2016-10-29
    • Data Source
      KAKENHI-PROJECT-25330018
  • [Presentation] A Self-stabilizing Algorithm for Robust and Adaptive Marching2015

    • Author(s)
      Yuichi Asahiro, Ichiro Suzuki, Masafumi Yamashita
    • Organizer
      Workshop on Distributed Robotic Swarms
    • Place of Presentation
      アルカディア市ヶ谷,東京都
    • Year and Date
      2015-10-05
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-25330018
  • [Presentation] 最小ブロック転送問題に対する近似アルゴリズムの改善について2015

    • Author(s)
      八木田剛,朝廣雄一,宮野英次
    • Organizer
      情報処理学会九州支部2015年度若手の会セミナー
    • Place of Presentation
      休暇村「志賀島」,福岡市
    • Year and Date
      2015-09-14
    • Data Source
      KAKENHI-PROJECT-25330018
  • [Presentation] ランダムグラフにおける直径限定部分グラフの最大サイズ2015

    • Author(s)
      朝廣雄一,土井悠也,宮野英次
    • Organizer
      日本オペレーションズ・リサーチ学会2015年秋季研究発表会
    • Place of Presentation
      九州工業大学,北九州市
    • Year and Date
      2015-09-09
    • Data Source
      KAKENHI-PROJECT-25330018
  • [Presentation] 次数制約のあるグラフ有向化問題の近似について2013

    • Author(s)
      朝廣雄一,ジェスパージャンソン,宮野英次,小野廣隆
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      沖縄産業支援センター
    • Data Source
      KAKENHI-PROJECT-25330018
  • [Presentation] 部分グラフクラスに対する最大dクラン問題2013

    • Author(s)
      土井悠也,朝廣雄一,宮野英次,志水宏宇
    • Organizer
      電気関係学会九州支部連合大会論文集
    • Place of Presentation
      熊本大学
    • Data Source
      KAKENHI-PROJECT-25330018
  • [Presentation] Maximum Diameter-Bounded Subgraphs in Intersection Graphs2013

    • Author(s)
      Yuichi Asahiro, Yuya Doi, Eiji Miyano, and Hirotaka Shimizu
    • Organizer
      Proc. The 16th Korea-Japan Joint Workshop on Algorithms and Computation (WAAC 2013)
    • Place of Presentation
      鳥取環境大学
    • Data Source
      KAKENHI-PROJECT-25330018
  • [Presentation] Maximum Diameter-Bounded Subgraphs in Graphs without Long Induced Cycles2013

    • Author(s)
      Yuichi Asahiro, Yuya Doi, Eiji Miyano, and Hirotaka Shimizu
    • Organizer
      The 6th Annual Meeting of Asian Association for Algorithms and Computation (AAAC2013)
    • Place of Presentation
      Matsushima, Japan
    • Data Source
      KAKENHI-PROJECT-25330018
  • [Presentation] 弦グラフにおける直径限定部分グラフ最大化問題2013

    • Author(s)
      朝廣雄一,土井悠也,宮野英次,志水宏宇
    • Organizer
      火の国情報シンポジウム2013
    • Place of Presentation
      熊本大学
    • Data Source
      KAKENHI-PROJECT-22700019
  • [Presentation] 複数バッファによる整列問題2013

    • Author(s)
      竹田圭佑,朝廣雄一,宮野英次
    • Organizer
      電気関係学会九州支部連合大会論文集
    • Place of Presentation
      Kyonggi University, Suwon, Korea
    • Data Source
      KAKENHI-PROJECT-25330018
  • [Presentation] W[1]-Hardness of Regular Induced Connected Subgraph Problems2012

    • Author(s)
      Yuichi Asahiro, Hiroshi Eto, and Eiji Miyano
    • Organizer
      Fifth Asian Association for Algorithms and Computation Annual Meeting (AAAC12)
    • Place of Presentation
      Fudan University, Shanghai, China
    • Data Source
      KAKENHI-PROJECT-22700019
  • [Presentation] 次数を限定した平面グラフにおける誘導部分グラフ探索問題2012

    • Author(s)
      江藤宏, 朝廣雄一, 伊藤健洋, 宮野英次
    • Organizer
      日本OR学会九州支部第3回九州地区における若手OR研究交流会
    • Place of Presentation
      北九州市立大学後援会館
    • Data Source
      KAKENHI-PROJECT-22700019
  • [Presentation] 次数を限定した誘導部分グラフ探索問題2012

    • Author(s)
      江藤宏, 朝廣雄一,伊藤健洋,宮野英次
    • Organizer
      2012年度夏のLAシンポジウム
    • Place of Presentation
      宮津ロイヤルホテル
    • Data Source
      KAKENHI-PROJECT-22700019
  • [Presentation] Improved Inapproximability of Maximum r-Regular Induced Connected Subgraph Problems2012

    • Author(s)
      Yuichi Asahiro, Hiroshi Eto, and Eiji Miyano
    • Organizer
      The 15th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2012)
    • Place of Presentation
      National Institute of Informatics
    • Data Source
      KAKENHI-PROJECT-22700019
  • [Presentation] 資源増加を許したOVSF符号割当問題に対する2競合アルゴリズム2011

    • Author(s)
      朝廣雄一, 上米良謙太, 宮野英次
    • Organizer
      情報処理学会 アルゴリズム研究会
    • Place of Presentation
      琉球大学
    • Year and Date
      2011-03-07
    • Data Source
      KAKENHI-PROJECT-22700019
  • [Presentation] 資源増加を許したOVSF符号割当問題に対する2競合アルゴリズム2011

    • Author(s)
      朝廣雄一
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      琉球大
    • Year and Date
      2011-03-07
    • Data Source
      KAKENHI-PROJECT-22700019
  • [Presentation] Minimizing Penalty on Upper and Lower Degree Constrained Graph Orientation2011

    • Author(s)
      Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
    • Organizer
      電子情報通信学会コンピューテーション研究会
    • Place of Presentation
      名古屋大(愛知県)
    • Year and Date
      2011-12-16
    • Data Source
      KAKENHI-PROJECT-22700019
  • [Presentation] 2-Competitive Algorithm for Online OVSF Code Assignment with Small Resource Augmentation2011

    • Author(s)
      Yuichi Asahiro
    • Organizer
      The 4th Annual Meeting of Asian Association for Algorithms and Computation
    • Place of Presentation
      National Tsing Hua University, Taiwan
    • Data Source
      KAKENHI-PROJECT-22700019
  • [Presentation] 資源増加を許したOVSF符号割当問題に対する(1+ε)-競合アルゴリズム2011

    • Author(s)
      朝廣雄一
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      山口大
    • Year and Date
      2011-11-18
    • Data Source
      KAKENHI-PROJECT-22700019
  • [Presentation] 2-Competitive Algorithm for Online OVSF Code Assignment with Small Resource Augmentation2011

    • Author(s)
      Yuichi Asahiro, Kenta Kanmera, Eiji Miyano
    • Organizer
      The 4th Annual Meeting of Asian Association for Algorithms and Computation
    • Place of Presentation
      National Tsing Hua University (Hsinchu, Taiwan)
    • Year and Date
      2011-04-17
    • Data Source
      KAKENHI-PROJECT-22700019
  • [Presentation] 頂点数を最大とする正則誘導連結部分グラフ問題の計算複雑さ2011

    • Author(s)
      朝廣雄一, 江藤宏, 宮野英次
    • Organizer
      電子情報通信学会コンピューテーション研究会
    • Place of Presentation
      広島大学(広島県)
    • Year and Date
      2011-06-30
    • Data Source
      KAKENHI-PROJECT-22700019
  • [Presentation] 最大正則連結部分グラフ問題のパラメータ化計算量2011

    • Author(s)
      江藤宏, 朝廣雄一, 宮野英次
    • Organizer
      電子情報通信学会九州支部学生会講演会
    • Place of Presentation
      佐賀大学(佐賀県)
    • Year and Date
      2011-09-06
    • Data Source
      KAKENHI-PROJECT-22700019
  • [Presentation] 資源増加を許したOVSF符号割当問題に対する(1+ε)競合アルゴリズム2011

    • Author(s)
      朝廣雄一, 上米良謙太, 宮野英次
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      山口大学(山口県)
    • Year and Date
      2011-11-18
    • Data Source
      KAKENHI-PROJECT-22700019
  • [Presentation] オンラインOVSF符号割当問題のリソースと競合比2010

    • Author(s)
      上米良謙太, 朝廣雄一, 宮野英次
    • Organizer
      電子情報通信学会九州支部学生会講演会
    • Place of Presentation
      福岡工業大学
    • Year and Date
      2010-09-24
    • Data Source
      KAKENHI-PROJECT-22700019
  • [Presentation] 直径d部分グラフ最大化問題の計算複雑さ2009

    • Author(s)
      三溝和明,宮野英次,朝廣雄一
    • Organizer
      情報処理学会アルゴリズム研究会
    • Data Source
      KAKENHI-PROJECT-18700015
  • [Presentation] NP-Hardness of the Sorting Buffer Problem on the Uniform Metric2008

    • Author(s)
      Yuichi Asahiro, Kenichi Kawahara and Eiji Miyano
    • Organizer
      Proc. The First AAAC Annual Meeting
    • Data Source
      KAKENHI-PROJECT-18700015
  • [Presentation] リテラル出現数限定2CNF等価項除去問題に対する近似困難性2008

    • Author(s)
      中村拓,朝廣雄一,宮野英次
    • Organizer
      電気関係学会九州支部連合大会論文集
    • Data Source
      KAKENHI-PROJECT-18700015
  • [Presentation] 一様メトリックにおけるソーティングバッファ問題のNP困難性2008

    • Author(s)
      朝廣雄一,河原憲一,宮野英次
    • Organizer
      電子情報通信学会技術研究報告
    • Data Source
      KAKENHI-PROJECT-18700015
  • [Presentation] 最大出次数最小化問題の各種グラフクラスに対する計算複雑さ2008

    • Author(s)
      朝廣, 雄一
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      北九州学術研究都市(福岡県)
    • Year and Date
      2008-03-07
    • Data Source
      KAKENHI-PROJECT-16092223
  • [Presentation] 最大出次数最小化問題の各種グラフクラスに対する計算複雑さ2008

    • Author(s)
      朝廣雄一,小野廣隆,宮野英次
    • Organizer
      情報処理学会研究報告
    • Data Source
      KAKENHI-PROJECT-18700015
  • [Presentation] 一様メトリックにおけるソーティングバッファ問題のNP困難性2008

    • Author(s)
      朝廣雄一, 河原憲一, 宮野英次
    • Organizer
      電子情報通信学会技術研究報告
    • Place of Presentation
      九州産業大
    • Year and Date
      2008-05-13
    • Data Source
      KAKENHI-PROJECT-18700015
  • [Presentation] Note on approximation of 1-regular 2-color paintshop problem2007

    • Author(s)
      朝廣, 雄一
    • Organizer
      INFORMS Annual Meeting
    • Place of Presentation
      Washington State Convention & Trade Center(米国ワシントン州シアトル)
    • Year and Date
      2007-11-04
    • Data Source
      KAKENHI-PROJECT-16092223
  • [Presentation] ブックマーク問題の近似について2007

    • Author(s)
      朝廣, 雄一
    • Organizer
      電子情報通信学会技術研究報告
    • Place of Presentation
      九州大学伊都キャンパス(福岡県)
    • Year and Date
      2007-05-25
    • Data Source
      KAKENHI-PROJECT-16092223
  • [Presentation] 2色限定ペイントショップ問題に対する貪欲法と近似解法2007

    • Author(s)
      中村拓,朝廣雄一,宮野英次
    • Organizer
      2色限定ペイントショップ問題に対する貪欲法と近似解法
    • Data Source
      KAKENHI-PROJECT-18700015
  • [Presentation] ブックマーク問題の近似について2007

    • Author(s)
      朝廣雄一,宮野英次,小野廣隆,村田俊英
    • Organizer
      電子情報通信学会技術研究報告
    • Data Source
      KAKENHI-PROJECT-18700015
  • [Presentation] オンラインソーティングバッファに対するFIFOアルゴリズム2007

    • Author(s)
      河原憲一,朝廣雄一,宮野英次
    • Organizer
      電気関係学会九州支部連合大会論文集
    • Data Source
      KAKENHI-PROJECT-18700015
  • [Presentation] Note on Approximation of 1-Regular 2-Color Paintshop Problem Proc2007

    • Author(s)
      Yuichi Asahiro, Eiji Miyano and Taku Nakamura
    • Organizer
      Note on Approximation of 1-Regular 2-Color Paintshop Problem Proc
    • Data Source
      KAKENHI-PROJECT-18700015
  • [Presentation] Note on Approximation of 1-Regular 2-Color Paintshop Problem2007

    • Author(s)
      Yuichi Asahiro, Eiji Miyano, Taku Nakamura
    • Organizer
      INFORMS Annual Meeting
    • Place of Presentation
      シアトル(アメリカ)
    • Year and Date
      2007-11-03
    • Data Source
      KAKENHI-PROJECT-18700015
  • [Presentation] サイズ3の最小ブロック転送問題の近似困難性2006

    • Author(s)
      朝廣雄一,古川哲也,池上佳一,宮野英次
    • Organizer
      電気関係学会九州支部連合大会
    • Data Source
      KAKENHI-PROJECT-18700015
  • [Presentation] サイクルグラフ上での地図作成問題に対する重み付き最近傍アルゴリズム2006

    • Author(s)
      朝廣雄一,宮野英次,宮崎修一,吉牟田拓朗
    • Organizer
      電子情報通信学会技術研究報告
    • Data Source
      KAKENHI-PROJECT-18700015
  • [Presentation] (In)approximability of Graph Orientation to Minimize the Maximum Weighted Outdegree2006

    • Author(s)
      Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kohei Zenmyo
    • Organizer
      情報処理学会研究報告
    • Data Source
      KAKENHI-PROJECT-18700015
  • [Presentation] 理想グラフの中の正則部分グラフの探索

    • Author(s)
      朝廣雄一,江藤宏,伊藤健洋,宮野英次
    • Organizer
      電気・情報関係学会九州支部連合大会論文集
    • Place of Presentation
      鹿児島市鹿児島大学
    • Year and Date
      2014-09-18 – 2014-09-19
    • Data Source
      KAKENHI-PROJECT-25330018
  • [Presentation] 次数制約部分グラフ探索問題

    • Author(s)
      朝廣雄一,江藤宏,伊藤健洋,宮野英次
    • Organizer
      夏のLAシンポジウム2014
    • Place of Presentation
      山口県岩国市半月庵
    • Year and Date
      2014-07-17 – 2014-07-19
    • Data Source
      KAKENHI-PROJECT-25330018
  • [Presentation] ランダムグラフにおける最大2-クランのサイズ

    • Author(s)
      土井悠也,朝廣雄一,宮野英次
    • Organizer
      電気・情報関係学会九州支部連合大会
    • Place of Presentation
      鹿児島市鹿児島大学
    • Year and Date
      2014-09-18 – 2014-09-19
    • Data Source
      KAKENHI-PROJECT-25330018
  • [Presentation] 次数制約のあるグラフ有向化問題の計算複雑さについて

    • Author(s)
      朝廣雄一,ジェスパージャンソン,宮野英次,小野廣隆
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      沖縄県石垣市大濱信泉記念館
    • Year and Date
      2014-11-20 – 2014-11-21
    • Data Source
      KAKENHI-PROJECT-25330018
  • 1.  YAMASHITA Masafumi (00135419)
    # of Collaborated Projects: 5 results
    # of Collaborated Products: 0 results
  • 2.  SAKURAI Kouichi (60264066)
    # of Collaborated Projects: 3 results
    # of Collaborated Products: 0 results
  • 3.  FUJITA Satoshi (40228995)
    # of Collaborated Projects: 3 results
    # of Collaborated Products: 0 results
  • 4.  MIYANO Eiji (10284548)
    # of Collaborated Projects: 3 results
    # of Collaborated Products: 8 results
  • 5.  SADAKANE Kunihiko (20323090)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 6.  ASAMA Hajime (50184156)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 7.  SUZUKI Masakazu (20112302)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 8.  SHIZUYA Hiroki (50196383)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 9.  SATOH Takashi (30262281)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 10.  ONO Hirotaka (00346826)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 6 results
  • 11.  横尾 真 (20380678)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 12.  溝口 佳寛 (80209783)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 13.  貞廣 泰造 (00280454)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 14.  廣瀬 英雄 (60275401)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 15.  江藤 宏 (70794022)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 16.  SAKAI Yasuyuki
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 17.  酒井 康之
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 18.  伊藤 健洋
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results
  • 19.  土中 哲秀
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 2 results

URL: 

Are you sure that you want to link your ORCID iD to your KAKEN Researcher profile?
* This action can be performed only by the researcher himself/herself who is listed on the KAKEN Researcher’s page. Are you sure that this KAKEN Researcher’s page is your page?

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

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi