Xiao Zhou

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 29

Top Venues

WALCOM

CoRR

IEICE Trans. Fundam. Electron. Commun. Comput. Sci.

Theor. Comput. Sci.

Publications

Takahiro Suzuki, Kei Kimura, Akira Suzuki, Yuma Tamura, Xiao Zhou
Parameterized Complexity of Weighted Target Set Selection. TAMC (2024)
Naoki Domon, Akira Suzuki, Yuma Tamura, Xiao Zhou
The Shortest Path Reconfiguration Problem Based on Relaxation of Reconfiguration Rules. WALCOM (2024)
Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou
On the Complexity of List H-Packing for Sparse Graph Classes. WALCOM (2024)
Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura, Xiao Zhou
Decremental optimization of vertex-colouring under the reconfiguration framework. Int. J. Comput. Math. Comput. Syst. Theory 8 (1) (2023)
Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura, Xiao Zhou
Parameterized Complexity of Optimizing List Vertex-Coloring Through Reconfiguration. WALCOM (2023)
Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou
On the complexity of list H-packing for sparse graph classes. CoRR (2023)
Kota Kumakura, Akira Suzuki, Yuma Tamura, Xiao Zhou
On the Routing Problems in Graphs with Ordered Forbidden Transitions. COCOON (1) (2023)
Yuma Tamura, Takehiro Ito, Xiao Zhou
Approximability of the independent feedback vertex set problem for bipartite graphs. Theor. Comput. Sci. 849 (2021)
Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura, Xiao Zhou
Decremental Optimization of Vertex-Coloring Under the Reconfiguration Framework. COCOON (2021)
Yuma Tamura, Takehiro Ito, Xiao Zhou
Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs. WALCOM (2020)
Yuma Tamura, Takehiro Ito, Xiao Zhou
Minimization and Parameterized Variants of Vertex Partition Problems on Graphs. ISAAC (2020)
Haruka Mizuta, Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
Reconfiguration of Minimum Steiner Trees via Vertex Exchanges. MFCS (2019)
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
The Coloring Reconfiguration Problem on Specific Graph Classes. IEICE Trans. Inf. Syst. (3) (2019)
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
Parameterized complexity of the list coloring reconfiguration problem with graph parameters. Theor. Comput. Sci. 739 (2018)
Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou
Algorithms for Coloring Reconfiguration Under Recolorability Constraints. ISAAC (2018)
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
Complexity of Reconfiguration Problems for Constraint Satisfaction. CoRR (2018)
Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou
The Complexity of (List) Edge-Coloring Reconfiguration Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (1) (2018)
Hiroki Maniwa, Takayuki Oki, Akira Suzuki, Kei Uchizawa, Xiao Zhou
Computational Power of Threshold Circuits of Energy at most Two. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2018)
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters. MFCS (2017)
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters. CoRR (2017)
Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou
Complexity of Coloring Reconfiguration under Recolorability Constraints. ISAAC (2017)
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
The Coloring Reconfiguration Problem on Specific Graph Classes. COCOA (1) (2017)
Haruka Mizuta, Takehiro Ito, Xiao Zhou
Reconfiguration of Steiner Trees in an Unweighted Graph. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (7) (2017)
Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou
The Complexity of (List) Edge-Coloring Reconfiguration Problem. WALCOM (2017)
Yusuke Aoki, Bjarni V. Halldórsson, Magnús M. Halldórsson, Takehiro Ito, Christian Konrad, Xiao Zhou
The minimum vulnerability problem on specific graph classes. J. Comb. Optim. 32 (4) (2016)
Kei Uchizawa, Daiki Yashima, Xiao Zhou
Threshold Circuits Detecting Global Patterns in Two-dimensional Maps. J. Graph Algorithms Appl. 20 (1) (2016)
Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou
The Complexity of (List) Edge-Coloring Reconfiguration Problem. CoRR (2016)
Takehiro Ito, Hiroyuki Nooka, Xiao Zhou
Reconfiguration of Vertex Covers in a Graph. IEICE Trans. Inf. Syst. (3) (2016)
Haruka Mizuta, Takehiro Ito, Xiao Zhou
Reconfiguration of Steiner Trees in an Unweighted Graph. IWOCA (2016)
Kei Uchizawa, Daiki Yashima, Xiao Zhou
Threshold Circuits for Global Patterns in 2-Dimensional Maps. WALCOM (2015)
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (6) (2015)
Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou
Competitive Diffusion on Weighted Graphs. WADS (2015)
Yuma Tamura, Takehiro Ito, Xiao Zhou
Algorithms for the Independent Feedback Vertex Set Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (6) (2015)
Kei Uchizawa, Takanori Aoki, Takehiro Ito, Xiao Zhou
Generalized rainbow connectivity of graphs. Theor. Comput. Sci. 555 (2014)
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs. COCOA (2014)
Takehiro Ito, Kazuto Kawamura, Hirotaka Ono, Xiao Zhou
Reconfiguration of list L(2,1)-labelings in a graph. Theor. Comput. Sci. 544 (2014)
Yuma Tamura, Takehiro Ito, Xiao Zhou
Deterministic Algorithms for the Independent Feedback Vertex Set Problem. IWOCA (2014)
Takehiro Ito, Hiroyuki Nooka, Xiao Zhou
Reconfiguration of Vertex Covers in a Graph. IWOCA (2014)
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs. CoRR (2014)
Kazuhide Nishikawa, Takao Nishizeki, Xiao Zhou
Bandwidth consecutive multicolorings of graphs. Theor. Comput. Sci. 532 (2014)
Yusuke Aoki, Bjarni V. Halldórsson, Magnús M. Halldórsson, Takehiro Ito, Christian Konrad, Xiao Zhou
The Minimum Vulnerability Problem on Graphs. COCOA (2014)
Taku Okada, Akira Suzuki, Takehiro Ito, Xiao Zhou
On the Minimum Caterpillar Problem in Digraphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (3) (2014)
Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou
Computational Complexity of Competitive Diffusion on (Un)weighted Graphs. CoRR (2014)
Akira Suzuki, Kei Uchizawa, Xiao Zhou
Energy-Efficient Threshold Circuits Detecting Global Pattern in 1-Dimentional Arrays. TAMC (2013)
Akira Suzuki, Kei Uchizawa, Xiao Zhou
Energy and fan-in of logic circuits computing symmetric Boolean functions. Theor. Comput. Sci. 505 (2013)
Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki, Xiao Zhou
On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms. Algorithmica 67 (2) (2013)
Akira Suzuki, Kei Uchizawa, Xiao Zhou
Energy-Efficient Threshold Circuits Computing mod Functions. Int. J. Found. Comput. Sci. 24 (1) (2013)
Kei Uchizawa, Takanori Aoki, Takehiro Ito, Xiao Zhou
Generalized Rainbow Connectivity of Graphs. WALCOM (2013)
Kei Uchizawa, Zhenghong Wang, Hiroki Morizumi, Xiao Zhou
Complexity of Counting Output Patterns of Logic Circuits. CATS (2013)
Taku Okada, Akira Suzuki, Takehiro Ito, Xiao Zhou
On the Minimum Caterpillar Problem in Digraphs. COCOON (2013)
Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki
Minimum Cost Partitions of Trees with Supply and Demand. Algorithmica 64 (3) (2012)
Xiao Zhou, Takashi Hikino, Takao Nishizeki
Small grid drawings of planar graphs with balanced partition. J. Comb. Optim. 24 (2) (2012)
Kazuhide Nishikawa, Takao Nishizeki, Xiao Zhou
Algorithms for Bandwidth Consecutive Multicolorings of Graphs - (Extended Abstract). FAW-AAIM (2012)
Takehiro Ito, Takao Nishizeki, Michael Schröder, Takeaki Uno, Xiao Zhou
Partitioning a Weighted Tree into Subtrees with Weights in a Given Range. Algorithmica 62 (3-4) (2012)
Takehiro Ito, Kazuto Kawamura, Xiao Zhou
An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree. IEICE Trans. Inf. Syst. (3) (2012)
Takehiro Ito, Kazuto Kawamura, Hirotaka Ono, Xiao Zhou
Reconfiguration of List L(2, 1)-Labelings in a Graph. ISAAC (2012)
Takehiro Ito, Kazuto Kawamura, Xiao Zhou
An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree. TAMC (2011)
Akira Suzuki, Kei Uchizawa, Xiao Zhou
Energy and Fan-In of Threshold Circuits Computing Mod Functions. TAMC (2011)
Akira Suzuki, Kei Uchizawa, Xiao Zhou
Energy-Efficient Threshold Circuits Computing Mod Functions. CATS (2011)
Takehiro Ito, Naoki Sakamoto, Xiao Zhou, Takao Nishizeki
Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings. IEICE Trans. Inf. Syst. (2) (2011)
Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki, Xiao Zhou
On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms. COCOON (2011)
Takehiro Ito, Naoki Sakamoto, Xiao Zhou, Takao Nishizeki
Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings. FAW (2010)
Xiao Zhou, Takashi Hikino, Takao Nishizeki
Small Grid Drawings of Planar Graphs with Balanced Bipartition. WALCOM (2010)
Xiao Zhou, Takao Nishizeki
) Grids. Discret. Math. Algorithms Appl. 2 (3) (2010)
Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki
Minimum Cost Partitions of Trees with Supply and Demand. ISAAC (2) (2010)
Zhengbing Bian, Qian-Ping Gu, Xiao Zhou
Efficient algorithms for wavelength assignment on trees of rings. Discret. Appl. Math. 157 (5) (2009)
Takehiro Ito, Xiao Zhou, Takao Nishizeki
Partitioning graphs of supply and demand. Discret. Appl. Math. 157 (12) (2009)
Xiao Zhou, Takao Nishizeki
) Grids. ISAAC (2009)
Takehiro Ito, Takeaki Uno, Xiao Zhou, Takao Nishizeki
Partitioning a Weighted Tree to Subtrees of Almost Uniform Size. ISAAC (2008)
Xiao Zhou, Takao Nishizeki
Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends. SIAM J. Discret. Math. 22 (4) (2008)
Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki
Approximability of partitioning graphs with supply and demand. J. Discrete Algorithms 6 (4) (2008)
Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki
Algorithms for finding distance-edge-colorings of graphs. J. Discrete Algorithms 5 (2) (2007)
Yuki Matsuo, Xiao Zhou, Takao Nishizeki
Sufficient Condition and Algorithm for List Total Colorings of Series-Parallel Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (5) (2007)
Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki
Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size. IEICE Trans. Inf. Syst. (2) (2007)
Xiao Zhou, Takao Nishizeki
Orthogonal drawings of series-parallel graphs with minimum bends. WALCOM (2007)
Shuji Isobe, Xiao Zhou, Takao Nishizeki
Total Colorings Of Degenerate Graphs. Comb. 27 (2) (2007)
Takehiro Ito, Xiao Zhou, Takao Nishizeki
Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size. J. Discrete Algorithms 4 (1) (2006)
Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki
Approximability of Partitioning Graphs with Supply and Demand. ISAAC (2006)
Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki
Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size. COCOON (2006)
Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki
Algorithms for Finding Distance-Edge-Colorings of Graphs. COCOON (2005)
Takehiro Ito, Xiao Zhou, Takao Nishizeki
Partitioning trees of supply and demand. Int. J. Found. Comput. Sci. 16 (4) (2005)
Zhengbing Bian, Qian-Ping Gu, Xiao Zhou
Tight Bounds for Wavelength Assignment on Trees of Rings. IPDPS (2005)
Takehiro Ito, Xiao Zhou, Takao Nishizeki
Partitioning graphs of supply and demand. ISCAS (1) (2005)
Xiao Zhou, Takao Nishizeki
Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends. ISAAC (2005)
Xiao Zhou, Yuki Matsuo, Takao Nishizeki
List total colorings of series-parallel graphs. J. Discrete Algorithms 3 (1) (2005)
Shuji Isobe, Xiao Zhou, Takao Nishizeki
Cost Total Colorings of Trees. IEICE Trans. Inf. Syst. (2) (2004)
Xiao Zhou, Takao Nishizeki
Algorithm for the Cost Edge-Coloring of Trees. J. Comb. Optim. 8 (1) (2004)
Takehiro Ito, Xiao Zhou, Takao Nishizeki
Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size. WG (2004)
Xiao Zhou, Takao Nishizeki
Multicolorings of Series-Parallel Graphs. Algorithmica 38 (2) (2004)
Zhengbing Bian, Qian-Ping Gu, Xiao Zhou
Wavelength Assignment on Bounded Degree Trees of Rings. ICPADS (2004)
Xiao Zhou, Yuki Matsuo, Takao Nishizeki
List Total Colorings of Series-Parallel Graphs. COCOON (2003)
Tomoya Fujino, Xiao Zhou, Takao Nishizeki
List Edge-Colorings of Series-Parallel Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (5) (2003)
Takehiro Ito, Takao Nishizeki, Xiao Zhou
Algorithms for the Multicolorings of Partial k-Trees. COCOON (2002)
Takehiro Ito, Xiao Zhou, Takao Nishizeki
Partitioning Trees of Supply and Demand. ISAAC (2002)
Xiao Zhou, Takao Nishizeki
Algorithm for the Cost Edge-Coloring of Trees. COCOON (2001)
Shuji Isobe, Xiao Zhou, Takao Nishizeki
Total Colorings of Degenerated Graphs. ICALP (2001)
Xiao Zhou, Takao Nishizeki
Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs. ISAAC (2001)
Takao Nishizeki, Jens Vygen, Xiao Zhou
The edge-disjoint paths problem is NP-complete for series-parallel graphs. Discret. Appl. Math. 115 (1-3) (2001)
Xiao Zhou, Takao Nishizeki
Finding Independent Spanning Trees in Partial k-Trees. ISAAC (2000)
Abul Kashem, Xiao Zhou, Takao Nishizeki
Algorithms for generalized vertex-rankings of partial k-trees. Theor. Comput. Sci. 240 (2) (2000)

Xiao Zhou.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Xiao Zhou