An Efficient Algorithm for Edge-Coloring Series-Parallel Multigraphs. - Xiao Zhou 001; Shin-Ichi Nakano; Hitoshi Suzuki; Takao Nishizeki (LATIN, 1992)

A Linear Algorithm for Edge-Coloring Partial k-Trees. - Xiao Zhou 001; Shin-Ichi Nakano; Takao Nishizeki (ESA, 1993)

Sequential and parallel algorithms for edge-coloring series-parallel multigraphs. - Xiao Zhou 001; Hitoshi Suzuki; Takao Nishizeki (IPCO, 1993)

An Efficient Algorithm for Edge-Ranking Trees. - Xiao Zhou 001; Takao Nishizeki (ESA, 1994)

Optimal parallel algorithm for edge-coloring partial k-trees with bounded degrees. - Xiao Zhou 001; Takao Nishizeki (ISPAN, 1994)

A Parallel Algorithm for Edge-Coloring Partial k-Trees. - Xiao Zhou 001; Shin-Ichi Nakano; Takao Nishizeki (SWAT, 1994)

Edge-Coloring Algorithms. - Shin-Ichi Nakano; Xiao Zhou 001; Takao Nishizeki (Computer Science Today, 1995)

Simple Reduction of f-Colorings to Edge-Colorings. - Xiao Zhou 001; Takao Nishizeki (COCOON, 1995)

Algorithms for Finding f-Colorings of Partial k-Trees. - Xiao Zhou 001; Takao Nishizeki (ISAAC, 1995)

Finding Optimal Edge-Rankings of Trees. - Xiao Zhou 001; Takao Nishizeki (SODA, 1995)

Generalized Vertex-Rankings of Trees. - Xiao Zhou 001; Nobuaki Nagai; Takao Nishizeki (Inf. Process. Lett., 1995)

Finding Edge-Disjoint Paths in Partial k-Trees (Extended Abstract). - Xiao Zhou 001; Syurei Tamura; Takao Nishizeki (ISAAC, 1996)

Generalized Edge-Ranking of Trees (Extended Abstract). - Xiao Zhou 001; Mohammod Abul Kashem; Takao Nishizeki (WG, 1996)

Edge-Coloring Partial k-Trees. - Xiao Zhou 001; Shin-Ichi Nakano; Takao Nishizeki (J. Algorithms, 1996)

A Linear Algorithm for Edge-Coloring Series-Parallel Multigraphs. - Xiao Zhou 001; Hitoshi Suzuki; Takao Nishizeki (J. Algorithms, 1996)

Generalized Vertex-Rankings of Partial k-trees. - Mohammod Abul Kashem; Xiao Zhou 001; Takao Nishizeki (COCOON, 1997)

An NC Parallel Algorithm for Generalized Vertex-Rankings of Partial k-Trees. - Mohammod Abul Kashem; Xiao Zhou 001; Takao Nishizeki (ISPAN, 1997)

An NC Parallel Algorithm for Edge-Coloring Series-Parallel Multigraphs. - Xiao Zhou 001; Hitoshi Suzuki; Takao Nishizeki (J. Algorithms, 1997)

The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees. - Xiao Zhou 001; Takao Nishizeki (ISAAC, 1998)

A Linear Algorithm for Finding Total Colorings of Partial k-Trees. - Shuji Isobe; Xiao Zhou 001; Takao Nishizeki (ISAAC, 1999)

A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees. - Shuji Isobe; Xiao Zhou 001; Takao Nishizeki (Int. J. Found. Comput. Sci., 1999)

Decompositions to Degree-Constrainded Subgraphs Are Simply Reducible to Edge-Colorings. - Xiao Zhou 001; Takao Nishizeki (J. Comb. Theory B, 1999)

Edge-Coloring and f-Coloring for Various Classes of Graphs. - Xiao Zhou 001; Takao Nishizeki (J. Graph Algorithms Appl., 1999)

Finding Independent Spanning Trees in Partial k-Trees. - Xiao Zhou 001; Takao Nishizeki (ISAAC, 2000)

A Linear Algorithm for Finding [{g, f}]-Colorings of Partial {k}-Trees. - Xiao Zhou 001; K. Fuse; Takao Nishizeki (Algorithmica, 2000)

Finding Edge-Disjoint Paths in Partial k-Trees. - Xiao Zhou 001; Syurei Tamura; Takao Nishizeki (Algorithmica, 2000)

Algorithms for generalized vertex-rankings of partial k-trees. - Mohammod Abul Kashem; Xiao Zhou 001; Takao Nishizeki (Theor. Comput. Sci., 2000)

Total Colorings of Degenerated Graphs. - Shuji Isobe; Xiao Zhou 001; Takao Nishizeki (ICALP, 2001)

Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs. - Xiao Zhou 001; Takao Nishizeki (ISAAC, 2001)

The edge-disjoint paths problem is NP-complete for series-parallel graphs. - Takao Nishizeki; Jens Vygen; Xiao Zhou 001 (Discret. Appl. Math., 2001)

Algorithms for the Multicolorings of Partial k-Trees. - Takehiro Ito; Takao Nishizeki; Xiao Zhou 001 (COCOON, 2002)

List Edge-Colorings of Series-Parallel Graphs. - Tomoya Fujino; Xiao Zhou 001; Takao Nishizeki (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003)

Wavelength Assignment on Bounded Degree Trees of Rings. - Zhengbing Bian; Qian-Ping Gu; Xiao Zhou 001 (ICPADS, 2004)

Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size. - Takehiro Ito; Xiao Zhou 001; Takao Nishizeki (WG, 2004)

Multicolorings of Series-Parallel Graphs. - Xiao Zhou 001; Takao Nishizeki (Algorithmica, 2004)

Cost Total Colorings of Trees. - Shuji Isobe; Xiao Zhou 001; Takao Nishizeki (IEICE Trans. Inf. Syst., 2004)

Algorithm for the Cost Edge-Coloring of Trees. - Xiao Zhou 001; Takao Nishizeki (J. Comb. Optim., 2004)

Tight Bounds for Wavelength Assignment on Trees of Rings. - Zhengbing Bian; Qian-Ping Gu; Xiao Zhou 001 (IPDPS, 2005)

Partitioning trees of supply and demand. - Takehiro Ito; Xiao Zhou 001; Takao Nishizeki (Int. J. Found. Comput. Sci., 2005)

List total colorings of series-parallel graphs. - Xiao Zhou 001; Yuki Matsuo; Takao Nishizeki (J. Discrete Algorithms, 2005)

Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size. - Takehiro Ito; Xiao Zhou 001; Takao Nishizeki (J. Discrete Algorithms, 2006)

Total Colorings Of Degenerate Graphs. - Shuji Isobe; Xiao Zhou 001; Takao Nishizeki (Comb., 2007)

Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size. - Takehiro Ito; Kazuya Goto; Xiao Zhou 001; Takao Nishizeki (IEICE Trans. Inf. Syst., 2007)

Sufficient Condition and Algorithm for List Total Colorings of Series-Parallel Graphs. - Yuki Matsuo; Xiao Zhou 001; Takao Nishizeki (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007)

Algorithms for finding distance-edge-colorings of graphs. - Takehiro Ito; Akira Kato; Xiao Zhou 001; Takao Nishizeki (J. Discrete Algorithms, 2007)

Partitioning a Weighted Tree to Subtrees of Almost Uniform Size. - Takehiro Ito; Takeaki Uno; Xiao Zhou 001; Takao Nishizeki (ISAAC, 2008)

Approximability of partitioning graphs with supply and demand. - Takehiro Ito; Erik D. Demaine; Xiao Zhou 001; Takao Nishizeki (J. Discrete Algorithms, 2008)

Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends. - Xiao Zhou 001; Takao Nishizeki (SIAM J. Discret. Math., 2008)

Convex Drawings of Internally Triconnected Plane Graphs on O(n2) Grids. - Xiao Zhou 001; Takao Nishizeki (ISAAC, 2009)

Efficient algorithms for wavelength assignment on trees of rings. - Zhengbing Bian; Qian-Ping Gu; Xiao Zhou 001 (Discret. Appl. Math., 2009)

Partitioning graphs of supply and demand. - Takehiro Ito; Xiao Zhou 001; Takao Nishizeki (Discret. Appl. Math., 2009)

Small Grid Drawings of Planar Graphs with Balanced Bipartition. - Xiao Zhou 001; Takashi Hikino; Takao Nishizeki (WALCOM, 2010)

Convex Drawings of Internally Triconnected Plane Graphs on O(N2) Grids. - Xiao Zhou 001; Takao Nishizeki (Discret. Math. Algorithms Appl., 2010)

Energy and Fan-In of Threshold Circuits Computing Mod Functions. - Akira Suzuki 001; Kei Uchizawa; Xiao Zhou 001 (TAMC, 2011)

Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings. - Takehiro Ito; Naoki Sakamoto; Xiao Zhou 001; Takao Nishizeki (IEICE Trans. Inf. Syst., 2011)

Algorithms for Bandwidth Consecutive Multicolorings of Graphs - (Extended Abstract). - Kazuhide Nishikawa; Takao Nishizeki; Xiao Zhou 001 (FAW-AAIM, 2012)

Reconfiguration of List L(2, 1)-Labelings in a Graph. - Takehiro Ito; Kazuto Kawamura; Hirotaka Ono 001; Xiao Zhou 001 (ISAAC, 2012)

Minimum Cost Partitions of Trees with Supply and Demand. - Takehiro Ito; Takuya Hara; Xiao Zhou 001; Takao Nishizeki (Algorithmica, 2012)

Partitioning a Weighted Tree into Subtrees with Weights in a Given Range. - Takehiro Ito; Takao Nishizeki; Michael Schröder 001; Takeaki Uno; Xiao Zhou 001 (Algorithmica, 2012)

An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree. - Takehiro Ito; Kazuto Kawamura; Xiao Zhou 001 (IEICE Trans. Inf. Syst., 2012)

Small grid drawings of planar graphs with balanced partition. - Xiao Zhou 001; Takashi Hikino; Takao Nishizeki (J. Comb. Optim., 2012)

Complexity of Counting Output Patterns of Logic Circuits. - Kei Uchizawa; Zhenghong Wang; Hiroki Morizumi; Xiao Zhou 001 (CATS, 2013)

Energy-Efficient Threshold Circuits Detecting Global Pattern in 1-Dimentional Arrays. - Akira Suzuki 001; Kei Uchizawa; Xiao Zhou 001 (TAMC, 2013)

On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms. - Kei Uchizawa; Takanori Aoki; Takehiro Ito; Akira Suzuki 001; Xiao Zhou 001 (Algorithmica, 2013)

Energy-Efficient Threshold Circuits Computing mod Functions. - Akira Suzuki 001; Kei Uchizawa; Xiao Zhou 001 (Int. J. Found. Comput. Sci., 2013)

Energy and fan-in of logic circuits computing symmetric Boolean functions. - Akira Suzuki 001; Kei Uchizawa; Xiao Zhou 001 (Theor. Comput. Sci., 2013)

The Minimum Vulnerability Problem on Graphs. - Yusuke Aoki; Bjarni V. Halldórsson; Magnús M. Halldórsson; Takehiro Ito; Christian Konrad 001; Xiao Zhou 001 (COCOA, 2014)

Deterministic Algorithms for the Independent Feedback Vertex Set Problem. - Yuma Tamura; Takehiro Ito; Xiao Zhou 001 (IWOCA, 2014)

Computational Complexity of Competitive Diffusion on (Un)weighted Graphs. - Takehiro Ito; Yota Otachi; Toshiki Saitoh; Hisayuki Satoh; Akira Suzuki 001; Kei Uchizawa; Ryuhei Uehara; Katsuhisa Yamanaka; Xiao Zhou 001 (CoRR, 2014)

On the Minimum Caterpillar Problem in Digraphs. - Taku Okada; Akira Suzuki 001; Takehiro Ito; Xiao Zhou 001 (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014)

Reconfiguration of list L(2,1)-labelings in a graph. - Takehiro Ito; Kazuto Kawamura; Hirotaka Ono 001; Xiao Zhou 001 (Theor. Comput. Sci., 2014)

Bandwidth consecutive multicolorings of graphs. - Kazuhide Nishikawa; Takao Nishizeki; Xiao Zhou 001 (Theor. Comput. Sci., 2014)

Generalized rainbow connectivity of graphs. - Kei Uchizawa; Takanori Aoki; Takehiro Ito; Xiao Zhou 001 (Theor. Comput. Sci., 2014)

Competitive Diffusion on Weighted Graphs. - Takehiro Ito; Yota Otachi; Toshiki Saitoh; Hisayuki Satoh; Akira Suzuki 001; Kei Uchizawa; Ryuhei Uehara; Katsuhisa Yamanaka; Xiao Zhou 001 (WADS, 2015)

Threshold Circuits for Global Patterns in 2-Dimensional Maps. - Kei Uchizawa; Daiki Yashima; Xiao Zhou 001 (WALCOM, 2015)

The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs. - Tatsuhiko Hatanaka; Takehiro Ito; Xiao Zhou 001 (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015)

Algorithms for the Independent Feedback Vertex Set Problem. - Yuma Tamura; Takehiro Ito; Xiao Zhou 001 (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015)

Reconfiguration of Vertex Covers in a Graph. - Takehiro Ito; Hiroyuki Nooka; Xiao Zhou 001 (IEICE Trans. Inf. Syst., 2016)

The minimum vulnerability problem on specific graph classes. - Yusuke Aoki; Bjarni V. Halldórsson; Magnús M. Halldórsson; Takehiro Ito; Christian Konrad 001; Xiao Zhou 001 (J. Comb. Optim., 2016)

Threshold Circuits Detecting Global Patterns in Two-dimensional Maps. - Kei Uchizawa; Daiki Yashima; Xiao Zhou 001 (J. Graph Algorithms Appl., 2016)

Complexity of Coloring Reconfiguration under Recolorability Constraints. - Hiroki Osawa; Akira Suzuki 001; Takehiro Ito; Xiao Zhou 001 (ISAAC, 2017)

Reconfiguration of Steiner Trees in an Unweighted Graph. - Haruka Mizuta; Takehiro Ito; Xiao Zhou 001 (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017)

Algorithms for Coloring Reconfiguration Under Recolorability Constraints. - Hiroki Osawa; Akira Suzuki 001; Takehiro Ito; Xiao Zhou 001 (ISAAC, 2018)

Complexity of Reconfiguration Problems for Constraint Satisfaction. - Tatsuhiko Hatanaka; Takehiro Ito; Xiao Zhou 001 (CoRR, 2018)

Computational Power of Threshold Circuits of Energy at most Two. - Hiroki Maniwa; Takayuki Oki; Akira Suzuki 001; Kei Uchizawa; Xiao Zhou 001 (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

The Complexity of (List) Edge-Coloring Reconfiguration Problem. - Hiroki Osawa; Akira Suzuki 001; Takehiro Ito; Xiao Zhou 001 (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

Parameterized complexity of the list coloring reconfiguration problem with graph parameters. - Tatsuhiko Hatanaka; Takehiro Ito; Xiao Zhou 001 (Theor. Comput. Sci., 2018)

Reconfiguration of Minimum Steiner Trees via Vertex Exchanges. - Haruka Mizuta; Tatsuhiko Hatanaka; Takehiro Ito; Xiao Zhou 001 (MFCS, 2019)

The Coloring Reconfiguration Problem on Specific Graph Classes. - Tatsuhiko Hatanaka; Takehiro Ito; Xiao Zhou 001 (IEICE Trans. Inf. Syst., 2019)

Minimization and Parameterized Variants of Vertex Partition Problems on Graphs. - Yuma Tamura; Takehiro Ito; Xiao Zhou 001 (ISAAC, 2020)

Decremental Optimization of Vertex-Coloring Under the Reconfiguration Framework. - Yusuke Yanagisawa; Akira Suzuki 001; Yuma Tamura; Xiao Zhou 001 (COCOON, 2021)

Approximability of the independent feedback vertex set problem for bipartite graphs. - Yuma Tamura; Takehiro Ito; Xiao Zhou 001 (Theor. Comput. Sci., 2021)

On the Routing Problems in Graphs with Ordered Forbidden Transitions. - Kota Kumakura; Akira Suzuki 001; Yuma Tamura; Xiao Zhou 001 (COCOON (1), 2023)

Parameterized Complexity of Optimizing List Vertex-Coloring Through Reconfiguration. - Yusuke Yanagisawa; Akira Suzuki 001; Yuma Tamura; Xiao Zhou 001 (WALCOM, 2023)

Decremental optimization of vertex-colouring under the reconfiguration framework. - Yusuke Yanagisawa; Akira Suzuki 001; Yuma Tamura; Xiao Zhou 001 (Int. J. Comput. Math. Comput. Syst. Theory, 2023)

The Shortest Path Reconfiguration Problem Based on Relaxation of Reconfiguration Rules. - Naoki Domon; Akira Suzuki 001; Yuma Tamura; Xiao Zhou 001 (WALCOM, 2024)

Changing Induced Subgraph Isomorphisms Under Extended Reconfiguration Rules. - Tatsuhiro Suga; Akira Suzuki 001; Yuma Tamura; Xiao Zhou 001 (WALCOM, 2025)

On the complexity of list H-packing for sparse graph classes. - Tatsuya Gima; Tesshu Hanaka; Yasuaki Kobayashi; Yota Otachi; Tomohito Shirai; Akira Suzuki 001; Yuma Tamura; Xiao Zhou 001 (Theor. Comput. Sci., 2025)

Parameterized complexity of weighted target set selection. - Takahiro Suzuki; Kei Kimura; Akira Suzuki 001; Yuma Tamura; Xiao Zhou 001 (Theor. Comput. Sci., 2025)