Xiao Zhou

Affiliations:
  • Tohoku University, Faculty of Engineering, Department of Information Engineering, Japan


According to our database1, Xiao Zhou authored at least 97 papers between 1992 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the Complexity of List H-Packing for Sparse Graph Classes.
Proceedings of the WALCOM: Algorithms and Computation, 2024

The Shortest Path Reconfiguration Problem Based on Relaxation of Reconfiguration Rules.
Proceedings of the WALCOM: Algorithms and Computation, 2024

2023
Decremental optimization of vertex-colouring under the reconfiguration framework.
Int. J. Comput. Math. Comput. Syst. Theory, January, 2023

Parameterized Complexity of Optimizing List Vertex-Coloring Through Reconfiguration.
Proceedings of the WALCOM: Algorithms and Computation, 2023

On the Routing Problems in Graphs with Ordered Forbidden Transitions.
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2021
Approximability of the independent feedback vertex set problem for bipartite graphs.
Theor. Comput. Sci., 2021

Decremental Optimization of Vertex-Coloring Under the Reconfiguration Framework.
Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020
Minimization and Parameterized Variants of Vertex Partition Problems on Graphs.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

2019
The Coloring Reconfiguration Problem on Specific Graph Classes.
IEICE Trans. Inf. Syst., 2019

Reconfiguration of Minimum Steiner Trees via Vertex Exchanges.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2018
Parameterized complexity of the list coloring reconfiguration problem with graph parameters.
Theor. Comput. Sci., 2018

The Complexity of (List) Edge-Coloring Reconfiguration Problem.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

Computational Power of Threshold Circuits of Energy at most Two.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

Complexity of Reconfiguration Problems for Constraint Satisfaction.
CoRR, 2018

Algorithms for Coloring Reconfiguration Under Recolorability Constraints.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017
Reconfiguration of Steiner Trees in an Unweighted Graph.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

Complexity of Coloring Reconfiguration under Recolorability Constraints.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2016
Threshold Circuits Detecting Global Patterns in Two-dimensional Maps.
J. Graph Algorithms Appl., 2016

The minimum vulnerability problem on specific graph classes.
J. Comb. Optim., 2016

Reconfiguration of Vertex Covers in a Graph.
IEICE Trans. Inf. Syst., 2016

2015
Algorithms for the Independent Feedback Vertex Set Problem.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

Threshold Circuits for Global Patterns in 2-Dimensional Maps.
Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

Competitive Diffusion on Weighted Graphs.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

2014
Generalized rainbow connectivity of graphs.
Theor. Comput. Sci., 2014

Bandwidth consecutive multicolorings of graphs.
Theor. Comput. Sci., 2014

Reconfiguration of list L(2,1)-labelings in a graph.
Theor. Comput. Sci., 2014

On the Minimum Caterpillar Problem in Digraphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014

Computational Complexity of Competitive Diffusion on (Un)weighted Graphs.
CoRR, 2014

Deterministic Algorithms for the Independent Feedback Vertex Set Problem.
Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

The Minimum Vulnerability Problem on Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2014

2013
Energy and fan-in of logic circuits computing symmetric Boolean functions.
Theor. Comput. Sci., 2013

Energy-Efficient Threshold Circuits Computing mod Functions.
Int. J. Found. Comput. Sci., 2013

On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms.
Algorithmica, 2013

Energy-Efficient Threshold Circuits Detecting Global Pattern in 1-Dimentional Arrays.
Proceedings of the Theory and Applications of Models of Computation, 2013

Complexity of Counting Output Patterns of Logic Circuits.
Proceedings of the Nineteenth Computing: The Australasian Theory Symposium, 2013

2012
Small grid drawings of planar graphs with balanced partition.
J. Comb. Optim., 2012

An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree.
IEICE Trans. Inf. Syst., 2012

Partitioning a Weighted Tree into Subtrees with Weights in a Given Range.
Algorithmica, 2012

Minimum Cost Partitions of Trees with Supply and Demand.
Algorithmica, 2012

Reconfiguration of List L(2, 1)-Labelings in a Graph.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Algorithms for Bandwidth Consecutive Multicolorings of Graphs - (Extended Abstract).
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2011
Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings.
IEICE Trans. Inf. Syst., 2011

Energy and Fan-In of Threshold Circuits Computing Mod Functions.
Proceedings of the Theory and Applications of Models of Computation, 2011

2010
Convex Drawings of Internally Triconnected Plane Graphs on O(N<sup>2</sup>) Grids.
Discret. Math. Algorithms Appl., 2010

Small Grid Drawings of Planar Graphs with Balanced Bipartition.
Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

2009
Partitioning graphs of supply and demand.
Discret. Appl. Math., 2009

Efficient algorithms for wavelength assignment on trees of rings.
Discret. Appl. Math., 2009

Convex Drawings of Internally Triconnected Plane Graphs on <i>O</i>(<i>n</i><sup>2</sup>) Grids.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008
Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends.
SIAM J. Discret. Math., 2008

Approximability of partitioning graphs with supply and demand.
J. Discrete Algorithms, 2008

Partitioning a Weighted Tree to Subtrees of Almost Uniform Size.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007
Algorithms for finding distance-edge-colorings of graphs.
J. Discrete Algorithms, 2007

Sufficient Condition and Algorithm for List Total Colorings of Series-Parallel Graphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007

Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size.
IEICE Trans. Inf. Syst., 2007

Total Colorings Of Degenerate Graphs.
Comb., 2007

2006
Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size.
J. Discrete Algorithms, 2006

2005
List total colorings of series-parallel graphs.
J. Discrete Algorithms, 2005

Partitioning trees of supply and demand.
Int. J. Found. Comput. Sci., 2005

Tight Bounds for Wavelength Assignment on Trees of Rings.
Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), 2005

2004
Algorithm for the Cost Edge-Coloring of Trees.
J. Comb. Optim., 2004

Cost Total Colorings of Trees.
IEICE Trans. Inf. Syst., 2004

Multicolorings of Series-Parallel Graphs.
Algorithmica, 2004

Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

Wavelength Assignment on Bounded Degree Trees of Rings.
Proceedings of the 10th International Conference on Parallel and Distributed Systems, 2004

2003
List Edge-Colorings of Series-Parallel Graphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

2002
Algorithms for the Multicolorings of Partial k-Trees.
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001
The edge-disjoint paths problem is NP-complete for series-parallel graphs.
Discret. Appl. Math., 2001

Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Total Colorings of Degenerated Graphs.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000
Algorithms for generalized vertex-rankings of partial k-trees.
Theor. Comput. Sci., 2000

Finding Edge-Disjoint Paths in Partial <i>k</i>-Trees.
Algorithmica, 2000

A Linear Algorithm for Finding [{<i>g</i>, <i>f</i>}]-Colorings of Partial {<i>k</i>}-Trees.
Algorithmica, 2000

Finding Independent Spanning Trees in Partial k-Trees.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

1999
Edge-Coloring and f-Coloring for Various Classes of Graphs.
J. Graph Algorithms Appl., 1999

Decompositions to Degree-Constrainded Subgraphs Are Simply Reducible to Edge-Colorings.
J. Comb. Theory, Ser. B, 1999

A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees.
Int. J. Found. Comput. Sci., 1999

A Linear Algorithm for Finding Total Colorings of Partial k-Trees.
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

1998
The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

1997
An NC Parallel Algorithm for Edge-Coloring Series-Parallel Multigraphs.
J. Algorithms, 1997

An NC Parallel Algorithm for Generalized Vertex-Rankings of Partial k-Trees.
Proceedings of the 1997 International Symposium on Parallel Architectures, 1997

Generalized Vertex-Rankings of Partial k-trees.
Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996
A Linear Algorithm for Edge-Coloring Series-Parallel Multigraphs.
J. Algorithms, 1996

Edge-Coloring Partial k-Trees.
J. Algorithms, 1996

Generalized Edge-Ranking of Trees (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996

Finding Edge-Disjoint Paths in Partial k-Trees (Extended Abstract).
Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

1995
Generalized Vertex-Rankings of Trees.
Inf. Process. Lett., 1995

Finding Optimal Edge-Rankings of Trees.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

Algorithms for Finding f-Colorings of Partial k-Trees.
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

Simple Reduction of f-Colorings to Edge-Colorings.
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

Edge-Coloring Algorithms.
Proceedings of the Computer Science Today: Recent Trends and Developments, 1995

1994
A Parallel Algorithm for Edge-Coloring Partial k-Trees.
Proceedings of the Algorithm Theory, 1994

Optimal parallel algorithm for edge-coloring partial k-trees with bounded degrees.
Proceedings of the International Symposium on Parallel Architectures, 1994

An Efficient Algorithm for Edge-Ranking Trees.
Proceedings of the Algorithms, 1994

1993
Sequential and parallel algorithms for edge-coloring series-parallel multigraphs.
Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

A Linear Algorithm for Edge-Coloring Partial k-Trees.
Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1992
An Efficient Algorithm for Edge-Coloring Series-Parallel Multigraphs.
Proceedings of the LATIN '92, 1992


  Loading...