Xiao Zhou

Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

Minimization and Parameterized Variants of Vertex Partition Problems on Graphs.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

2019

Reconfiguration of Minimum Steiner Trees via Vertex Exchanges.

[BibT_eX]

[DOI]

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2018

Computational Power of Threshold Circuits of Energy at most Two.

[BibT_eX]

[DOI]

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

Complexity of Reconfiguration Problems for Constraint Satisfaction.

[BibT_eX]

[DOI]

CoRR, 2018

Algorithms for Coloring Reconfiguration Under Recolorability Constraints.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017

The Complexity of (List) Edge-Coloring Reconfiguration Problem.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2017

Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters.

[BibT_eX]

[DOI]

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Complexity of Coloring Reconfiguration under Recolorability Constraints.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

The Coloring Reconfiguration Problem on Specific Graph Classes.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

Threshold Circuits Detecting Global Patterns in Two-dimensional Maps.

[BibT_eX]

[DOI]

Daiki Yashima

J. Graph Algorithms Appl., 2016

The minimum vulnerability problem on specific graph classes.

[BibT_eX]

[DOI]

Yusuke Aoki

Bjarni V. Halldórsson

Magnús M. Halldórsson

Christian Konrad

J. Comb. Optim., 2016

Reconfiguration of Steiner Trees in an Unweighted Graph.

[BibT_eX]

[DOI]

Haruka Mizuta

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

2015

Algorithms for the Independent Feedback Vertex Set Problem.

[BibT_eX]

[DOI]

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

Threshold Circuits for Global Patterns in 2-Dimensional Maps.

[BibT_eX]

[DOI]

Daiki Yashima

Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

Competitive Diffusion on Weighted Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

2014

Bandwidth consecutive multicolorings of graphs.

[BibT_eX]

[DOI]

Kazuhide Nishikawa

Theor. Comput. Sci., 2014

Reconfiguration of list L(2,1)-labelings in a graph.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

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

[BibT_eX]

[DOI]

CoRR, 2014

Deterministic Algorithms for the Independent Feedback Vertex Set Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

Reconfiguration of Vertex Covers in a Graph.

[BibT_eX]

[DOI]

Hiroyuki Nooka

Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2014

The Minimum Vulnerability Problem on Graphs.

[BibT_eX]

[DOI]

Yusuke Aoki

Bjarni V. Halldórsson

Magnús M. Halldórsson

Christian Konrad

Proceedings of the Combinatorial Optimization and Applications, 2014

2013

Energy and fan-in of logic circuits computing symmetric Boolean functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Generalized Rainbow Connectivity of Graphs.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

Energy-Efficient Threshold Circuits Detecting Global Pattern in 1-Dimentional Arrays.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2013

On the Minimum Caterpillar Problem in Digraphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

Complexity of Counting Output Patterns of Logic Circuits.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Computing: The Australasian Theory Symposium, 2013

2012

Small grid drawings of planar graphs with balanced partition.

[BibT_eX]

[DOI]

Takashi Hikino

J. Comb. Optim., 2012

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

[BibT_eX]

[DOI]

Algorithmica, 2012

Reconfiguration of List L(2, 1)-Labelings in a Graph.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Algorithms for Bandwidth Consecutive Multicolorings of Graphs - (Extended Abstract).

[BibT_eX]

[DOI]

Kazuhide Nishikawa

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2011

Energy and Fan-In of Threshold Circuits Computing Mod Functions.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2011

An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree.

[BibT_eX]

[DOI]

Kazuto Kawamura

Proceedings of the Theory and Applications of Models of Computation, 2011

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

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

Energy-Efficient Threshold Circuits Computing Mod Functions.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011

2010

Convex Drawings of Internally Triconnected Plane Graphs on O(N2) Grids.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2010

Small Grid Drawings of Planar Graphs with Balanced Bipartition.

[BibT_eX]

[DOI]

Takashi Hikino

Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

Minimum Cost Partitions of Trees with Supply and Demand.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010

2009

Efficient algorithms for wavelength assignment on trees of rings.

[BibT_eX]

[DOI]

Zhengbing Bian

Qian-Ping Gu

Discret. Appl. Math., 2009

Convex Drawings of Internally Triconnected Plane Graphs on O(n2) Grids.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

Partitioning a Weighted Tree to Subtrees of Almost Uniform Size.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007

Sufficient Condition and Algorithm for List Total Colorings of Series-Parallel Graphs.

[BibT_eX]

[DOI]

Yuki Matsuo

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

Total Colorings Of Degenerate Graphs.

[BibT_eX]

[DOI]

Comb., 2007

2006

Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2006

Approximability of Partitioning Graphs with Supply and Demand.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2005

Partitioning graphs of supply and demand.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Circuits and Systems (ISCAS 2005), 2005

Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Tight Bounds for Wavelength Assignment on Trees of Rings.

[BibT_eX]

[DOI]

Zhengbing Bian

Qian-Ping Gu

Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), 2005

Algorithms for Finding Distance-Edge-Colorings of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

Cost Total Colorings of Trees.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2004

Multicolorings of Series-Parallel Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2004

Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

Wavelength Assignment on Bounded Degree Trees of Rings.

[BibT_eX]

[DOI]

Zhengbing Bian

Qian-Ping Gu

Proceedings of the 10th International Conference on Parallel and Distributed Systems, 2004

2003

List Edge-Colorings of Series-Parallel Graphs.

[BibT_eX]

[DOI]

Tomoya Fujino

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

List Total Colorings of Series-Parallel Graphs.

[BibT_eX]

[DOI]

Yuki Matsuo

Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2002

Partitioning Trees of Supply and Demand.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Algorithms for the Multicolorings of Partial k-Trees.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001

The edge-disjoint paths problem is NP-complete for series-parallel graphs.

[BibT_eX]

[DOI]

Jens Vygen

Discret. Appl. Math., 2001

Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Total Colorings of Degenerated Graphs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Algorithm for the Cost Edge-Coloring of Trees.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000

Algorithms for generalized vertex-rankings of partial k-trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Finding Edge-Disjoint Paths in Partial k-Trees.

[BibT_eX]

[DOI]

Syurei Tamura

Algorithmica, 2000

A Linear Algorithm for Finding [{g, f}]-Colorings of Partial {k}-Trees.

[BibT_eX]

[DOI]

K. Fuse

Algorithmica, 2000

Finding Independent Spanning Trees in Partial k-Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

1999

Decompositions to Degree-Constrainded Subgraphs Are Simply Reducible to Edge-Colorings.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1999

A Linear Algorithm for Finding Total Colorings of Partial k-Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

1998

A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998

The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

1997

An NC Parallel Algorithm for Edge-Coloring Series-Parallel Multigraphs.

[BibT_eX]

[DOI]

Hitoshi Suzuki

J. Algorithms, 1997

An NC Parallel Algorithm for Generalized Vertex-Rankings of Partial k-Trees.

[BibT_eX]

[DOI]

Proceedings of the 1997 International Symposium on Parallel Architectures, 1997

Generalized Vertex-Rankings of Partial k-trees.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996

A Linear Algorithm for Edge-Coloring Series-Parallel Multigraphs.

[BibT_eX]

[DOI]

Hitoshi Suzuki

J. Algorithms, 1996

Edge-Coloring Partial k-Trees.

[BibT_eX]

[DOI]

J. Algorithms, 1996

Generalized Edge-Ranking of Trees (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996

Finding Edge-Disjoint Paths in Partial k-Trees (Extended Abstract).

[BibT_eX]

[DOI]

Syurei Tamura

Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

1995

Generalized Vertex-Rankings of Trees.

[BibT_eX]

[DOI]

Nobuaki Nagai

Inf. Process. Lett., 1995

Finding Optimal Edge-Rankings of Trees.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

Algorithms for Finding f-Colorings of Partial k-Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

Simple Reduction of f-Colorings to Edge-Colorings.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

Edge-Coloring Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Today: Recent Trends and Developments, 1995

1994

A Parallel Algorithm for Edge-Coloring Partial k-Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1994

Optimal parallel algorithm for edge-coloring partial k-trees with bounded degrees.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Parallel Architectures, 1994

Edge-Coloring and f-Coloring for Various Classes of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

An Efficient Algorithm for Edge-Ranking Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1994

1993

Sequential and parallel algorithms for edge-coloring series-parallel multigraphs.

[BibT_eX]

Hitoshi Suzuki

Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

A Linear Algorithm for Edge-Coloring Partial k-Trees.

[BibT_eX]

[DOI]