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

Zhou Xiao  周 暁

ORCIDConnect your ORCID iD *help
… Alternative Names

ZHOU Xiao  周 暁

周 曉  シュウ ギョウ

Less
Researcher Number 10272022
Other IDs
Affiliation (Current) 2025: 東北大学, 情報科学研究科, 教授
Affiliation (based on the past Project Information) *help 2016 – 2021: 東北大学, 情報科学研究科, 教授
2013: 東北大学, 大学院情報科学研究科, 教授
2011 – 2013: 東北大学, 情報科学研究科, 教授
2007 – 2009: Tohoku University, 大学院・情報科学研究科, 准教授
2006: Tohoku University, Graduate School of Information Sciences, Assistant Professor, 大学院情報科学研究科, 助教授 … More
2000 – 2006: Tohoku University, Graduate School of Information Sciences, Assistant Professor, 大学院・情報科学研究科, 助教授
2001: Tohoku University, Graduate School of Information Sciences, Associate Professor, 情報科学研究科, 助教授
1997 – 1999: 東北大学, 大学院・情報科学研究科, 講師
1998: 東北大学, 大学院情報科学研究科, 講師 Less
Review Section/Research Field
Principal Investigator
Fundamental theory of informatics / 計算機科学 / Basic Section 60010:Theory of informatics-related / Theory of informatics
Except Principal Investigator
Fundamental theory of informatics / 計算機科学 / Science and Engineering
Keywords
Principal Investigator
アルゴリズム / 彩色 / グラフ / 木 / 部分k木 / 辺彩色 / FPTアルゴリズム / NP困難 / 計算量理論 / 木幅 … More / algorithm / 動的計画法 / 分解木 / 直並列グラフ / コスト辺彩色 / 点彩色 / 辺ランク付け / FTPアルゴリズム / 組合せ最適化問題 / 木構造 / NP困難性 / 多項式時間アルゴリズム / 最適化問題 / 組合せ問題 / 木分解 / coloring / tree-decomposition / partial k-tree / [g, f]-coloring / 1-vertex-coloring / cost edge-coloring / total coloring / edge-coloring / graph / 彩色問題 / ランク付け / 辺ランク / 部分k-ホ / 金彩色 / [g,f]辺彩色 / 1-点彩色 / 全彩色 / FPTAS / FPTAS / 部分k木 / グラフ分割 / 部分木 / 線形時間 / 多項式時間 / 重み付き彩色 / 多重彩色 / リスト辺彩色 / 並列アルゴリズム / [g, f]-辺彩色 / 部分k-木 … More
Except Principal Investigator
アルゴリズム / グラフ描画 / 部分k木 / Edge-Colorings / Structured Graphs / Algorithms / 辺彩色 / 構造的グラフ / 直並列グラフ / Edge-Disjoint Paths / 辺素な道 / Series-Parallel Graphs / VLSI設計 / 設計自動化 / 離散構造 / アルゴリズム理論 / Orthogonal Drawir / List Total Coloring / Partial k-Trees / 直交描画 / リスト全彩色 / Plane graph / Straight line drawing / Inner rectangul drawing / Rectangular drawing / Graph Drawing / Algorithm / 平面グラフ / 直線描画 / 内部矩形描画 / 矩形描画 / Graph Drawlngs / Series-Paraphs / Partial κ-Trees / 部分K木 / Partial κ-trees / Partial kappa-trees / 3連結成分分解木 / 内部3連結グラフ / 格子凸描画 / グラフ彩色 / グラフ分割 / 擬多項式時間 / 辺容量 / 公平連結分割 / 全域配送林 / 描画 / 彩色 / 分割 / グラフ / インターネット高度化 / 情報基礎 / 可視化 / インターネット高速化 Less
  • Research Projects

    (17 results)
  • Research Products

    (164 results)
  • Co-Researchers

    (9 People)
  •  The Ridesharing Problem of Graphs and Its ApplicationsPrincipal Investigator

    • Principal Investigator
      Zhou Xiao
    • Project Period (FY)
      2019 – 2021
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Review Section
      Basic Section 60010:Theory of informatics-related
    • Research Institution
      Tohoku University
  •  Research on Design Method of Graph Algorithm based on Tree StructurePrincipal Investigator

    • Principal Investigator
      Zhou Xiao
    • Project Period (FY)
      2016 – 2018
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Theory of informatics
    • Research Institution
      Tohoku University
  •  Study on a Design Method of Graph Partition Algorithm and Its ApplicationsPrincipal Investigator

    • Principal Investigator
      ZHOU Xiao
    • Project Period (FY)
      2011 – 2013
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Tohoku University
  •  Efficient Algorithms for Partitionings, Colorings and Drawings of Graphs and their Applications

    • Principal Investigator
      NISHIZEKI Takao
    • Project Period (FY)
      2009 – 2013
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Kwansei Gakuin University
      Tohoku University
  •  Design Theory of Algorithms for Partial k-TreesPrincipal Investigator

    • Principal Investigator
      ZHOU Xiao
    • Project Period (FY)
      2007 – 2009
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Tohoku University
  •  Graph Drawing Algorithms and Applications to VLSI Designs

    • Principal Investigator
      NISHIZEKI Takao
    • Project Period (FY)
      2007 – 2008
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Tohoku University
  •  Unified Methodology for Designing Efficient Algorithms

    • Principal Investigator
      NISHIZEKI Takao
    • Project Period (FY)
      2005 – 2006
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Tohoku University
  •  グラフ描画アルゴリズムとそのWeb情報検索への応用

    • Principal Investigator
      NISHIZEKI Takao
    • 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
  •  The Research for Finding Algorithms to Solve Some Combination Problems on Partial k-TreesPrincipal Investigator

    • Principal Investigator
      ZHOU Xiao
    • Project Period (FY)
      2004 – 2006
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Tohoku University
  •  Research on algorithms and theory of graph drawings

    • Principal Investigator
      NISHIZEKI Takao
    • Project Period (FY)
      2003 – 2004
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Tohoku University
  •  通信スケジューリングのグラフアルゴリズムによる解法Principal Investigator

    • Principal Investigator
      周 暁
    • Project Period (FY)
      2001 – 2002
    • Research Category
      Grant-in-Aid for Young Scientists (B)
    • Research Field
      計算機科学
    • Research Institution
      Tohoku University
  •  A Study on Efficient Graph Algprithms and their Evaluation

    • Principal Investigator
      NISHIZEKI Takao
    • Project Period (FY)
      2001 – 2002
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      計算機科学
    • Research Institution
      Tohoku University
  •  通信スケジューリングのグラフアルゴリズムによる解法Principal Investigator

    • Principal Investigator
      周 暁
    • Project Period (FY)
      1999 – 2000
    • Research Category
      Grant-in-Aid for Encouragement of Young Scientists (A)
    • Research Field
      計算機科学
    • Research Institution
      Tohoku University
  •  Algorithm Engineering for Structural Graphs

    • Principal Investigator
      NISHIZEKI Takao
    • Project Period (FY)
      1999 – 2000
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      計算機科学
    • Research Institution
      Tohoku University
  •  A Method for solving scheduling problems by graph algorithmsPrincipal Investigator

    • Principal Investigator
      ZHOU Xiao
    • Project Period (FY)
      1998 – 2000
    • Research Category
      Grant-in-Aid for Scientific Research on Priority Areas (B)
    • Research Institution
      Tohoku University
  •  ネットワーク上の通信スケジューリングの分散アルゴリズムPrincipal Investigator

    • Principal Investigator
      周 暁
    • Project Period (FY)
      1997 – 1998
    • Research Category
      Grant-in-Aid for Encouragement of Young Scientists (A)
    • Research Field
      計算機科学
    • Research Institution
      Tohoku University
  •  Paradigm for Designing Efficient Algorithms on Structured Graphs

    • Principal Investigator
      NISHIZEKI Takao
    • Project Period (FY)
      1997 – 1998
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      計算機科学
    • Research Institution
      Tohoku University

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

All Journal Article Presentation

  • [Journal Article] Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs2021

    • Author(s)
      Yuma Tamura, Takehiro Ito and Xiao Zhou
    • Journal Title

      Theoretical Computer Science

      Volume: 849 Pages: 227-236

    • DOI

      10.1016/j.tcs.2020.10.026

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19K11813, KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20J11259, KAKENHI-PLANNED-20H05793, KAKENHI-PROJECT-18H04091
  • [Journal Article] Approximability of the independent feedback vertex set problem for bipartite graphs2021

    • Author(s)
      Yuma Tamura, Takehiro Ito and Xiao Zhou
    • Journal Title

      Theoretical Computer Science

      Volume: 849 Pages: 227-236

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19K11813
  • [Journal Article] Decremental optimization of vertex-coloring under the reconfiguration framework2021

    • Author(s)
      Yusuke Yanagisawa, Yuma Tamura, Akira Suzuki and Xiao Zhou
    • Journal Title

      Proceedings of the 27th International Computing and Combinatorics Conference (COCOON 2021), Lecture Notes in Computer Science (LNCS)

      Volume: 13025 Pages: 355-366

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19K11813
  • [Journal Article] Minimization and Parameterized Variants of Vertex Partition Problems on Graphs2020

    • Author(s)
      Yuma Tamura, Takehiro Ito and Xiao Zhou
    • Journal Title

      Proceedings of the 31st International Symposium on Algorithms and Computation (ISAAC2020), Leibniz International Proceedings in Informatics (LIPIcs)

      Volume: 181

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-19K11813
  • [Journal Article] Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs2020

    • Author(s)
      Yuma Tamura, Takehiro Ito and Xiao Zhou
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 12049 Pages: 286-295

    • DOI

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

    • ISBN
      9783030398804, 9783030398811
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19K11813
  • [Journal Article] The Coloring Reconfiguration Problem on Specific Graph Classes2019

    • Author(s)
      HATANAKA Tatsuhiko、ITO Takehiro、ZHOU Xiao
    • Journal Title

      IEICE Trans. Inf. & Syst.

      Volume: E102.D Issue: 3 Pages: 423-429

    • DOI

      10.1587/transinf.2018FCP0005

    • NAID

      130007606879

    • ISSN
      0916-8532, 1745-1361
    • Year and Date
      2019-03-01
    • Language
      English
    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-16J02175, KAKENHI-PROJECT-16K00003, KAKENHI-PROJECT-16K00004, KAKENHI-PROJECT-19K11813
  • [Journal Article] Reconfiguration of Minimum Steiner Trees via Vertex Exchanges2019

    • Author(s)
      Haruka Mizuta, Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou
    • Journal Title

      Leibniz International Proceedings in Informatics

      Volume: 138

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-19K11813
  • [Journal Article] Computational Power of Threshold Circuits of Energy at most Two2018

    • Author(s)
      MANIWA Hiroki、OKI Takayuki、SUZUKI Akira、UCHIZAWA Kei、ZHOU Xiao
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: E101.A Issue: 9 Pages: 1431-1439

    • DOI

      10.1587/transfun.E101.A.1431

    • NAID

      130007479449

    • ISSN
      0916-8508, 1745-1337
    • Year and Date
      2018-09-01
    • Language
      English
    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K12636, KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-16K00003, KAKENHI-PROJECT-16K00006
  • [Journal Article] The Complexity of (List) Edge-Coloring Reconfiguration Problem2018

    • Author(s)
      Osawa Hiroki、Suzuki Akira、Ito Takehiro、Zhou Xiao
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: E101.A Issue: 1 Pages: 232-238

    • DOI

      10.1587/transfun.E101.A.232

    • NAID

      130006300867

    • ISSN
      0916-8508, 1745-1337
    • Language
      English
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-16K00004, KAKENHI-PROJECT-17K12636, KAKENHI-PROJECT-16K00003
  • [Journal Article] Computational power of threshold circuits of energy at most two2018

    • Author(s)
      Hiroki Maniwa, Takayuki Oki, Akira Suzuki, Kei Uchizawa, Xiao Zhou
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

      Volume: 印刷中

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16K00003
  • [Journal Article] Algorithms for Coloring Reconfiguration under Recolorability Constraints2018

    • Author(s)
      Hiroki Osawa, Akira Suzuki, Takehiro Ito, and Xiao Zhou
    • Journal Title

      Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC 2018), Leibniz International Proceedings in Informatics

      Volume: 123

    • DOI

      10.4230/LIPICS.ISAAC.2018.37

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-16K00003, KAKENHI-PROJECT-16K00004
  • [Journal Article] Parameterized complexity of the list coloring reconfiguration problem with graph parameters2018

    • Author(s)
      Hatanaka Tatsuhiko、Ito Takehiro、Zhou Xiao
    • Journal Title

      Theoretical Computer Science

      Volume: 739 Pages: 65-79

    • DOI

      10.1016/j.tcs.2018.05.005

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-16J02175, KAKENHI-PROJECT-16K00003, KAKENHI-PROJECT-16K00004
  • [Journal Article] Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters2017

    • Author(s)
      Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou
    • Journal Title

      In Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), Leibniz International Proceedings in Informatics

      Volume: 83

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16K00003
  • [Journal Article] The Coloring Reconfiguration Problem on Specific Graph Classes2017

    • Author(s)
      Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou
    • Journal Title

      In Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2017), Lecture Notes in Computer Science

      Volume: 10627 Pages: 152-162

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16K00003
  • [Journal Article] Reconfiguration of Steiner Trees in an Unweighted Graph2017

    • Author(s)
      Haruka Mizuta, Takehiro Ito and Xiao Zhou
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: E100.A Issue: 7 Pages: 1532-1540

    • DOI

      10.1587/transfun.E100.A.1532

    • NAID

      130007311770

    • ISSN
      0916-8508, 1745-1337
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16K00003, KAKENHI-PROJECT-16K00004
  • [Journal Article] The Complexity of (List) Edge-Coloring Reconfiguration Problem2017

    • Author(s)
      Hiroki Osawa, Akira Suzuki, Takehiro Ito and Xiao Zhou
    • Journal Title

      In Proceedings of the 11th International Conference and Workshops on Algorithms and Computation (WALCOM 2017), Lecture Notes in Computer Science

      Volume: 10167 Pages: 347-358

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16K00003
  • [Journal Article] Complexity of Coloring Reconfiguration under Recolorability Constraints2017

    • Author(s)
      Hiroki Osawa, Akira Suzuki, Takehiro Ito and Xiao Zhou
    • Journal Title

      In Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC 2017), Leibniz International Proceedings in Informatics

      Volume: 92

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16K00003
  • [Journal Article] The Complexity of (List) Edge-Coloring Reconfiguration Problem2017

    • Author(s)
      Hiroki Osawa, Akira Suzuki, Takehiro Ito and Xiao Zhou
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 10167 Pages: 347-358

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-16K00003
  • [Journal Article] A Dynamic Programming Algorithm for the Ridersharing Problem Restricted with Unique Destination and Zero Detour on Trees2017

    • Author(s)
      Li Yiming、Lu Huiqiang、Ye Zhiqian、Zhou Xiao
    • Journal Title

      Journal of Applied Mathematics and Physics

      Volume: 05 Issue: 09 Pages: 1678-1685

    • DOI

      10.4236/jamp.2017.59140

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K00003
  • [Journal Article] The Minimum Vulnerability Problem on Specific Graph Classes2016

    • Author(s)
      Yusuke Aoki, Bjarni V. Halldorsson, Magnus M. Halldorsson, Takehiro Ito, Christian Konrad and Xiao Zhou
    • Journal Title

      Journal of Combinatorial Optimization

      Volume: 32 Pages: 1288-1304

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K00003
  • [Journal Article] Reconfiguration of Vertex Covers in a Graph2016

    • Author(s)
      Takehiro Ito, Hiroyuki Nooka and Xiao Zhou
    • Journal Title

      IEICE Trans. on Information and Systems

      Volume: E99-D Pages: 598-606

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16K00003
  • [Journal Article] Reconfiguration of Steiner Trees in an Unweighted Graph2016

    • Author(s)
      Haruka Mizuta, Takehiro Ito and Xiao Zhou
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 9843 Pages: 163-175

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-16K00003
  • [Journal Article] Bandwidth consecutive multicolorings of graphs2014

    • Author(s)
      Kazuhide Nishikawa, Takao Nishizeki and Xiao Zhou
    • Journal Title

      Theoretical Computer Science

      Volume: 印刷中

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500001
  • [Journal Article] Generalized rainbow connectivity of graphs2014

    • Author(s)
      Kei Uchizawa, Takanori Aoki, Takehiro Ito and Xiao Zhou
    • Journal Title

      Theoretical Computer Science (TCS)

      Volume: 555 Pages: 35-42

    • DOI

      10.1016/j.tcs.2014.01.007

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500001, KAKENHI-PLANNED-24106010, KAKENHI-PUBLICLY-25106504, KAKENHI-PROJECT-25330003, KAKENHI-PROJECT-25330005
  • [Journal Article] Generalized rainbow connectivity of graphs2014

    • Author(s)
      Kei Uchizawa, Takanori Aoki, Takehiro Ito and Xiao Zhou
    • Journal Title

      Theoretical Computer Science

      Volume: 印刷中

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500001
  • [Journal Article] Reconfigure on list L(2, 1)-labelings in a graph2014

    • Author(s)
      Takehiro Ito, Kazuto Kawamura, Hitotaka Ono and Xiao Zhou
    • Journal Title

      Theoretical Computer Science (TCS)

      Volume: 544 Pages: 84-97

    • DOI

      10.1016/j.tcs.2014.04.011

    • NAID

      110009670153

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500001, KAKENHI-PLANNED-24106004, KAKENHI-PROJECT-24220003, KAKENHI-PUBLICLY-25106504, KAKENHI-PROJECT-25330003
  • [Journal Article] Bandwidth consecutive multicolorings of graphs2014

    • Author(s)
      Kazuhide Nishikawa, Takao Nishizeki and Xiao Zhou
    • Journal Title

      Theoretical Computer Science (TCS)

      Volume: 532 Pages: 64-72

    • DOI

      10.1016/j.tcs.2013.02.015

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500001
  • [Journal Article] On the Minimum Caterpillar Problem in Digraphs2014

    • Author(s)
      Taku Okada, Akira Suzuki, Takehiro Ito and Xiao Zhou
    • Journal Title

      IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences

      Volume: E97-A Pages: 848-857

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500001
  • [Journal Article] On the Minimum Caterpillar Problem in Digraphs2014

    • Author(s)
      Taku Okada, Akira Suzuki, Takehiro Ito and Xiao Zhou
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: E97.A Issue: 3 Pages: 848-857

    • DOI

      10.1587/transfun.E97.A.848

    • NAID

      130003394790

    • ISSN
      0916-8508, 1745-1337
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500001, KAKENHI-PUBLICLY-25106504, KAKENHI-PROJECT-25330003
  • [Journal Article] Reconfigure on list L(2,1)-labelings in a graph2014

    • Author(s)
      Takehiro Ito, Kazuto Kawamura, Hitotaka Ono and Xiao Zhou
    • Journal Title

      Theoretical Computer Science

      Volume: 印刷中

    • NAID

      110009670153

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500001
  • [Journal Article] Energy and fan-in of logic circuits computing symmetric Boolean functions2013

    • Author(s)
      Akira Suzuki, Kei Uchizawa and Xiao Zhou
    • Journal Title

      Theoretical Computer Science

      Volume: 505 Pages: 74-80

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500001
  • [Journal Article] Energy-efficient threshold circuits computing MOD functions2013

    • Author(s)
      Akira Suzuki, Kei Uchizawa and Xiao Zhou
    • Journal Title

      International Journal of Foundations of Computer Science

      Volume: 24 Pages: 15-29

    • NAID

      110008676159

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500001
  • [Journal Article] Bandwidth consecutive multicolorings of graphs2013

    • Author(s)
      Kazuhide Nishikawa, Takao Nishizeki and Xiao Zhou
    • Journal Title

      Theoretical Computer Science (TCS)

      Volume: 印刷中

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500001
  • [Journal Article] Energy and fan-in of logic circuits computing symmetric Boolean functions2013

    • Author(s)
      Akira Suzuki, Kei Uchizawa and Xiao Zhou
    • Journal Title

      Theoretical Computer Science (TCS)

      Volume: 505 Pages: 74-80

    • DOI

      10.1016/j.tcs.2012.11.039

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-12J03660, KAKENHI-PROJECT-23500001, KAKENHI-PROJECT-23700003, KAKENHI-PLANNED-24106010, KAKENHI-PROJECT-25330005
  • [Journal Article] On the rainbow connectivity of graphs: complexity and FPT algorithms2013

    • Author(s)
      Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki and Xiao Zhou
    • Journal Title

      Algorithmica

      Volume: 67 Pages: 161-179

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500001
  • [Journal Article] On the rainbow connectivity of graphs : complexity and FPT algorithms2013

    • Author(s)
      Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki and Xiao Zhou
    • Journal Title

      Algorithmica

      Volume: 67, Issue2 Issue: 2 Pages: 161-179

    • DOI

      10.1007/s00453-012-9689-4

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500001, KAKENHI-PROJECT-23700003, KAKENHI-PLANNED-24106010, KAKENHI-PROJECT-25330005
  • [Journal Article] Energy-efficient threshold circuits computing MOD functions2013

    • Author(s)
      Akira Suzuki, Kei Uchizawa and Xiao Zhou
    • Journal Title

      International Journal of Foundations of Computer Science (IJFCS)

      Volume: 24 Issue: 01 Pages: 15-29

    • DOI

      10.1142/s0129054113400029

    • NAID

      110008676159

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500001, KAKENHI-PROJECT-23700003
  • [Journal Article] Partitioning a Weighted Tree into Subtrees with Weights in a Given Range2012

    • Author(s)
      T. Ito, T. Nishizeki, M. Schroder, T. Uno, X. Zhou
    • Journal Title

      Algorithmica

      Volume: 62 Pages: 823-841

    • URL

      http://www.springerlink.com/content/r0prp612975834g1/

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500001
  • [Journal Article] An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree2012

    • Author(s)
      Takehiro Ito, Kazuto Kawamura and Xiao Zhou
    • Journal Title

      IEICE Trans. Inf. & Syst.

      Volume: E95-D Issue: 3 Pages: 737-745

    • DOI

      10.1587/transinf.E95.D.737

    • NAID

      10030611536

    • ISSN
      0916-8532, 1745-1361
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22700001, KAKENHI-PROJECT-23500001
  • [Journal Article] Minimum cost partitions of trees with supply and demand2012

    • Author(s)
      T. Nishizeki, T. Ito
    • Journal Title

      Algorithmica

      Volume: 64 Issue: 3 Pages: 400-415

    • DOI

      10.1007/s00453-011-9573-7

    • NAID

      110008676163

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500001, KAKENHI-PROJECT-22700001, KAKENHI-PROJECT-23500001
  • [Journal Article] Energy-Efficient Threshold Circuits for Comparison Functions2012

    • Author(s)
      Kei Uchizawa and Xiao Zhou
    • Journal Title

      IIS

      Volume: 18 Issue: 2 Pages: 161-166

    • DOI

      10.4036/iis.2012.161

    • NAID

      130002531676

    • ISSN
      1340-9050, 1347-6157
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500001, KAKENHI-PROJECT-23700003
  • [Journal Article] Partitioning a weighted tree into subtrees with weights in a given range2012

    • Author(s)
      T. Ito, T. Nishizeki, M. Schroder, T. Uno, X. Zhou
    • Journal Title

      Algorithmica

      Volume: 62-3 Issue: 3-4 Pages: 823-841

    • DOI

      10.1007/s00453-010-9485-y

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500001, KAKENHI-PROJECT-22700001, KAKENHI-PROJECT-23500001, KAKENHI-PLANNED-24106007
  • [Journal Article] Small grid drawings of planar graphs with balanced partition2012

    • Author(s)
      T. Nishizeki, X. Zhou
    • Journal Title

      J. Combinatorial Optimization

      Volume: 24 Issue: 2 Pages: 99-115

    • DOI

      10.1007/s10878-011-9381-7

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500001, KAKENHI-PROJECT-23500001
  • [Journal Article] Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings2011

    • Author(s)
      T. Ito, N. Sakamoto, X. Zhou, T. Nishizeki
    • Journal Title

      IEICE Trans. Inf. & Syst.

      Volume: E94-D Issue: 2 Pages: 190-195

    • DOI

      10.1587/transinf.E94.D.190

    • NAID

      130000453878

    • ISSN
      0916-8532, 1745-1361
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Journal Article] Convex drawings of internally triconnected plane graphs on O(n^2) grids2010

    • Author(s)
      X.Zhou
    • Journal Title

      Discrete Math., Alg.and Appl.

      Volume: 2 Pages: 347-362

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Journal Article] Partitioning graphs with supply and demand2009

    • Author(s)
      T. Ito, X. Zhou, T. Nishizek
    • Journal Title

      Discrete Applied Mathematics (印刷中)

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Journal Article] Efficient algorithms for wavelength assignment on trees of rings2009

    • Author(s)
      Z. B. Bian, Q. P. Gu, X. Zhou
    • Journal Title

      Discrete Applied Mathematics 157

      Pages: 875-889

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Journal Article] Partitioning graphs of supply and demand2009

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      Discrete Applied Mathematics Vol.157, Issue 12

      Pages: 2620-2633

    • NAID

      110003206419

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Journal Article] Efficient algorithms for wavelength assignment on trees of rings2009

    • Author(s)
      Zhengbing Bian, Qianping Gu, Xiao Zhou
    • Journal Title

      Discrete Applied Mathematics 157

      Pages: 875-889

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Journal Article] Partitioning graphs with supply and demand2009

    • Author(s)
      Takehiro Ito, Xiao Zhou, Takao Nishizeki
    • Journal Title

      Discrete Applied Math. 157

      Pages: 2620-2633

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Journal Article] Partitioning graphs with supply and demand2009

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      Discrete Applied Math. 157

      Pages: 2620-2633

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Journal Article] Approximability of partitioning graphs with supply and demand2008

    • Author(s)
      Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki
    • Journal Title

      Journal of Discrete Algorithms 6

      Pages: 627-650

    • NAID

      110004851550

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Journal Article] Orthogonal drawings of series-parallel graphs with minimum bends2008

    • Author(s)
      X. Zhou and T. Nishizeki
    • Journal Title

      SIAM J. Discrete Math Vol.22, No.4

      Pages: 1570-1604

    • NAID

      110003499880

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Journal Article] Approximability of partitioning graphs with supply and demand2008

    • Author(s)
      T. Ito, E. D. Demaine, X. Zhou and T. Nishizeki
    • Journal Title

      Journal of Discrete Algorithms Vol.6

      Pages: 627-650

    • NAID

      110004851550

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Journal Article] Orthogonal drawings of series-parallel graphs with minimum bends2008

    • Author(s)
      X. Zhou, T. Nishizek
    • Journal Title

      SIAM J. Discrete Math 22

      Pages: 1570-1604

    • NAID

      110003499880

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Journal Article] Approximability of partitioning graphs with supply and demand2008

    • Author(s)
      T. Ito, E.D. Demaine, X. Zhou and T. Nishizeki
    • Journal Title

      Journal of Discrete Algorithms Vol.6

      Pages: 627-650

    • NAID

      110004851550

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Journal Article] Approximability of partitioning graphs with supply and demand2008

    • Author(s)
      T. Ito, E. D. Demaine, X. Zhou, T. Nishizek
    • Journal Title

      Journal of Discrete Algorithms 6

      Pages: 627-650

    • NAID

      110004851550

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Journal Article] Orthogonal drawings of series-parallel graphs with minimum bends2008

    • Author(s)
      Xiao Zhou, Takao Nishizek
    • Journal Title

      SIAM J.Discrete Math. 22

      Pages: 1570-1604

    • NAID

      110003499880

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Journal Article] Algorithms for Finding Distance-Edge-Colorings of Graphs2007

    • Author(s)
      T.Ito, A.Kato, X.Zhou, T.Nishizeki
    • Journal Title

      Journal of Discrete Algorithms 5

      Pages: 304-322

    • NAID

      10015530666

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Partitioning a multi-weighted graph to connected subgraphs of almost uniform size2007

    • Author(s)
      T.Ito, K.Goto, X.Zhou, T.Nishizeki
    • Journal Title

      IEICE Trans. on Information and Systems Vol.E90-D, No.2

      Pages: 449-456

    • NAID

      130005444301

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] List total colorings of series-parallel graphs2007

    • Author(s)
      Y. Matsuo, X. Zhou and T. Nishizeki
    • Journal Title

      IEICE Trans. on Fundamentals of Electronics, Communication and Computer Science E90-A

      Pages: 907-916

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Journal Article] Total colorings of degenerate graphs2007

    • Author(s)
      Shuji Isobe, Xiao Zhou, Takao Nishizeki
    • Journal Title

      Combinatorica 27

      Pages: 167-182

    • NAID

      110003191839

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Journal Article] Sufficient condition and algorithm for list total colorings of series-parallel graphs2007

    • Author(s)
      Y. Matsuo, X. Zhou and T. Nishizeki
    • Journal Title

      IEICE Trans. Fundamentals Vol.E90-A, No.5

      Pages: 907-916

    • NAID

      110007519153

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Journal Article] Partitioning a multi-weighted graph to connected subgraphs of almost uniform size,2007

    • Author(s)
      T.Ito, K.Goto, X.Zhou, T.Nishizeki
    • Journal Title

      IEICE Trans. on Information and Systems Vol. E90-D

      Pages: 449-456

    • NAID

      130005444301

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Partitioning a multi-weighted graph to connected subgraphs of almost uniform size2007

    • Author(s)
      Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki
    • Journal Title

      IEICE Trans. on Information and Systems E90-D

      Pages: 449-456

    • NAID

      130005444301

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Journal Article] Partitioning a multi-weighted graph to connected subgraphs of almost uniform size2007

    • Author(s)
      T.Ito, K.Goto, X.Zhou, T.Nishizeki
    • Journal Title

      IEICE Trans. INF. & SYST. E90-D

      Pages: 449-456

    • NAID

      130005444301

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Partitioning a multi-weighted graph to connected subgraphs of almost uniform size2007

    • Author(s)
      T. Ito, K. Goto, X. Zhou and T. Nishizeki
    • Journal Title

      IEICE Trans. on Information and Systems E90-D

      Pages: 449-456

    • NAID

      130005444301

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Journal Article] Algorithms for finding distance-edge-colorings of graphs2007

    • Author(s)
      T.Ito, A. Kato, X. Zhou and T. Nishizeki
    • Journal Title

      Journal of Discrete Algorithms Vol.5,No.2

      Pages: 304-322

    • NAID

      10015530666

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Journal Article] Algorithms for finding distance-edge-colorings of graphs2007

    • Author(s)
      Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki
    • Journal Title

      Journal of Discrete Algorithms 5

      Pages: 304-322

    • NAID

      10015530666

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Journal Article] Sufficient condition and Algorithm for list total colorings of series-parallel graphs2007

    • Author(s)
      Y. Matsuo, X. Zhou and T. Nishizeki
    • Journal Title

      IEICE Trans. Fundamentals Vol. E90-A No. 5

      Pages: 907-916

    • NAID

      110007519153

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16092203
  • [Journal Article] Algorithms for finding distance-edge-colorings of graphs2007

    • Author(s)
      T. Ito, K. Goto, X. Zhou and T. Nishizeki
    • Journal Title

      Journal of Discrete Algorithms 5

      Pages: 304-322

    • NAID

      10015530666

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Journal Article] Algorithms for Finding Distance-Edge-Colorings of Graphs,2007

    • Author(s)
      T.Ito, A.Kato, X.Zhou, T.Nishizeki
    • Journal Title

      Journal of Discrete Algorithms Vol. 5

      Pages: 304-322

    • NAID

      10015530666

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Partitioning a multi-weighted graph to connected subgraphs of almost uniform size2007

    • Author(s)
      T.Ito, K.Goto, X.Zhou, T.Nishizeki
    • Journal Title

      IEICE Trans. INF. & SYST Vol.E90-D No.2

      Pages: 449-456

    • NAID

      130005444301

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Algorithms for finding distance-edge-colorings of graphs2007

    • Author(s)
      T. Ito, A. Kato, X. Zhou and T. Nishizeki
    • Journal Title

      Journal of Discrete Algorithms Vol.5, No.2

      Pages: 304-322

    • NAID

      10015530666

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Journal Article] List total colorings of series-parallel graphs2007

    • Author(s)
      Yuki Matsuo, Xiao Zhou, Takao Nishizeki
    • Journal Title

      IEICE Trans.on Fundamentals of Electronics, Communications and Computer Sciences E90-A

      Pages: 907-916

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Journal Article] Algorithms for finding distance-edge-colorings of graphs2007

    • Author(s)
      T. Ito, A. Kato, X. Zhou and T. Nishizeki
    • Journal Title

      Journal of Discrete Algorithms Vol. 5, No. 2

      Pages: 304-322

    • NAID

      10015530666

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16092203
  • [Journal Article] Sufficient condition and Algorithm for list total colorings of series-parallel graphs2007

    • Author(s)
      Y. Matsuo, X. Zhou and T. Nishizeki
    • Journal Title

      IEICE Trans. Fundamentals Vol.E90-A No.5

      Pages: 907-916

    • NAID

      110007519153

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Journal Article] Total colorings of degenerate graphs2007

    • Author(s)
      S. Isobe, X. Zhou and T. Nishizeki
    • Journal Title

      Combinatorica Vol.27No.2

      Pages: 167-182

    • NAID

      110003191839

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Journal Article] Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size2007

    • Author(s)
      T.Ito, K.Goto, X.Zhou, Takao Nishizeki
    • Journal Title

      IEICE Trans. on Information and Systems Vol. E90-D・No.2

      Pages: 449-456

    • NAID

      130005444301

    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Total colorings of degenerate graphs2007

    • Author(s)
      S. Isobe, X. Zhou and T. Nishizeki
    • Journal Title

      Combinatorica Vol.27, No.2

      Pages: 167-182

    • NAID

      110003191839

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Journal Article] Total colorings of degenerate graphs2007

    • Author(s)
      S. Isobe, X. Zhou and T. Nishizeki
    • Journal Title

      Combinatorica 27

      Pages: 167-182

    • NAID

      110003191839

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Journal Article] Partitioning a Graph of Bounded Tree-Width to Connected Subgraphs of Almost Uniform Size2006

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      Journal of Discrete Algorithms 4

      Pages: 142-154

    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size2006

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      Journal of Discrete Algorithms Vol. 4, No. 1

      Pages: 142-154

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size2006

    • Author(s)
      Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki
    • Journal Title

      IEICE Trans. on Information and Systems E90-D

      Pages: 449-456

    • NAID

      130005444301

    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size,2006

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      Journal of Discrete Algorithms Vol. 4

      Pages: 142-154

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Sufficient condition and algorithm for list total colorings of series-parallel graphs2006

    • Author(s)
      Y.Matsuo, X.Zhou, T.Nishizeki
    • Journal Title

      Proc. of 9th Japan-Korea joint workshop on Algorithms and Computation

      Pages: 49-56

    • NAID

      110007519153

    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size2006

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      Journal of Discrete Algorithms Vol.4, No.1

      Pages: 142-154

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Partitioning a multi-weighted graph to connected subgraphs of almost uniform size2006

    • Author(s)
      T.Ito, K.Goto, X.Zhou, T.Nishizeki
    • Journal Title

      Proc. of COCOON2006, LNCS 4112

      Pages: 63-72

    • NAID

      130005444301

    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size2006

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      Journal of Discrete Algorithms 4

      Pages: 142-154

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Approximability of partitioning graphs with supply and demand2006

    • Author(s)
      T.Ito, E.D.Demaine, X.Zhou, T.Nishizeki
    • Journal Title

      Proc. of ISAAC2006, LNCS 4288

      Pages: 121-130

    • NAID

      110004851550

    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size2006

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      Journal of Discrete Algorithms Vol. 4・No. 1

      Pages: 142-154

    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] List colorings of series-parallel graphs2005

    • Author(s)
      X.Zhou, Y.Matsuo, T.Nishizeki
    • Journal Title

      Journal of Discrete Algorithms 3

      Pages: 47-60

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-15500002
  • [Journal Article] List total colorings of series-parallel graphs,2005

    • Author(s)
      X.Zhou, Y.Matsuo, T.Nishizeki
    • Journal Title

      Journal of Discrete Algorithms 3

      Pages: 47-60

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] List total colorings of series-parallel graphs2005

    • Author(s)
      X.Zhou, Y.Matsuo, T.Nishizeki
    • Journal Title

      Journal of Discrete Algorithms 3

      Pages: 47-60

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Partitioning trees of supply and demand2005

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      International J. of Found. of Computer Science 16

      Pages: 803-827

    • NAID

      110003178704

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Partitioning trees of supply and demand2005

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      International Journal of Foundations of Computer Science Vol.16・No.4

      Pages: 803-827

    • NAID

      110003178704

    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Partitioning trees of supply and demand2005

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      International Journal of Foundations of Computer Science Vol.16, No.4

      Pages: 803-827

    • NAID

      110003178704

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Orthogonal drawing of series-parallel graphs with minimum bends2005

    • Author(s)
      X.Zhou, T.Nishizeki
    • Journal Title

      Proc.of ISAAC 2005

      Pages: 166-175

    • NAID

      110003499880

    • Data Source
      KAKENHI-PROJECT-16092203
  • [Journal Article] Algorithms for finding distance-edge-colorings of graphs2005

    • Author(s)
      T.Ito, A.Kato, X.Zhou, T.Nishizeki
    • Journal Title

      Proc.of COCOON 2005, Lect.Notes in Comp.Sci(Springer-verlag) 3595

      Pages: 798-807

    • NAID

      10015530666

    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] List total colorings of series-parallel graphs2005

    • Author(s)
      X.Zhou, Y.Matsuo, T.Nishizeki
    • Journal Title

      Journal of Discrete Algorithms 3

      Pages: 47-60

    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] List colorings of series-parallel graphs2005

    • Author(s)
      X.Zhou, Y.Matsuo, T.Nishizeki
    • Journal Title

      Journal of Discrete Algorithms 3

      Pages: 47-60

    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Partitioning trees of supply and demand2005

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      International Journal of Foundations of Computer Science 16

      Pages: 803-827

    • NAID

      110003178704

    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Partitioning trees of supply and demand2005

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      International Journal of Foundations of Computer Science Vol.16 No.4

      Pages: 803-827

    • NAID

      110003178704

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Partitioning trees of supply and demand2005

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      International Journal of Foundations of Computer Science Vol.16・No.4

      Pages: 803-827

    • NAID

      110003178704

    • Data Source
      KAKENHI-PROJECT-16092203
  • [Journal Article] List total colorings of series-parallel graphs2005

    • Author(s)
      X.Zhou, Y.Matsuo, T.Nishizeki
    • Journal Title

      Journal of Discrete Algorithms 3(1)

      Pages: 47-60

    • Data Source
      KAKENHI-PROJECT-16092203
  • [Journal Article] Orthogonal drawings of series-parallel graphs with minimum bends2005

    • Author(s)
      X.Zhou, T.Nishizeki
    • Journal Title

      Proc.of ISAAC 2005, Lect.Notes in Comp.Sci(Springer-verlag) 3827

      Pages: 166-175

    • NAID

      110003499880

    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Partitioning trees of supply and demand,2005

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      International J. of Found. of Computer Science Vol. 16

      Pages: 803-827

    • NAID

      110003178704

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Algorithm for the cost edge-coloring of trees2004

    • Author(s)
      X.Zhou, T.Nishizeki
    • Journal Title

      Journal of Combinatorial Optimization 8(1)

      Pages: 97-108

    • Data Source
      KAKENHI-PROJECT-16092203
  • [Journal Article] Cost total colorings of trees2004

    • Author(s)
      S.Isobe, X.Zhou, T.Nishizeki
    • Journal Title

      IEICE Trans.INF. & SYST E-87D 2

      Pages: 337-342

    • NAID

      110003223354

    • Data Source
      KAKENHI-PROJECT-16092203
  • [Journal Article] Cost total colorings of trees2004

    • Author(s)
      S.Isobe, X.Zhou, T.Nishizeki
    • Journal Title

      IEICE Trans. INF. & SYST. E-87

      Pages: 337-342

    • NAID

      110003223354

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Cost total colorings of trees,2004

    • Author(s)
      S.Isobe, X.Zhou, T.Nishizeki
    • Journal Title

      IEICE Trans. INF. & SYST. Vol.E-87

      Pages: 337-342

    • NAID

      110003223354

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Multicolorings of series-parallel graphs2004

    • Author(s)
      X.Zhou, T.Nishizeki
    • Journal Title

      Algorithmica 38

      Pages: 271-297

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-15500002
  • [Journal Article] Multicolorings of series-parallel graphs,2004

    • Author(s)
      X.Zhou, T.Nishizeki
    • Journal Title

      Algorithmica 38

      Pages: 271-297

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Algorithm for the cost edge-coloring of trees,2004

    • Author(s)
      X.Zhou, T.Nishizeki
    • Journal Title

      Journal of Combinatorial Optimization 8

      Pages: 97-108

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Algorithm for the cost edge-coloring of trees2004

    • Author(s)
      X.Zhou, T.Nishizeki
    • Journal Title

      Journal of Combinatorial Optimization 8

      Pages: 97-108

    • Data Source
      KAKENHI-PROJECT-15500002
  • [Journal Article] Multicolorings of series-parallel graphs2004

    • Author(s)
      X.Zhou, T.Nishizeki
    • Journal Title

      Algorithmica 38

      Pages: 271-297

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Algorithm for the cost edge-coloring of trees2004

    • Author(s)
      X.Zhou, T.Nishizeki
    • Journal Title

      Journal of Combinatorial Optimization 8

      Pages: 97-108

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Orthogonal drawings of series-parallel graphs with minimum bends

    • Author(s)
      X. Zhou and T. Nishizeki
    • Journal Title

      SIAM J. Discrete Math. (採録決定)

    • NAID

      110003499880

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Journal Article] Partitioning graphs with supply and demand

    • Author(s)
      T. Ito, X. Zhou and T. Nishizeki
    • Journal Title

      Discrete Applied Math. (採録決定)

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Journal Article] Approximability of partitioning graphs with supply and demand

    • Author(s)
      T. Ito, E. Demaine, X. Zhou and T. Nishizeki
    • Journal Title

      Journal of Discrete Algorithms (採録決定)

    • NAID

      110004851550

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Journal Article] Efficient algorithms for wavelength assignment on trees of rings

    • Author(s)
      Z.Bian, Q.Gu, X.Zhou
    • Journal Title

      Discrete Applied Mathematics 157

      Pages: 875-889

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Presentation] Optimization variant of vertex-coloring reconfiguration problem,2021

    • Author(s)
      Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura and Xiao Zhou
    • Organizer
      情報処理学会 第185回アルゴリズム研究会
    • Data Source
      KAKENHI-PROJECT-19K11813
  • [Presentation] Decremental optimization of vertex-coloring under the reconfiguration framework2021

    • Author(s)
      Yusuke Yanagisawa, Yuma Tamura, Akira Suzuki and Xiao Zhou
    • Organizer
      The 27th International Computing and Combinatorics Conference (COCOON 2021)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11813
  • [Presentation] 区間グラフに対するハミルトン閉路遷移問題2021

    • Author(s)
      佐藤 颯介,鈴木 顕,伊藤 健洋,周 暁
    • Organizer
      電子情報通信学会 2021年 総合大会 COMP 学生シンポジウム
    • Data Source
      KAKENHI-PROJECT-19K11813
  • [Presentation] Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs2020

    • Author(s)
      Yuma Tamura, Takehiro Ito and Xiao Zhou
    • Organizer
      Proceedings of the 14th International Conference and Workshop on Algorithms and Computation (WALCOM 2020),
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11813
  • [Presentation] Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs2020

    • Author(s)
      Yuma Tamura, Takehiro Ito and Xiao Zhou
    • Organizer
      the 14th International Conference and Workshop on Algorithms and Computation (WALCOM2020)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11813
  • [Presentation] Approximation of the Independent Feedback Vertex Set Problem2020

    • Author(s)
      Yuma Tamura, Takehiro Ito and Xiao Zhou
    • Organizer
      情報処理学会 第177回アルゴリズム研究会
    • Data Source
      KAKENHI-PROJECT-19K11813
  • [Presentation] Minimizing a Vertex Set Satisfying Specific Graph Properties2020

    • Author(s)
      Yuma Tamura, Takehiro Ito and Xiao Zhou
    • Organizer
      情報処理学会 第180回アルゴリズム研究会
    • Data Source
      KAKENHI-PROJECT-19K11813
  • [Presentation] Reconfiguration of Minimum Steiner Trees via Vertex Exchanges2019

    • Author(s)
      Haruka Mizuta, Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou
    • Organizer
      Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
    • Data Source
      KAKENHI-PROJECT-19K11813
  • [Presentation] The Complexity of (List) Edge-Coloring Reconfiguration Problem2017

    • Author(s)
      Hiroki Osawa, Akira Suzuki, Takehiro Ito and Xiao Zhou
    • Organizer
      the 11th International Conference and Workshops on Algorithms and Computation (WALCOM 2017)
    • Place of Presentation
      Hsinchu, Taiwan
    • Year and Date
      2017-03-29
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K00003
  • [Presentation] The Coloring Reconfiguration Problem on Specific Graph Classes2017

    • Author(s)
      Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou
    • Organizer
      In Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2017),
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K00003
  • [Presentation] The Complexity of (List) Edge-Coloring Reconfiguration Problem2017

    • Author(s)
      Hiroki Osawa, Akira Suzuki, Takehiro Ito and Xiao Zhou
    • Organizer
      In Proceedings of the 11th International Conference and Workshops on Algorithms and Computation (WALCOM 2017)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K00003
  • [Presentation] Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters2017

    • Author(s)
      Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou
    • Organizer
      In Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K00003
  • [Presentation] Complexity of Coloring Reconfiguration under Recolorability Constraints2017

    • Author(s)
      Hiroki Osawa, Akira Suzuki, Takehiro Ito and Xiao Zhou
    • Organizer
      In Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC 2017),
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K00003
  • [Presentation] Reconfiguration of Steiner Trees in an Unweighted Graph2016

    • Author(s)
      Haruka Mizuta, Takehiro Ito and Xiao Zhou
    • Organizer
      the 27th International Workshop on Combinatorial Algorithms (IWOCA 2016)
    • Place of Presentation
      Helsinki, Finland
    • Year and Date
      2016-08-17
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K00003
  • [Presentation] Energy-efficient threshold circuits detecting global pattern in 1-dimentional arrays2013

    • Author(s)
      Akira Suzuki, Kei Uchizawa and Xiao Zhou
    • Organizer
      Proceedings of the 10th Annual Conference on Theory and Applications of Models of Computation (TAMC'13)
    • Place of Presentation
      Hong Kong, China
    • Year and Date
      2013-05-22
    • Data Source
      KAKENHI-PROJECT-23500001
  • [Presentation] On the minimum caterpillar problem in digraphs2013

    • Author(s)
      Taku Okada, Akira Suzuki, Takehiro Ito, and Xiao Zhou
    • Organizer
      Proceedings of the 19th Annual International Computing and Combinatorics Conference (COCOON'13)
    • Place of Presentation
      Hang Zhou, China
    • Year and Date
      2013-06-22
    • Data Source
      KAKENHI-PROJECT-23500001
  • [Presentation] Generalized Rainbow Connectivity of Graphs, In Proc2013

    • Author(s)
      Kei Uchizawa, Takanori Aoki, Takehiro Ito and Xiao Zhou
    • Organizer
      the 7th International Workshop on Algorithms and Computation (WALCOM'13)
    • Place of Presentation
      Kharagpur, India
    • Year and Date
      2013-02-15
    • Data Source
      KAKENHI-PROJECT-23500001
  • [Presentation] Complexity of counting output patterns of logic circuits, In Proc2013

    • Author(s)
      Kei Uchizawa, Zhenghong Wang, Hiroki Morizumi and Xiao Zhou
    • Organizer
      the 19th edition of Computing : the Australasian Theory Symposium (CATS'13)
    • Place of Presentation
      Adelaide, Australia
    • Year and Date
      2013-01-30
    • Data Source
      KAKENHI-PROJECT-23500001
  • [Presentation] Algorithm for cost non-preemptive scheduling of partial k-trees2012

    • Author(s)
      Yiming Li, Zhiqian Ye and Xiao Zhou
    • Organizer
      Proceedings of the 2012 Symposium on Applied and Engineering Mathematics (AEM'12)
    • Place of Presentation
      Beijing, China
    • Year and Date
      2012-10-27
    • Data Source
      KAKENHI-PROJECT-23500001
  • [Presentation] Reconfiguration of list L(2, 1)-labelings in a graph, In Proc2012

    • Author(s)
      Takehiro Ito, Kazuto Kawamura, Hirotaka Ono and Xiao Zhou
    • Organizer
      the 23th Annual International Symposium on Algorithms and Computation (ISAAC'12)
    • Place of Presentation
      Taipei, Taiwan
    • Year and Date
      2012-12-19
    • Data Source
      KAKENHI-PROJECT-23500001
  • [Presentation] Algorithms for bandwidth consecutive multicolorings of graphs2012

    • Author(s)
      Kazuhide Nishikawa, Takao Nishizeki and Xiao Zhou
    • Organizer
      Proceedings of FAW-AAIM 2012
    • Place of Presentation
      Beijing, China
    • Year and Date
      2012-05-15
    • Data Source
      KAKENHI-PROJECT-23500001
  • [Presentation] On the rainbow connectivity of graphs : complexity and FPT algorithms2011

    • Author(s)
      Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki, and Xiao Zhou
    • Organizer
      Proceedings of the 17th Annual International Computing and Combinatorics Conference (COCOON'11)
    • Place of Presentation
      Dallas, Texas, USA
    • Year and Date
      2011-08-15
    • Data Source
      KAKENHI-PROJECT-23500001
  • [Presentation] An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree2011

    • Author(s)
      Takehiro Ito, Kazuto Kawamura and Xiao Zhou
    • Organizer
      TAMC 2011
    • Place of Presentation
      東京
    • Data Source
      KAKENHI-PROJECT-23500001
  • [Presentation] On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms2011

    • Author(s)
      K. Uchizawa, T. Aoki, T. Ito, A. Suzuki, X. Zhou
    • Organizer
      COCOON'11
    • Place of Presentation
      Dallas,アメリカ
    • Data Source
      KAKENHI-PROJECT-23500001
  • [Presentation] Small grid drawings of planar graphs with balanced bipartition2010

    • Author(s)
      X.Zhou, T.Hikino, T.Nishizeki
    • Organizer
      WALCOM 2010
    • Place of Presentation
      BUET (バングラデシュ)
    • Year and Date
      2010-02-10
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Presentation] Grid drawings of planar graphs with balanced bipartition2010

    • Author(s)
      X.Zhou, T.Hikino, T.Nishizeki
    • Organizer
      In Proc.of the 4th Workshop on Algorithms and Computation(WALCOM'10), Lect.Notes in Computer Science, Springer
    • Place of Presentation
      Dhaka, Bangladesh
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Presentation] Grid drawings of planar graphs with balanced bipartition2010

    • Author(s)
      Xiao Zhou, Takashi Hikino, Takao Nishizeki
    • Organizer
      Proc. of the 4th Workshop on Algorithms and Computation (WALCOM'10), Lect. Notes in Computer Science, Springer
    • Place of Presentation
      Dhaka, Bangladesh
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Presentation] Convex drawings of internally triconnected plane graphs on O(n^2)grids2009

    • Author(s)
      X.Zhou, T.Nishizeki
    • Organizer
      ISAAC 2009
    • Place of Presentation
      Ala Moana Hotel (アメリカ)
    • Year and Date
      2009-12-18
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Presentation] Convex drawings of internally triconnected plane graphs on O(n^2)grids2009

    • Author(s)
      X.Zhou, T.Nishizeki
    • Organizer
      In Proc.of the 20th Annual International Symposium on Algorithms and Computation(ISAAC'09), Lect.Notes in Computer Science. Springer
    • Place of Presentation
      Hawaii, USA
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Presentation] Convex drawings of internally triconnected plane graphs on O(n^2) grids2009

    • Author(s)
      Xiao Zhou, Takao Nishizeki
    • Organizer
      Proc. of the 20th Annual International Symposium on Algorithms and Computation (ISAAC'09), Lect. Notes in Computer Science, Springer
    • Place of Presentation
      Hawaii, USA
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Presentation] Convex drawings of internal triconnected plane graphs on O(n^ 2) grids2009

    • Author(s)
      X. Zhou
    • Organizer
      ISAAC 2009
    • Place of Presentation
      Ala Moana Hotel, USA
    • Year and Date
      2009-12-18
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Presentation] Partitioning a weighted tree to subtrees of almost uniform size2008

    • Author(s)
      T. Ito, T. Uno, X. Zhou, T. Nishizek
    • Organizer
      Proc. of ISAAC'08, LNCS., Springer, 5369, pp. 196-207, 2008
    • Place of Presentation
      オーストラリアゴールドコースト
    • Year and Date
      2008-12-17
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Presentation] Partitioning a weighted tree to subtrees of almost uniform size2008

    • Author(s)
      Takehiro Ito, Takeaki Uno, Xiao Zhou, Takao Nishizeki
    • Organizer
      Proc. of the 19th Annual International Symposium on Algorithms and Computation (ISAAC'08), Lect. Notes in Computer Science, Springer
    • Place of Presentation
      Gold Coast, Australia
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Presentation] Partitioning a weighted tree to subtrees of almost uniform size2008

    • Author(s)
      T. Ito, T. Uno, X. Zhou and T. Nishizeki
    • Organizer
      Proc. of ISAAC 2008, Lect. Notes in Comp. Sci
    • Place of Presentation
      Springer-verlag(5369, 196-207)
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Presentation] Partitioning a weighted tree to subtrees of almost uniform size2008

    • Author(s)
      T. Ito, T. Uno, X. Zhou and T. Nishizeki
    • Organizer
      ISAAC 2008
    • Place of Presentation
      オーストラリア・ゴールドコースト
    • Year and Date
      2008-12-15
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Presentation] Orthogonal drawings of series-parallel graphs with minimum bends2007

    • Author(s)
      X. Zhou and T. Nishizeki
    • Organizer
      Proc. of WALCOM
    • Place of Presentation
      (3-12)
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Presentation] Algorithms for bandwidth consecutive multicolorings of graphs

    • Author(s)
      Kazuhide Nishikawa, Takao Nishizeki and Xiao Zhou
    • Organizer
      Proceedings of FAW-AAIM 2012, Lect. Notes in Computer Science, Springer, 7285, pp. 117-128, 2012
    • Place of Presentation
      Beijing, China
    • Data Source
      KAKENHI-PROJECT-23500001
  • [Presentation] Energy-efficient threshold circuits detecting global pattern in 1-dimentional arrays

    • Author(s)
      Akira Suzuki, Kei Uchizawa and Xiao Zhou
    • Organizer
      Proceedings of the 10th Annual Conference on Theory and Applications of Models of Computation (TAMC'13)
    • Place of Presentation
      香港,中国
    • Data Source
      KAKENHI-PROJECT-23500001
  • [Presentation] Reconfiguration of list L(2,1)-labelings in a graph

    • Author(s)
      Takehiro Ito, Kazuto Kawamura, Hirotaka Ono and Xiao Zhou
    • Organizer
      Proc. of the 23th Annual International Symposium on Algorithms and Computation (ISAAC'12), Lect. Notes in Computer Science, Springer, 7676, pp. 34-43, Dec., 2012
    • Place of Presentation
      Taipei, Taiwan
    • Data Source
      KAKENHI-PROJECT-23500001
  • [Presentation] Complexity of counting output patterns of logic circuits

    • Author(s)
      Kei Uchizawa, Zhenghong Wang, Hiroki Morizumi and Xiao Zhou
    • Organizer
      Proc. of the 19th edition of Computing: the Australasian Theory Symposium (CATS'13), 141, pp. 37-42, Jan. 2013.
    • Place of Presentation
      Adelaide, Australia
    • Data Source
      KAKENHI-PROJECT-23500001
  • [Presentation] Algorithm for cost non-preemptive scheduling of partial k-trees

    • Author(s)
      Yiming Li, Zhiqian Ye and Xiao Zhou
    • Organizer
      Proceedings of the 2012 Symposium on Applied and Engineering Mathematics (AEM'12), pp. 233-236, Oct., 2012
    • Place of Presentation
      Beijing, China
    • Data Source
      KAKENHI-PROJECT-23500001
  • [Presentation] Generalized Rainbow Connectivity of Graphs

    • Author(s)
      Kei Uchizawa, Takanori Aoki, Takehiro Ito and Xiao Zhou
    • Organizer
      Proc. of the 7th International Workshop on Algorithms and Computatio (WALCOM'13),Lect. Notes in Computer Science, Springer, 7748, pp. 233-244, Feb., 2013
    • Place of Presentation
      Kharagpur, India
    • Data Source
      KAKENHI-PROJECT-23500001
  • [Presentation] On the minimum caterpillar problem in digraphs

    • Author(s)
      54.Taku Okada, Akira Suzuki, Takehiro Ito, and Xiao Zhou
    • Organizer
      Proceedings of the 19th Annual International Computing and Combinatorics Conference (COCOON'13)
    • Place of Presentation
      杭州,中国
    • Data Source
      KAKENHI-PROJECT-23500001
  • 1.  NISHIZEKI Takao (80005545)
    # of Collaborated Projects: 10 results
    # of Collaborated Products: 82 results
  • 2.  ITO Takehiro (40431548)
    # of Collaborated Projects: 5 results
    # of Collaborated Products: 23 results
  • 3.  MIURA Kazuyuki (80333871)
    # of Collaborated Projects: 4 results
    # of Collaborated Products: 0 results
  • 4.  ASANO Yasuhito (20361157)
    # of Collaborated Projects: 4 results
    # of Collaborated Products: 0 results
  • 5.  RAHMAN Md.Saidur (60361151)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 6.  UCHIZAWA Kei (90510248)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 7.  KUSAKARI Yishiyoki (50302203)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 8.  NAKANO Shin-ichi (30227855)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 9.  MIZUKI Takaaki (90323089)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results

URL: 

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

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

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi