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

Kobayashi Yasuaki  小林 靖明

… Alternative Names

Yasuaki Kobayashi  小林 靖明

Less
Researcher Number 60735083
Other IDs
  • ORCIDhttps://orcid.org/0000-0003-3244-6915
Affiliation (Current) 2025: 北海道大学, 情報科学研究院, 准教授
Affiliation (based on the past Project Information) *help 2020 – 2024: 北海道大学, 情報科学研究院, 准教授
2017 – 2021: 京都大学, 情報学研究科, 助教
2014 – 2015: 学習院大学, 付置研究所, 助教
Review Section/Research Field
Principal Investigator
Basic Section 60010:Theory of informatics-related / Sections That Are Subject to Joint Review: Basic Section60010:Theory of informatics-related , Basic Section60020:Mathematical informatics-related / Basic Section 60020:Mathematical informatics-related / Theory of informatics
Except Principal Investigator
Medium-sized Section 60:Information science, computer engineering, and related fields / Basic Section 61030:Intelligent informatics-related / Medium-sized Section 61:Human informatics and related fields / Transformative Research Areas, Section (IV) / Intelligent informatics
Keywords
Principal Investigator
グラフアルゴリズム / 固定パラメータ容易性 / 列挙アルゴリズム / 近似アルゴリズム / 離散最適化 / 多様性最大化 / 離散アルゴリズム / メタアルゴリズム / 数理論理 / メタ定理 … More / 組合せ遷移 / 木幅 / アルゴリズム的メタ定理 / パス幅 / 指数時間厳密アルゴリズム / グラフの階層描画 / グラフ描画 / 固定パラメータアルゴリズム / 厳密アルゴリズム … More
Except Principal Investigator
データマイニング / 列挙アルゴリズム / 組合せ遷移 / 閉集合 / 実問題への応用 / 実用的アルゴリズム / 固定パラメータアルゴリズム / パス幅 / 木幅 / アルゴリズム / 高次元ブール値データ / 知識基盤形成 / 次世代機械学習技術 / 大規模半構造データ / 離散構造学習 / 分散アルゴリズム / グラフアルゴリズム / 双クラスタリング / 形式概念解析 / 弱閉集合 / 2項関係 / 知識発見 Less
  • Research Projects

    (9 results)
  • Research Products

    (199 results)
  • Co-Researchers

    (27 People)
  •  解空間の形状に着目した組合せ遷移の理論:計算量解析の高精細化とソルバー新技法

    • Principal Investigator
      伊藤 健洋
    • Project Period (FY)
      2024 – 2027
    • Research Category
      Grant-in-Aid for Scientific Research (A)
    • Review Section
      Medium-sized Section 60:Information science, computer engineering, and related fields
    • Research Institution
      Tohoku University
  •  Making treewidth and pathwidth practical

    • Principal Investigator
      玉木 久夫
    • Project Period (FY)
      2024 – 2027
    • Research Category
      Grant-in-Aid for Scientific Research (A)
    • Review Section
      Medium-sized Section 60:Information science, computer engineering, and related fields
    • Research Institution
      Meiji University
  •  Foundation of algorithmic theory of finding diverse solutions for discrete optimization problemsPrincipal Investigator

    • Principal Investigator
      小林 靖明
    • Project Period (FY)
      2023 – 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
      Hokkaido University
  •  高次元ブール値テンソルデータからの多項閉集合を用いた知識発見

    • Principal Investigator
      山本 章博
    • Project Period (FY)
      2021 – 2023
    • Research Category
      Grant-in-Aid for Scientific Research (B)
    • Review Section
      Basic Section 61030:Intelligent informatics-related
    • Research Institution
      Kyoto University
  •  Research on fast algorithmic meta-theorems for tree decomposable graphsPrincipal Investigator

    • Principal Investigator
      Kobayashi Yasuaki
    • Project Period (FY)
      2020 – 2022
    • Research Category
      Grant-in-Aid for Early-Career Scientists
    • Review Section
      Basic Section 60010:Theory of informatics-related
    • Research Institution
      Hokkaido University
      Kyoto University
  •  Computer Science Approach for Expanding Combinatorial Reconfiguration: Toward Automatic Generation of Algorithms

    • Principal Investigator
      ITO Takehiro
    • Project Period (FY)
      2020 – 2022
    • Research Category
      Grant-in-Aid for Transformative Research Areas (B)
    • Review Section
      Transformative Research Areas, Section (IV)
    • Research Institution
      Tohoku University
  •  Development of Next-generation Semi-Structured Data Mining Technology Towards The Real-World Knowledge Creation Infrastructure

    • Principal Investigator
      有村 博紀
    • Project Period (FY)
      2020 – 2024
    • Research Category
      Grant-in-Aid for Scientific Research (A)
    • Review Section
      Medium-sized Section 61:Human informatics and related fields
    • Research Institution
      Hokkaido University
  •  Properties of Weakly Closed Itemsets and their Application to Knowledge Discovery

    • Principal Investigator
      Yamamoto Akihiro
    • Project Period (FY)
      2017 – 2019
    • Research Category
      Grant-in-Aid for Scientific Research (B)
    • Research Field
      Intelligent informatics
    • Research Institution
      Kyoto University
  •  Exact algorithms for Sugiyama method in layered graph drawingsPrincipal Investigator

    • Principal Investigator
      Yasuaki Kobayashi
    • Project Period (FY)
      2014 – 2015
    • Research Category
      Grant-in-Aid for Research Activity Start-up
    • Research Field
      Theory of informatics
    • Research Institution
      Gakushuin University

All 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 Other

All Journal Article Presentation

  • [Journal Article] Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover2024

    • Author(s)
      Takashi Horiyama, Yasuaki Kobayashi, Hirotaka Ono, Kazuhisa Seto, Ryu Suzuki
    • Journal Title

      Proc. the 38th Annual AAAI Conference on Artificial Intelligence (AAAI 2024)

      Volume: 38 Pages: 20726-20734

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Journal Article] Structural Parameterizations of Vertex Integrity2024

    • Author(s)
      Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi
    • Journal Title

      Lecture Notes in Computer Science, Proc. WALCOM 2024

      Volume: 14549 Pages: 406-420

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Journal Article] Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover2024

    • Author(s)
      Horiyama Takashi、Kobayashi Yasuaki、Ono Hirotaka、Seto Kazuhisa、Suzuki Ryu
    • Journal Title

      Proceedings of the AAAI Conference on Artificial Intelligence

      Volume: 38 Issue: 18 Pages: 20726-20734

    • DOI

      10.1609/aaai.v38i18.30060

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-21K19765, KAKENHI-PLANNED-20H05793, KAKENHI-PROJECT-23K28034
  • [Journal Article] On the Complexity of List $$\mathcal H$$-Packing for Sparse Graph Classes2024

    • Author(s)
      Gima Tatsuya、Hanaka Tesshu、Kobayashi Yasuaki、Otachi Yota、Shirai Tomohito、Suzuki Akira、Tamura Yuma、Zhou Xiao
    • Journal Title

      Proceedings of the 18th International Conference and Workshop on Algorithms and Computation (WALCOM 2024)

      Volume: 14549 Pages: 421-435

    • DOI

      10.1007/978-981-97-0566-5_30

    • ISBN
      9789819705658, 9789819705665
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-21K17707, KAKENHI-PROJECT-23KJ1066, KAKENHI-PROJECT-21K11752, KAKENHI-PROJECT-20K11666, KAKENHI-PROJECT-21K21278, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05794, KAKENHI-PROJECT-23K28034
  • [Journal Article] On the Complexity of List H-Packing for Sparse Graph Classes2024

    • Author(s)
      Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou
    • Journal Title

      Lecture Notes in Computer Science, Proc. WALCOM 2024

      Volume: 14549 Pages: 421-435

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Journal Article] Structural Parameterizations of Vertex Integrity2024

    • Author(s)
      Gima Tatsuya、Hanaka Tesshu、Kobayashi Yasuaki、Murai Ryota、Ono Hirotaka、Otachi Yota
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 14549 Pages: 406-420

    • DOI

      10.1007/978-981-97-0566-5_29

    • ISBN
      9789819705658, 9789819705665
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21K19765, KAKENHI-PROJECT-21K17707, KAKENHI-PROJECT-23KJ1066, KAKENHI-PROJECT-21K11752, KAKENHI-PLANNED-20H05793, KAKENHI-PROJECT-23K28034
  • [Journal Article] Finding a Reconfiguration Sequence between Longest Increasing Subsequences2024

    • Author(s)
      Yuuki Aoike, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi
    • Journal Title

      IEICE Trans. Inf. & Syst.

      Volume: E107.D Issue: 4 Pages: 559-563

    • DOI

      10.1587/transinf.2023EDL8067

    • ISSN
      0916-8532, 1745-1361
    • Year and Date
      2024-04-01
    • Language
      English
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793, KAKENHI-PROJECT-23K28034
  • [Journal Article] A framework to design approximation algorithms for finding diverse solutions in combinatorial problems2023

    • Author(s)
      Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
    • Journal Title

      Proc. of 37th AAAI Conference on Artificial Intelligence (AAAI 2023), AAAI-23 Technical Tracks 4

      Volume: 37 Issue: 4 Pages: 3968-3976

    • DOI

      10.1609/aaai.v37i4.25511

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-22H00513
  • [Journal Article] Algorithmic theory of qubit routing2023

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Journal Title

      Proc. of 18th Algorithms and Data Structures Symposium (WADS 2023), Lecture Notes in Computer Science

      Volume: 14079 Pages: 533-546

    • DOI

      10.1007/978-3-031-38906-1_35

    • ISBN
      9783031389054, 9783031389061
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11692, KAKENHI-PROJECT-23K10982, KAKENHI-PROJECT-20K11670, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-23K21646, KAKENHI-PROJECT-22H05001
  • [Journal Article] Rerouting planar curves and disjoint paths2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      Proc. of 50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023), Leibniz International Proceedings in Informatics

      Volume: 261

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids2023

    • Author(s)
      Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
    • Journal Title

      Proc. the 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023), Leibniz International Proceedings in Informatics (LIPIcs)

      Volume: 272

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Journal Article] Reconfiguration of Time-Respecting Arborescences2023

    • Author(s)
      Ito Takehiro、Iwamasa Yuni、Kamiyama Naoyuki、Kobayashi Yasuaki、Kobayashi Yusuke、Maezawa Shun-ichi、Suzuki Akira
    • Journal Title

      Algorithms and Data Structures (WADS 2023)

      Volume: 14079 Pages: 521-532

    • DOI

      10.1007/978-3-031-38906-1_34

    • ISBN
      9783031389054, 9783031389061
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-22K13956, KAKENHI-PROJECT-22K17854, KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11692, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05794, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-23K28034
  • [Journal Article] Polynomial-delay enumeration of large maximal common independent sets in two matroids2023

    • Author(s)
      Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
    • Journal Title

      Proc. of 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023), Leibniz International Proceedings in Informatics

      Volume: 272

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Hardness of finding combinatorial shortest paths on graph associahedra2023

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
    • Journal Title

      Proc. of 50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023), Leibniz International Proceedings in Informatics

      Volume: 261

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] On reachable assignments under dichotomous preferences2023

    • Author(s)
      Ito Takehiro、Kakimura Naonori、Kamiyama Naoyuki、Kobayashi Yusuke、Nozaki Yuta、Okamoto Yoshio、Ozeki Kenta
    • Journal Title

      Theoretical Computer Science

      Volume: 979 Pages: 114196-114196

    • DOI

      10.1016/j.tcs.2023.114196

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-20K14317, KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11692, KAKENHI-PROJECT-23K10982, KAKENHI-PROJECT-20K11670, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-23K21646
  • [Journal Article] Fixed-parameter algorithms for graph constraint logic2023

    • Author(s)
      Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Muhlenthaler, Akira Suzuki
    • Journal Title

      Theoretical Computer Science

      Volume: 959 Pages: 113863-113863

    • DOI

      10.1016/j.tcs.2023.113863

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11692, KAKENHI-PROJECT-20K11666, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05794, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-18H04091
  • [Journal Article] Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph2023

    • Author(s)
      Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima, Mizuki Sue
    • Journal Title

      Lecture Notes in Computer Science, Proc. SPIRE2023,

      Volume: 14240 Pages: 28-34

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Journal Article] 組合せゲームにおけるアルゴリズムと計算量2023

    • Author(s)
      小林 靖明
    • Journal Title

      オペレーションズ・リサーチ

      Volume: 68巻3号 Pages: 131-137

    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Journal Article] Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph2023

    • Author(s)
      Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima, Mizuki Sue
    • Journal Title

      Proceedings of 30th International Symposium on String Processing and Information Retrieval

      Volume: LNCS 14240 Pages: 28-34

    • DOI

      10.1007/978-3-031-43980-3_3

    • ISBN
      9783031439797, 9783031439803
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21K17705, KAKENHI-PUBLICLY-23H04386, KAKENHI-PROJECT-23K24808, KAKENHI-PROJECT-23K28034
  • [Journal Article] Reconfiguration of spanning trees with degree constraints or diameter constraints2023

    • Author(s)
      Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki and Kunihiro Wasa
    • Journal Title

      Algorithmica

      Volume: - Issue: 9 Pages: 2779-2816

    • DOI

      10.1007/s00453-023-01117-z

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-20K11666, KAKENHI-PROJECT-22K17849, KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11692, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05794, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-18H04091
  • [Journal Article] Reconfiguration of colorings in triangulations of the sphere2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      Proc. of 39th International Symposium on Computational Geometry (SoCG 2023), Leibniz International Proceedings in Informatics

      Volume: 258

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Monotone edge flips to an orientation of maximum edge-connectivity a la Nash-Williams2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      ACM Transactions on Algorithms

      Volume: 19 Issue: 1 Pages: 6-6

    • DOI

      10.1145/3561302

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11692, KAKENHI-PROJECT-22K13956, KAKENHI-PROJECT-20K23323, KAKENHI-PROJECT-17K00028, KAKENHI-PROJECT-18K03391, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-23K21646
  • [Journal Article] Reconfiguring (non-spanning) arborescences2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
    • Journal Title

      Theoretical Computer Science

      Volume: 943 Pages: 131-141

    • DOI

      10.1016/j.tcs.2022.12.007

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-21K11752, KAKENHI-PROJECT-22K17851, KAKENHI-PROJECT-20K23323, KAKENHI-PROJECT-20K19742, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05794, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-22H00513
  • [Journal Article] Reconfiguration of Time-Respecting Arborescences2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki
    • Journal Title

      Lecture Notes in Computer Science, Proc. WADS 2023

      Volume: 14079 Pages: 521-532

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Journal Article] Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids2023

    • Author(s)
      Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
    • Journal Title

      Proceedings of MFCS 2023, LIPIcs

      Volume: 272

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-23K28034
  • [Journal Article] Reconfiguration of Regular Induced Subgraphs2022

    • Author(s)
      Eto Hiroshi、Ito Takehiro、Kobayashi Yasuaki、Otachi Yota、Wasa Kunihiro
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 13174 Pages: 35-46

    • DOI

      10.1007/978-3-030-96731-4_4

    • ISBN
      9783030967307, 9783030967314
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-21K11752, KAKENHI-PROJECT-19K20350, KAKENHI-PROJECT-20K19742, KAKENHI-PLANNED-20H05793
  • [Journal Article] Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study2022

    • Author(s)
      Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, Yota Otachi
    • Journal Title

      Proceedings of AAAI 2022

      Volume: 36(4) Pages: 3758-3766

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Journal Article] Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets2022

    • Author(s)
      Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi, Saket Saurabh
    • Journal Title

      Proceedings of MFCS 2022, LIPIcs

      Volume: vol. 241, 6 Pages: 1-15

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Journal Article] Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study2022

    • Author(s)
      Tesshu Hanaka、Yasuaki Kobayashi、Kazuhiro Kurita、See Woo Lee、Yota Otachi
    • Journal Title

      Proceedings of AAAI 2022

      Volume: 37 Pages: 3758-3766

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20K19742
  • [Journal Article] Linear-Delay Enumeration for Minimal Steiner Problems2022

    • Author(s)
      Kobayashi Yasuaki、Kurita Kazuhiro、Wasa Kunihiro
    • Journal Title

      Proceedings of PODS 2022

      Volume: - Pages: 323-354

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Journal Article] Parameterized Complexity of Graph Burning2022

    • Author(s)
      Kobayashi Yasuaki、Otachi Yota
    • Journal Title

      Algorithmica

      Volume: 84 Issue: 8 Pages: 2379-2393

    • DOI

      10.1007/s00453-022-00962-8

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-21K11752, KAKENHI-PROJECT-20H00595, KAKENHI-PROJECT-20K19742, KAKENHI-PLANNED-20H05793, KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-22H00513
  • [Journal Article] Finding shortest non-separating and non-disconnecting paths2022

    • Author(s)
      Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi
    • Journal Title

      arXiv

      Volume: --

    • Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Polynomial-Delay and Polynomial-Space Enumeration of Large Maximal Matchings2022

    • Author(s)
      Kobayashi Yasuaki、Kurita Kazuhiro、Wasa Kunihiro
    • Journal Title

      48TH INTERNATIONAL WORKSHOP ON GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE

      Volume: - Pages: 342-355

    • DOI

      10.1007/978-3-031-15914-5_25

    • ISBN
      9783031159138, 9783031159145
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21K17812, KAKENHI-PROJECT-22K17849, KAKENHI-PUBLICLY-21H05861, KAKENHI-PROJECT-19K20350, KAKENHI-PROJECT-20K19742, KAKENHI-PLANNED-20H05962, KAKENHI-PLANNED-20H05793
  • [Journal Article] Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study2022

    • Author(s)
      Hanaka Tesshu、Kobayashi Yasuaki、Kurita Kazuhiro、Lee See Woo、Otachi Yota
    • Journal Title

      Proceedings of the AAAI Conference on Artificial Intelligence

      Volume: 36 Issue: 4 Pages: 3758-3766

    • DOI

      10.1609/aaai.v36i4.20290

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-21K11752, KAKENHI-PROJECT-21K17812, KAKENHI-PUBLICLY-21H05861, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05962
  • [Journal Article] Linear-Time Recognition of Double-Threshold Graphs2022

    • Author(s)
      Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno
    • Journal Title

      Algorithmica 84(4): 1163-1181 (2022)

      Volume: 84 Issue: 4 Pages: 1163-1181

    • DOI

      10.1007/s00453-021-00921-9

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-17K00017, KAKENHI-PROJECT-20K11670, KAKENHI-PROJECT-21K11752, KAKENHI-PLANNED-20H05964, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-18H04091
  • [Journal Article] An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion2022

    • Author(s)
      Aoike Yuuki、Gima Tatsuya、Hanaka Tesshu、Kiyomi Masashi、Kobayashi Yasuaki、Kobayashi Yusuke、Kurita Kazuhiro、Otachi Yota
    • Journal Title

      Theory of Computing Systems

      Volume: 66 Issue: 2 Pages: 502-515

    • DOI

      10.1007/s00224-022-10076-x

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-19K21537, KAKENHI-PROJECT-20K11692, KAKENHI-PROJECT-21K11752, KAKENHI-PROJECT-20H00595, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-20K19742, KAKENHI-PLANNED-20H05962, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-18H04091
  • [Journal Article] Monotone edge flips to an orientation of maximum edge-connectivity ? la Nash-Williams2022

    • Author(s)
      Ito Takehiro、Iwamasa Yuni、Kakimura Naonori、Kamiyama Naoyuki、Kobayashi Yusuke、Maezawa Shun-ichi、Nozaki Yuta、Okamoto Yoshio、Ozeki Kenta
    • Journal Title

      Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)

      Volume: なし Pages: 1342-1355

    • DOI

      10.1137/1.9781611977073.56

    • ISBN
      9781611977073
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-18K03391, KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11670, KAKENHI-PROJECT-20K11692, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795
  • [Journal Article] Reconfiguration of colorings in triangulations of the sphere2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      arXiv

      Volume: -

    • Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Reconfiguration of spanning trees with degree constraint or diameter constraint2022

    • Author(s)
      Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
    • Journal Title

      arXiv

      Volume: --

    • Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets2022

    • Author(s)
      Ankit Abhinav、Susobhan Bandopadhyay、Aritra Banik、Yasuaki Kobayashi、Shunsuke Nagano、Yota Otachi、Saket Saurabh
    • Journal Title

      Proceedings of MFCS 2022, LIPIcs

      Volume: 241

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-20K19742
  • [Journal Article] Shortest reconfiguration of perfect matchings via alternating cycles2022

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Journal Title

      SIAM Journal on Discrete Mathematics

      Volume: 36 Issue: 2 Pages: 1102-1123

    • DOI

      10.1137/20m1364370

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11670, KAKENHI-PROJECT-17K00028, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-23K21646, KAKENHI-PROJECT-18H04091
  • [Journal Article] Reconfiguration of spanning trees with degree constraint or diameter constraint2022

    • Author(s)
      Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
    • Journal Title

      Proc. of 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022), Leibniz International Proceedings in Informatics

      Volume: 219

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Independent Set Reconfiguration on Directed Graphs2022

    • Author(s)
      Takehiro Ito、Yuni Iwamasa、Yasuaki Kobayashi、Yu Nakahata、Yota Otachi、Masahiro Takahashi、Kunihiro Wasa
    • Journal Title

      Proceedings of MFCS 2022, LIPIcs

      Volume: 241

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20K19742
  • [Journal Article] Reconfiguration of Regular Induced Subgraphs2022

    • Author(s)
      Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa
    • Journal Title

      Proceedings of WALCOM 2022, LNCS

      Volume: vol. 13174 Pages: 35-46

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Journal Article] 多様な組合せを求めるアルゴリズム論的アプローチ2022

    • Author(s)
      小林 靖明
    • Journal Title

      システム/制御/情報

      Volume: 66巻11号

    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Journal Article] An <i>O</i>(<i>n</i><sup>2</sup>)-Time Algorithm for Computing a Max-Min 3-Dispersion on a Point Set in Convex Position2022

    • Author(s)
      KOBAYASHI Yasuaki、NAKANO Shin-ichi、UCHIZAWA Kei、UNO Takeaki、YAMAGUCHI Yutaro、YAMANAKA Katsuhisa
    • Journal Title

      IEICE Trans. Inf. & Syst.

      Volume: E105.D Issue: 3 Pages: 503-507

    • DOI

      10.1587/transinf.2021FCP0013

    • NAID

      130008165607

    • ISSN
      0916-8532, 1745-1361
    • Year and Date
      2022-03-01
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19K11812, KAKENHI-PROJECT-22K11897, KAKENHI-PROJECT-20K19742, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05962
  • [Journal Article] On reachable assignments under dichotomous preferences2022

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      Proc. of 24th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA 2022), Lecture Notes in Computer Science

      Volume: 13753 Pages: 650-658

    • DOI

      10.1007/978-3-031-21203-1_43

    • ISBN
      9783031212024, 9783031212031
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11670, KAKENHI-PROJECT-20K14317, KAKENHI-PROJECT-20K20417, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795
  • [Journal Article] Rerouting planar curves and disjoint paths2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      arXiv

      Volume: -

    • Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Algorithmic meta-theorems for combinatorial reconfiguration revisited2022

    • Author(s)
      Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi
    • Journal Title

      Proc. of 30th Annual European Symposium on Algorithms (ESA 2022), Leibniz International Proceedings in Informatics

      Volume: 244

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] A framework to design approximation algorithms for finding diverse solutions in combinatorial problems2022

    • Author(s)
      Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
    • Journal Title

      arXiv

      Volume: --

    • Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Exploring the gap between treedepth and vertex cover through vertex integrity2022

    • Author(s)
      Gima Tatsuya、Hanaka Tesshu、Kiyomi Masashi、Kobayashi Yasuaki、Otachi Yota
    • Journal Title

      Theoretical Computer Science

      Volume: 918 Pages: 60-76

    • DOI

      10.1016/j.tcs.2022.03.021

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21K17707, KAKENHI-PROJECT-21K11752, KAKENHI-PROJECT-20H00595, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-20K19742
  • [Journal Article] Independent set reconfiguration on directed graphs2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
    • Journal Title

      Proc. of 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022), Leibniz International Proceedings in Informatics

      Volume: 241

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Independent set reconfiguration on directed graphs2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
    • Journal Title

      In Proceedings of MFCS 2022, LIPIcs

      Volume: vol. 241, 58 Pages: 1-15

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Journal Article] Independent set reconfiguration on directed graphs2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
    • Journal Title

      arXiv

      Volume: --

    • Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] A parameterized view to the robust recoverable base problem of matroids under structural uncertainty2022

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Journal Title

      Operations Research Letters

      Volume: 50 Issue: 3 Pages: 370-375

    • DOI

      10.1016/j.orl.2022.05.001

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11670, KAKENHI-PROJECT-20K11692, KAKENHI-PROJECT-17K00028, KAKENHI-PROJECT-20K20417, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-23K21646
  • [Journal Article] Reforming an envy-free matching2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      Proc. of 36th AAAI Conference on Artificial Intelligence (AAAI 2022)

      Volume: 36 Issue: 5 Pages: 5084-5091

    • DOI

      10.1609/aaai.v36i5.20441

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795
  • [Journal Article] Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited2022

    • Author(s)
      Tatsuya Gima、Takehiro Ito、Yasuaki Kobayashi、Yota Otachi
    • Journal Title

      Proceedings of ESA 2022, LIPIcs

      Volume: 244

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20K19742
  • [Journal Article] Polynomial-Delay Enumeration of Large Maximal Matchings2022

    • Author(s)
      Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
    • Journal Title

      Proceedings of WG 2022, LNCS

      Volume: vol. 13453 Pages: 342-355

    • NAID

      130008051609

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Journal Article] Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited2022

    • Author(s)
      Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi
    • Journal Title

      Proceedings of ESA 2022, LIPIcs

      Volume: vol. 244, 61 Pages: 1-15

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Journal Article] Reforming an envy-free matching2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      arXiv

      Volume: --

    • Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Parameterized complexity of non-separating and non-disconnecting paths and sets2022

    • Author(s)
      Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi, Saket Saurabh
    • Journal Title

      Proc. of 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022), Leibniz International Proceedings in Informatics

      Volume: 241

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Linear-Delay Enumeration for Minimal Steiner Problems2022

    • Author(s)
      Kobayashi Yasuaki、Kurita Kazuhiro、Wasa Kunihiro
    • Journal Title

      PODS '22: Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems

      Volume: - Pages: 301-313

    • DOI

      10.1145/3517804.3524148

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21K17812, KAKENHI-PROJECT-22K17849, KAKENHI-PUBLICLY-21H05861, KAKENHI-PROJECT-19K20350, KAKENHI-PROJECT-20K19742, KAKENHI-PLANNED-20H05962, KAKENHI-PLANNED-20H05793
  • [Journal Article] Distribution-Aware Counterfactual Explanation by Mixed-Integer Linear Optimization2021

    • Author(s)
      Kanamori Kentaro、Takagi Takuya、Kobayashi Ken、Arimura Hiroki
    • Journal Title

      Transactions of the Japanese Society for Artificial Intelligence

      Volume: 36 Issue: 6 Pages: C-L44_1-12

    • DOI

      10.1527/tjsai.36-6_C-L44

    • NAID

      130008110420

    • ISSN
      1346-0714, 1346-8030
    • Year and Date
      2021-11-01
    • Language
      English
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-20J20654, KAKENHI-PROJECT-21K17817, KAKENHI-PLANNED-20H05963, KAKENHI-PROJECT-20H00595
  • [Journal Article] Exploring the Gap Between Treedepth and Vertex Cover Through Vertex?Integrity2021

    • Author(s)
      Gima Tatsuya、Hanaka Tesshu、Kiyomi Masashi、Kobayashi Yasuaki、Otachi Yota
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 12701 Pages: 271-285

    • DOI

      10.1007/978-3-030-75242-2_19

    • ISBN
      9783030752415, 9783030752422
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-21K11752, KAKENHI-PLANNED-20H05793
  • [Journal Article] Finding a maximum minimal separator: Graph classes and fixed-parameter tractability2021

    • Author(s)
      Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Tsuyoshi Yagita
    • Journal Title

      Theoretical Computer Science

      Volume: 865 Pages: 131-140

    • DOI

      10.1016/j.tcs.2021.03.006

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-19K21537, KAKENHI-PROJECT-20K11692, KAKENHI-PROJECT-20K19742, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795
  • [Journal Article] DACE: Distribution-Aware Counterfactual Explanation by Mixed-Integer Linear Optimization2021

    • Author(s)
      #Kentaro Kanamori, Takuya Takagi, Ken Kobayashi, Hiroki Arimura
    • Journal Title

      Proc. the 29th International Joint Conference on Artificial Intelligence and the 17th Pacific Rim International Conference on Artificial Intelligence (IJCAI-PRICAI 2020)

      Volume: - Pages: 2855-2862

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Journal Article] Reconfiguring Directed Trees in a Digraph2021

    • Author(s)
      Ito Takehiro、Iwamasa Yuni、Kobayashi Yasuaki、Nakahata Yu、Otachi Yota、Wasa Kunihiro
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 13025 Pages: 343-354

    • DOI

      10.1007/978-3-030-89543-3_29

    • ISBN
      9783030895426, 9783030895433
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-21K11752, KAKENHI-PROJECT-19K20350, KAKENHI-PROJECT-20K19742, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795
  • [Journal Article] Algorithms for gerrymandering over graphs2021

    • Author(s)
      Ito Takehiro、Kamiyama Naoyuki、Kobayashi Yusuke、Okamoto Yoshio
    • Journal Title

      Theoretical Computer Science

      Volume: 868 Pages: 30-45

    • DOI

      10.1016/j.tcs.2021.03.037

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-20K11670, KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11692, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-18H04091
  • [Journal Article] Finding diverse trees, paths, and more2021

    • Author(s)
      Hanaka Tesshu, Kobayashi Yasuaki, Kazuhiro Kurita, Yota Otachi
    • Journal Title

      Proceedings of AAAI 2021

      Volume: 35 Pages: 3778-3786

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20K19742
  • [Journal Article] Ordered Counterfactual Explanation by Mixed-Integer Linear Optimization.2021

    • Author(s)
      Kentaro Kanamori, Takuya Takagi, Ken Kobayashi, Yuichi Ike, Kento Uemura, Hiroki Arimura
    • Journal Title

      Proceedings of the AAAI Conference on Artificial Intelligence

      Volume: 35(13) Pages: 11564-11574

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Journal Article] Finding diverse trees, paths, and more2021

    • Author(s)
      Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi
    • Journal Title

      Proc. of the AAAI Conference on Artificial Intelligence (AAAI 2021)

      Volume: 35 Issue: 5 Pages: 3778-3786

    • DOI

      10.1609/aaai.v35i5.16495

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Parameterized Complexity of $$(A,\ell )$$-Path Packing2021

    • Author(s)
      Belmonte Remy、Hanaka Tesshu、Kanzaki Masaaki、Kiyomi Masashi、Kobayashi Yasuaki、Kobayashi Yusuke、Lampis Michael、Ono Hirotaka、Otachi Yota
    • Journal Title

      Algorithmica

      Volume: 84 Issue: 4 Pages: 871-895

    • DOI

      10.1007/s00453-021-00875-y

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K21537, KAKENHI-PROJECT-20K19742, KAKENHI-PROJECT-21K11752, KAKENHI-PROJECT-20H00595, KAKENHI-PLANNED-20H05967, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-18H04091
  • [Journal Article] Monotone edge flips to an orientation of maximum edge-connectivity a la Nash-Williams2021

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      arXiv

      Volume: --

    • Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Polynomial-delay enumeration of large maximal matchings2021

    • Author(s)
      Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
    • Journal Title

      arXiv

      Volume: --

    • NAID

      130008051609

    • Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Computing the Largest Bond and the Maximum Connected Cut of a Graph2021

    • Author(s)
      Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Ueverton S. Souza
    • Journal Title

      Algorithmica

      Volume: 83 Issue: 5 Pages: 1421-1458

    • DOI

      10.1007/s00453-020-00789-1

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K21537, KAKENHI-PLANNED-20H05793, KAKENHI-PROJECT-20K19742, KAKENHI-PLANNED-20H05795
  • [Journal Article] Reconfiguration of regular induced subgraphs2021

    • Author(s)
      Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa
    • Journal Title

      arXiv

      Volume: --

    • Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] A (probably) optimal algorithm for Bisection on bounded-treewidth graphs2021

    • Author(s)
      Hanaka Tesshu、Kobayashi Yasuaki、Sone Taiga
    • Journal Title

      Theoretical Computer Science

      Volume: 873 Pages: 38-46

    • DOI

      10.1016/j.tcs.2021.04.023

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19K21537, KAKENHI-PROJECT-20K19742, KAKENHI-PLANNED-20H05793
  • [Journal Article] Metric Learning for Ordered Labeled Trees with pq-grams2020

    • Author(s)
      Hikaru Shindo , Masaaki Nishino , Yasuaki Kobayashi , Akihiro Yamamoto
    • Journal Title

      Frontiers in Artificial Intelligence and Applications

      Volume: 325 Pages: 1475-1482

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20K19742
  • [Journal Article] Parameterized Complexity of Graph Burning2020

    • Author(s)
      Yasuaki Kobayashi , Yota Otachi
    • Journal Title

      Leibniz International Proceedings in Informatics

      Volume: 180

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20K19742
  • [Journal Article] Parameterized Complexity of (A,l)-Path Packing2020

    • Author(s)
      Belmonte Remy、Hanaka Tesshu、Kanzaki Masaaki、Kiyomi Masashi、Kobayashi Yasuaki、Kobayashi Yusuke、Lampis Michael、Ono Hirotaka、Otachi Yota
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 12126 Pages: 43-55

    • DOI

      10.1007/978-3-030-48966-3_4

    • ISBN
      9783030489656, 9783030489663
    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-20K19742, KAKENHI-PROJECT-19K21537, KAKENHI-PROJECT-17H01698
  • [Journal Article] An Optimal Algorithm for Bisection for Bounded-Treewidth Graph2020

    • Author(s)
      Hanaka Tesshu、Kobayashi Yasuaki、Sone Taiga
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 12340 Pages: 25-36

    • DOI

      10.1007/978-3-030-59901-0_3

    • ISBN
      9783030599003, 9783030599010
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20K19742, KAKENHI-PROJECT-19K21537
  • [Journal Article] A note on exponential-time algorithms for linearwidth2020

    • Author(s)
      Yasuaki Kobayashi, Yu Nakahata
    • Journal Title

      arXiv

      Volume: --

    • Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Efficient Enumerations for Minimal Multicuts and Multiway Cuts2020

    • Author(s)
      Kazuhiro Kurita、Yasuaki Kobayashi
    • Journal Title

      Leibniz International Proceedings in Informatics

      Volume: 170

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20K19742
  • [Journal Article] An improved deterministic parameterized algorithm for cactus vertex deletion2020

    • Author(s)
      Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
    • Journal Title

      arXiv

      Volume: --

    • Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Fixed-parameter algorithms for graph constraint logic2020

    • Author(s)
      Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Muhlenthaler, Akira Suzuki
    • Journal Title

      arXiv

      Volume: --

    • Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Subgraph Isomorphism on Graph Classes that Exclude a Substructure2020

    • Author(s)
      Bodlaender Hans L.、Hanaka Tesshu、Kobayashi Yasuaki、Kobayashi Yusuke、Okamoto Yoshio、Otachi Yota、van der Zanden Tom C.
    • Journal Title

      Algorithmica

      Volume: 82 Issue: 12 Pages: 3566-3587

    • DOI

      10.1007/s00453-020-00737-z

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-20K11670, KAKENHI-PROJECT-20K19742, KAKENHI-PROJECT-19K21537, KAKENHI-PROJECT-18H04091
  • [Journal Article] An improved fixed-parameter algorithm for one-page crossing minimization2017

    • Author(s)
      Yasuaki Kobayahsi, Hiromu Ohtsuka, Hisao Tamaki:
    • Journal Title

      LIPICS

      Volume: 89

    • Data Source
      KAKENHI-PROJECT-17H01788
  • [Journal Article] Computing directed pathwidth in O(1.89^n) time2016

    • Author(s)
      Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki, Toshihiro Tano
    • Journal Title

      Algorithmica

      Volume: 75(1) Issue: 1 Pages: 138-157

    • DOI

      10.1007/s00453-015-0015-9

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26880018, KAKENHI-PROJECT-26330021
  • [Journal Article] A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization2015

    • Author(s)
      Yasuaki Kobayashi, Hisao Tamaki
    • Journal Title

      Algorithmica

      Volume: 72 Issue: 3 Pages: 778-790

    • DOI

      10.1007/s00453-014-9872-x

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26330021, KAKENHI-PROJECT-26880018
  • [Journal Article] Computing the pathwidth of directed graphs with small vertex cover2015

    • Author(s)
      Yasuaki Kobayashi
    • Journal Title

      Information Processing Letters

      Volume: 115(2) Issue: 2 Pages: 310-312

    • DOI

      10.1016/j.ipl.2014.10.002

    • NAID

      110009925282

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-26880018
  • [Journal Article] On the pathwidth of almost semicomplete digraphs2015

    • Author(s)
      Kenta Kitsunai, Yasuaki Kobayashi, Hisao Tamaki
    • Journal Title

      Algorithms - ESA 2015 (Lecture Notes in Computer Science)

      Volume: 9294 Pages: 816-827

    • DOI

      10.1007/978-3-662-48350-3_68

    • ISBN
      9783662483497, 9783662483503
    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26880018
  • [Journal Article] Search Space Reduction through Commitments in Pathwidth Computation: An Experimental Study2014

    • Author(s)
      Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki
    • Journal Title

      Lecture Notes in Computer Science (SEA 2014)

      Volume: 8504 Pages: 388-399

    • DOI

      10.1007/978-3-319-07959-2_33

    • NAID

      110009925281

    • ISBN
      9783319079585, 9783319079592
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-26330021, KAKENHI-PROJECT-26880018
  • [Journal Article] A linear edge kernel for two-layer crossing minimization2014

    • Author(s)
      Yasuaki Kobayashi, Hirokazu Maruta, Yusuke Namae, Hisao Tamaki
    • Journal Title

      Theoretical Computer Science

      Volume: 554(16) Pages: 74-81

    • DOI

      10.1016/j.tcs.2014.06.009

    • NAID

      110009768496

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-26880018
  • [Presentation] 極小シュタイナー多点対頂点カット列挙の計算困難性2024

    • Author(s)
      小林靖明,栗田和宏
    • Organizer
      2023年度冬のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Presentation] Computing diverse pair of solutions for SAT2024

    • Author(s)
      儀間達也,岩政勇仁,小林靖明,栗田和宏,大舘陽太,斉藤凛
    • Organizer
      電子情報通信学会総合大会 COMP-AFSA学生シンポジウム
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Presentation] Computing diverse pair of solutions for SAT2024

    • Author(s)
      儀間達也,岩政勇仁,小林靖明,栗田和宏,大舘陽太,斉藤凛
    • Organizer
      2023年冬のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-23K28034
  • [Presentation] Theoretical aspects of generating instances with unique solutions: Pre-assignment models for unique vertex cover2024

    • Author(s)
      Takashi Horiyama, Yasuaki Kobayashi, Hirotaka Ono, Kazuhisa Seto, Ryu Suzuki
    • Organizer
      38th AAAI Conference on Artificial Intelligence (AAAI 2024)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] List variants of packing problems on sparse graphs2024

    • Author(s)
      Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou
    • Organizer
      第196回アルゴリズム研究発表会
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] 極小シュタイナー多点対頂点カット列挙の計算困難性2024

    • Author(s)
      小林靖明,栗田和宏
    • Organizer
      2023年冬のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-23K28034
  • [Presentation] Hardness of Uniquifying Minimum Vertex Covers and Minimum Dominating Sets under Pre-assignments2024

    • Author(s)
      堀山貴史,小林靖明,小野廣隆,脊戸和寿,鈴木琉
    • Organizer
      電子情報通信学会総合大会 COMP-AFSA学生シンポジウム
    • Data Source
      KAKENHI-PROJECT-23K28034
  • [Presentation] On the complexity of list H-packing for sparse graph classes2024

    • Author(s)
      Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou
    • Organizer
      18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Structural parameterizations of vertex integrity2024

    • Author(s)
      Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi
    • Organizer
      18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Hardness of Uniquifying Minimum Vertex Covers and Minimum Dominating Sets under Pre-assignments2024

    • Author(s)
      堀山貴史,小林靖明,小野廣隆,脊戸和寿,鈴木琉
    • Organizer
      電子情報通信学会総合大会 COMP-AFSA学生シンポジウム
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Presentation] Computing diverse pair of solutions for SAT2024

    • Author(s)
      儀間達也,岩政勇仁,小林靖明,栗田和宏,大舘陽太,斉藤凛
    • Organizer
      電子情報通信学会総合大会 COMP-AFSA学生シンポジウム
    • Data Source
      KAKENHI-PROJECT-23K28034
  • [Presentation] List Variants of Packing Problems on Sparse Graphs2024

    • Author(s)
      Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou
    • Organizer
      第196回アルゴリズム研究会,情報処理学会
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Presentation] List Variants of Packing Problems on Sparse Graphs2024

    • Author(s)
      atsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou
    • Organizer
      情報処理学会 第196回アルゴリズム研究会
    • Data Source
      KAKENHI-PROJECT-23K28034
  • [Presentation] Computing diverse pair of solutions for SAT2024

    • Author(s)
      儀間達也,岩政勇仁,小林靖明,栗田和宏,大舘陽太,斉藤凛
    • Organizer
      2023年度冬のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Presentation] 多様な最短経路を求める固定パラメータアルゴリズム2023

    • Author(s)
      舟山諒,小林靖明
    • Organizer
      コンピュテーション研究会,電子情報通信学会
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Presentation] Polynomial-delay enumeration of large maximal common independent sets in two matroids2023

    • Author(s)
      Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
    • Organizer
      48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Minimum Consistent Subset for Trees Revisited2023

    • Author(s)
      Hiroki Arimura, Tatsuya Gima, Yasuaki Kobayashi, Hiroomi Nochide, Yota Otachi
    • Organizer
      WAAC 2023
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-23K28034
  • [Presentation] Structural Parameterizations of Vertex Integrity2023

    • Author(s)
      Ryota Murai, Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Hirotaka Ono, Yota Otachi
    • Organizer
      WAAC 2023
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-23K28034
  • [Presentation] 連結制約のある頂点符号付きグラフ分割問題の緩和問題に対する高速なアルゴリズム2023

    • Author(s)
      藤原優,吉岡和希,小林靖明
    • Organizer
      人工知能学会 第126回人工知能基本問題研究会
    • Data Source
      KAKENHI-PROJECT-23K28034
  • [Presentation] Reconfiguration of colorings in triangulations of the sphere2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Organizer
      39th International Symposium on Computational Geometry (SoCG 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Reconfiguration of Linear Extensions2023

    • Author(s)
      伊藤大修,山中克久,平山 貴司,小林 靖明
    • Organizer
      情報処理学会 第191回アルゴリズム研究会
    • Data Source
      KAKENHI-PROJECT-20K19742
  • [Presentation] 時間制約付き有向木の遷移2023

    • Author(s)
      伊藤健洋,岩政勇仁,神山直之,小林靖明,小林佑輔,前澤俊一,鈴木顕
    • Organizer
      2023年夏のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-23K28034
  • [Presentation] Rerouting planar curves and disjoint paths2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Organizer
      50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] 弦グラフの部分クラスにおける極大誘導部分グラフ列挙への多項式遅延アルゴリズム2023

    • Author(s)
      佐藤嶺,小林靖明,栗田和宏,和佐州洋
    • Organizer
      コンピュテーション研究会,電子情報通信学会
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Presentation] 時間制約付き有向木の遷移2023

    • Author(s)
      伊藤 健洋, 岩政 勇仁, 神山 直之, 小林 靖明, 小林 佑輔, 前澤 俊一, 鈴木 顕
    • Organizer
      2023年度夏のLAシンポジウム
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints2023

    • Author(s)
      Yasuaki Kobayashi, Kazuhiro Kurita, Yasuko Matsui, Hirotaka Ono
    • Organizer
      コンピュテーション研究会,電子情報通信学会
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Presentation] 要素数制約付き極小辺被覆の多項式遅延列挙2023

    • Author(s)
      小林靖明,栗田和宏
    • Organizer
      第126回人工知能基本問題研究会,人工知能学会
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Presentation] 多様な最短経路を求める固定パラメータアルゴリズム2023

    • Author(s)
      舟山諒,小林靖明
    • Organizer
      電子情報通信学会 コンピュテーション研究会
    • Data Source
      KAKENHI-PROJECT-23K28034
  • [Presentation] Three open problems on combinatorial reconfiguration2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Organizer
      3rd Workshop on Combinatorial Reconfiguration, affiliated with ICALP 2023
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] 要素数制約付き極小辺被覆の多項式遅延列挙2023

    • Author(s)
      小林靖明,栗田和宏
    • Organizer
      人工知能学会 第126回人工知能基本問題研究会
    • Data Source
      KAKENHI-PROJECT-23K28034
  • [Presentation] Algorithmic theory of qubit routing2023

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Organizer
      18th Algorithms and Data Structures Symposium (WADS 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Hardness of finding combinatorial shortest paths on graph associahedra2023

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
    • Organizer
      50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] 文字列集合に対する多様な最長共通部分列の発見2023

    • Author(s)
      志田祐仁,小林靖明,有村博紀
    • Organizer
      コンピュテーション研究会,電子情報通信学会
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Presentation] 時間制約付き有向木の遷移2023

    • Author(s)
      伊藤健洋,岩政勇仁,神山直之,小林靖明,小林佑輔,前澤俊一,鈴木顕
    • Organizer
      2023年度夏のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Presentation] Reconfiguration of time-respecting arborescences2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki
    • Organizer
      18th Algorithms and Data Structures Symposium (WADS 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] 弦グラフの部分クラスにおける極大誘導部分グラフ列挙への多項式遅延アルゴリズム2023

    • Author(s)
      佐藤嶺,小林靖明,栗田和宏,和佐州洋
    • Organizer
      電子情報通信学会 コンピュテーション研究会
    • Data Source
      KAKENHI-PROJECT-23K28034
  • [Presentation] 弦グラフの部分クラスにおける極大誘導部分グラフ列挙への多項式遅延アルゴリズム2023

    • Author(s)
      佐藤 嶺, 小林 靖明, 栗田 和宏, 和佐 州洋
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] A framework to design approximation algorithms for finding diverse solutions in combinatorial problems2023

    • Author(s)
      Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
    • Organizer
      37th AAAI Conference on Artificial Intelligence (AAAI 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] 多様な最短経路を求める固定パラメータアルゴリズム2023

    • Author(s)
      舟山諒,小林靖明
    • Organizer
      2023年度夏のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Presentation] 連結制約のある頂点符号付きグラフ分割問題の緩和問題に対する高速なアルゴリズム2023

    • Author(s)
      藤原優,吉岡和希,小林靖明
    • Organizer
      第126回人工知能基本問題研究会,人工知能学会
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Presentation] Algorithmic meta-theorems for combinatorial reconfiguration revisited2023

    • Author(s)
      儀間達也,伊藤健洋,小林靖明,大舘陽太
    • Organizer
      2022年冬のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-20K19742
  • [Presentation] 要素数制約付き極大マトロイド共通独立集合の多項式遅延列挙2023

    • Author(s)
      小林靖明,栗田和宏,和佐州洋
    • Organizer
      日本オペレーションズ・リサーチ学会 2023年秋季研究発表会&シンポジウム
    • Data Source
      KAKENHI-PROJECT-23K28034
  • [Presentation] NP-completeness of Computing Pre-assignments to Uniquify Vertex Cover for Bipartite Graphs2023

    • Author(s)
      Ryu Suzuki, Yasuaki Kobayashi, Kazuhisa Seto, Takashi Horiyama
    • Organizer
      WAAC 2023
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-23K28034
  • [Presentation] NP-completeness of Computing Pre-assignments to Uniquify Vertex Cover for Bipartite Graphs2023

    • Author(s)
      Ryu Suzuki, Yasuaki Kobayashi, Kazuhisa Seto, Takashi Horiyama
    • Organizer
      2023年夏のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Presentation] 多様な最短経路を求める固定パラメータアルゴリズム2023

    • Author(s)
      舟山諒,小林靖明
    • Organizer
      2023年夏のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-23K28034
  • [Presentation] 文字列集合に対する多様な最長共通部分列の発見2023

    • Author(s)
      志田祐仁,小林靖明,有村博紀
    • Organizer
      電子情報通信学会 コンピュテーション研究会
    • Data Source
      KAKENHI-PROJECT-23K28034
  • [Presentation] 要素数制約付き極大マトロイド共通独立集合の多項式遅延列挙2023

    • Author(s)
      小林靖明,栗田和宏,和佐州洋
    • Organizer
      2023年秋季研究発表会&シンポジウム,日本オペレーションズ・リサーチ学会
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Presentation] 頂点インテグリティのパラメータ化計算量2023

    • Author(s)
      村井亮太,儀間達也,土中哲秀,小林靖明,小野廣隆,大舘陽太
    • Organizer
      2022年冬のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-20K19742
  • [Presentation] Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints2023

    • Author(s)
      Yasuaki Kobayashi, Kazuhiro Kurita, Yasuko Matsui, Hirotaka Ono
    • Organizer
      電子情報通信学会 コンピュテーション研究会
    • Data Source
      KAKENHI-PROJECT-23K28034
  • [Presentation] Algorithmic theory of qubit routing2023

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Organizer
      3rd Workshop on Combinatorial Reconfiguration, affiliated with ICALP 2023
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] NP-completeness of Computing Pre-assignments to Uniquify Vertex Cover for Bipartite Graphs2023

    • Author(s)
      Ryu Suzuki, Yasuaki Kobayashi, Kazuhisa Seto, Takashi Horiyama
    • Organizer
      2023年夏のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-23K28034
  • [Presentation] Polynomial-Delay Enumeration of Large Maximal Matchings2022

    • Author(s)
      Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
    • Organizer
      WEPA 2022
    • Data Source
      KAKENHI-PROJECT-20K19742
  • [Presentation] 半順序集合の弱埋め込み問題に対するパラメータ化アルゴリズム2022

    • Author(s)
      宮﨑怜子,有村博紀,小林靖明
    • Organizer
      コンピュテーション(COMP)研究会, 電子情報通信学会,愛媛大学
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Presentation] 木における誘導マッチング遷移2022

    • Author(s)
      江藤宏,伊藤健洋,小林靖明,前澤俊一,大舘陽太,和佐州洋
    • Organizer
      Japanese Conference on Combinatorics and Its Applications 2022
    • Data Source
      KAKENHI-PROJECT-20K19742
  • [Presentation] 球面の三角形分割の彩色遷移2022

    • Author(s)
      伊藤 健洋,岩政 勇仁,小林 佑輔,前澤 俊一,野崎 雄太,岡本 吉央,小関 健太
    • Organizer
      2022年度応用数学合同研究集会
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] 正則誘導部分グラフ遷移問題の計算複雑さ2022

    • Author(s)
      江藤宏,伊藤健洋,小林靖明,大舘陽太,和佐州洋
    • Organizer
      日本オペレーションズ・リサーチ学会 2022年秋季研究発表会&シンポジウム
    • Data Source
      KAKENHI-PROJECT-20K19742
  • [Presentation] Linear-delay enumeration for minimal Steiner problems2022

    • Author(s)
      Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
    • Organizer
      41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Algorithmic meta-theorems for combinatorial reconfiguration revisited2022

    • Author(s)
      Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi
    • Organizer
      30th Annual European Symposium on Algorithms (ESA 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Polynomial-delay and polynomial-space enumeration of large maximal matchings2022

    • Author(s)
      Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
    • Organizer
      5th Workshop on Enumeration Problems and Applications (WEPA 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] コンパクト非巡回語グラフに基づく連長圧縮Burrows-Wheeler変換の効率良い構築2022

    • Author(s)
      須江瑞樹,小林靖明,有村博紀,中島祐人,稲永俊介
    • Organizer
      電子情報通信学会 コンピュテーション研究会
    • Data Source
      KAKENHI-PROJECT-20K19742
  • [Presentation] コンパクト非巡回語グラフに基づく連長圧縮Burrows-Wheeler変換の効率良い構築2022

    • Author(s)
      須江瑞樹,小林靖明,有村博紀,中島祐人,稲永俊介
    • Organizer
      コンピュテーション(COMP)研究会, 電子情報通信学会,愛媛大学
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Presentation] Finding shortest non-separating and non-disconnecting paths2022

    • Author(s)
      Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi
    • Organizer
      情報処理学会 第187回アルゴリズム研究会
    • Data Source
      KAKENHI-PROJECT-20K19742
  • [Presentation] Reconfiguration of regular induced subgraphs2022

    • Author(s)
      Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa
    • Organizer
      16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] On reachable assignments under dichotomous preferences2022

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, and Kenta Ozeki
    • Organizer
      24th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] 球面の三角形分割の彩色遷移2022

    • Author(s)
      伊藤 健洋,岩政 勇仁,小林 佑輔,前澤 俊一,野崎 雄太,岡本 吉央,小関 健太
    • Organizer
      日本オペレーションズ・リサーチ学会 2022年秋季研究発表会
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] 半順序集合の弱埋め込み問題に対するパラメータ化アルゴリズム2022

    • Author(s)
      宮﨑玲子,有村博紀,小林靖明
    • Organizer
      電子情報通信学会 コンピュテーション研究会
    • Data Source
      KAKENHI-PROJECT-20K19742
  • [Presentation] Monotone edge flips to an orientation of maximum edge-connectivity a la Nash-Williams2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Invited
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Polynomial-delay and polynomial-space enumeration of large maximal matchings2022

    • Author(s)
      Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
    • Organizer
      48th edition of the International Workshop on Graph-Theoretic Concepts in Computer Science (WG2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Parameterized complexity of non-separating and non-disconnecting paths and sets2022

    • Author(s)
      Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi, Saket Saurabh
    • Organizer
      47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Independent set reconfiguration on directed graphs2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
    • Organizer
      47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] 多様な解集合を発見する効率良い近似アルゴリズム2022

    • Author(s)
      栗田和宏,土中哲秀,清見礼,小林靖明,小林佑輔,大舘陽太
    • Organizer
      人工知能学会 第119回人工知能基本問題研究会
    • Data Source
      KAKENHI-PROJECT-20K19742
  • [Presentation] Reconfiguration of spanning trees with degree constraint or diameter constraint2022

    • Author(s)
      Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
    • Organizer
      39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Monotone edge flips to an orientation of maximum edge-connectivity a la Nash-Williams2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Organizer
      2022 ACM-SIAM Symposium on Discrete Algorithms (SODA 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Algorithmic meta-theorems for combinatorial reconfiguration revisited2022

    • Author(s)
      儀間達也,伊藤健洋,小林靖明,大舘陽太
    • Organizer
      Japanese Conference on Combinatorics and Its Applications 2022
    • Data Source
      KAKENHI-PROJECT-20K19742
  • [Presentation] Fixed-parameter tractability of linear extension diameter2022

    • Author(s)
      Tesshu Hanaka, Yasuaki Kobayashi
    • Organizer
      電子情報通信学会 コンピュテーション研究会
    • Data Source
      KAKENHI-PROJECT-20K19742
  • [Presentation] Efficient Enumeration of Spanning Subgraphs in Planar Graphs with Edge Connectivity Constraints2022

    • Author(s)
      Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
    • Organizer
      電子情報通信学会 コンピュテーション研究会
    • Data Source
      KAKENHI-PROJECT-20K19742
  • [Presentation] 疎グラフに対するアルゴリズム的メタ定理2021

    • Author(s)
      小林靖明
    • Organizer
      日本OR学会 RAMP数理最適化シンポジウム
    • Invited
    • Data Source
      KAKENHI-PROJECT-20K19742
  • [Presentation] Reconfiguring directed trees in a digraph2021

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
    • Organizer
      27th International Computing and Combinatorics Conference (COCOON 2021)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Reconfiguration of envy-free item allocations2021

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Organizer
      Workshop on Combinatorial Reconfiguration, affiliated with ICALP 2021
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Max-min 3-dispersion on a convex polygon2021

    • Author(s)
      Yasuaki Kobayashi, Shin-ichi Nakano, Kei Uchizawa, Takeaki Uno, Yutaro Yamaguchi, Katsuhisa Yamanaka
    • Organizer
      37th European Workshop on Computational Geometry (EuroCG 2021)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Reconfiguring directed trees in a digraph2021

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
    • Organizer
      Workshop on Combinatorial Reconfiguration, affiliated with ICALP 2021
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] 順列グラフのカラフル独立集合問題に対するアルゴリズム2021

    • Author(s)
      吉村仁志,小林靖明,山本章博
    • Organizer
      情報処理学会 第182回アルゴリズム研究会
    • Data Source
      KAKENHI-PROJECT-20K19742
  • [Presentation] 大きな極大マッチングの多項式遅延列挙2021

    • Author(s)
      栗田 和宏, 小林 靖明, 和佐 州洋
    • Organizer
      2021年度人工知能学会全国大会
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Complexity of reconfiguration of regular induced subgraphs2021

    • Author(s)
      Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Token sliding on directed graphs2021

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Masahiro Takahashi, Yota Otachi, Kunihiro Wasa
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Max-Min 3-dispersion on a Convex Polygon2021

    • Author(s)
      Yasuaki Kobayashi, Shin-Ichi Nakano, Kei Uchizawa, Takeaki Uno, Yutaro Yamaguchi, Katsuhisa Yamanaka
    • Organizer
      EuroCG
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-20K19742
  • [Presentation] Reformist envy-free item allocations: algorithms and complexity2021

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Organizer
      第183回情報処理学会アルゴリズム研究会
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Max-Min dispersion on a Convex Polygon2021

    • Author(s)
      Yasuaki Kobayashi, Shin-ichi Nakano, Kei Uchizawa, Takeaki Uno, Yutaro Yamaguchi, Katsuhisa Yamanaka
    • Organizer
      Proceedings of the European Workshop on Computational Geometry (EuroCG 2021)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Presentation] Max-Min 3-dispersion on a Convex Polygon2021

    • Author(s)
      Yasuaki Kobayashi, Shin-Ichi Nakano, Kei Uchizawa, Takeaki Uno, Yutaro Yamaguchi, Katsuhisa Yamanaka
    • Organizer
      The 37th European Workshop on Computational Geometry (EuroCG 2021)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-20K19742
  • [Presentation] Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Cardinality Constraints2020

    • Author(s)
      Kazuhiro Kurita, Yasuaki Kobayashi and Kunihiro Wasa
    • Organizer
      Fourth International Workshop on Enumeration Problems and Applications
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-20K19742
  • [Presentation] 多様な部分グラフを発見するアルゴリズム2020

    • Author(s)
      土中哲秀,小林靖明,栗田和宏,大舘陽太
    • Organizer
      第113回人工知能基本問題研究会
    • Data Source
      KAKENHI-PROJECT-20K19742
  • [Presentation] 単調な性質を持つサイズ制約付き極小解の近似列挙アルゴリズム2020

    • Author(s)
      小林靖明,栗田和宏,和佐州洋
    • Organizer
      日本OR学会 超スマート社会のシステムデザインのための理論と応用研究部会
    • Invited
    • Data Source
      KAKENHI-PROJECT-20K19742
  • [Presentation] 可換マッチング問題の固定パラメーター容易性に関する研究2020

    • Author(s)
      久保田 稜,小島 健介,小林 靖明,○山本 章博
    • Organizer
      人工知能学会 第112回人工知能基本問題研究会(SIG-FPAI)
    • Data Source
      KAKENHI-PROJECT-17H01788
  • [Presentation] An improved deterministic parameterized algorithm for cactus vertex deletion2020

    • Author(s)
      Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
    • Organizer
      電子情報通信学会 コンピュテーション研究会
    • Data Source
      KAKENHI-PROJECT-20K19742
  • [Presentation] Polynomial delay enumeration for Steiner problems2020

    • Author(s)
      Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
    • Organizer
      電子情報通信学会 コンピュテーション研究会
    • Data Source
      KAKENHI-PROJECT-20K19742
  • [Presentation] Efficient enumeration of minimal multiway cuts2020

    • Author(s)
      栗田和宏,小林靖明
    • Organizer
      情報処理学会 第177回アルゴリズム研究会
    • Data Source
      KAKENHI-PROJECT-20K19742
  • [Presentation] 混合整数線形計画法に基づく実現可能性を考慮した反事実的説明法2020

    • Author(s)
      金森 憲太朗, 高木 拓也, 小林 健, 有村 博紀
    • Organizer
      2020年度人工知能学会全国大会 (JSAI2020)
    • Data Source
      KAKENHI-PROJECT-20H00595
  • [Presentation] 可換マッチング問題の固定パラメーター容易性に関する研究2020

    • Author(s)
      久保田稜,小島健介,小林靖明,山本章博
    • Organizer
      人工知能学会,第113回人工知能基本問題研究会
    • Data Source
      KAKENHI-PROJECT-20K19742
  • [Presentation] Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with cardinality constraints2020

    • Author(s)
      Kazuhiro Kurita, Yasuaki Kobayashi, Kunihiro Wasa
    • Organizer
      4th International Workshop on Enumeration Problems and Applications (WEPA 2020)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Fixed-parameter algorithms for graph constraint logic2020

    • Author(s)
      Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz M?hlenthaler, Akira Suzuki
    • Organizer
      15th International Symposium on Parameterized and Exact Computation (IPEC 2020)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] 文字列データの線形最小汎化問題に対するアルゴリズム2019

    • Author(s)
      里見 琢聞, 小林 靖明, 山本 章博
    • Organizer
      第109回人工知能基本問題研究会
    • Data Source
      KAKENHI-PROJECT-17H01788
  • [Presentation] 整数計画法による木構造データ間のアラインメント距離の計算2018

    • Author(s)
      久保田稜,小林靖明,山本章博
    • Organizer
      人工知能学会人工知能基本問題研究会(第106回)
    • Data Source
      KAKENHI-PROJECT-17H01788
  • [Presentation] 頂点被覆数の小さいグラフの最適消去木の計算について2015

    • Author(s)
      小林 靖明,玉木久夫
    • Organizer
      情報処理学会
    • Place of Presentation
      鹿児島
    • Year and Date
      2015-11-20
    • Data Source
      KAKENHI-PROJECT-26880018
  • [Presentation] On the pathwidth of almost semicomplete digraphs2015

    • Author(s)
      Kenta Kitsunai, Yasuaki Kobayashi, Hisao Tamaki
    • Organizer
      The 23rd Annual European Symposium on Algorithms
    • Place of Presentation
      Patras, Greece
    • Year and Date
      2015-09-14
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26880018
  • [Presentation] 準完全有向グラフとその一般化に対するパス幅計算について2015

    • Author(s)
      橘内謙太,小林靖明,玉木久夫
    • Organizer
      情報処理学会
    • Place of Presentation
      東京
    • Year and Date
      2015-03-03
    • Data Source
      KAKENHI-PROJECT-26880018
  • [Presentation] Improved fixed parameter algorithm for two-layer crossing minimization

    • Author(s)
      Yasuaki Kobayashi, Hisao Tamaki
    • Organizer
      情報処理学会
    • Place of Presentation
      愛知
    • Year and Date
      2015-01-13 – 2015-01-14
    • Data Source
      KAKENHI-PROJECT-26880018
  • 1.  Yamamoto Akihiro (30230535)
    # of Collaborated Projects: 3 results
    # of Collaborated Products: 3 results
  • 2.  ITO Takehiro (40431548)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 48 results
  • 3.  大舘 陽太 (80610196)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 29 results
  • 4.  久保山 哲二 (80302660)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 5.  和佐 州洋 (00781337)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 21 results
  • 6.  山内 由紀子 (10546518)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 7.  有村 博紀 (20222763)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 7 results
  • 8.  宇野 毅明 (00302977)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 1 results
  • 9.  平田 耕一 (20274558)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 10.  ジョーダン チャールズハロルド (60647577)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 11.  喜田 拓也 (70343316)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 12.  宋 剛秀 (00625121)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 13.  野崎 雄太 (40822648)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 1 results
  • 14.  玉木 久夫 (20111354)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 2 results
  • 15.  齋藤 寿樹 (00590390)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 16.  川原 純 (20572473)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 17.  吉仲 亮 (80466424)
    # 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: 7 results
  • 20.  栗田 和宏
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 2 results
  • 21.  宇野 裕之
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results
  • 22.  岡本 吉央
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results
  • 23.  小関 健太
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results
  • 24.  前澤 俊一
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results
  • 25.  小野 廣隆
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 2 results
  • 26.  中島 祐人
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results
  • 27.  鈴木 顕
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results

URL: 

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi