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

KOBAYASHI Yusuke  小林 佑輔

ORCIDConnect your ORCID iD *help
Researcher Number 40581591
Other IDs
Affiliation (Current) 2020: 京都大学, 数理解析研究所, 准教授
Affiliation (based on the past Project Information) *help 2018 – 2020: 京都大学, 数理解析研究所, 准教授
2015 – 2018: 筑波大学, システム情報系, 准教授
2014: 筑波大学, システム情報工学研究科(系), 准教授
2014: 東京大学, 大学院情報理工学系研究科, 助教
2011 – 2014: 東京大学, 情報理工学(系)研究科, 助教
2010 – 2011: 東京大学, 大学院・情報理工学系研究科, 助教
Review Section/Research Field
Principal Investigator
Fundamental theory of informatics / Mathematical informatics / Basic Section 60020:Mathematical informatics-related
Except Principal Investigator
Social systems engineering/Safety system / Engineering fundamentals / Science and Engineering / Information science, computer engineering, and related fields / Medium-sized Section 7:Economics, business administration, and related fields / Broad Section J / Transformative Research Areas, Section (IV)
Keywords
Principal Investigator
アルゴリズム / グラフ / 組合せ最適化 / グラフアルゴリズム / グラフ理論 / 辺素パス問題 / グラフマイナー理論 / 多項式時間
Except Principal Investigator
アルゴリズム / 離散最適化 … More / 数理工学 / 最適化 / スケジューリング / 凸関数 / 双対性 / 劣モジュラ関数 / マトロイド / computation / 計算量 / 反マトロイド / 回路計算量 / 実数計算量 / 計算複雑度 / 老朽化 / 都市インフラ / 地方分権 / アセットマネジメント / フリーライダー / コンパクトシティ / 人口減少 / 財政逼迫 / 公共施設 / 選択と集中 / 広域連携 / 自治体実装 / 錐最適化 / 半正定値最適化 / 二重非負値最適化 / 共正値最適化 / 線形計画問題 / 二重非負値錐 / 共正値錐 / 線形計画法 / 勾配法 / 半正定値錐 / 半正定値計画問題 / 半正定値基 / ネットワーク / 最適化理論 / 応用数学 / データ分析 / ネットワーク理論 / 被覆問題 / グラフ探索 / 遷移可能性 / ナッシュ均衡 / 計算幾何 / 貪慾法 / 算法設計 / 電動自動車 / 移動革命 / インフラ維持管理 / 受益者負担 / 交通課金 / グラフアルゴリズム / 離散数学 / 組合せ最適化 / 分散計算 / サブモジュラー関数 / グラフ / 計算理論 / 組合せ遷移 / 数学 Less
  • Research Projects

    (13 results)
  • Research Products

    (125 results)
  • Co-Researchers

    (50 People)
  •  組合せ最適化における多面体手法の高度化Principal InvestigatorOngoing

    • Principal Investigator
      小林 佑輔
    • Project Period (FY)
      2020 – 2023
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Review Section
      Basic Section 60020:Mathematical informatics-related
    • Research Institution
      Kyoto University
  •  Development of Combinatorial Reconfiguration by Mathematics Approach: From Examples to New MethodsOngoing

    • Principal Investigator
      岡本 吉央
    • Project Period (FY)
      2020 – 2022
    • Research Category
      Grant-in-Aid for Transformative Research Areas (B)
    • Review Section
      Transformative Research Areas, Section (IV)
    • Research Institution
      The University of Electro-Communications
  •  走行税課金による道路インフラ維持管理-EV化と車両認証のデジタル時代を迎えて-Ongoing

    • Principal Investigator
      大澤 義明
    • Project Period (FY)
      2019 – 2022
    • Research Category
      Grant-in-Aid for Challenging Research (Pioneering)
    • Review Section
      Medium-sized Section 7:Economics, business administration, and related fields
    • Research Institution
      University of Tsukuba
  •  Large Graphs: Theory and AlgorithmsOngoing

    • Principal Investigator
      河原林 健一
    • Project Period (FY)
      2018 – 2022
    • Research Category
      Grant-in-Aid for Scientific Research (S)
    • Review Section
      Broad Section J
    • Research Institution
      National Institute of Informatics
  •  Analysis of unbounded scheduling problemsOngoing

    • Principal Investigator
      河村 彰星
    • Project Period (FY)
      2017 – 2020
    • Research Category
      Grant-in-Aid for Challenging Research (Exploratory)
    • Research Field
      Information science, computer engineering, and related fields
    • Research Institution
      Kyoto University
      Kyushu University
  •  Optimization problems with time and it's applications on networks.

    • Principal Investigator
      SHIGENO Maiko
    • Project Period (FY)
      2016 – 2019
    • Research Category
      Grant-in-Aid for Scientific Research (B)
    • Research Field
      Social systems engineering/Safety system
    • Research Institution
      University of Tsukuba
  •  Study on Theory of Combinatorial Optimization with Applications to Robust Network DesignPrincipal Investigator

    • Principal Investigator
      Kobayashi Yusuke
    • Project Period (FY)
      2016 – 2019
    • Research Category
      Grant-in-Aid for Young Scientists (B)
    • Research Field
      Mathematical informatics
    • Research Institution
      Kyoto University
      University of Tsukuba
  •  Construction of basic theory to accelerate the utilization of conic optimization in the real world

    • Principal Investigator
      Yoshise Akiko
    • Project Period (FY)
      2015 – 2018
    • Research Category
      Grant-in-Aid for Scientific Research (B)
    • Research Field
      Social systems engineering/Safety system
    • Research Institution
      University of Tsukuba
  •  Theory and Experimental Study of Selecting, Consolidating, and Overhauling Aged Urban Infrastructures

    • Principal Investigator
      OHSAWA Yoshiaki
    • Project Period (FY)
      2013 – 2016
    • Research Category
      Grant-in-Aid for Scientific Research (A)
    • Research Field
      Social systems engineering/Safety system
    • Research Institution
      University of Tsukuba
  •  Exploring the limits of computation from mathematical logic

    • Principal Investigator
      Makino Kazuhisa
    • Project Period (FY)
      2012 – 2016
    • Research Category
      Grant-in-Aid for Scientific Research on Innovative Areas (Research in a proposed research area)
    • Review Section
      Science and Engineering
    • Research Institution
      Kyoto University
  •  Using dual concepts in graph minor algorithmsPrincipal Investigator

    • Principal Investigator
      KOBAYASHI Yusuke
    • Project Period (FY)
      2012 – 2016
    • Research Category
      Grant-in-Aid for Young Scientists (B)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      University of Tsukuba
      The University of Tokyo
  •  Research on algorithms based on graph minor theoryPrincipal Investigator

    • Principal Investigator
      KOBAYASHI Yusuke
    • Project Period (FY)
      2010 – 2011
    • Research Category
      Grant-in-Aid for Research Activity Start-up
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      The University of Tokyo
  •  Unified Optimization Theory by Discrete Convex Paradigm

    • Principal Investigator
      MUROTA Kazuo
    • Project Period (FY)
      2009 – 2014
    • Research Category
      Grant-in-Aid for Scientific Research (B)
    • Research Field
      Engineering fundamentals
    • Research Institution
      The University of Tokyo

All 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 Other

All Journal Article Presentation Book

  • [Book] 基礎数学Ⅳ2019

    • Author(s)
      山本芳嗣(編著)安東弘泰,小林佑輔,佐野良夫,繁野麻衣子,八森正泰 他著
    • Total Pages
      360
    • Publisher
      東京化学同人
    • ISBN
      9784807914968
    • Data Source
      KAKENHI-PROJECT-16H03118
  • [Book] 巨大地震による複合災害-発生メカニズム・被害・都市や地域の復興-2015

    • Author(s)
      大澤義明,小林隆史,太田尚孝 他
    • Total Pages
      210
    • Publisher
      筑波大学出版会
    • Data Source
      KAKENHI-PROJECT-25242029
  • [Journal Article] A strongly polynomial time algorithm for the maximum supply rate problem on trees2020

    • Author(s)
      Takayama Koki、Kobayashi Yusuke
    • Journal Title

      Theoretical Computer Science

      Volume: 806 Pages: 323-331

    • DOI

      10.1016/j.tcs.2019.05.014

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-16H03118, KAKENHI-PROJECT-16K16010
  • [Journal Article] Linear min-max relation between the treewidth of an H-minor-free graph and its largest grid minor2020

    • Author(s)
      Ken-ichi Kawarabayashi and Yusuke Kobayashi
    • Journal Title

      Journal of Combinatorial Theory, Series B

      Volume: 141 Pages: 165-180

    • DOI

      10.1016/j.jctb.2019.07.007

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-16K16010, KAKENHI-PROJECT-18H05291
  • [Journal Article] An FPT algorithm for minimum additive spanner problem2020

    • Author(s)
      Yusuke Kobayashi
    • Journal Title

      Proceedings of STACS 2020

      Volume: -

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-16K16010
  • [Journal Article] Shortest reconfiguration of colorings under Kempe-changes2020

    • Author(s)
      Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Muhlenthaler, Akira Suzuki, and Kunihiro Wasa
    • Journal Title

      Proceedings of STACS 2020

      Volume: -

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K16010
  • [Journal Article] On the number of edges in a graph with many two-hop disjoint paths2020

    • Author(s)
      Takayama Koki、Kobayashi Yusuke
    • Journal Title

      Discrete Applied Mathematics

      Volume: -

    • DOI

      10.1016/j.dam.2020.01.003

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16H03118
  • [Journal Article] Parameterized algorithms for maximum cut with connectivity constraints2019

    • Author(s)
      Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, and Yusuke Kobayashi
    • Journal Title

      Proceedings of IWOCA 2019

      Volume: -

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-16K16010
  • [Journal Article] An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number2019

    • Author(s)
      Kobayashi Yasuaki、Kobayashi Yusuke、Miyazaki Shuichi、Tamaki Suguru
    • Journal Title

      Proceedings of IWOCA 2019

      Volume: 30 Pages: 327-338

    • DOI

      10.1007/978-3-030-25005-8_27

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-18H05291, KAKENHI-PROJECT-18H04090, KAKENHI-PROJECT-16K16010
  • [Journal Article] The perfect matching reconfiguration problem2019

    • Author(s)
      Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Muhlenthaler, and Kunihiro Wasa
    • Journal Title

      Proceedings of MFCS 2019

      Volume: -

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K16010
  • [Journal Article] Improved analysis of highest-degree branching for feedback vertex set2019

    • Author(s)
      Yoichi Iwata and Yusuke Kobayashi
    • Journal Title

      Proceedings of IWOCA 2019

      Volume: -

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-16K16010
  • [Journal Article] Parameterized algorithms for maximum cut with connectivity constraints2019

    • Author(s)
      Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, and Yusuke Kobayashi
    • Journal Title

      Proceedings of the 14th International Symposium on Parameterized and Exact Computation (IPEC 2019) / Leibniz International Proceedings in Informatics (LIPIcs)

      Volume: 148

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-17K19960
  • [Journal Article] Diameter of Colorings Under Kempe Changes2019

    • Author(s)
      Bonamy Marthe、Heinrich Marc、Ito Takehiro、Kobayashi Yusuke、Mizuta Haruka、Muehlenthaler Moritz、Suzuki Akira、Wasa Kunihiro
    • Journal Title

      Proceedings of COCOON 2019

      Volume: 11653 Pages: 52-64

    • DOI

      10.1007/978-3-030-26176-4_5

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-18H05291, KAKENHI-PROJECT-16K16010
  • [Journal Article] Improved analysis of highest-degree branching for feedback vertex set2019

    • Author(s)
      Yoichi Iwata and Yusuke Kobayashi
    • Journal Title

      Proceedings of the 14th International Symposium on Parameterized and Exact Computation (IPEC 2019) / Leibniz International Proceedings in Informatics (LIPIcs)

      Volume: 148

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-17K19960
  • [Journal Article] The perfect matching reconfiguration problem2019

    • Author(s)
      Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Muhlenthaler, and Kunihiro Wasa
    • Journal Title

      Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019) / Leibniz International Proceedings in Informatics (LIPIcs)

      Volume: 138

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K19960
  • [Journal Article] Two disjoint shortest paths problem with non-negative edge length2019

    • Author(s)
      Kobayashi Yusuke、Sako Ryo
    • Journal Title

      Operations Research Letters

      Volume: 47 Pages: 66-69

    • DOI

      10.1016/j.orl.2018.11.012

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-16K16010, KAKENHI-PROJECT-16H03118
  • [Journal Article] Shortest reconfiguration of perfect matchings via alternating cycles2019

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

      Proceedings of ESA 2019

      Volume: -

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-16K16010
  • [Journal Article] Shortest reconfiguration of perfect matchings via alternating cycles2019

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

      Proceedings of the 27th European Symposium on Algorithms (ESA 2019) / Leibniz International Proceedings in Informatics (LIPIcs)

      Volume: 144

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-17K19960
  • [Journal Article] NP-hardness and fixed-parameter tractability of the minimum spanner problem2018

    • Author(s)
      Kobayashi Yusuke
    • Journal Title

      Theoretical Computer Science

      Volume: 746 Pages: 88-97

    • DOI

      10.1016/j.tcs.2018.06.031

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-16K16010, KAKENHI-PROJECT-16H03118
  • [Journal Article] All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs2018

    • Author(s)
      Kawarabayashi Ken-ichi、Kobayashi Yusuke
    • Journal Title

      SIAM Journal on Computing

      Volume: 47 Pages: 1483-1504

    • DOI

      10.1137/130932326

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-16K16010
  • [Journal Article] A Strongly Polynomial Time Algorithm for the Maximum Supply Rate Problem on Trees2018

    • Author(s)
      Takayama Koki、Kobayashi Yusuke
    • Journal Title

      Theoretical Computer Science

      Volume: - Pages: 54-67

    • DOI

      10.1007/978-3-319-78455-7_5

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-16K16010, KAKENHI-PROJECT-16H03118, KAKENHI-PROJECT-18H05291
  • [Journal Article] Tight Approximability of the Server Allocation Problem for Real-Time Applications2018

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

      Proceedings of the 3rd International Workshop on Algorithmic Aspects of Cloud Computing

      Volume: --- Pages: 41-55

    • DOI

      10.1007/978-3-319-74875-7_4

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-15K00009, KAKENHI-PROJECT-16K00004, KAKENHI-PROJECT-17K00028, KAKENHI-PROJECT-16K16010, KAKENHI-PROJECT-16H03118
  • [Journal Article] Reconfiguration of maximum-weight b-matchings in a graph2018

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

      Journal of Combinatorial Optimization

      Volume: 37 Pages: 454-464

    • DOI

      10.1007/s10878-018-0289-3

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-17K00028, KAKENHI-PROJECT-16K16010, KAKENHI-PROJECT-16H03118, KAKENHI-PROJECT-16K00004
  • [Journal Article] Finding a Shortest Non-zero Path in Group-Labeled Graphs via Permanent Computation2017

    • Author(s)
      Yusuke Kobayashi and Sho Toyooka
    • Journal Title

      Algorithmica

      Volume: 77 Pages: 1128-1142

    • DOI

      10.1007/s00453-016-0142-y

    • NAID

      120006223989

    • Peer Reviewed / Acknowledgement Compliant / Open Access
    • Data Source
      KAKENHI-PROJECT-24700004, KAKENHI-PLANNED-24106002
  • [Journal Article] Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs2017

    • Author(s)
      Kakimura Naonori、Kawarabayashi Ken-ichi、Kobayashi Yusuke
    • Journal Title

      SIAM J. Discrete Math.

      Volume: 31 Pages: 766-782

    • DOI

      10.1137/15m1022239

    • Peer Reviewed
    • Data Source
      KAKENHI-PLANNED-24106002
  • [Journal Article] Efficient stabilization of cooperative matching games2017

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

      Theor. Comput. Sci.

      Volume: 印刷中 Pages: 69-82

    • DOI

      10.1016/j.tcs.2017.03.020

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PUBLICLY-15H00849, KAKENHI-PROJECT-16K00004, KAKENHI-PLANNED-24106002
  • [Journal Article] Packing edge-disjoint odd Eulerian subgraphs through prescribed vertices in 4-edge-connected graphs2017

    • Author(s)
      Naonori Kakimura, Ken-ichi Kawarabayashi, and Yusuke Kobayashi
    • Journal Title

      SIAM Journal on Discrete Mathematics

      Volume: 印刷中

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-24700004
  • [Journal Article] A weighted linear matroid parity algorithm2017

    • Author(s)
      Iwata Satoru、Kobayashi Yusuke
    • Journal Title

      STOC

      Volume: - Pages: 264-276

    • DOI

      10.1145/3055399.3055436

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-16K16010, KAKENHI-PLANNED-24106002
  • [Journal Article] Complexity of the Multi-Service Center Problem2017

    • Author(s)
      Ito Takehiro、Kakimura Naonori、Kobayashi Yusuke
    • Journal Title

      Proceedings of the 28th International Symposium on Algorithms and Computation

      Volume: 92

    • DOI

      10.4230/LIPIcs.ISAAC.2017.48

    • Language
      English
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-16K00004, KAKENHI-PROJECT-17K00028, KAKENHI-PROJECT-16K16010, KAKENHI-PROJECT-16H03118
  • [Journal Article] Randomized strategies for cardinality robustness in the knapsack problem2017

    • Author(s)
      Yusuke Kobayashi and Kenjiro Takazawa
    • Journal Title

      TCS

      Volume: 699 Pages: 53-62

    • DOI

      10.1016/j.tcs.2016.12.019

    • NAID

      120006373957

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16K16012, KAKENHI-PLANNED-24106002, KAKENHI-PROJECT-26280001
  • [Journal Article] Reconfiguration of Maximum-Weight b-Matchings in a Graph2017

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

      Proceedings of the 23rd Annual International Computing and Combinatorics Conference

      Volume: --- Pages: 287-296

    • DOI

      10.1007/978-3-319-62389-4_24

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-15K00009, KAKENHI-PROJECT-16K00004, KAKENHI-PROJECT-17K00028, KAKENHI-PROJECT-16K16010, KAKENHI-PROJECT-16H03118
  • [Journal Article] The Directed Disjoint Shortest Paths Problem2017

    • Author(s)
      Kristof Berczi and Yusuke Kobayashi
    • Journal Title

      Proceedings of the 25th European Symposium on Algorithms (ESA 2017)

      Volume: -

    • DOI

      10.4230/LIPIcs.ESA.2017.13

    • Language
      English
    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K16010
  • [Journal Article] Covering Intersecting Bi-set Families under Matroid Constraints2016

    • Author(s)
      Kristof Berczi, Tamas Kiraly, and Yusuke Kobayashi
    • Journal Title

      SIAM J. Discrete Math.

      Volume: 30 Pages: 1758-1774

    • DOI

      10.1137/15m1049099

    • NAID

      120005867141

    • Peer Reviewed / Acknowledgement Compliant / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-25242029, KAKENHI-PROJECT-26280004, KAKENHI-PROJECT-24700004, KAKENHI-PROJECT-16K16010, KAKENHI-PLANNED-24106002
  • [Journal Article] Edge-disjoint odd cycles in 4-edge-connected graphs2016

    • Author(s)
      Ken-ichi Kawarabayashi, Yusuke Kobayashi
    • Journal Title

      Journal of Combinatorial Theory, Series B

      Volume: 119 Pages: 12-27

    • DOI

      10.1016/j.jctb.2015.12.002

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PLANNED-24106003, KAKENHI-PROJECT-25242029, KAKENHI-PROJECT-24700004, KAKENHI-PLANNED-24106002
  • [Journal Article] An improved approximation algorithm for the edge-disjoint paths problem with congestion two2016

    • Author(s)
      Ken-ichi Kawarabayashi, Yusuke Kobayashi
    • Journal Title

      ACM Transactions on Algorithms

      Volume: 13 Pages: 1-17

    • DOI

      10.1145/2960410

    • NAID

      120006023362

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PLANNED-24106003, KAKENHI-PROJECT-25242029, KAKENHI-PROJECT-24700004, KAKENHI-PROJECT-16K16010, KAKENHI-PLANNED-24106002
  • [Journal Article] Improved max-flow min-cut algorithms in a circular disk failure model with application to a road network2016

    • Author(s)
      Kensuke Otsuki, Yusuke Kobayashi, and Kazuo Murota
    • Journal Title

      European Journal of Operational Research

      Volume: 248 Pages: 396-403

    • DOI

      10.1016/j.ejor.2015.07.035

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-24700004, KAKENHI-PROJECT-26280004, KAKENHI-PLANNED-24106002
  • [Journal Article] Improved max-flow min-cut algorithms in a circular disk failure model with application to a road network2016

    • Author(s)
      Kensuke Otsuki, Yusuke Kobayashi, and Kazuo Murota
    • Journal Title

      European Journal of Operational Research

      Volume: 248 Pages: 396-403

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-25242029
  • [Journal Article] The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs2015

    • Author(s)
      Ken-ichi Kawarabayashi and Yusuke Kobayashi
    • Journal Title

      Combinatorica

      Volume: 35 Pages: 477-495

    • DOI

      10.1007/s00493-014-2828-6

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-24700004, KAKENHI-PLANNED-24106003, KAKENHI-PLANNED-24106002
  • [Journal Article] The generalized terminal backup problem2015

    • Author(s)
      Attila Bernath, Yusuke Kobayashi, and Tatsuya Matsuoka
    • Journal Title

      SIAM Journal on Discrete Mathematics

      Volume: 29 Pages: 1764-1782

    • DOI

      10.1137/140972858

    • Peer Reviewed / Acknowledgement Compliant / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-24700004, KAKENHI-PLANNED-24106002
  • [Journal Article] Fence patrolling by mobile agents with distinct speeds2015

    • Author(s)
      A. Kawamura,Y. Kobayashi
    • Journal Title

      Distributed Computing

      Volume: 28 Pages: 147-154

    • DOI

      10.1007/s00446-014-0226-3

    • Peer Reviewed
    • Data Source
      KAKENHI-PLANNED-24106002
  • [Journal Article] The complexity of minimizing the difference of two M#-convex set functions2015

    • Author(s)
      Yusuke Kobayashi
    • Journal Title

      Operations Research Letters

      Volume: 43 Pages: 573-574

    • DOI

      10.1016/j.orl.2015.08.011

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-24700004, KAKENHI-PROJECT-26280004, KAKENHI-PLANNED-24106002
  • [Journal Article] Routing algorithms under mutual interference constraints2015

    • Author(s)
      Kota Ishihara and Yusuke Kobayashi
    • Journal Title

      Journal of the Operations Research Society of Japan

      Volume: 58 Pages: 209-222

    • NAID

      130005096749

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-24700004
  • [Journal Article] Finding a path in group-labeled graphs with two labels forbidden2015

    • Author(s)
      Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 9134 Pages: 797-809

    • DOI

      10.1007/978-3-662-47672-7_65

    • Peer Reviewed
    • Data Source
      KAKENHI-PLANNED-24106002
  • [Journal Article] Triangle-free 2-matchings and M-concave functions on jump systems2014

    • Author(s)
      Y. Kobayashi
    • Journal Title

      Discrete Applied Mathematics

      Volume: 175 Pages: 35-42

    • DOI

      10.1016/j.dam.2014.05.016

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-21360045, KAKENHI-PROJECT-24700004, KAKENHI-PROJECT-26280004, KAKENHI-PLANNED-24106002
  • [Journal Article] An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem2014

    • Author(s)
      K. Kawarabayashi, Y. Kobayashi, and S. Kreutzer
    • Journal Title

      STOC 2014

      Volume: - Pages: 70-78

    • DOI

      10.1145/2591796.2591876

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-24700004, KAKENHI-PLANNED-24106002
  • [Journal Article] The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs2014

    • Author(s)
      K. Kawarabayashi and Y. Kobayashi
    • Journal Title

      Combinatorica

      Volume: 未定

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-24700004
  • [Journal Article] The Generalized Terminal Backup Problem2014

    • Author(s)
      Attila Bernath, Yusuke Kobayashi
    • Journal Title

      SODA

      Volume: 25 Pages: 1678-1686

    • DOI

      10.1137/1.9781611973402.121

    • Peer Reviewed
    • Data Source
      KAKENHI-PLANNED-24106002
  • [Journal Article] Selecting vertex disjoint paths in plane graphs2014

    • Author(s)
      H. Flier, Y. Kobayashi, M. Mihalak, A. Schobel, P. Widmayer, and A. Zych
    • Journal Title

      Networks

      Volume: 未定

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-24700004
  • [Journal Article] Minimum-cost $b$-edge dominating sets on trees2014

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

      ISAAC 2014

      Volume: 8889 Pages: 195-207

    • DOI

      10.1007/978-3-319-13075-0_16

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PLANNED-24106005, KAKENHI-PROJECT-24700004, KAKENHI-PROJECT-24700008, KAKENHI-PUBLICLY-25106504, KAKENHI-PROJECT-25330003, KAKENHI-PROJECT-25730001, KAKENHI-PLANNED-24106002
  • [Journal Article] 給油所過疎地域に関する数理的考察2014

    • Author(s)
      盆子原歩,小林隆史,大澤義明
    • Journal Title

      都市計画論文集

      Volume: 49 Pages: 603-608

    • NAID

      130004700752

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-25242029
  • [Journal Article] Max-flow min-cut theorem and faster algorithms in a circular disk failure model2014

    • Author(s)
      Y. Kobayashi and K. Otsuki
    • Journal Title

      INFOCOM 2014

      Volume: - Pages: 1635-1643

    • DOI

      10.1109/infocom.2014.6848100

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-24700004, KAKENHI-PLANNED-24106002
  • [Journal Article] All-or-nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs2013

    • Author(s)
      Ken-ichi Kawarabayashi, Yusuke Kobayashi
    • Journal Title

      FOCS

      Volume: 54 Pages: 383-386

    • DOI

      10.1109/focs.2013.28

    • Peer Reviewed
    • Data Source
      KAKENHI-PLANNED-24106002
  • [Journal Article] Triangle-free 2-matchings and M-concave Functions on Jump Systems2013

    • Author(s)
      Yusuke Kobayashi
    • Journal Title

      Proceedings of the 8th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications

      Volume: 8 Pages: 383-386

    • Peer Reviewed
    • Data Source
      KAKENHI-PLANNED-24106002
  • [Journal Article] Robust Matchings and Matroid Intersections2013

    • Author(s)
      R. Fujita, Y. Kobayashi, and K. Makino
    • Journal Title

      SIAM J. Discrete Math.

      Volume: 27 Pages: 1234-1256

    • DOI

      10.1137/100808800

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21360045, KAKENHI-PROJECT-22500007, KAKENHI-PLANNED-24106002, KAKENHI-PROJECT-24700004
  • [Journal Article] An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs2013

    • Author(s)
      K. Kawarabayashi and Y. Kobayashi
    • Journal Title

      ACM Transactions on Algorithms

      Volume: 9 Pages: 1-13

    • DOI

      10.1145/2438645.2438648

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21360045, KAKENHI-PLANNED-24106003, KAKENHI-PROJECT-24700004
  • [Journal Article] An algorithm for (n-3)-connectivity augmentation problem: jump system approach2012

    • Author(s)
      Kristof Berczi and Yusuke Kobayashi
    • Journal Title

      Journal of Combinatorial Theory, Series B

      Volume: 102 Pages: 565-587

    • DOI

      10.1016/j.jctb.2011.08.007

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22800005
  • [Journal Article] Fixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem2012

    • Author(s)
      K. Kawarabayashi and Y. Kobayashi
    • Journal Title

      Journal of Combinatorial Theory, Series B

      Volume: 102 Pages: 1020-1034

    • DOI

      10.1016/j.jctb.2011.12.001

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21360045, KAKENHI-PROJECT-22800005, KAKENHI-PROJECT-24700004
  • [Journal Article] Algorithms for finding a maximum non-k-linked graph2012

    • Author(s)
      Yusuke Kobayashi and Yuichi Yoshida
    • Journal Title

      SIAM Journal on Discrete Mathematics

      Volume: 26 Pages: 591-604

    • DOI

      10.1137/110846725

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-24700004
  • [Journal Article] Cone superadditivity of discrete convex functions2012

    • Author(s)
      Y. Kobayashi, K. Murota and R. Weismantel
    • Journal Title

      Mathematical Programming, Series A

      Volume: 135 Pages: 25-44

    • DOI

      10.1007/s10107-011-0447-1

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21360045, KAKENHI-PROJECT-24700004
  • [Journal Article] A proof of Cunningham's conjecture on restricted subgraphs and jump systems2012

    • Author(s)
      Y. Kobayashi, J. Szabo, K. Takazawa
    • Journal Title

      Journal of Combinatorial Theory, Series B

      Volume: published online Pages: 948-966

    • DOI

      10.1016/j.jctb.2012.03.003

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23700016, KAKENHI-PROJECT-24700004
  • [Journal Article] Cone superadditivity of discrete convex functions2012

    • Author(s)
      Y.Kobayashi, K.Murota, R.Weismantel
    • Journal Title

      Mathematical Programming, Series A

      Volume: (印刷中)(掲載確定)

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Journal Article] A linear time algorithm for the induced disjoint paths problem in planar graphs2012

    • Author(s)
      K.Kawarabayashi, Y.Kobayashi
    • Journal Title

      Journal of Computer and System Sciences

      Volume: 78 Pages: 670-680

    • DOI

      10.1016/j.jcss.2011.10.004

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21684002, KAKENHI-PROJECT-22800005
  • [Journal Article] An algorithm for finding a maximum t-matching excluding complete partite subgraphs2012

    • Author(s)
      Y.Kobayashi, X.Yin
    • Journal Title

      Discrete Optimization

      Volume: (印刷中)(掲載確定)

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Journal Article] The disjoint paths problem in quadratic time2012

    • Author(s)
      Ken-ichi Kawarabayashi, Yusuke Kobayashi, and Bruce Reed
    • Journal Title

      Journal of Combinatorial Theory,Series B

      Volume: 102 Pages: 424-435

    • DOI

      10.1016/j.jctb.2011.07.004

    • Data Source
      KAKENHI-PROJECT-22800005
  • [Journal Article] An immersion of a square in $4$-edge-connected graphs2012

    • Author(s)
      Ken-ichi Kawarabayashi and Yusuke Kobayashi
    • Journal Title

      Progress in Informatics

      Volume: 9 Pages: 35-36

    • DOI

      10.2201/niipi.2012.9.7

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22800005
  • [Journal Article] An algorithm for finding a maximum t-matching excluding complete partite subgraphs2012

    • Author(s)
      Yusuke Kobayashi and Xin Yin
    • Journal Title

      Discrete Optimization

      Volume: 9 Pages: 98-108

    • DOI

      10.1016/j.disopt.2012.02.003

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-24700004
  • [Journal Article] Testing the (s,t)-disconnectivity of graphs and digraphs2012

    • Author(s)
      Yuichi Yoshida and Yusuke Kobayashi
    • Journal Title

      Theoretical Computer Science

      Volume: 434 Pages: 98-113

    • DOI

      10.1016/j.tcs.2012.01.045

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-24700004
  • [Journal Article] An improved algorithm for the half-disjoint paths problem2011

    • Author(s)
      K. Kawarabayashi and Y. Kobayashi
    • Journal Title

      SIAM Journal on Discrete Mathematics

      Volume: 25 Pages: 1322-1330

    • DOI

      10.1137/100808812

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Journal Article] An Improved Algorithm for the Half-Disjoint Paths Problem2011

    • Author(s)
      Ken-ichi KAWARABAYASHI, Yusuke KOBAYASHI
    • Journal Title

      SIAM Journal on Discrete Mathematics

      Volume: 25 Pages: 1322-1330

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22800005
  • [Journal Article] Cone Superadditivity of Discrete Convex Functions2011

    • Author(s)
      Y.Kobayashi, K.Murota, R.Weismantel
    • Journal Title

      Mathematical Programming, Series A

      Volume: (印刷中(掲載確定))

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Journal Article] A simple algorithm for finding a maximum triangle-free 2-matching in subcubic graphs2010

    • Author(s)
      Y.Kobayashi
    • Journal Title

      Discrete Optimization

      Volume: 7 Pages: 197-202

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Journal Article] The Disjoint Paths Problem in Quadratic Time

    • Author(s)
      Ken-ichi KAWARABAYASHI, Yusuke KOBAYASHI, Bruce REED
    • Journal Title

      Journal of Combinatorial Theory, Series B

      Volume: (印刷中)(掲載確定)

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22800005
  • [Presentation] Restricted 2-matching problems2020

    • Author(s)
      Yusuke Kobayashi
    • Organizer
      International Workshop on Combinatorial Optimization and Algorithmic Game Theory
    • Invited / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K16010
  • [Presentation] An FPT algorithm for minimum additive spanner problem2020

    • Author(s)
      Yusuke Kobayashi
    • Organizer
      37th Symposium on Theoretical Aspects of Computer Science (STACS 2020)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K16010
  • [Presentation] Algorithms for gerrymandering over graphs2019

    • Author(s)
      Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
    • Organizer
      18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2019)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K16010
  • [Presentation] A weighted linear matroid parity algorithm2018

    • Author(s)
      小林佑輔
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Invited
    • Data Source
      KAKENHI-PROJECT-16K16010
  • [Presentation] A weighted linear matroid parity algorithm2018

    • Author(s)
      小林佑輔
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Invited
    • Data Source
      KAKENHI-PROJECT-17K19960
  • [Presentation] A weighted linear matroid parity algorithm2018

    • Author(s)
      Yusuke Kobayashi
    • Organizer
      HIM Follow-up WS to TP Combinatorial Optimization
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K16010
  • [Presentation] 最小スパナー問題の困難性と固定パラメータ容易性2018

    • Author(s)
      小林佑輔
    • Organizer
      応用数理学会年会
    • Data Source
      KAKENHI-PROJECT-16K16010
  • [Presentation] 最小スパナー問題の困難性と固定パラメータ容易性2018

    • Author(s)
      小林佑輔
    • Organizer
      応用数理学会年会
    • Data Source
      KAKENHI-PROJECT-17K19960
  • [Presentation] Weighted linear matroid parity problem2017

    • Author(s)
      Yusuke Kobayashi
    • Organizer
      The 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications
    • Invited / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K16010
  • [Presentation] 需給ネットワーク分割問題における供給率最大化アルゴリズム2017

    • Author(s)
      高山 功輝,小林 佑輔
    • Organizer
      日本応用数理学会2017年研究部会連合発表会
    • Place of Presentation
      電気通信大学(東京都調布市)
    • Year and Date
      2017-03-06
    • Data Source
      KAKENHI-PROJECT-16H03118
  • [Presentation] 需給ネットワーク分割問題における供給率最大化アルゴリズム2017

    • Author(s)
      高山 功輝, 小林 佑輔
    • Organizer
      日本応用数理学会2017年研究部会連合発表会
    • Place of Presentation
      電気通信大学(東京都調布市)
    • Data Source
      KAKENHI-PROJECT-16K16010
  • [Presentation] A weighted linear matroid parity algorithm2017

    • Author(s)
      Yusuke Kobayashi
    • Organizer
      Franco-Japanese Days on Combinatorics and Optmization 2017 in Honour of Michel Deza
    • Invited / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K16010
  • [Presentation] 時間遅れフィードバックによる多粒子系の拡散制御2016

    • Author(s)
      安東弘泰, 小林幹
    • Organizer
      第59回自動制御連合講演会, システム制御情報学会
    • Place of Presentation
      北九州国際会議場(福岡県北九州市)
    • Year and Date
      2016-11-09
    • Data Source
      KAKENHI-PROJECT-16H03118
  • [Presentation] RESASを用いた地域創生を目指す地域解析 -北海道津別町を事例に-2016

    • Author(s)
      小林隆史,大澤義明,竹屋裕樹,湊信乃介
    • Organizer
      オペレーションズ・リサーチ学会2016春季研究発表会
    • Place of Presentation
      慶應義塾大学矢上キャンパス(神奈川県・横浜市)
    • Year and Date
      2016-03-17
    • Data Source
      KAKENHI-PROJECT-25242029
  • [Presentation] The directed disjoint shortest paths problem2016

    • Author(s)
      Yusuke Kobayashi
    • Organizer
      Southern Italian Workshop on Algorithms and Graphs 2016
    • Place of Presentation
      Puglia, Italy
    • Year and Date
      2016-09-25
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-24700004
  • [Presentation] Randomized strategies for cardinality robustness in the knapsack problem2016

    • Author(s)
      Yusuke Kobayashi
    • Organizer
      The 13th Meeting on Analytic Algorithmics and Combinatorics
    • Place of Presentation
      Arlington, Virginia, USA
    • Year and Date
      2016-01-11
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-24700004
  • [Presentation] ネットワーク型交渉ゲームの安定化アルゴリ ズム2016

    • Author(s)
      伊藤建洋,垣村尚徳,神山直之,小林佑輔, 岡本吉央
    • Organizer
      アルゴリズム研究会
    • Place of Presentation
      電気通信大学
    • Data Source
      KAKENHI-PLANNED-24106002
  • [Presentation] 有向木詰め込みに関する最大最小定理2015

    • Author(s)
      小林佑輔
    • Organizer
      日本オペレーションズ・リサーチ学会「最適化の基盤とフロンティア」研究部会(WOO)
    • Place of Presentation
      東京理科大学,東京
    • Year and Date
      2015-03-28
    • Invited
    • Data Source
      KAKENHI-PROJECT-24700004
  • [Presentation] 群ラベル付きグラフにおける最短路アルゴリズム2015

    • Author(s)
      小林佑輔,豊岡 祥
    • Organizer
      日本応用数理学会 研究部会連合発表会
    • Place of Presentation
      明治大学
    • Year and Date
      2015-03-06
    • Data Source
      KAKENHI-PLANNED-24106002
  • [Presentation] Finding a shortest non-zero path in group-labeled graphs2015

    • Author(s)
      Yusuke Kobayashi and Sho Toyooka
    • Organizer
      The 9th Japanese- Hungarian Symposium on Discrete Mathe- matics and Its Applications
    • Place of Presentation
      Fukuoka
    • Year and Date
      2015-06-02
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-24106002
  • [Presentation] 木における最小費用b-辺支配集合問題2015

    • Author(s)
      伊藤建洋,垣村尚徳,神山直之,小林佑輔,岡本吉央
    • Organizer
      日本オペレーションズ・リサーチ学会 春季研究発表会
    • Place of Presentation
      東京理科大学
    • Year and Date
      2015-03-26
    • Data Source
      KAKENHI-PLANNED-24106002
  • [Presentation] Algorithmic aspects of covering supermodular functions under matroid constraints2015

    • Author(s)
      Krist´of B´erczi, Tam´as Kir´aly, and Yusuke Kobayashi
    • Organizer
      The 9th Japanese- Hungarian Symposium on Discrete Mathe- matics and Its Applications
    • Place of Presentation
      Fukuoka
    • Year and Date
      2015-06-02
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-24106002
  • [Presentation] 人口減少地域における道の駅の利用状況2015

    • Author(s)
      川岸卓司,川口明子,小林隆史,大澤義明
    • Organizer
      第29回応用地域学会研究発表大会
    • Place of Presentation
      慶應義塾大学三田キャンパス(東京都・港区)
    • Year and Date
      2015-11-29
    • Data Source
      KAKENHI-PROJECT-25242029
  • [Presentation] Max-flow min-cut theorem and faster algorithms in a circular disk failure model2014

    • Author(s)
      小林佑輔
    • Organizer
      JST ERATO 河原林巨大グラフプロジェクト・感謝祭 Summer 2014
    • Place of Presentation
      国立情報学研究所(東京都千代田区)
    • Year and Date
      2014-08-08
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Presentation] Max-flow min-cut theorem and faster algorithms in a circular disk failure model2014

    • Author(s)
      小林佑輔
    • Organizer
      JST ERATO 河原林巨大グラフプロジェクト・感謝祭 Summer 2014
    • Place of Presentation
      国立情報学研究所,東京
    • Year and Date
      2014-08-08
    • Invited
    • Data Source
      KAKENHI-PROJECT-24700004
  • [Presentation] The generalized terminal backup problem2014

    • Author(s)
      A. Bernath and Y. Kobayashi
    • Organizer
      The 25th Annual ACM-SIAM Symposium on Discrete Algorithms
    • Place of Presentation
      Portland, Oregon, USA
    • Data Source
      KAKENHI-PROJECT-24700004
  • [Presentation] Triangle-free 2-matchings and M-concave functions on jump systems2013

    • Author(s)
      Y. Kobayashi
    • Organizer
      The 8th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications
    • Place of Presentation
      Veszprem, Hungary
    • Data Source
      KAKENHI-PROJECT-24700004
  • [Presentation] Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid minor2013

    • Author(s)
      K. Kawarabayashi and Y. Kobayashi
    • Organizer
      The Asian Mathematical Conference 2013
    • Place of Presentation
      Busan, Korea
    • Invited
    • Data Source
      KAKENHI-PROJECT-24700004
  • [Presentation] All-or-nothing multicommodity flow problem with bounded fractionality in planar graphs2013

    • Author(s)
      K. Kawarabayashi and Y. Kobayashi
    • Organizer
      The 54th Annual IEEE Symposium on Foundations of Computer Science
    • Place of Presentation
      Berkeley, California, USA
    • Data Source
      KAKENHI-PROJECT-24700004
  • [Presentation] 自治体規模からみた給油所過疎地に関する研究2013

    • Author(s)
      盆子原歩・小林隆史・大澤義明
    • Organizer
      日本オペレーションズ・リサーチ学会2013年秋季研究発表会
    • Place of Presentation
      徳島大学
    • Data Source
      KAKENHI-PROJECT-25242029
  • [Presentation] An Algorithm for Finding a Maximum $t$-matching Excluding Complete Partite Subgraphs2012

    • Author(s)
      Y. Kobayashi
    • Organizer
      The 21th International Symposium on Mathematical Programming
    • Place of Presentation
      ベルリン,ドイツ
    • Data Source
      KAKENHI-PLANNED-24106002
  • [Presentation] An algorithm for finding a maximum t-matching excluding complete partite subgraphs2012

    • Author(s)
      Yusuke Kobayashi
    • Organizer
      The 21st International Symposium on Mathematical Programming
    • Place of Presentation
      Berlin, Germany
    • Data Source
      KAKENHI-PROJECT-24700004
  • [Presentation] 点素パス問題に対するアルゴリズム2012

    • Author(s)
      小林佑輔
    • Organizer
      組合せ最適化セミナー
    • Place of Presentation
      京都大学(京都府)
    • Invited
    • Data Source
      KAKENHI-PROJECT-22800005
  • [Presentation] An algorithm for finding a maximum t-matching excluding complete partite subgraphs2012

    • Author(s)
      Yusuke Kobayashi
    • Organizer
      The 21st International Symposium on Mathematical Programming
    • Place of Presentation
      Berlin, Germany
    • Data Source
      KAKENHI-PROJECT-22800005
  • [Presentation] 点素パス問題に対するアルゴ リズム2012

    • Author(s)
      小林 佑輔
    • Organizer
      組合せ最適化セミナー
    • Place of Presentation
      京都大学
    • Data Source
      KAKENHI-PROJECT-22800005
  • [Presentation] An algorithm for finding a maximum t-matching excluding complete partite subgraphs2011

    • Author(s)
      Y. Kobayashi and X. Yin
    • Organizer
      7th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications
    • Place of Presentation
      京都大学数理解析研究所 (京都市左京区)
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Presentation] Cone superadditivity of discrete convex functions2011

    • Author(s)
      Y. Kobayashi, K. Murota and R. Weismantel
    • Organizer
      7th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications
    • Place of Presentation
      京都大学数理解析研究所 (京都市左京区)
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Presentation] Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid minor2011

    • Author(s)
      Yusuke Kobayashi
    • Organizer
      The 5th workshop on Graph Classes, Optimization, and Width Parameters
    • Place of Presentation
      Daejeon, Korea
    • Data Source
      KAKENHI-PROJECT-22800005
  • [Presentation] An Algorithm for Finding a Maximum t-Matching Excluding Complete Partite Subgraphs2011

    • Author(s)
      Yusuke Kobayashi
    • Organizer
      The 7th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications
    • Place of Presentation
      京都大学(京都府)
    • Year and Date
      2011-06-02
    • Data Source
      KAKENHI-PROJECT-22800005
  • [Presentation] Algorithms for Finding a Maximum Non-k-Linked Graph2011

    • Author(s)
      Yusuke Kobayashi
    • Organizer
      The 19th Annual European Symposium on Algorithms
    • Place of Presentation
      Saarbrucken, Germany
    • Year and Date
      2011-09-05
    • Data Source
      KAKENHI-PROJECT-22800005
  • [Presentation] Robust Matchings and Matroid Intersections2010

    • Author(s)
      Yusuke Kobayashi
    • Organizer
      The 18th Annual European Symposium on Algorithms
    • Place of Presentation
      Liverpool, UK
    • Year and Date
      2010-09-08
    • Data Source
      KAKENHI-PROJECT-22800005
  • [Presentation] 離散凸関数の錐別優加法性2010

    • Author(s)
      小林佑輔, 室田一雄, R.Weismantel
    • Organizer
      日本オペレーションズ・リサーチ学会2010年度春季研究発表会
    • Place of Presentation
      首都大学東京(東京都八王子市)
    • Year and Date
      2010-03-04
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Presentation] Improved Algorithm for the Half-Disjoint Paths Problem2010

    • Author(s)
      Yusuke Kobayashi
    • Organizer
      The 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems
    • Place of Presentation
      Barcelona, Spain
    • Year and Date
      2010-09-03
    • Data Source
      KAKENHI-PROJECT-22800005
  • [Presentation] Improved algorithm for the half-disjoint paths problem2010

    • Author(s)
      Ken-ichi Kawarabayashi and Yusuke Kobayashi
    • Organizer
      The 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems(APPROX 2010)
    • Place of Presentation
      Barcelona, Spain,
    • Data Source
      KAKENHI-PROJECT-22800005
  • [Presentation] An O(log n)-approximation Algorithm for the Disjoint Paths Problem in Eulerian Planar Graphs and 4-edge-connected Planar Graphs2010

    • Author(s)
      Yusuke Kobayashi
    • Organizer
      The 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems
    • Place of Presentation
      Barcelona, Spain
    • Year and Date
      2010-09-03
    • Data Source
      KAKENHI-PROJECT-22800005
  • [Presentation] Packing edge-disjoint odd S-cycles in 4-edge-connected graphs

    • Author(s)
      Yusuke Kobayashi
    • Organizer
      SIAM Conference on Discrete Mathematics 2014
    • Place of Presentation
      Minneapolis, USA
    • Year and Date
      2014-06-16 – 2014-06-19
    • Invited
    • Data Source
      KAKENHI-PROJECT-24700004
  • [Presentation] 円板形領域損傷モデルにおける最大流最小カットアルゴリズムの実験的評価

    • Author(s)
      大槻兼資,小林佑輔,室田一雄
    • Organizer
      日本オペレーションズ・リサーチ学会 春季研究発表会
    • Place of Presentation
      大阪大学
    • Year and Date
      2014-03-06 – 2014-03-07
    • Data Source
      KAKENHI-PLANNED-24106002
  • [Presentation] he Generalized Terminal Backup Problem

    • Author(s)
      Attila Bernath and Yusuke Kobayashi
    • Organizer
      Bertinoro Workshop 2013 on Graph Theory and Algorithms
    • Place of Presentation
      Bertinoro, Italy
    • Year and Date
      2013-12-15 – 2013-12-20
    • Data Source
      KAKENHI-PLANNED-24106002
  • [Presentation] Max-flow min-cut theorem and faster algorithms in a circular disk failure model

    • Author(s)
      Y. Kobayashi and K. Otsuki
    • Organizer
      The 33rd Annual IEEE International Conference on Computer Communications (INFOCOM 2014)
    • Place of Presentation
      Toronto, Canada
    • Year and Date
      2014-04-27 – 2014-05-02
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Presentation] The generalized terminal backup problem

    • Author(s)
      A. Bernath and Y. Kobayashi
    • Organizer
      The 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014)
    • Place of Presentation
      Portland, USA
    • Year and Date
      2014-01-05 – 2014-01-07
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Presentation] Max-flow min-cut theorem and faster algorithms in a circular disk failure model,

    • Author(s)
      Yusuke Kobayashi
    • Organizer
      The 33rd Annual IEEE International Conference on Computer Communications (INFOCOM 2014)
    • Place of Presentation
      Toronto, Canada
    • Year and Date
      2014-04-27 – 2014-05-02
    • Data Source
      KAKENHI-PROJECT-24700004
  • [Presentation] 一般化ターミナルバックアップ問題に対する多項式時間アルゴリズム

    • Author(s)
      小林佑輔,松岡達也
    • Organizer
      日本応用数理学会 研究部会連合発表会
    • Place of Presentation
      京都大学
    • Year and Date
      2014-03-19 – 2014-03-20
    • Data Source
      KAKENHI-PLANNED-24106002
  • [Presentation] Triangle-free 2-matchings and M-concave functions on jump systems

    • Author(s)
      Y. Kobayashi
    • Organizer
      The 8th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications
    • Place of Presentation
      Veszprem, Hungary
    • Year and Date
      2013-06-04 – 2013-06-07
    • Data Source
      KAKENHI-PROJECT-21360045
  • 1.  KAKIMURA Naonori (30508180)
    # of Collaborated Projects: 4 results
    # of Collaborated Products: 9 results
  • 2.  Yoshise Akiko (50234472)
    # of Collaborated Projects: 3 results
    # of Collaborated Products: 0 results
  • 3.  OHSAWA Yoshiaki (50183760)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 5 results
  • 4.  SHIGENO Maiko (40272687)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 1 results
  • 5.  河村 彰星 (20600117)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 1 results
  • 6.  櫻井 一宏 (20581383)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 7.  八森 正泰 (00344862)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 1 results
  • 8.  高野 祐一 (40602959)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 9.  MUROTA Kazuo (50134466)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 6 results
  • 10.  TAMURA Akihisa (50217189)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 11.  IWATA Satoru (00263161)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 12.  SHIOURA Akiyoshi (10296882)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 13.  MORIGUCHI Satoko (60407351)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 14.  TSUCHIMURA Nobuyuki (20345119)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 15.  Makino Kazuhisa (60294162)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 1 results
  • 16.  ロスマン ベンジャミン (90599177)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 17.  鈴木 勉 (00282327)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 18.  秋山 英三 (40317300)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 19.  宮川 雅至 (50400627)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 20.  小市 俊悟 (50513602)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 21.  渡辺 俊 (60212320)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 22.  堤 盛人 (70292886)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 23.  藤井 さやか (70422194)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 24.  竹原 浩太 (70611747)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 25.  有田 智一 (90344861)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 26.  田中 健一 (90408724)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 27.  久野 誉人 (00205113)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 28.  フン・ドック トゥアン (20633465)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 29.  安東 弘泰 (20553770)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 2 results
  • 30.  佐野 良夫 (20650261)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 1 results
  • 31.  小野 廣隆 (00346826)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 1 results
  • 32.  城所 幸弘 (90283811)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 33.  栗野 盛光 (90732313)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 34.  小林 隆史 (90466657)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 35.  和田 健太郎 (20706957)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 36.  河原林 健一 (40361159)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 6 results
  • 37.  吉田 悠一 (50636967)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 38.  Avis David (90584110)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 39.  岡本 吉央 (00402660)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 3 results
  • 40.  神山 直之 (10548134)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 1 results
  • 41.  小関 健太 (10649122)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 42.  野崎 雄太 (40822648)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 43.  岩政 勇仁 (70854602)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 44.  COOK Stephen
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 45.  ZIEGLER Martin
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 46.  GURVICH Vladimir
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 47.  BOROS Endre
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 48.  TAMAKI Suguru
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results
  • 49.  高澤 兼二郎
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 2 results
  • 50.  伊藤 健洋
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 7 results

URL: 

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

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi