KAWARABAYASHI Ken-ichi 河原林健一

Researcher Number	40361159
Other IDs
Affiliation (Current)	2025: 国立情報学研究所, 情報学プリンシプル研究系, 教授
Affiliation (based on the past Project Information) *help	2010 – 2024: 国立情報学研究所, 情報学プリンシプル研究系, 教授 2016: 国立情報学研究所, 情報プリンシプル系, 教授 2012: 国立情報学研究所, 情報学プリンシプル系, 教授 2009 – 2010: National Institute of Informatics, プリンシプル研究系, 教授 2007 – 2008: 国立情報学研究所, 情報学プリンシプル研究系, 准教授 2006: 国立情報学研究所, 情報学プリンシプル研究系, 助教授 2004 – 2005: Tohoku University, Graduate School of Information Science, Research Associate, 大学院・情報科学研究科, 助手
Review Section/Research Field	Principal Investigator Broad Section J / General mathematics (including Probability theory/Statistical mathematics) / Theory of informatics / Transformative Research Areas, Section (IV) / Science and Engineering / Fundamental theory of informatics Except Principal Investigator Transformative Research Areas, Section (IV) / Information network / Science and Engineering / Fundamental theory of informatics / General mathematics (including Probability theory/Statistical mathematics) / General mathematics (including Probability theory/Statistical mathematics) / Science and Engineering
Keywords	Principal Investigator グラフ / アルゴリズム / グラフアルゴリズム / グラフ理論 / グラフ彩色 / 組合せ最適化 / 計算理論 / 曲面上のグラフ / グラフマイナー / 組合せ最適 … More / 離散最適化 / 離散数学 / 平面グラフ / 多項式時間 / Hadwiger予想 / グラフマイナー理論 / 4色定理 / グラフ構造 / CSP / matroid / TSP / graph / 計算量 / サブモジュラー関数 / 分散計算 / 調和解析 / 劣線形時間 / 定数時間 / 離散アルゴリズム / 計算量理論 / 性質検査 / 劣線形時間計算 / 定数時間検査 / 制約充足問題 / 理論計算機科学 / 独立点集合 / 選択数 / グラフ細分 / 点素パス問題 / マイナー / 最短パス / セパレイター / マイナー操作 / グラフ連結度 / グラフ構造理論 / 理想グラフ / HADWIGER予想 / リスト彩色 / Hadweiger予想 … More Except Principal Investigator 組合せ論 / アルゴリズム / combinatorics / computational geometry / graph theory / 計算幾何学 / 研究推進 / 組織運営 / 革新的アルゴリズム基盤 / ネットワーク / ELC Workshop / ELC Seminar / ELC 秋学校 / 計算理論若手研究者育成 / 計算限界研究センター / 多視点からの統合的解析 / 若手研究者育成 / 各種啓発・研究成果波及 / 国際研究者交流 / 多視点からの連携研究 / 計算限界解明手法の開拓 / 成果の総括と公表 / 計算量上下界解析 / アルゴリズム理論 / 計算複雑さの理論 / 成果の波及 / 成果の総括 / 若手研究者の育成 / 研究拠点形成 / 研究連携促進 / 計算限界解明 / digitization / Discrepancy / Algorithms / ディジタル化 / ディスクレパンシー / グラフ理論 / extremal graph theory / combinatorial geometry / discrete geometry / algorithm / discrete optimization / 擬確率的手法 / 組み合せ幾何 / 離散幾何 / 計算幾何 / グラフ論 / 離散構造 / 直径 / 連結度 / グラフ / 離散数学 / 決定木 / 知識抽出 / クラスタリング / 計算理論 / データマイニング Less

Graph Algorithms and Optimization: Theory and Scalable AlgorithmsPrincipal Investigator
- Principal Investigator
  
  河原林健一
- Project Period (FY)
  2022 – 2026
- Research Category
  
  Grant-in-Aid for Scientific Research (S)
- Review Section
  
  Broad Section J
- Research Institution
  National Institute of Informatics
Research Initiatives on Algorithmic Foundations for Social Advancement
- Principal Investigator
  
  湊真一
- Project Period (FY)
  2020 – 2024
- Research Category
  
  Grant-in-Aid for Transformative Research Areas (A)
- Review Section
  
  Transformative Research Areas, Section (IV)
- Research Institution
  Kyoto University
New computational models for algorithms and discrete optimizationPrincipal Investigator
- Principal Investigator
  
  河原林健一
- Project Period (FY)
  2020 – 2024
- Research Category
  
  Grant-in-Aid for Transformative Research Areas (A)
- Review Section
  
  Transformative Research Areas, Section (IV)
- Research Institution
  National Institute of Informatics
Large Graphs: Theory and AlgorithmsPrincipal Investigator
- 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
TSP in Combinatorial Optimization and CSP in Theoretical Computer SciencePrincipal Investigator
- Principal Investigator
  
  河原林健一
- Project Period (FY)
  2018 – 2020
- Research Category
  
  Grant-in-Aid for JSPS Fellows
- Research Field
  
  Theory of informatics
- Research Institution
  National Institute of Informatics
Interconnection networks approaching the theoretical limit
- Principal Investigator
  
  Fujiwara Ikki
- Project Period (FY)
  2015 – 2017
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Information network
- Research Institution
  National Institute of Information and Communications Technology
  National Institute of Informatics
Studies on Limits of Computation via Information and Coding TheoryPrincipal Investigator
- Principal Investigator
  
  Kawarabayashi Kenichi
- Project Period (FY)
  2012 – 2016
- Research Category
  
  Grant-in-Aid for Scientific Research on Innovative Areas (Research in a proposed research area)
- Review Section
  
  Science and Engineering
- Research Institution
  National Institute of Informatics
A Multifaced Approach Toward Understanding the Limitations of Compuation
- Principal Investigator
  
  Watanabe Osamu
- 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
  Tokyo Institute of Technology
アルゴリズム的グラフマイナー理論Principal Investigator
- Principal Investigator
  
  河原林健一
- Project Period (FY)
  2009 – 2010
- Research Category
  
  Grant-in-Aid for Challenging Exploratory Research
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  National Institute of Informatics
structural graph theory and eifficient algorithm for graph coloring problemsPrincipal Investigator
- Principal Investigator
  
  KAWARABAYASHI Ken-ichi
- Project Period (FY)
  2009 – 2012
- Research Category
  
  Grant-in-Aid for Young Scientists (A)
- Research Field
  
  General mathematics (including Probability theory/Statistical mathematics)
- Research Institution
  National Institute of Informatics
A study on the distance structure and the connectivity structure of graphs
- Principal Investigator
  
  ANDO Kiyoshi (ANDOU Kiyoshi)
- Project Period (FY)
  2008 – 2011
- Research Category
  
  Grant-in-Aid for Scientific Research (B)
- Research Field
  
  General mathematics (including Probability theory/Statistical mathematics)
- Research Institution
  The University of Electro-Communications
計算理論的設計による知識抽出モデルに関する研究
- Principal Investigator
  
  TOKUYAMA Takeshi
- Project Period (FY)
  2004 – 2007
- Research Category
  
  Grant-in-Aid for Scientific Research on Priority Areas
- Review Section
  
  Science and Engineering
- Research Institution
  Tohoku University
グラフ彩色問題における4色定理の応用、拡張に関する研究Principal Investigator
- Principal Investigator
  
  河原林健一
- Project Period (FY)
  2004 – 2006
- Research Category
  
  Grant-in-Aid for Young Scientists (B)
- Research Field
  
  General mathematics (including Probability theory/Statistical mathematics)
- Research Institution
  National Institute of Informatics
  Tohoku University
Research on data rounding based on discrete systems.
- Principal Investigator
  
  TOKUYAMA Takeshi
- Project Period (FY)
  2004 – 2005
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Tohoku University
Fundamental and application oriented studies of discrete structures
- Principal Investigator
  
  ANDO Kiyoshi
- Project Period (FY)
  2002 – 2004
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  General mathematics (including Probability theory/Statistical mathematics)
- Research Institution
  The University of Electro-Communications

[Book] 丸善出版2013
- Author(s)
  河原林健一，田井中麻都佳
- Total Pages
  208
- Publisher
  これも数学だった!?: カーナビ，路線図，SNS (丸善ライブラリー)
- Data Source
  KAKENHI-PLANNED-24106003
[Book] これも数学だった!? : カーナビ,路線図, SNS2013
- Author(s)
  河原林健一, 田井中麻都佳著
- Total Pages
  208
- Publisher
  丸善出版
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] A half-integral Erd?s-P?sa theorem for directed odd cycles2023
- Author(s)
  Kawarabayashi Ken-ichi、Kreutzer Stephan、Kwon O-joung、Xie Qiqin
- Journal Title
  
  Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms(SODA)
  
  Volume: 2023 Pages: 3043-3062
- DOI
  10.1137/1.9781611977554.ch118
- ISBN
  9781611977554
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-20H05965, KAKENHI-PROJECT-22H05001
[Journal Article] Additive non-approximability of chromatic number in proper minor-closed classes2023
- Author(s)
  Dvo??k Zden?k、Kawarabayashi Ken-ichi
- Journal Title
  
  Journal of Combinatorial Theory, Series B
  
  Volume: 158 Pages: 74-92
- DOI
  10.1016/j.jctb.2020.09.003
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-22H05001
[Journal Article] Optimal distributed covering algorithms2023
- Author(s)
  Ben-Basat Ran、Even Guy、Kawarabayashi Ken-ichi、Schwartzman Gregory
- Journal Title
  
  Distributed Computing
  
  Volume: 36 Issue: 1 Pages: 45-55
- DOI
  10.1007/s00446-021-00391-w
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-20H05965, KAKENHI-PROJECT-22H05001
[Journal Article] Embeddings of Planar Quasimetrics into Directed ?<sub>1</sub> and Polylogarithmic Approximation for Directed Sparsest-Cut2022
- Author(s)
  Kawarabayashi Ken-ichi、Sidiropoulos Anastasios
- Journal Title
  
  FOCS’２１
  
  Volume: 1 Pages: 480-491
- DOI
  10.1109/focs52979.2021.00055
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-20H05965, KAKENHI-PROJECT-18H05291
[Journal Article] Directed Tangle Tree-Decompositions and Applications2022
- Author(s)
  Giannopoulou Archontia C.、Kawarabayashi Ken-ichi、Kreutzer Stephan、Kwon O-joung
- Journal Title
  
  SODA'22
  
  Volume: 1 Pages: 377-405
- DOI
  10.1137/1.9781611977073.19
- ISBN
  9781611977073
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H05291, KAKENHI-PLANNED-20H05965
[Journal Article] A Parameter-Free Algorithm for Misspecified Linear Contextual Bandits2021
- Author(s)
  Kei Takemura, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
- Journal Title
  
  The 24th International Conference on Artificial Intelligence and Statistics
  
  Volume: 130
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PLANNED-20H05965
[Journal Article] Rooted topological minors on four vertices2021
- Author(s)
  Koyo Hayashi, Ken-ichi Kawarabayashi
- Journal Title
  
  Journal of Combinatorial Theory, Series B
  
  Volume: - Pages: 146-185
- DOI
  10.1016/j.jctb.2021.05.002
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-19J22605, KAKENHI-PROJECT-22H05001
[Journal Article] RelWalk - {A} Latent Variable Model Approach to Knowledge Graph Embedding2021
- Author(s)
  Danushka Bollegala, Huda Hakami, Yuichi Yoshida, Ken-ichi Kawarabayashi
- Journal Title
  
  Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume, {EACL} 2021
  
  Volume: 133
- Peer Reviewed / Open Access / Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-20H05965
[Journal Article] RelWalk - A Latent Variable Model Approach to Knowledge Graph Embedding2021
- Author(s)
  Bollegala Danushka、Hakami Huda、Yoshida Yuichi、Kawarabayashi Ken-ichi
- Journal Title
  
  EACL'21
  
  Volume: 1 Pages: 1551-1565
- DOI
  10.18653/v1/2021.eacl-main.133
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-20H05965, KAKENHI-PROJECT-18H05291
[Journal Article] Model-Checking on Ordered Structures2020
- Author(s)
  Eickmeyer Kord、Heuvel Jan van den、Kawarabayashi Ken-Ichi、Kreutzer Stephan、Mendez Patrice Ossona De、Pilipczuk Michal、Quiroz Daniel A.、Rabinovich Roman、Siebertz Sebastian
- Journal Title
  
  ACM Transactions on Computational Logic
  
  Volume: 21 Issue: 2 Pages: 1-28
- DOI
  10.1145/3360011
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H05291
[Journal Article] Improved Distributed Approximations for Maximum Independent Set.2020
- Author(s)
  Ken-ichi Kawarabayashi, Seri Khoury, Aaron Schild, Gregory Schwartzman
- Journal Title
  
  Proceedings of the 34th International Symposium on Distributed Computing (DISC 2020)
  
  Volume: 35 Pages: 1-16
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H05291
[Journal Article] The Directed Flat Wall Theorem2020
- Author(s)
  Giannopoulo Archontia C.、Kawarabayashi Ken-ichi、Kreutzer Stephan、Kwon O-joung
- Journal Title
  
  SODA'20
  
  Volume: 1 Pages: 239-258
- DOI
  10.1137/1.9781611975994.15
- ISBN
  9781611975994
- Peer Reviewed / Open Access / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H05291
[Journal Article] Minimum Violation Vertex Maps and Their Applications to Cut Problems2020
- Author(s)
  Kawarabayashi Ken-ichi、Xu Chao
- Journal Title
  
  SIAM Journal on Discrete Mathematics
  
  Volume: 34 Issue: 4 Pages: 2183-2207
- DOI
  10.1137/19m1290899
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H05291
[Journal Article] Improved Distributed Approximations for Maximum Independent Set2020
- Author(s)
  Ken-ichi Kawarabayashi , Seri Khoury , Aaron Schild , Gregory Schwartzman
- Journal Title
  
  34th International Symposium on Distributed Computing (DISC 2020)
  
  Volume: 179 Pages: 1868-8969
- Peer Reviewed / Open Access / Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-20H05965
[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] A nearly 5/3-approximation FPT Algorithm for Min-k-Cut2020
- Author(s)
  Kawarabayashi Ken-ichi、Lin Bingkai
- Journal Title
  
  Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms (SODA 2020)
  
  Volume: 20 Pages: 990-999
- DOI
  10.1137/1.9781611975994.59
- ISBN
  9781611975994
- Peer Reviewed / Open Access / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H05291
[Journal Article] Delay and Cooperation in Nonstochastic Linear Bandits2020
- Author(s)
  Shinji Ito , Daisuke Hatano , Hanna Sumita , Kei Takemura , Takuro Fukunaga , Naonori Kakimura , Ken-ichi Kawarabayashi
- Journal Title
  
  Advances in Neural Information Processing Systems
  
  Volume: 33
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PLANNED-20H05965
[Journal Article] Polynomial Planar Directed Grid Theorem2019
- Author(s)
  Hatzel Meike、Kawarabayashi Ken-ichi、Kreutzer Stephan
- Journal Title
  
  Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019)
  
  Volume: 19 Pages: 1465-1484
- DOI
  10.1137/1.9781611975482.89
- ISBN
  9781611975482
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H05291
[Journal Article] Optimal Distributed Covering Algorithms2019
- Author(s)
  Ben Basat Ran、Even Guy、Kawarabayashi Ken-ichi、Schwartzman Gregory
- Journal Title
  
  Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (PODC2019)
  
  Volume: 19 Pages: 104-106
- DOI
  10.1145/3293611.3331577
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H05291
[Journal Article] Deterministic Edge Connectivity in Near-Linear Time2019
- Author(s)
  Kawarabayashi Ken-Ichi、Thorup Mikkel
- Journal Title
  
  Journal of the ACM
  
  Volume: 66 Issue: 1 Pages: 1-50
- DOI
  10.1145/3274663
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18H05291
[Journal Article] Stochastic Submodular Maximization with Performance-Dependent Item Costs2019
- Author(s)
  Fukunaga Takuro、Konishi Takuya、Fujita Sumio、Kawarabayashi Ken-ichi
- Journal Title
  
  Proceedings of the AAAI Conference on Artificial Intelligence
  
  Volume: 33 Issue: 01 Pages: 1485-1494
- DOI
  10.1609/aaai.v33i01.33011485
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H05291
[Journal Article] Polylogarithmic approximation for Euler genus on bounded degree graphs2019
- Author(s)
  Kawarabayashi Ken-ichi、Sidiropoulos Anastasios
- Journal Title
  
  Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC 2019)
  
  Volume: 51 Pages: 164-175
- DOI
  10.1145/3313276.3316409
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H05291
[Journal Article] Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising2019
- Author(s)
  Hatano Daisuke、Kuroki Yuko、Kawase Yasushi、Sumita Hanna、Kakimura Naonori、Kawarabayashi Ken-ichi
- Journal Title
  
  The 16th Pacific Rim International Conference on Artificial Intelligence (PRICAI 2019), LNCS
  
  Volume: 16 Pages: 568-582
- DOI
  10.1007/978-3-030-29908-8_45
- ISBN
  9783030299071, 9783030299088
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18H05291
[Journal Article] Boosting PageRank Scores by Optimizing Internal Link Structure2018
- Author(s)
  Naoto Ohsaka, Tomohiro Sonobe, Naonori Kakimura, Takuro Fukunaga, Sumio Fujita, Ken-ichi Kawarabayashi
- Journal Title
  
  Database and Expert Systems Applications, DEXA 2018. Lecture Notes in Computer Science
  
  Volume: 11029 Pages: 424-439
- DOI
  10.1007/978-3-319-98809-2_26
- ISBN
  9783319988085, 9783319988092
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-17K00040, KAKENHI-PROJECT-18H05291
[Journal Article] Matching Extension Missing Vertices and Edges in Triangulations of Surfaces2017
- Author(s)
  Ken-ichi Kawarabayashi, Kenta Ozeki, Michael D. Plummer
- Journal Title
  
  Journal of Graph Theory
  
  Volume: 85 Issue: 1 Pages: 249-257
- DOI
  10.1002/jgt.22058
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-24106003, KAKENHI-PROJECT-25871053
[Journal Article] Coloring 3-Colorable Graphs with Less than n^{1/5} Colors2017
- Author(s)
  Ken-ichi Kawarabayashi, Mikkel Thorup
- Journal Title
  
  Ｊ．　ＡＣＭ
  
  Volume: 64 Issue: 1 Pages: 1-23
- DOI
  10.1145/3001582
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-24106003
[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 Trans. Algorithms
  
  Volume: 13 Issue: 1 Pages: 1-17
- DOI
  10.1145/2960410
- NAID
  120007135027
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PLANNED-24106003, KAKENHI-PROJECT-25242029, KAKENHI-PROJECT-24700004, KAKENHI-PROJECT-16K16010, KAKENHI-PLANNED-24106002
[Journal Article] 5-connected toroidal graphs are Hamiltonian-connected2016
- Author(s)
  Ken-ichi Kawarabayashi, and Kenta Ozeki
- Journal Title
  
  SIAM Journal of Discrete Mathematics
  
  Volume: 30 Issue: 1 Pages: 112-140
- DOI
  10.1137/151002812
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-25871053, KAKENHI-PLANNED-24106003
[Journal Article] Coloring immersion-free graphs2016
- Author(s)
  Naonori Kakimura, Ken-ichi Kawarabayashi
- Journal Title
  
  J. Comb. Theory, Ser. B
  
  Volume: 121 Pages: 284-307
- DOI
  10.1016/j.jctb.2016.07.005
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PLANNED-24106003, KAKENHI-PROJECT-25730001
[Journal Article] Edge-disjoint odd cycles in 4-edge-connected graphs2016
- Author(s)
  Ken-ichi Kawarabayashi, Yusuke Kobayashi
- Journal Title
  
  J. Comb. Theory, Ser. 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] Fixed-Parameter Tractability for Subset Feedback Set Problems with Parity Constraints2015
- Author(s)
  Naonori Kakimura and Ken-ichi Kawarabayashi
- Journal Title
  
  Theoretical Computer Science
  
  Volume: 576 Pages: 61-76
- DOI
  10.1016/j.tcs.2015.02.004
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-25730001, KAKENHI-PLANNED-24106003
[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 Issue: 4 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 Directed Grid Theorem2015
- Author(s)
  Ken-ichi Kawarabayashi and Stephan Kreutzer
- Journal Title
  
  Proc. of the 47th Annual ACM on Symposium on Theory of Computing (STOC)
  
  Volume: 47 Pages: 655-664
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-24106003
[Journal Article] Removable paths and cycles with parity constraints2014
- Author(s)
  Ken-ichi Kawarabayashi, Orlando Lee and Bruce A. Reed
- Journal Title
  
  Journal of Combinatorial Theory Ser B
  
  Volume: 106 Issue: 1 Pages: 115-133
- DOI
  10.1016/j.jctb.2008.03.007
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PLANNED-24106003
[Journal Article] A connected subgraph maintaining high connectivity2014
- Author(s)
  藤田慎也，河原林健一
- Journal Title
  
  European Journal of Combinatorics
  
  Volume: 35 Pages: 245-255
- DOI
  10.1016/j.ejc.2013.06.014
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-23740095, KAKENHI-PLANNED-24106003
[Journal Article] ～ふしぎの国のスウガク使い～「離散数学がおもしろくて役に立つ！」2014
- Author(s)
  内村直之（協力：河原林健一）
- Journal Title
  
  大学への数学
  
  Volume: June Pages: 74-76
- Data Source
  KAKENHI-ORGANIZER-24106001
[Journal Article] Sub-exponential graph coloring algorithm for stencil-based Jacobian computations2014
- Author(s)
  Michael Lulfesmann and Ken-ichi Kawarabayashi
- Journal Title
  
  Journal of Computational Science
  
  Volume: 5(1) Issue: 1 Pages: 1-11
- DOI
  10.1016/j.jocs.2013.06.002
- Peer Reviewed
- Data Source
  KAKENHI-PLANNED-24106003
[Journal Article] Half-Integral Packing of Odd Cycles through Prescribed Vertices2013
- Author(s)
  Naonori Kakimura, Ken-ichi Kawarabayashi
- Journal Title
  
  Combinatorica
  
  Volume: 35 Issue: 5 Pages: 549-572
- DOI
  10.1007/s00493-013-2865-6
- Peer Reviewed
- Data Source
  KAKENHI-PLANNED-24106002, KAKENHI-PLANNED-24106003
[Journal Article] Connectivities for k-knitted graphs and for minimal counterexamples to Hadwiger's Conjecture2013
- Author(s)
  K. Kawarabayashi and G. Yu
- Journal Title
  
  J. Combin. Theory, Ser. B
  
  Volume: 103 Pages: 320-326
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] Testing subdivision-freeness: Structural graph theory meets property testing2013
- Author(s)
  Ken-ichi Kawarabayashi, Yuichi Yoshida
- Journal Title
  
  the 43rd ACM Symposium on Theory of Computing
  
  Volume: 43 Pages: 437-446
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] A simpler proof for the two disjoint odd cycles theorem2013
- Author(s)
  K. Kawarabayashi and K. Ozeki
- Journal Title
  
  J. Combin. Theory, Ser. B
  
  Volume: 103 Pages: 313-319
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] Half-Integral Packing of Odd Cycles through Prescribed Vertices2013
- Author(s)
  N. Kakimura and K. Kawarabayashi
- Journal Title
  
  Combinatorica
  
  Volume: 33 Pages: 549-572
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] An O(log n)-approximation algorithm for the disjoint paths problem in Eulerian planar graphs2013
- Author(s)
  K. Kawarabayashi and Y. Kobayashi
- Journal Title
  
  ACM transaction on Algorithms
  
  Volume: 9(No.16)
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] Connectivities for k-knitted graphs and for minimal counterexamples to Hadwiger's Conjecture2013
- Author(s)
  Ken-ichi Kawarabayashi and Gexin Yu
- Journal Title
  
  Journal of Combinatorial Theory, Series B
  
  Volume: 103(3) Issue: 3 Pages: 320-326
- DOI
  10.1016/j.jctb.2013.02.001
- Peer Reviewed
- Data Source
  KAKENHI-PLANNED-24106003
[Journal Article] An O(\log n)-approximation algorithm for the disjoint paths problem in2013
- Author(s)
  Ken-ichi Kawarabayashi, Yusuke Kobayashi
- Journal Title
  
  ACM transaction on Algorithms
  
  Volume: 9 Pages: 9-29
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] A simpler proof for the two odd cycles theorem2013
- Author(s)
  K. Kawarabayashi, K. Ozeki
- Journal Title
  
  J. Combin. Theory Ser. B
  
  Volume: (掲載決定) Issue: 3 Pages: 313-319
- DOI
  10.1016/j.jctb.2012.11.004
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-10J04633, KAKENHI-PLANNED-24106003
[Journal Article] An Approximation Algorithm for the Bipartite Traveling Tournament Problem2013
- Author(s)
  R. Hoshino and K. Kawarabayashi
- Journal Title
  
  Mathematics of Operation Research
  
  Volume: 38 Pages: 720-728
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] Notices of the American Mathematical Society2013
- Author(s)
  Richard Hoshino, Ken-ichi Kawarabayashi
- Journal Title
  
  Graph Theory and Sports Scheduling
  
  Volume: 60 Pages: 726-731
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[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 Issue: 2 Pages: 1-13
- DOI
  10.1145/2438645.2438648
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21360045, KAKENHI-PLANNED-24106003, KAKENHI-PROJECT-24700004
[Journal Article] Generating Approximate Solutions to the Traveling Tournament Problem using a Linear Distance Relaxation2012
- Author(s)
  R. Hoshino, K. Kawarabayashi
- Journal Title
  
  J. Artificial Intelligence Research
  
  Volume: 45 Pages: 257-286
- DOI
  10.1613/jair.3713
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-11F01755, KAKENHI-PLANNED-24106003
[Journal Article] Minimally contraction-critically 6-connected graphs2012
- Author(s)
  Ando, Kiyoshi; Fujita, Shinya; Kawarabayashi, Ken-ichi
- Journal Title
  
  Discrete Mathematics
  
  Volume: 312 Pages: 671-679
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20340016
[Journal Article] Spanning closed walks and TSP in 3-connected planar graphs2012
- Author(s)
  K.Kawarabayashi, K.Ozeki
- Journal Title
  
  ACM-SLAM Symposium on Discrete Algorithms, (SODA'12)
  
  Pages: 671-682
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] Minimally contraction-critically 6-connected graphs2012
- Author(s)
  Ando, Kiyoshi ; Fujita, Shinya ; Kawarabayashi, Ken-ichi
- Journal Title
  
  Discrete Math
  
  Volume: 312 Pages: 671-679
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20340016
[Journal Article] On the excluded minor structure theorem for graphs of large treewidth2012
- Author(s)
  R. Diestel, K. Kawarabayashi, T. Muller and P. Wollan
- Journal Title
  
  J. Combin. Theory Ser. B
  
  Volume: 102 Pages: 1189-1210
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] Linkless and flat embeddings in 3-space2012
- Author(s)
  K. Kawarabayashi, S. Kreutzer and B. Mohar
- Journal Title
  
  Discrete and Computational Geometry 47
  
  Pages: 731-755
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] The Erdos-Posa property for clique minors in highly connected graphs2012
- Author(s)
  R. Diestel, K. Kawarabayashi and P. Wollan
- Journal Title
  
  J. Combin. Theory Ser. B
  
  Volume: 102 Pages: 454-469
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[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
  
  J. Combin. Theory Ser. B
  
  Volume: 102 Pages: 1020-1034
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] On the excluded minor structure theorem for graphs of large tree-width2012
- Author(s)
  Reinhard Diestel, Ken-ichi Kawarabayashi, Theodor Muller and Paul Wollan
- Journal Title
  
  Journal of Combinatorial Theory, Series B
  
  Volume: 102(6) Issue: 6 Pages: 1189-1210
- DOI
  10.1016/j.jctb.2012.07.001
- Peer Reviewed
- Data Source
  KAKENHI-PLANNED-24106003
[Journal Article] Edge-disjoint Odd Cycles in 4-edge-connected Graphs2012
- Author(s)
  K. Kawarabayashi and Y. Kobayashi
- Journal Title
  
  Symposium on Theoretical Aspects of Computer Science (STACS)
  
  Pages: 206-217
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] Minors in large almost-5-connected non-planar graphs2012
- Author(s)
  Ken-ichi Kawarabayashi and John Maharry
- Journal Title
  
  Journal of Graph Theory
  
  Volume: 71(2) Issue: 2 Pages: 128-141
- DOI
  10.1002/jgt.20637
- Peer Reviewed
- Data Source
  KAKENHI-PLANNED-24106003
[Journal Article] Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid minor2012
- Author(s)
  K. Kawarabayashi and Y. Kobayashi
- Journal Title
  
  Symposium on Theoretical Aspects of Computer Science (STACS)
  
  Pages: 278-289
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] The disjoint paths problem in quadratic time2012
- Author(s)
  K. Kawarabayashi, Y. Kobayashi and B. Reed
- Journal Title
  
  J. Combin. Theory Ser. B
  
  Volume: 102 Pages: 424-435
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[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 Issue: 2 Pages: 670-680
- DOI
  10.1016/j.jcss.2011.10.004
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002, KAKENHI-PROJECT-22800005
[Journal Article] A Linear Time Algorithm for the Induced Disjoint Paths Problem in Planar Graphs2012
- Author(s)
  K. Kawarabayashi and Y. Kobayashi
- Journal Title
  
  Journal of Computer and System Sciences
  
  Pages: 670-680
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] Packing Directed Circuits through Prescribed Vertices Bounded Fractionally2012
- Author(s)
  N. Kakimura and K. Kawarabayashi
- Journal Title
  
  Siam. J. Discrete Math 26
  
  Pages: 1121-1133
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] List-Coloring Graphs without Subdivisions and without Immersions2012
- Author(s)
  K.Kawarabayashi, Y.Kobayashi
- Journal Title
  
  ACM-SIAM Symposium on Discrete Algorithms, (SODA'12)
  
  Pages: 1425-1435
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] Linkless and flat embeddings in 3-space2012
- Author(s)
  K.Kawarabayashi, S.Kreutzer, B.Mohar
- Journal Title
  
  Discrete and Computational Geometry
  
  Volume: 47 Pages: 731-755
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] Three-coloring triangle-free planar graphs in linear time2011
- Author(s)
  Z.Dvorak, K.Kawarabayashi, R.Thomas
- Journal Title
  
  ACM transaction on Algorithms
  
  Volume: 7
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] Scheduling Bipartite Tournaments to Minimize Total Travel Distance2011
- Author(s)
  K.Kawarabayashi, R.Hoshino
- Journal Title
  
  Journal of Artificial Intelligence Research
  
  Volume: 42 Pages: 91-124
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] Recognizing a totally odd K4-subdivision, parity 2-disjoint rooted paths and a parity cycle through specified elements2010
- Author(s)
  K.Kawarabayashi, et al.
- Journal Title
  
  ACM-SIAM Symposium on Discrete Algorithms,(SODA'10)
  
  Pages: 318-328
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21650004
[Journal Article] Algorithms for finding an induced cycle in planar graphs2010
- Author(s)
  K.Kawarabayashi, Y.Kobayashi
- Journal Title
  
  Combinatorica
  
  Volume: 30 Pages: 715-734
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21650004
[Journal Article] An(almost)linear time algoritlun for odd cycles transversal2010
- Author(s)
  K.Kawarabayashi et al.
- Journal Title
  
  ACM-SIAM Symposium on Discrete Algorithms, (SODA'10)
  
  Pages: 365-378
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] The edge disjoint paths problem in Eulerian graphs and 4-edge-connected graphs2010
- Author(s)
  K.Kawarabayashi et al.
- Journal Title
  
  ACM-SIAM Symposium on Discrete Algorithms, (SODA'10)
  
  Pages: 345-353
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] Recognizing a totally odd K4-subdivision, parity 2-disjoint rooted paths and a parity cycle through specified elements2010
- Author(s)
  K.Kawarabayashi et al.
- Journal Title
  
  ACM-SIAM Symposium on Discrete Algorithms, (SODA'10)
  
  Pages: 318-328
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] The edge disjoint paths problem in Eulerian graphs and 4-edge-connected graphs2010
- Author(s)
  K.Kawarabayashi, et al.
- Journal Title
  
  ACM-SIAM Symposium on Discrete Algorithms,(SODA'10)
  
  Pages: 345-353
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21650004
[Journal Article] An(almost)linear time algorithm for odd cycles transversal2010
- Author(s)
  K.Kawarabayashi, et al.
- Journal Title
  
  ACM-SIAM Symposium on Discrete Algorithms,(SODA'10)
  
  Pages: 365-378
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21650004
[Journal Article] A shorter proof of the Graph Minor Algorithm-The Unique Linkage Theorem-2010
- Author(s)
  K.Kawarabayashi, P.Wollan
- Journal Title
  
  42nd ACM Symposium on Theory of Computing (STOC'10)
  
  Volume: STOC'10 Pages: 687-694
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21650004
[Journal Article] A separator theorem in minor-closed classes2010
- Author(s)
  K.Kawarabayashi, B.Reed
- Journal Title
  
  the 51st Annual Symposium on Foundations of Computer Science (FOCS'10)
  
  Volume: FOCS'10 Pages: 153-152
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21650004
[Journal Article] Acyclic coloring and Star coloring surfaces2010
- Author(s)
  K.Kawarabayashi, et al.
- Journal Title
  
  Siam J.Discrete Math. 24
  
  Pages: 56-71
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21650004
[Journal Article] Long cycles without hamiltonian paths2009
- Author(s)
  K.Kawarabayashi, et al.
- Journal Title
  
  Discrete Math 308
  
  Pages: 5899-5906
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21650004
[Journal Article] On the number of 4-contractibleedges in 4-connected graphs2009
- Author(s)
  Ando, Kiyoshi ; Egawa, Yoshimi ; Kawarabayashi, Ken-ichi
- Journal Title
  
  J. Combin. Theory Ser. B
  
  Volume: 99, no.1 Pages: 97-109
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20340016
[Journal Article] Highly parity linked graphs2009
- Author(s)
  K.Kawarabayashi et al.
- Journal Title
  
  Combinatorica 29
  
  Pages: 215-225
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] Decomposing planar graphs of girth five into an independent set and a forest2009
- Author(s)
  K.Kawarabayashi, et al.
- Journal Title
  
  J.Combin.Theory Ser.B 99
  
  Pages: 674-684
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21650004
[Journal Article] Long cycles without hamiltonian paths2009
- Author(s)
  K.Kawarabayashi et al.
- Journal Title
  
  Discrete Math 308
  
  Pages: 5899-5906
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] N-flips in even triangulations on a surface2009
- Author(s)
  K.Kawarabayashi et al.
- Journal Title
  
  J.Combin.Theory Ser.B 99
  
  Pages: 229-246
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] K_6-minor in triangulations in the Klein bottle2009
- Author(s)
  K.Kawarabayashi et al.
- Journal Title
  
  Siam J.Discrete Math 23
  
  Pages: 96-108
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] On the number of 4-contractible edges in 4-connected graphs2009
- Author(s)
  K.Ando, Y.Egawa, K.Kawarabayashi, Kriesell.M
- Journal Title
  
  J.Combin.Theory Ser.B 99
  
  Pages: 97-109
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20340016
[Journal Article] A weakening of the odd Hadwiger's conjecture2009
- Author(s)
  K.Kawarabayashi
- Journal Title
  
  Combinatorics, Probability and Computing 17
  
  Pages: 815-821
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] A weakening of the odd Hadwiger's conjecture2009
- Author(s)
  K.Kawarabayashi
- Journal Title
  
  Combinatorics, Probability and Computing 17
  
  Pages: 815-821
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21650004
[Journal Article] Decomposing planar graphs of girth five into an independent set and a forest2009
- Author(s)
  K.Kawarabayashi et al.
- Journal Title
  
  J.Combin.Theory Ser.B 99
  
  Pages: 674-684
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] K_6-minor in triangulations in the Klein bottle2009
- Author(s)
  K.Kawarabayashi, et al.
- Journal Title
  
  Siam J.Discrete Math 23
  
  Pages: 96-108
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21650004
[Journal Article] Removable cycles in non-bipartite graphs2009
- Author(s)
  K.Kawarabayashi et al.
- Journal Title
  
  J.Combin.Theory Ser.B 99
  
  Pages: 30-38
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] N-flips in even triangulations on a surface2009
- Author(s)
  K.Kawarabayashi, et al.
- Journal Title
  
  J.Combin.Theory Ser.B 99
  
  Pages: 229-246
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21650004
[Journal Article] Hadwiger's Conjecture is decidable2009
- Author(s)
  K.Kawarabayashi et al.
- Journal Title
  
  the 41st ACM Symposium on Theory of Computing(STOC'09)
  
  Pages: 445-454
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] 6-critical graphs on the Klein bottle2009
- Author(s)
  K.Kawarabayashi et al.
- Journal Title
  
  Siam J.Discrete Math 23
  
  Pages: 372-383
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] Planarity allowing few error vertices in linear time2009
- Author(s)
  K.Kawarabayashi
- Journal Title
  
  50th Annual Symposium on Foundations of Computer Science(FOCS 2009)
  
  Pages: 639-648
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21650004
[Journal Article] Removable cycles in non-bipartite graphs2009
- Author(s)
  K.Kawarabayashi, et al.
- Journal Title
  
  J.Combin.Theory Ser.B 99
  
  Pages: 30-38
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21650004
[Journal Article] 6-critical graphs on the Klein bottle2009
- Author(s)
  K.Kawarabayashi, et al.
- Journal Title
  
  Siam J.Discrete Math 23
  
  Pages: 372-383
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21650004
[Journal Article] Highly parity linked graphs2009
- Author(s)
  K.Kawarabayashi, et al.
- Journal Title
  
  Combinatorica 29
  
  Pages: 215-225
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21650004
[Journal Article] Note on coloring graphs without odd Kk-minors2009
- Author(s)
  K.Kawarabayashi
- Journal Title
  
  J.Combin.Theory Ser.B 99
  
  Pages: 728-731
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] Hadwiger's Conjecture is decidable2009
- Author(s)
  K.Kawarabayashi, et al.
- Journal Title
  
  the 41st ACM Symposium on Theory of Computing(STOC'09)
  
  Pages: 445-454
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21650004
[Journal Article] Note on coloring graphs without odd Kk-minors2009
- Author(s)
  K.Kawarabayashi
- Journal Title
  
  J.Combin.Theory Ser.B 99
  
  Pages: 728-731
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21650004
[Journal Article] Planarity allowing few error vertices in linear time2009
- Author(s)
  K.Kawarabayashi
- Journal Title
  
  50th Annual Symposium on Foundations of Computer Science(FOCS 2009)
  
  Pages: 639-648
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] On the number of 4-contractible edges in 4-connected graphs2008
- Author(s)
  K.Ando, Y.Egawa, K.Kawarabayashi, Kriesell.M
- Journal Title
  
  J.Combin.Theory Ser.B 99 no.1
  
  Pages: 97-109
- Data Source
  KAKENHI-PROJECT-20340016
[Journal Article] Contractible edges in minimally $k$-connected graphs 42008
- Author(s)
  K. Ando, A. kaneko, K. Kawarabayashi
- Journal Title
  
  Discrete Mathematics 308
  
  Pages: 597-602
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20340016
[Journal Article] Computing crossing number in linear time2007
- Author(s)
  K.Kawarabayashi, B.Reed
- Journal Title
  
  ACM Symposium on Theory of Computing (STOC' 07) 39
  
  Pages: 382-390
- Data Source
  KAKENHI-PROJECT-16740044
[Journal Article] On the connectivity of mininmum and minimal counterexamples to Hadwiger's Conjecture2007
- Author(s)
  K.Kawarabayashi
- Journal Title
  
  J. Combin. Theory Ser. B 97
  
  Pages: 144-150
- Data Source
  KAKENHI-PROJECT-16740044
[Journal Article] A relaxed version of Hadwiger's conjecture for list-coloring2007
- Author(s)
  K.Kawarabayashi, B.Mohar
- Journal Title
  
  J. Combin. Theory Ser. B 97
  
  Pages: 647-651
- Data Source
  KAKENHI-PROJECT-16740044
[Journal Article] The Erdos-Posa property for orientable surface2007
- Author(s)
  K.Kawarabayashi, A.Nakamoto
- Journal Title
  
  Discrete Math. 307
  
  Pages: 764-768
- Data Source
  KAKENHI-PROJECT-16740044
[Journal Article] Chords of longest circuits in locally planar graphs2007
- Author(s)
  K.Kawarabayashi, J.Niu, C.Q.Zhang
- Journal Title
  
  Europ. J. Combinatorics 28
  
  Pages: 315-321
- Data Source
  KAKENHI-PROJECT-16740044
[Journal Article] $2$-connected spanning subgraphs with low maximum degree in locally planar graphs2007
- Author(s)
  M.Ellingham, K.Kawarabayashi
- Journal Title
  
  J. Combin. Theory Ser. B 97
  
  Pages: 401-412
- Data Source
  KAKENHI-PROJECT-16740044
[Journal Article] Rooted minor problems in graphs2007
- Author(s)
  L.Jorgensen, K.Kawarabayashi
- Journal Title
  
  J. Graph Theory 55
  
  Pages: 191-207
- Data Source
  KAKENHI-PROJECT-16740044
[Journal Article] Half integral packing, Erd＆odblac;s-Posa propert and Graph minors2007
- Author(s)
  K.Kawarabayashi
- Journal Title
  
  ACM-SIAM Symposium on Discrete Algorithms 2007 (SODA) 18
  
  Pages: 1187-1196
- Data Source
  KAKENHI-PROJECT-16740044
[Journal Article] Some recent progress and applications on Graph Minor Theory2007
- Author(s)
  K.Kawarabayashi, B.Mohar
- Journal Title
  
  Graphs and Combinatorics 23
  
  Pages: 1-46
- Data Source
  KAKENHI-PROJECT-16740044
[Journal Article] Dominating number in cubic graphs with large girth2006
- Author(s)
  K.Kawarabayashi, M.Plummer, A.Saito
- Journal Title
  
  J. Graph Theory 52
  
  Pages: 1-6
- Data Source
  KAKENHI-PROJECT-16740044
[Journal Article] Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs2006
- Author(s)
  K.Kawarabayashi, B.Mohar
- Journal Title
  
  Proceedings of the 38th ACM Symposium on Theory of Computing 38
  
  Pages: 401-406
- Data Source
  KAKENHI-PROJECT-16092202
[Journal Article] On sufficient degree conditions for a graph to be $k$-linked2006
- Author(s)
  K.Kawarabayashi, A.Kostochka, G.Yu
- Journal Title
  
  Lombinatorics, Probability and Computing 15
  
  Pages: 685-894
- Data Source
  KAKENHI-PROJECT-16740044
[Journal Article] Approximating the chromatic number and the list-chromatic number of minor-closed family2006
- Author(s)
  K.Kawarabayashi, B.Mohar
- Journal Title
  
  ACM Symposium on Theory of Computing (STOC' 06) 38
  
  Pages: 401-416
- Data Source
  KAKENHI-PROJECT-16740044
[Journal Article] Non-zero disjoint cycles in highly connected graphs2006
- Author(s)
  K.Kawarabayashi, P.Wollan
- Journal Title
  
  J. Combin. Theory Ser. B 96
  
  Pages: 296-301
- Data Source
  KAKENHI-PROJECT-16740044
[Journal Article] Algorithmic Graph Minor Theory : Improved Grid Minor Bounds and Wagner's Contraction2006
- Author(s)
  E.D.Demaine, M.Hajiaghayi, K.Kawarabayashi
- Journal Title
  
  Proceedings of The 17th International Symposium on Algorithms and Computation LNCS4288
  
  Pages: 3-15
- Data Source
  KAKENHI-PROJECT-16092202
[Journal Article] Algorithmic Graph Minor Theory : Decomposition, Approximation, and Coloring.2005
- Author(s)
  E.D.Demaine, M.Taghi Hajiaghayi, K.Kawarabayashi
- Journal Title
  
  Proceedings of 46th Annual IEEE Symposium on Foundations of Computer Science
  
  Pages: 327-353
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-16500001
[Journal Article] Any 7-Chromatic Graphs Has K_7 Or K_4, _4 As A Minor.2005
- Author(s)
  K.Kawarabayashi, B.Toft
- Journal Title
  
  Combinatorica 25-3
  
  Pages: 327-353
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-16500001
[Journal Article] Detecting even holes2005
- Author(s)
  M.Chudnovsky, K.Kawarabayashi, P.Seymour
- Journal Title
  
  J.Graph Theory 48
  
  Pages: 85-111
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] Nonseparating paths with two prescribed endvertices in $4$-connected graphs2005
- Author(s)
  K.Kawarabayashi
- Journal Title
  
  Annals of Combinatorics 9
  
  Pages: 47-56
- Data Source
  KAKENHI-PROJECT-16740044
[Journal Article] Algorithmic Graph Minor Theory : Decomposition, Approximation, and Coloring.2005
- Author(s)
  E.D.Demaine, M.Taghi Hajiaghayi, K.Kawarabayashi
- Journal Title
  
  Proceedings of 46th Annual IEEE Symposium on Foundations of Computer Science 46
  
  Pages: 327-353
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-16500001
[Journal Article] Acute triangles in 4-connected maximal plane graphs2005
- Author(s)
  K.Kawarabayashi, A.Nakamoto, Y.Oda, M.Watanabe
- Journal Title
  
  Discrete Mathematics 292(1-3)
  
  Pages: 95-106
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-16500001
[Journal Article] Improvement of the theorem of Duchet and Meyniel on Hadwiger's Conjecture2005
- Author(s)
  K.Kawarabayashi
- Journal Title
  
  J.Combin.Theory Ser.B 95
  
  Pages: 152-167
- Data Source
  KAKENHI-PROJECT-16740044
[Journal Article] Acute triangles in 4-connected maximal plane graphs2005
- Author(s)
  K.Kawarabayashi, A.Nakamoto, Y.Oda, M.Watanabe
- Journal Title
  
  Discrete Mathematics 293(1-3)
  
  Pages: 95-106
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-16500001
[Journal Article] Any 7-Chromatic Graphs Has K_7 Or K_<4,4> As A Minor.2005
- Author(s)
  K.Kawarabayashi, B.Toft
- Journal Title
  
  Combinatorica 25-3
  
  Pages: 327-353
- Data Source
  KAKENHI-PROJECT-16500001
[Journal Article] On Structure of $k$-connected graphs without $K_k$-minors2005
- Author(s)
  K.Kawarabayashi
- Journal Title
  
  Europ.J.Combinatorics 26
  
  Pages: 293-310
- Data Source
  KAKENHI-PROJECT-16740044
[Journal Article] Any $7$-chromatic graph has a $K_7$-minor or a $K_{4,4}$-minor2005
- Author(s)
  K.Kawarabayashi, B.Toft
- Journal Title
  
  Combinatorica 25
  
  Pages: 327-353
- Data Source
  KAKENHI-PROJECT-16740044
[Journal Article] Detecting Even Holes2005
- Author(s)
  M.Chudnovsky, K.Kawarabayashi, P.Seymour
- Journal Title
  
  Journal of Graph Theory 48(2)
  
  Pages: 85-111
- Data Source
  KAKENHI-PROJECT-16740044
[Journal Article] Acute triangles in 4-connected maximal plane graphs.2005
- Author(s)
  K.Kawarabayashi, A.Nakamoto, Y.Oda, M.Watanabe
- Journal Title
  
  Discrete Mathematics 292(1-3)
  
  Pages: 95-106
- Data Source
  KAKENHI-PROJECT-16500001
[Journal Article] Any 7-Chromatic Graphs Has K_7 Or K_<4.4> As A Minor.2005
- Author(s)
  K.Kawarabayashi, B.Toft
- Journal Title
  
  Combinatorica 25-3
  
  Pages: 327-353
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-16500001
[Journal Article] On the structure of k-connected graphs without K_k-minor.2005
- Author(s)
  K.Kawarabayashi, R.Luo, J.Niu, C.-Q.Zhang
- Journal Title
  
  European Journal of Combinatorics 26(3-4)
  
  Pages: 293-308
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-16500001
[Journal Article] Acute triangles in 4-connected plane graphs2005
- Author(s)
  K.Kawarabayashi
- Journal Title
  
  Discrete Math. 292
  
  Pages: 95-106
- Data Source
  KAKENHI-PROJECT-16740044
[Journal Article] On Properties of a Set of Global Roundings Associated with Clique Connection of Graphs2004
- Author(s)
  T.Ishikawa, K.Kawarabayashi, T.Tokuyama
- Journal Title
  
  Interdisciplinary Information Sciences 10(2)
  
  Pages: 159-163
- NAID
  110001065895
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-16500001
[Journal Article] Cycles through prescribed vertex set in n-connected graphs2004
- Author(s)
  K.Kawarabayashi
- Journal Title
  
  J.Combin.Theory Ser.B 90-2
  
  Pages: 315-323
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-16500001
[Journal Article] A theorem on paths in locally planar triangulations2004
- Author(s)
  K.Kawarabayashi
- Journal Title
  
  European J.Combin. 25
  
  Pages: 781-784
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] A theorem on paths in locally planar triangulations2004
- Author(s)
  Kawarabayashi, Ken-ichi
- Journal Title
  
  European J.Combin. 25
  
  Pages: 781-784
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] Cycles through prescribed vertex set in n-connected graphs.2004
- Author(s)
  K.Kawarabayashi
- Journal Title
  
  J.Combin.Theory Ser.B 90(2)
  
  Pages: 315-323
- Data Source
  KAKENHI-PROJECT-16500001
[Journal Article] Cycled through a prescribed vertex set in N-connected graphs2004
- Author(s)
  K.Kawarabayashi
- Journal Title
  
  Combin. Theory Ser.B 90
  
  Pages: 315-323
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] Cycles through prescribed vertex set in n-connected graphs2004
- Author(s)
  K.Kawarabayashi
- Journal Title
  
  J.Combin.Theroy Ser.B. 90(2)
  
  Pages: 315-323
- Data Source
  KAKENHI-PROJECT-16740044
[Journal Article] Rooted minor problems in highly connected graphs2004
- Author(s)
  Kawarabayashi, Ken-ichi
- Journal Title
  
  Discrete Math. 287
  
  Pages: 121-123
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] Cycles through prescribed vertex set in n-connected graphs.2004
- Author(s)
  K.Kawarabayashi
- Journal Title
  
  J. Combin. Theory Ser. B 90(2)
  
  Pages: 315-323
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-16500001
[Journal Article] On Properties of a Set of Global Roundings Associated with Clique Connections of Graphs2004
- Author(s)
  T.Ishikawa, K.Kawarabayashi, T.Tokuyama
- Journal Title
  
  Interdisciplinary Information Sciences 10(2)
  
  Pages: 159-163
- NAID
  110001065895
- Data Source
  KAKENHI-PROJECT-16500001
[Journal Article] Vertex-disjoint cycles containing specified vertices in a bipartite graph.2004
- Author(s)
  Chen, Guantao, Enomoto, Hikoe, Kawarabayashi, Ken-ichi, Ota, Katsuhiro, Lou, Dingjun, Saito, Akira
- Journal Title
  
  J.Graph Theory 46, no.3
  
  Pages: 145-165
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] A theorem on paths in locally triangulations.2004
- Author(s)
  K.Kawarabayashi
- Journal Title
  
  Europ.J.Combinatorics 25
  
  Pages: 781-784
- Data Source
  KAKENHI-PROJECT-16740044
[Journal Article] Rooted minor problems in highly connected graphs2004
- Author(s)
  K.Kawarabayashi
- Journal Title
  
  Discrete Math. 287
  
  Pages: 121-123
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] Rooted minors problem in highly connected graphs2004
- Author(s)
  K.Kawarabayashi
- Journal Title
  
  Discrete Math. 287
  
  Pages: 121-123
- Data Source
  KAKENHI-PROJECT-16740044
[Journal Article] Vertex-Disjoint Cycles Containing Specified Vertices in a Bipartite Graph2004
- Author(s)
  G.Chen, H.Enomoto, K.Kawarabayashi, D.Lou, K.Ota, A.Saito
- Journal Title
  
  Journal of Graph Theory 46(3)
  
  Pages: 145-166
- Data Source
  KAKENHI-PROJECT-16740044
[Journal Article] Cycles through a prescribed vertex set in N connected graphs.2004
- Author(s)
  Kawarabayashi, Ken-ichi
- Journal Title
  
  J.Combin.Theory Ser.B 90, no.2
  
  Pages: 315-323
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] Cycles through a prescribed vertex set in N-connected graphs2004
- Author(s)
  K.Kawarabayashi
- Journal Title
  
  Combin.Theory Ser.B 90
  
  Pages: 315-323
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] K-Linked Graphs with Girth Condition2004
- Author(s)
  K.Kawarabayashi
- Journal Title
  
  J.Graph Theory 45(1)
  
  Pages: 48-50
- Data Source
  KAKENHI-PROJECT-16740044
[Journal Article] On Properties of a Set of Global Roundings Associated with Clique Connection of Graphs2004
- Author(s)
  T.Ishikawa, K.Kawarabayashi, T.Tokuyama
- Journal Title
  
  Interdisciplinary Information Sciences 10-2
  
  Pages: 159-163
- NAID
  110001065895
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-16500001
[Journal Article] Vertex-disjoint cycles containing specified vertices in a bipartite graph2004
- Author(s)
  G.Chen, H.Enomoto, K.Kawarabayashi, K.Ota, D.Lou, A.Saito
- Journal Title
  
  J.Graph Theory 46
  
  Pages: 145-166
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] k-linked graphs with girth condition2004
- Author(s)
  K.Kawarabayashi
- Journal Title
  
  J. Graph Theory 45,no.1
  
  Pages: 48-50
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] κ-linked graphs with girth condition.2004
- Author(s)
  Kawarabayashi, Ken-ichi
- Journal Title
  
  J.Graph Theory 45, no.1
  
  Pages: 48-50
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] On two equimatchable graph classes.2003
- Author(s)
  Kawarabayashi, Ken-ichi, Plummer, Michael D., Saito, Akira
- Journal Title
  
  Discrete Math. 266, no.1-3
  
  Pages: 263-274
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] Cycles having the same modularity and removable edges in 2-connected graphs2003
- Author(s)
  K.Ando, M.Hagita, A.Kaneko, M.Kano, K.Kawarabayashi, A.Saito
- Journal Title
  
  Discrete Math. 265 no.1-3
  
  Pages: 23-30
- NAID
  40005603562
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] On two equimatchable graph classes2003
- Author(s)
  K.Kawarabayashi, M.Plummer, A.Saito
- Journal Title
  
  Discrete Math. 266,no.1-3
  
  Pages: 263-274
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] Some forbidden subgraph conditions for a graph to have a κ-contractible edge2003
- Author(s)
  Ando, Kiyoshi, Kawarabayashi, Ken-ichi
- Journal Title
  
  Discrete Math. 267, no.1-3
  
  Pages: 3-11
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] Subgraphs of graphs on surfaces with high representativity.2003
- Author(s)
  Kawarabayashi, Ken-ichi, Nakamoto, Atsuhiro, Ota, Katsuhiro
- Journal Title
  
  J.Combin.Theory Ser.B 89, no.2
  
  Pages: 207-229
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] 2-connected 7-coverings of 3-connected graphs on surfaces.2003
- Author(s)
  Kawarabayashi, Ken-ichi, Nakamoto, Atsuhiro, Ota, Katsuhiro
- Journal Title
  
  J.Graph Theory 43, no.1
  
  Pages: 26-36
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] Cycles having the same modularity and removable edges in 2-connected graphs.2003
- Author(s)
  Ando, Kiyoshi, Hagita, Mariko, Kaneko, Atsushi, Kano, Mikio, Kawarabayashi, Ken-ichi, Saito, Akira
- Journal Title
  
  Discrete Math. 265, no.1-3
  
  Pages: 23-30
- NAID
  40005603562
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] 2-connected 7-coverings of 3-connected graphs on surfaces2003
- Author(s)
  K.Kawarabayashi, A.Nakamoto, K.Ota
- Journal Title
  
  J.Graph Theory 43,no.1
  
  Pages: 26-36
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] Vertices of degree 6 in a contraction critically 6-connected graph.2003
- Author(s)
  Ando, Kiyoshi, Kaneko, Atsushi, Kawarabayashi, Ken-ichi
- Journal Title
  
  Discrete Math. 273, no.1-3
  
  Pages: 55-69
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] Vertices of degree 6 in a contraction critically 6-connected graph2003
- Author(s)
  K.Ando, A.Kaneko, K.Kawarabayashi
- Journal Title
  
  Discrete Math. 273 no.1-3
  
  Pages: 55-69
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] Subgraphs of graphs on surfaces with high-representativity2003
- Author(s)
  K.Kawarabayashi, A.Nakamoto, K.Ota
- Journal Title
  
  J.Combin. Theory Ser.B 89,no.2
  
  Pages: 207-229
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] Hamiltonian cycles in n-extendable graphs2002
- Author(s)
  K.Kawarabayashi, K.Ota, A.Saito
- Journal Title
  
  J. Graph Theory 40,no.2
  
  Pages: 75-82
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] K^-_4 -facter in a graph.2002
- Author(s)
  Kawarabayashi, Ken-ichi
- Journal Title
  
  J.Graph Theory 39, no.2
  
  Pages: 111-128
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] Contractible edges and bowties in a κ-connected graph.2002
- Author(s)
  Ando, Kiyoshi, Kaneko, Atsushi, Kawarabayashi, Ken-ichi, Yoshiomoto, Kiyoshi
- Journal Title
  
  Ars Combin. 64
  
  Pages: 239-247
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] On a Hamiltonian cycle in which specified vertices are not isolated2002
- Author(s)
  A.Kaneko, K.Kawarabayashi, K.Ota, K.Yoshimoto
- Journal Title
  
  Discrete math. 258,no.1-3
  
  Pages: 85-91
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] On separable self-complementary graphs.2002
- Author(s)
  Kawarabayashi, Ken-ichi, Nakamoto, Atsuhiro, Oda, Yoshiaki, Ota, Katsuhiro, Tazawa, Shinsei, Watanabe, Mamoru
- Journal Title
  
  Discrete Math. 257, no.1
  
  Pages: 165-168
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] Graph partition into paths containing specified vertices.2002
- Author(s)
  Kawarabayashi, Ken-ichi
- Journal Title
  
  Discrete Math. 248, no.1-3
  
  Pages: 271-277
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] Contractible edges and triangles in k-connected graphs2002
- Author(s)
  K.Kawarabayashi
- Journal Title
  
  J.Combin. Theory Ser.B 85,no.2
  
  Pages: 207-221
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] F-factor and vertex-disjoint F in a graph2002
- Author(s)
  K.Kawarabayashi
- Journal Title
  
  Ars Combin. 62
  
  Pages: 183-187
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] Path factors in cubic graphs.2002
- Author(s)
  Kawarabayashi, Ken-ichi, Matsuda, Haruhide, Oda, Yoshiaki, Ota, Katsuhiro
- Journal Title
  
  J.Graph Theory 39, no.3
  
  Pages: 188-193
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] On a Hamiltonian cycle in which specified vertices are not isolated.2002
- Author(s)
  Kaneko, Atsushi, Kawarabayashi, Ken-ichi, Ota, Katsuhiro, Yoshimoto, Kiyoshi
- Journal Title
  
  Discrete Math. 258, no.1-3
  
  Pages: 85-91
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] One or two disjoint circuits cover independent edges. Lovasz-Woodall conjecture.2002
- Author(s)
  Kawarabayashi, Ken-ichi
- Journal Title
  
  J.Combin.Theory Ser.B 84, no.1
  
  Pages: 1-44
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] One or two disjoint circuits cover independent edges. Lovasz-Woodall conjecture2002
- Author(s)
  K.Kawarabayashi
- Journal Title
  
  J.Combin. Theory Ser.B 84,no.1
  
  Pages: 1-44
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] K factor in a graph2002
- Author(s)
  K.Kawarabayashi
- Journal Title
  
  J. Graph Theory 39,no.2
  
  Pages: 111-128
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] Graph partition into paths containing specified vertices2002
- Author(s)
  K.Kawarabayashi
- Journal Title
  
  Discrete Math. 248,no.1-3
  
  Pages: 271-277
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] Contractible edges and bowties in a k-connected graph2002
- Author(s)
  K.Ando, A.Kaneko, K.Kawarabayashi, K.Yoshimoto
- Journal Title
  
  Ars Combin. 64
  
  Pages: 239-247
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] Path factors in cubic graphs2002
- Author(s)
  K.Kawarabayashi, H.Matsuda, Y.Oda, K.Ota
- Journal Title
  
  J. Graph Theory 39,no.3
  
  Pages: 188-193
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] F-factor and vertex-disjoint F in a graph.2002
- Author(s)
  Kawarabayashi, Ken-ichi
- Journal Title
  
  Ars Combin. 62
  
  Pages: 183-187
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] On separable self-complementary graphs2002
- Author(s)
  K.Kawarabayashi, A.Nakamoto, Y.Oda, K.Ota, S.Tazawa, M.Watanabe
- Journal Title
  
  Discrete Math. 257,no.1
  
  Pages: 165-168
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] Contractible edges and triangles in k-connected graphs.2002
- Author(s)
  Kawarabayashi, Ken-ichi
- Journal Title
  
  J.Combin.Theory Ser.B 85, no.2
  
  Pages: 207-221
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] Hamiltonian cycles in n-extendable graphs.2002
- Author(s)
  Kawarabayashi, Ken-ichi, Ota, Katsuhiro, Saito, Akira
- Journal Title
  
  J.Graph Theory 40, no.2
  
  Pages: 75-82
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-14540105
[Journal Article] List-Coloring Graphs without Subdivisions and without Immersions
- Author(s)
  K. Kawarabayashi and Y. Kobayashi
- Journal Title
  
  ACM-SIAM Symposium on Discrete Algorithms, (SODA'12)
  
  Pages: 1425-1435
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] Packing directed cycles through a specified vertex set
- Author(s)
  K. Kawarabayashi, M. Krcal, D. Kral and S. Kreutzer
- Journal Title
  
  ACM-SIAM Symposium on Discrete Algorithms
  
  Volume: SODA'13 Pages: 365-377
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] List-coloring embedded graphs
- Author(s)
  Z. Dvorak and K. Kawarabayashi
- Journal Title
  
  ACM-SIAM Symposium on Discrete Algorithms
  
  Volume: SODA'13 Pages: 1004-1012
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] Testing subdivision-freeness : property testing meets structural graph theory
- Author(s)
  K. Kawarabayashi and Y. Yoshida
- Journal Title
  
  the 43rd ACM Symposium on Theory of Computing(STOC 2013)
  
  Pages: 437-446
- NAID
  110009768651
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes
- Author(s)
  K. Eickmeyer, K. Kawarabayashi and S. Kreutzer
- Journal Title
  
  Logic in Computer Science(LICS'13)
  
  Pages: 134-142
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] Erdos-Posa property and its algorithmic applications --- parity constraints, subset feedback set, and subset packing
- Author(s)
  N. Kakimura, K. Kawarabayashi and Y. Kobayashi
- Journal Title
  
  ACM-SIAM Symposium on Discrete Algorithms, (SODA'12)
  
  Pages: 1726-1826
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] All-or-nothing multicommodity flow problem with bounded fractionality in planar graphs
- Author(s)
  K. Kawarabayashi and Y. Kobayashi
- Journal Title
  
  the 54th Annual Symposium on Foundations of Computer Science (FOCS 2013)
  
  Pages: 187-196
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] More Compact Oracles for Approximate Distances in Undirected Planar Graphs
- Author(s)
  K. Kawarabayashi, C. Sommer and M. Thorup
- Journal Title
  
  ACM-SIAM Symposium on Discrete Algorithms
  
  Volume: SODA'13 Pages: 550-561
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] Totally odd subdivisions and parity subdivisions : Structures and Coloring
- Author(s)
  K. Kawarabayashi
- Journal Title
  
  ACM-SIAM Symposium on Discrete Algorithms
  
  Volume: SODA'13 Pages: 1013-1029
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] Combinatorial coloring of 3-colorable graphs
- Author(s)
  K. Kawarabayashi and M. Thorup
- Journal Title
  
  the 53rd Annual Symposium on Foundations of Computer Science (FOCS 2012)
  
  Pages: 68-75
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] 5-coloring K_{3,k}-minor-free graphs
- Author(s)
  K. Kawarabayashi
- Journal Title
  
  ACM-SIAM Symposium on Discrete Algorithms
  
  Volume: SODA'13 Pages: 985-1003
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] Spanning closed walks and TSP in 3-connected planar graphs
- Author(s)
  K. Kawarabayashi and K. Ozeki
- Journal Title
  
  ACM-SIAM Symposium on Discrete Algorithms, (SODA'12)
  
  Pages: 671-682
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] A Simple Algorithm for the Graph Minor Decomposition - Logic meets Structural Graph Theory
- Author(s)
  M. Grohe, K. Kawarabayashi and B. Reed
- Journal Title
  
  ACM-SIAM Symposium on Discrete Algorithms
  
  Volume: SODA'13 Pages: 414-431
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Journal Article] 4-connected projective planar graphs are hamiltonian-connected
- Author(s)
  K. Kawarabayashi and K. Ozeki
- Journal Title
  
  ACM-SIAM Symposium on Discrete Algorithms
  
  Volume: SODA'13 Pages: 378-395
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21684002
[Presentation] 古典アルゴリズムとの比較：数理的な正当性と近似アルゴリズム2024
- Author(s)
  河原林健一
- Organizer
  2024年電気情報通信学会総合大会
- Invited
- Data Source
  KAKENHI-PROJECT-22H05001
[Presentation] Computing Canonical Graph Decompositions2023
- Author(s)
  河原林健一
- Organizer
  10TH SLOVENIAN CONFERENCE ON GRAPH THEORY
- Invited / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-22H05001
[Presentation] Toward the directed graph minor theory2023
- Author(s)
  河原林健一
- Organizer
  TGT35
- Invited / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-22H05001
[Presentation] Recent progress on Directed Graph Minor2022
- Author(s)
  河原林健一
- Organizer
  8th Czech-Slovak International Symposium on Graph Theory, Combinatorics, Algorithms and Applications
- Invited / Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-20H05965
[Presentation] Low diameter decomposition, polylogarithmic approximation for directed sparsest-cut, and embedding into directed for directed planar graph2021
- Author(s)
  Ken-ichi Kawarabayashi
- Organizer
  Banff International Research Station for Mathematical Innovation and Discovery2021
- Invited / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H05291
[Presentation] Low diameter decomposition, polylogarithmic approximation for directed sparsest-cut, and embedding into directed for directed planar graph2021
- Author(s)
  河原林健一
- Organizer
  Banff International Research Station for Mathematical Innovation and Discovery2021
- Invited / Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-20H05965
[Presentation] The Directed Flat Wall Theorem2020
- Author(s)
  Ken-ichi Kawarabayashi
- Organizer
  ACM-SIAM Symposium on Discrete Algorithms (SODA 2020)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H05291
[Presentation] Directed Graph Minor2020
- Author(s)
  Ken-ichi Kawarabayashi
- Organizer
  ICNTDM 2020
- Invited / Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-20H05965
[Presentation] The Directed Flat Wall Theorem.2020
- Author(s)
  Ken-ichi Kawarabayashi
- Organizer
  SODA'20
- Invited / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H05291
[Presentation] Some algorithmic aspect using the Four Color Theorem2019
- Author(s)
  Ken-ichi Kawarabayashi
- Organizer
  Waterloo Coloring Conference 2019
- Invited / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H05291
[Presentation] Algorithmic Topological Graph Theory2019
- Author(s)
  Ken-ichi Kawarabayashi
- Organizer
  42th ACCMCC
- Invited / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H05291
[Presentation] Directed Graph Minors2018
- Author(s)
  Ken-ichi Kawarabayashi
- Organizer
  30th Workshop on Topological Graph Theory
- Invited / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H05291
[Presentation] Deterministic global minimum cut of a simple graph in near-linear time2016
- Author(s)
  Ken-ichi Kawarabayashi
- Organizer
  HALG 2016
- Place of Presentation
  Paris
- Year and Date
  2016-06-06
- Invited / Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-24106003
[Presentation] Towards the Graph Minor Theorems for Directed Graphs2015
- Author(s)
  Ken-ichi Kawarabayashi
- Organizer
  the 42nd International Colloquium on Automata, Languages and Programming (ICALP)
- Place of Presentation
  Kyoto (Japan)
- Year and Date
  2015-07-06
- Invited / Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-24106003
[Presentation] An Excluded Grid Theorem for Digraphs with Forbidden Minors2014
- Author(s)
  Ken-ichi Kawarabayashi and Stephan Kreutzer
- Organizer
  SODA 2014
- Place of Presentation
  Portland, Oregon, USA
- Data Source
  KAKENHI-PLANNED-24106003
[Presentation] Mining for Analogous Tuples from an Entity-Relation Graph2013
- Author(s)
  Danushka Bollegala, Mitsuru Kusumoto, Yuichi Yoshida, and Ken-ichi Kawarabayashi
- Organizer
  IJCAI 2013
- Place of Presentation
  Beijing, China
- Data Source
  KAKENHI-PLANNED-24106003
[Presentation] Packing directed cycles through a specified vertex set2013
- Author(s)
  Ken-ichi Kawarabayashi, Marek Krcal, Daniel Kral and Stephan Kreutzer
- Organizer
  SODA 2013
- Place of Presentation
  New Orleans, Louisiana, USA
- Data Source
  KAKENHI-PLANNED-24106003
[Presentation] 5-coloring K_{3,k}-minor-free graphs: Beyond Thomassen2013
- Author(s)
  Ken-ichi Kawarabayashi
- Organizer
  SODA 2013
- Place of Presentation
  New Orleans, Louisiana, USA
- Data Source
  KAKENHI-PLANNED-24106003
[Presentation] More Compact Oracles for Approximate Distances in Undirected Planar Graphs2013
- Author(s)
  Ken-ichi Kawarabayashi, Christian Sommer and Mikkel Thorup
- Organizer
  SODA 2013
- Place of Presentation
  New Orleans, Louisiana, USA
- Data Source
  KAKENHI-PLANNED-24106003
[Presentation] Balancing the Traveling Tournament Problem for Weekday and Weekend Games2013
- Author(s)
  Richard Hoshino and Ken-ichi Kawarabayashi
- Organizer
  IAAI 2013
- Place of Presentation
  Bellevue, Washington, USA
- Data Source
  KAKENHI-PLANNED-24106003
[Presentation] Approximating Multi Commodity Network Design on Graphs of Bounded Pathwidth and Bounded Degree2013
- Author(s)
  Kord Eickmeyer, Ken-ichi Kawarabayashi
- Organizer
  SAGT 2013
- Place of Presentation
  Aachen, Germany
- Data Source
  KAKENHI-PLANNED-24106003
[Presentation] Testing Subdivision-Freeness: --- Property Testing Meets Structural Graph Theory ---2013
- Author(s)
  Ken{-}ichi Kawarabayashi and Yuichi Yoshida
- Organizer
  STOC 2013
- Place of Presentation
  Palo Alto, CA, USA
- Data Source
  KAKENHI-PLANNED-24106003
[Presentation] Coloring 3-colorable graphs2013
- Author(s)
  Ken-ichi Kawarabayashi
- Organizer
  16th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG2 2013)
- Place of Presentation
  Tokyo
- Invited
- Data Source
  KAKENHI-PROJECT-21684002
[Presentation] Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes2013
- Author(s)
  Kord Eickmeyer, Ken-ichi Kawarabayashi and Stephan Kreutzer
- Organizer
  LICS 2013
- Place of Presentation
  New Orleans, LA, USA
- Data Source
  KAKENHI-PLANNED-24106003
[Presentation] Totally odd subdivisions and parity subdivisions: Structures and Coloring2013
- Author(s)
  Ken-ichi Kawarabayashi
- Organizer
  SODA 2013
- Place of Presentation
  New Orleans, Louisiana, USA
- Data Source
  KAKENHI-PLANNED-24106003
[Presentation] A Simple Algorithm for the Graph Minor Decomposition - Logic meets Structural Graph Theory2013
- Author(s)
  Martin Grohe, Ken-ichi Kawarabayashi and Bruce Reed
- Organizer
  SODA 2013
- Place of Presentation
  New Orleans, Louisiana, USA
- Data Source
  KAKENHI-PLANNED-24106003
[Presentation] 4-connected projective-planar graphs are hamiltonian-connected2013
- Author(s)
  Ken-ichi Kawarabayashi and Kenta Ozeki
- Organizer
  SODA 2013
- Place of Presentation
  New Orleans, Louisiana, USA
- Data Source
  KAKENHI-PLANNED-24106003
[Presentation] List-coloring embedded graphs2013
- Author(s)
  Zdenek Dvorak and Ken-ichi Kawarabayashi
- Organizer
  SODA 2013
- Place of Presentation
  New Orleans, Louisiana, USA
- Data Source
  KAKENHI-PLANNED-24106003
[Presentation] Property testing for sparse graphs2013
- Author(s)
  Ken-ichi Kawarabayashi
- Organizer
  Graph Theory and Interactions
- Place of Presentation
  Durham, England, UK
- Invited
- Data Source
  KAKENHI-PROJECT-21684002
[Presentation] All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs2013
- Author(s)
  Ken-ichi Kawarabayashi and Yusuke Kobayashi
- Organizer
  FOCS 2013
- Place of Presentation
  Berkeley, CA, USA
- Data Source
  KAKENHI-PLANNED-24106003
[Presentation] Combinatorial Coloring of 3-Colorable Graphs2012
- Author(s)
  Ken-ichi Kawarabayashi and Mikkel Thorup
- Organizer
  FOCS 2012
- Place of Presentation
  New Brunswick, NJ, USA
- Data Source
  KAKENHI-PLANNED-24106003
[Presentation] What makes a 4-edge-connected graph so special?2011
- Author(s)
  Ken-ichi Kawarabayashi
- Organizer
  European Conference on Combinatorics, Graph Theory and Applications
- Place of Presentation
  ブダペスト(招待講演)
- Data Source
  KAKENHI-PROJECT-21684002
[Presentation] TSP in minor-closed family of graphs2011
- Author(s)
  Ken-ichi Kawarabayashi
- Organizer
  Japan-Hungary Discrete Mathematics Conference
- Place of Presentation
  京都大学数理解析研究所(招待講演)
- Data Source
  KAKENHI-PROJECT-21684002
[Presentation] What makes a 4-edge-connected graph so special?2011
- Author(s)
  K. Kawarabayashi
- Organizer
  European Conference on Combinatorics, Graph Theory and Applications
- Place of Presentation
  ブダペスト
- Year and Date
  2011-09-04
- Invited
- Data Source
  KAKENHI-PROJECT-21684002
[Presentation] TSP in minor-closed family of graphs2011
- Author(s)
  K. Kawarabayashi
- Organizer
  Japan-Hungary Discrete Mathematics Conference
- Place of Presentation
  京都大学数理解析研究所
- Year and Date
  2011-05-20
- Invited
- Data Source
  KAKENHI-PROJECT-21684002
[Presentation] The disjoint paths problem---Algorithm and Structure2011
- Author(s)
  K.Kawarabayashi
- Organizer
  WALCOM'2011
- Place of Presentation
  IITニューデリー
- Year and Date
  2011-02-20
- Data Source
  KAKENHI-PROJECT-21650004
[Presentation] Hadwiger's conjecture is decidable2009
- Author(s)
  K.Kawarabayashi
- Organizer
  The 6th Japan-Hungary conference in Discrete Math
- Place of Presentation
  Budapest
- Year and Date
  2009-05-16
- Data Source
  KAKENHI-PROJECT-21650004
[Presentation] The disjoint paths problem, structure and algorithm2009
- Author(s)
  K.Kawarabayashi
- Organizer
  Fourth workshop in Graph Classes, Optimization, and Width Parameters, GROW 2009
- Place of Presentation
  Bergen
- Year and Date
  2009-10-15
- Data Source
  KAKENHI-PROJECT-21650004
[Presentation] Hadwiger's conjecture is decidable2009
- Author(s)
  K. Kawarabayashi
- Organizer
  The 6th Japan-Hungary conference in Discrete Math
- Place of Presentation
  Budapest
- Year and Date
  2009-05-16
- Data Source
  KAKENHI-PROJECT-21684002
[Presentation] The disjoint paths problem, structure and algorithm2009
- Author(s)
  K. Kawarabayashi
- Organizer
  Fourth workshop in Graph Classes, Optimization, and Width Parameters, GROW 2009
- Place of Presentation
  Bergen
- Year and Date
  2009-10-15
- Data Source
  KAKENHI-PROJECT-21684002
[Presentation] Graphs without subdivision2009
- Author(s)
  K. Kawarabayashi
- Organizer
  Danish Graph Theory
- Place of Presentation
  Copenhagen
- Year and Date
  2009-11-26
- Data Source
  KAKENHI-PROJECT-21684002
[Presentation] Graphs without subdivision2009
- Author(s)
  K.Kawarabayashi
- Organizer
  Danish Graph Theory
- Place of Presentation
  Copenhagen
- Year and Date
  2009-11-26
- Data Source
  KAKENHI-PROJECT-21650004
[Presentation] Computing Crossing Number in Linear Time2007
- Author(s)
  K. Kawarabayashi, B. Reed
- Organizer
  39th Annual ACM Symposium on Theory of Computing
- Place of Presentation
  San Diego, California, アメリカ
- Data Source
  KAKENHI-PROJECT-16092202
[Presentation] Coloring graphs with some forbidden or restricted configuration
- Author(s)
  Ken-ichi Kawarabayashi
- Organizer
  The 7th Craocow Conference on Graph Theory `RYTRO’14
- Place of Presentation
  Rytro, Poland
- Year and Date
  2014-09-14 – 2014-09-19
- Invited
- Data Source
  KAKENHI-PLANNED-24106003
[Presentation] Towards the grid minor theorem for directed graphs
- Author(s)
  Ken-ichi Kawarabayashi
- Organizer
  The 23rd Workshop on Cycles and Colourings
- Place of Presentation
  Novy Smokovec, High Tatras, Slovakia
- Year and Date
  2014-09-07 – 2014-09-12
- Invited
- Data Source
  KAKENHI-PLANNED-24106003
[Presentation] Fast Shortest-path Distance Queries on Road Networks by Pruned Highway Labeling
- Author(s)
  Takuya Akiba, Yoichi Iwata, Ken-ichi Kawarabayashi and Yuki Kawata
- Organizer
  ALENEX 2014
- Place of Presentation
  Portland, Oregon, USA
- Data Source
  KAKENHI-PLANNED-24106003

1. AVIS David (90584110)

# of Collaborated Projects: 4 results

# of Collaborated Products: 0 results
2. 吉田悠一 (50636967)

# of Collaborated Projects: 4 results

# of Collaborated Products: 4 results
3. TOKUYAMA Takeshi (40312631)

# of Collaborated Projects: 3 results

# of Collaborated Products: 3 results
4. ANDO Kiyoshi (20096944)

# of Collaborated Projects: 2 results

# of Collaborated Products: 13 results
5. MINATO Shinichi (10374612)

# of Collaborated Projects: 2 results

# of Collaborated Products: 0 results
6. MAKINO Kazuhisa (60294162)

# of Collaborated Projects: 2 results

# of Collaborated Products: 0 results
7. YAMASHITA Shigeru (30362833)

# of Collaborated Projects: 2 results

# of Collaborated Products: 0 results
8. TAKIMOTO Eiji (50236395)

# of Collaborated Projects: 2 results

# of Collaborated Products: 0 results
9. HORIYAMA Takashi (60314530)

# of Collaborated Projects: 2 results

# of Collaborated Products: 0 results
10. 玉置卓 (40432413)

# of Collaborated Projects: 2 results

# of Collaborated Products: 0 results
11. 垣村尚徳 (30508180)

# of Collaborated Projects: 2 results

# of Collaborated Products: 3 results
12. 小林佑輔 (40581591)

# of Collaborated Projects: 2 results

# of Collaborated Products: 3 results
13. 黒木祐子 (50889095)

# of Collaborated Projects: 2 results

# of Collaborated Products: 0 results
14. EGAWA Yoshimi (70147502)

# of Collaborated Projects: 1 results

# of Collaborated Products: 3 results
15. ISHIGAMI Yoshiyasu (50262374)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
16. Watanabe Osamu (80158617)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
17. ASANO Takao (90124544)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
18. IBARAKI Toshihide (50026192)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
19. IMAI Hiroshi (80183010)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
20. TODA Seinosuke (90172163)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
21. MARUOKA Akira (50005427)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
22. ASANO Tetsuo (90113133)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
23. KATOH Naoki (40145826)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
24. MORI Ryuhei (60732857)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
25. Fujiwara Ikki (90648023)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
26. Koibuchi Michihiro (40413926)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
27. 塩浦昭義 (10296882)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
28. 全眞嬉 (80431550)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
29. 脊戸和寿 (20584056)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
30. 伊藤大雄 (50283487)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
31. 金子篤司 (30255608)

# of Collaborated Projects: 1 results

# of Collaborated Products: 8 results
32. 宇野毅明 (00302977)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
33. 安田宜仁 (50396149)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
34. 上原隆平 (00256471)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
35. 岩田覚 (00263161)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
36. 福永拓郎 (60452314)

# of Collaborated Projects: 1 results

# of Collaborated Products: 3 results
37. 平原秀一 (80848440)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
38. 林興養 (40963559)

# of Collaborated Projects: 1 results

# of Collaborated Products: 3 results
39. Fujita Satoshi

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
40. Nakano Koji

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
41. Takafuji Daisuke

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
42. Matsutani Hiroki

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
43. Yasudo Ryota

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
44. FULLA PETER

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
45. HOSHINO Richard

# of Collaborated Projects: 0 results

# of Collaborated Products: 2 results
46. 藤田慎也

# of Collaborated Projects: 0 results

# of Collaborated Products: 1 results
47. 小関健太

# of Collaborated Projects: 0 results

# of Collaborated Products: 1 results

KAWARABAYASHI Ken-ichi 河原林 健一

Research Projects

Research Products

Co-Researchers

Graph Algorithms and Optimization: Theory and Scalable AlgorithmsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

Research Initiatives on Algorithmic Foundations for Social Advancement

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

New computational models for algorithms and discrete optimizationPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

Large Graphs: Theory and AlgorithmsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

TSP in Combinatorial Optimization and CSP in Theoretical Computer SciencePrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Interconnection networks approaching the theoretical limit

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Studies on Limits of Computation via Information and Coding TheoryPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

A Multifaced Approach Toward Understanding the Limitations of Compuation

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

アルゴリズム的グラフマイナー理論Principal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

structural graph theory and eifficient algorithm for graph coloring problemsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

A study on the distance structure and the connectivity structure of graphs

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

計算理論的設計による知識抽出モデルに関する研究

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

グラフ彩色問題における4色定理の応用、拡張に関する研究Principal Investigator

Principal Investigator

Project Period (FY)

Research Category

KAWARABAYASHI Ken-ichi 河原林健一