Xiao Zhou

136 papers A* 2A 3B 37C 9Misc 11Journal 63Unranked 10
YearRankTypeTitle / Venue / Authors
2026 B conf
Spanning Trees with a Small Vertex Cover: The Complexity on Specific Graph Classes.
SOFSEM
Toranosuke Kokai, Akira Suzuki, Takahiro Suzuki, Yuma Tamura, Xiao Zhou
2025 B conf
Changing Induced Subgraph Isomorphisms Under Extended Reconfiguration Rules.
WALCOM
Tatsuhiro Suga, Akira Suzuki, Yuma Tamura, Xiao Zhou
2025 J jnl
Changing Induced Subgraph Isomorphisms Under Extended Reconfiguration Rules.
CoRR
Tatsuhiro Suga, Akira Suzuki, Yuma Tamura, Xiao Zhou
2025 J jnl
Changing induced subgraph isomorphisms under extended reconfiguration rules.
Inf. Comput.
Tatsuhiro Suga, Akira Suzuki, Yuma Tamura, Xiao Zhou
2025 J jnl
On the complexity of list H-packing for sparse graph classes.
Theor. Comput. Sci.
Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou
2025 J jnl
Parameterized complexity of weighted target set selection.
Theor. Comput. Sci.
Takahiro Suzuki, Kei Kimura, Akira Suzuki, Yuma Tamura, Xiao Zhou
2025 B conf
Reachability of Independent Sets and Vertex Covers Under Extended Reconfiguration Rules.
ISAAC
Shuichi Hirahara, Naoto Ohsaka, Tatsuhiro Suga, Akira Suzuki, Yuma Tamura, Xiao Zhou
2025 J jnl
Reachability of Independent Sets and Vertex Covers Under Extended Reconfiguration Rules.
CoRR
Shuichi Hirahara, Naoto Ohsaka, Tatsuhiro Suga, Akira Suzuki, Yuma Tamura, Xiao Zhou
2025 J jnl
Spanning Trees with a Small Vertex Cover: the Complexity on Specific Graph Classes.
CoRR
Toranosuke Kokai, Akira Suzuki, Takahiro Suzuki, Yuma Tamura, Xiao Zhou
2024 B conf
On the Complexity of List H-Packing for Sparse Graph Classes.
WALCOM
Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou
2024 C conf
Parameterized Complexity of Weighted Target Set Selection.
TAMC
Takahiro Suzuki, Kei Kimura, Akira Suzuki, Yuma Tamura, Xiao Zhou
2024 B conf
The Shortest Path Reconfiguration Problem Based on Relaxation of Reconfiguration Rules.
WALCOM
Naoki Domon, Akira Suzuki, Yuma Tamura, Xiao Zhou
2023 J jnl
Decremental optimization of vertex-colouring under the reconfiguration framework.
Int. J. Comput. Math. Comput. Syst. Theory
Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura, Xiao Zhou
2023 — conf
On the Routing Problems in Graphs with Ordered Forbidden Transitions.
COCOON (1)
Kota Kumakura, Akira Suzuki, Yuma Tamura, Xiao Zhou
2023 J jnl
On the complexity of list H-packing for sparse graph classes.
CoRR
Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou
2023 B conf
Parameterized Complexity of Optimizing List Vertex-Coloring Through Reconfiguration.
WALCOM
Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura, Xiao Zhou
2021 J jnl
Approximability of the independent feedback vertex set problem for bipartite graphs.
Theor. Comput. Sci.
Yuma Tamura, Takehiro Ito, Xiao Zhou
2021 Misc conf
Decremental Optimization of Vertex-Coloring Under the Reconfiguration Framework.
COCOON
Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura, Xiao Zhou
2020 B conf
Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs.
WALCOM
Yuma Tamura, Takehiro Ito, Xiao Zhou
2020 B conf
Minimization and Parameterized Variants of Vertex Partition Problems on Graphs.
ISAAC
Yuma Tamura, Takehiro Ito, Xiao Zhou
2019 B conf
Reconfiguration of Minimum Steiner Trees via Vertex Exchanges.
MFCS
Haruka Mizuta, Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
2019 J jnl
The Coloring Reconfiguration Problem on Specific Graph Classes.
IEICE Trans. Inf. Syst.
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
2018 B conf
Algorithms for Coloring Reconfiguration Under Recolorability Constraints.
ISAAC
Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou
2018 J jnl
Complexity of Reconfiguration Problems for Constraint Satisfaction.
CoRR
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
2018 J jnl
Computational Power of Threshold Circuits of Energy at most Two.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Hiroki Maniwa, Takayuki Oki, Akira Suzuki, Kei Uchizawa, Xiao Zhou
2018 J jnl
Parameterized complexity of the list coloring reconfiguration problem with graph parameters.
Theor. Comput. Sci.
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
2018 J jnl
The Complexity of (List) Edge-Coloring Reconfiguration Problem.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou
2017 B conf
Complexity of Coloring Reconfiguration under Recolorability Constraints.
ISAAC
Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou
2017 B conf
Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters.
MFCS
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
2017 J jnl
Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters.
CoRR
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
2017 J jnl
Reconfiguration of Steiner Trees in an Unweighted Graph.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Haruka Mizuta, Takehiro Ito, Xiao Zhou
2017 — conf
The Coloring Reconfiguration Problem on Specific Graph Classes.
COCOA (1)
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
2017 B conf
The Complexity of (List) Edge-Coloring Reconfiguration Problem.
WALCOM
Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou
2016 C conf
Reconfiguration of Steiner Trees in an Unweighted Graph.
IWOCA
Haruka Mizuta, Takehiro Ito, Xiao Zhou
2016 J jnl
Reconfiguration of Vertex Covers in a Graph.
IEICE Trans. Inf. Syst.
Takehiro Ito, Hiroyuki Nooka, Xiao Zhou
2016 J jnl
The Complexity of (List) Edge-Coloring Reconfiguration Problem.
CoRR
Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou
2016 J jnl
The minimum vulnerability problem on specific graph classes.
J. Comb. Optim.
Yusuke Aoki, Bjarni V. Halldórsson, Magnús M. Halldórsson, Takehiro Ito, Christian Konrad, Xiao Zhou
2016 J jnl
Threshold Circuits Detecting Global Patterns in Two-dimensional Maps.
J. Graph Algorithms Appl.
Kei Uchizawa, Daiki Yashima, Xiao Zhou
2015 J jnl
Algorithms for the Independent Feedback Vertex Set Problem.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Yuma Tamura, Takehiro Ito, Xiao Zhou
2015 B conf
Competitive Diffusion on Weighted Graphs.
WADS
Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou
2015 J jnl
The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
2015 B conf
Threshold Circuits for Global Patterns in 2-Dimensional Maps.
WALCOM
Kei Uchizawa, Daiki Yashima, Xiao Zhou
2014 J jnl
Bandwidth consecutive multicolorings of graphs.
Theor. Comput. Sci.
Kazuhide Nishikawa, Takao Nishizeki, Xiao Zhou
2014 J jnl
Computational Complexity of Competitive Diffusion on (Un)weighted Graphs.
CoRR
Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou
2014 C conf
Deterministic Algorithms for the Independent Feedback Vertex Set Problem.
IWOCA
Yuma Tamura, Takehiro Ito, Xiao Zhou
2014 J jnl
Generalized rainbow connectivity of graphs.
Theor. Comput. Sci.
Kei Uchizawa, Takanori Aoki, Takehiro Ito, Xiao Zhou
2014 J jnl
On the Minimum Caterpillar Problem in Digraphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Taku Okada, Akira Suzuki, Takehiro Ito, Xiao Zhou
2014 C conf
Reconfiguration of Vertex Covers in a Graph.
IWOCA
Takehiro Ito, Hiroyuki Nooka, Xiao Zhou
2014 J jnl
Reconfiguration of list L(2,1)-labelings in a graph.
Theor. Comput. Sci.
Takehiro Ito, Kazuto Kawamura, Hirotaka Ono, Xiao Zhou
2014 C conf
The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs.
COCOA
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
2014 J jnl
The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs.
CoRR
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
2014 C conf
The Minimum Vulnerability Problem on Graphs.
COCOA
Yusuke Aoki, Bjarni V. Halldórsson, Magnús M. Halldórsson, Takehiro Ito, Christian Konrad, Xiao Zhou
2013 — conf
Complexity of Counting Output Patterns of Logic Circuits.
CATS
Kei Uchizawa, Zhenghong Wang, Hiroki Morizumi, Xiao Zhou
2013 J jnl
Energy and fan-in of logic circuits computing symmetric Boolean functions.
Theor. Comput. Sci.
Akira Suzuki, Kei Uchizawa, Xiao Zhou
2013 J jnl
Energy-Efficient Threshold Circuits Computing mod Functions.
Int. J. Found. Comput. Sci.
Akira Suzuki, Kei Uchizawa, Xiao Zhou
2013 C conf
Energy-Efficient Threshold Circuits Detecting Global Pattern in 1-Dimentional Arrays.
TAMC
Akira Suzuki, Kei Uchizawa, Xiao Zhou
2013 B conf
Generalized Rainbow Connectivity of Graphs.
WALCOM
Kei Uchizawa, Takanori Aoki, Takehiro Ito, Xiao Zhou
2013 Misc conf
On the Minimum Caterpillar Problem in Digraphs.
COCOON
Taku Okada, Akira Suzuki, Takehiro Ito, Xiao Zhou
2013 J jnl
On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms.
Algorithmica
Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki, Xiao Zhou
2012 — conf
Algorithms for Bandwidth Consecutive Multicolorings of Graphs - (Extended Abstract).
FAW-AAIM
Kazuhide Nishikawa, Takao Nishizeki, Xiao Zhou
2012 J jnl
An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree.
IEICE Trans. Inf. Syst.
Takehiro Ito, Kazuto Kawamura, Xiao Zhou
2012 J jnl
Minimum Cost Partitions of Trees with Supply and Demand.
Algorithmica
Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki
2012 J jnl
Partitioning a Weighted Tree into Subtrees with Weights in a Given Range.
Algorithmica
Takehiro Ito, Takao Nishizeki, Michael Schröder, Takeaki Uno, Xiao Zhou
2012 B conf
Reconfiguration of List L(2, 1)-Labelings in a Graph.
ISAAC
Takehiro Ito, Kazuto Kawamura, Hirotaka Ono, Xiao Zhou
2012 J jnl
Small grid drawings of planar graphs with balanced partition.
J. Comb. Optim.
Xiao Zhou, Takashi Hikino, Takao Nishizeki
2011 C conf
An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree.
TAMC
Takehiro Ito, Kazuto Kawamura, Xiao Zhou
2011 C conf
Energy and Fan-In of Threshold Circuits Computing Mod Functions.
TAMC
Akira Suzuki, Kei Uchizawa, Xiao Zhou
2011 — conf
Energy-Efficient Threshold Circuits Computing Mod Functions.
CATS
Akira Suzuki, Kei Uchizawa, Xiao Zhou
2011 J jnl
Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings.
IEICE Trans. Inf. Syst.
Takehiro Ito, Naoki Sakamoto, Xiao Zhou, Takao Nishizeki
2011 Misc conf
On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms.
COCOON
Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki, Xiao Zhou
2010 J jnl
Convex Drawings of Internally Triconnected Plane Graphs on O(N
Discret. Math. Algorithms Appl.
Xiao Zhou, Takao Nishizeki
2010 Misc conf
Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings.
FAW
Takehiro Ito, Naoki Sakamoto, Xiao Zhou, Takao Nishizeki
2010 — conf
Minimum Cost Partitions of Trees with Supply and Demand.
ISAAC (2)
Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki
2010 B conf
Small Grid Drawings of Planar Graphs with Balanced Bipartition.
WALCOM
Xiao Zhou, Takashi Hikino, Takao Nishizeki
2009 B conf
Convex Drawings of Internally Triconnected Plane Graphs on
ISAAC
Xiao Zhou, Takao Nishizeki
2009 J jnl
Efficient algorithms for wavelength assignment on trees of rings.
Discret. Appl. Math.
Zhengbing Bian, Qian-Ping Gu, Xiao Zhou
2009 J jnl
Partitioning graphs of supply and demand.
Discret. Appl. Math.
Takehiro Ito, Xiao Zhou, Takao Nishizeki
2008 J jnl
Approximability of partitioning graphs with supply and demand.
J. Discrete Algorithms
Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki
2008 J jnl
Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends.
SIAM J. Discret. Math.
Xiao Zhou, Takao Nishizeki
2008 B conf
Partitioning a Weighted Tree to Subtrees of Almost Uniform Size.
ISAAC
Takehiro Ito, Takeaki Uno, Xiao Zhou, Takao Nishizeki
2007 J jnl
Algorithms for finding distance-edge-colorings of graphs.
J. Discrete Algorithms
Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki
2007 B conf
Orthogonal drawings of series-parallel graphs with minimum bends.
WALCOM
Xiao Zhou, Takao Nishizeki
2007 J jnl
Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size.
IEICE Trans. Inf. Syst.
Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki
2007 J jnl
Sufficient Condition and Algorithm for List Total Colorings of Series-Parallel Graphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Yuki Matsuo, Xiao Zhou, Takao Nishizeki
2007 J jnl
Total Colorings Of Degenerate Graphs.
Comb.
Shuji Isobe, Xiao Zhou, Takao Nishizeki
2006 B conf
Approximability of Partitioning Graphs with Supply and Demand.
ISAAC
Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki
2006 Misc conf
Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size.
COCOON
Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki
2006 J jnl
Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size.
J. Discrete Algorithms
Takehiro Ito, Xiao Zhou, Takao Nishizeki
2005 Misc conf
Algorithms for Finding Distance-Edge-Colorings of Graphs.
COCOON
Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki
2005 J jnl
List total colorings of series-parallel graphs.
J. Discrete Algorithms
Xiao Zhou, Yuki Matsuo, Takao Nishizeki
2005 B conf
Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends.
ISAAC
Xiao Zhou, Takao Nishizeki
2005 — conf
Partitioning graphs of supply and demand.
ISCAS (1)
Takehiro Ito, Xiao Zhou, Takao Nishizeki
2005 J jnl
Partitioning trees of supply and demand.
Int. J. Found. Comput. Sci.
Takehiro Ito, Xiao Zhou, Takao Nishizeki
2005 A conf
Tight Bounds for Wavelength Assignment on Trees of Rings.
IPDPS
Zhengbing Bian, Qian-Ping Gu, Xiao Zhou
2004 J jnl
Algorithm for the Cost Edge-Coloring of Trees.
J. Comb. Optim.
Xiao Zhou, Takao Nishizeki
2004 J jnl
Cost Total Colorings of Trees.
IEICE Trans. Inf. Syst.
Shuji Isobe, Xiao Zhou, Takao Nishizeki
2004 J jnl
Multicolorings of Series-Parallel Graphs.
Algorithmica
Xiao Zhou, Takao Nishizeki
2004 B conf
Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size.
WG
Takehiro Ito, Xiao Zhou, Takao Nishizeki
2004 B conf
Wavelength Assignment on Bounded Degree Trees of Rings.
ICPADS
Zhengbing Bian, Qian-Ping Gu, Xiao Zhou
2003 J jnl
List Edge-Colorings of Series-Parallel Graphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Tomoya Fujino, Xiao Zhou, Takao Nishizeki
2003 Misc conf
List Total Colorings of Series-Parallel Graphs.
COCOON
Xiao Zhou, Yuki Matsuo, Takao Nishizeki
2002 Misc conf
Algorithms for the Multicolorings of Partial k-Trees.
COCOON
Takehiro Ito, Takao Nishizeki, Xiao Zhou
2002 B conf
Partitioning Trees of Supply and Demand.
ISAAC
Takehiro Ito, Xiao Zhou, Takao Nishizeki
2001 Misc conf
Algorithm for the Cost Edge-Coloring of Trees.
COCOON
Xiao Zhou, Takao Nishizeki
2001 B conf
Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs.
ISAAC
Xiao Zhou, Takao Nishizeki
2001 J jnl
The edge-disjoint paths problem is NP-complete for series-parallel graphs.
Discret. Appl. Math.
Takao Nishizeki, Jens Vygen, Xiao Zhou
2001 A* conf
Total Colorings of Degenerated Graphs.
ICALP
Shuji Isobe, Xiao Zhou, Takao Nishizeki
2000 J jnl
A Linear Algorithm for Finding [{
Algorithmica
Xiao Zhou, K. Fuse, Takao Nishizeki
2000 J jnl
Algorithms for generalized vertex-rankings of partial k-trees.
Theor. Comput. Sci.
Mohammod Abul Kashem, Xiao Zhou, Takao Nishizeki
2000 J jnl
Finding Edge-Disjoint Paths in Partial
Algorithmica
Xiao Zhou, Syurei Tamura, Takao Nishizeki
2000 B conf
Finding Independent Spanning Trees in Partial k-Trees.
ISAAC
Xiao Zhou, Takao Nishizeki
1999 B conf
A Linear Algorithm for Finding Total Colorings of Partial k-Trees.
ISAAC
Shuji Isobe, Xiao Zhou, Takao Nishizeki
1999 J jnl
A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees.
Int. J. Found. Comput. Sci.
Shuji Isobe, Xiao Zhou, Takao Nishizeki
1999 J jnl
Decompositions to Degree-Constrainded Subgraphs Are Simply Reducible to Edge-Colorings.
J. Comb. Theory B
Xiao Zhou, Takao Nishizeki
1999 J jnl
Edge-Coloring and f-Coloring for Various Classes of Graphs.
J. Graph Algorithms Appl.
Xiao Zhou, Takao Nishizeki
1998 B conf
A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees.
WG
Shuji Isobe, Xiao Zhou, Takao Nishizeki
1998 B conf
The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees.
ISAAC
Xiao Zhou, Takao Nishizeki
1997 J jnl
An NC Parallel Algorithm for Edge-Coloring Series-Parallel Multigraphs.
J. Algorithms
Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki
1997 — conf
An NC Parallel Algorithm for Generalized Vertex-Rankings of Partial k-Trees.
ISPAN
Mohammod Abul Kashem, Xiao Zhou, Takao Nishizeki
1997 Misc conf
Generalized Vertex-Rankings of Partial k-trees.
COCOON
Mohammod Abul Kashem, Xiao Zhou, Takao Nishizeki
1996 J jnl
A Linear Algorithm for Edge-Coloring Series-Parallel Multigraphs.
J. Algorithms
Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki
1996 J jnl
Edge-Coloring Partial k-Trees.
J. Algorithms
Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki
1996 B conf
Finding Edge-Disjoint Paths in Partial k-Trees (Extended Abstract).
ISAAC
Xiao Zhou, Syurei Tamura, Takao Nishizeki
1996 B conf
Generalized Edge-Ranking of Trees (Extended Abstract).
WG
Xiao Zhou, Mohammod Abul Kashem, Takao Nishizeki
1995 B conf
Algorithms for Finding f-Colorings of Partial k-Trees.
ISAAC
Xiao Zhou, Takao Nishizeki
1995 — ch.
Edge-Coloring Algorithms.
Computer Science Today
Shin-Ichi Nakano, Xiao Zhou, Takao Nishizeki
1995 A* conf
Finding Optimal Edge-Rankings of Trees.
SODA
Xiao Zhou, Takao Nishizeki
1995 J jnl
Generalized Vertex-Rankings of Trees.
Inf. Process. Lett.
Xiao Zhou, Nobuaki Nagai, Takao Nishizeki
1995 Misc conf
Simple Reduction of f-Colorings to Edge-Colorings.
COCOON
Xiao Zhou, Takao Nishizeki
1994 — conf
A Parallel Algorithm for Edge-Coloring Partial k-Trees.
SWAT
Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki
1994 A conf
An Efficient Algorithm for Edge-Ranking Trees.
ESA
Xiao Zhou, Takao Nishizeki
1994 B conf
Edge-Coloring and f-Coloring for Various Classes of Graphs.
ISAAC
Xiao Zhou, Takao Nishizeki
1994 — conf
Optimal parallel algorithm for edge-coloring partial k-trees with bounded degrees.
ISPAN
Xiao Zhou, Takao Nishizeki
1993 A conf
A Linear Algorithm for Edge-Coloring Partial k-Trees.
ESA
Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki
1993 B conf
Sequential and parallel algorithms for edge-coloring series-parallel multigraphs.
IPCO
Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki
1992 B conf
An Efficient Algorithm for Edge-Coloring Series-Parallel Multigraphs.
LATIN
Xiao Zhou, Shin-Ichi Nakano, Hitoshi Suzuki, Takao Nishizeki