2008 |
58 | EE | Takehiro Ito,
Takeaki Uno,
Xiao Zhou,
Takao Nishizeki:
Partitioning a Weighted Tree to Subtrees of Almost Uniform Size.
ISAAC 2008: 196-207 |
57 | EE | Takehiro Ito,
Erik D. Demaine,
Xiao Zhou,
Takao Nishizeki:
Approximability of partitioning graphs with supply and demand.
J. Discrete Algorithms 6(4): 627-650 (2008) |
2007 |
56 | | Xiao Zhou,
Takao Nishizeki:
Orthogonal drawings of series-parallel graphs with minimum bends.
WALCOM 2007: 3-12 |
55 | EE | Shuji Isobe,
Xiao Zhou,
Takao Nishizeki:
Total Colorings Of Degenerate Graphs.
Combinatorica 27(2): 167-182 (2007) |
54 | EE | Yuki Matsuo,
Xiao Zhou,
Takao Nishizeki:
Sufficient Condition and Algorithm for List Total Colorings of Series-Parallel Graphs.
IEICE Transactions 90-A(5): 907-916 (2007) |
53 | EE | Takehiro Ito,
Kazuya Goto,
Xiao Zhou,
Takao Nishizeki:
Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size.
IEICE Transactions 90-D(2): 449-456 (2007) |
52 | EE | Takehiro Ito,
Akira Kato,
Xiao Zhou,
Takao Nishizeki:
Algorithms for finding distance-edge-colorings of graphs.
J. Discrete Algorithms 5(2): 304-322 (2007) |
2006 |
51 | EE | Takehiro Ito,
Kazuya Goto,
Xiao Zhou,
Takao Nishizeki:
Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size.
COCOON 2006: 63-72 |
50 | EE | Xiao Zhou,
Hong Jia,
Yanlin Lu,
Weilong Ding:
Product Model Data Exchange Technology of Heterogeneous Systems in Collaborative Design Environment.
ICAT Workshops 2006: 145-148 |
49 | EE | Weilong Ding,
Wei-tong Zhang,
Xiao Zhou:
An Improved Algorithm Based on Sub-Structures for Creating Virtual Plant.
ICAT Workshops 2006: 200-204 |
48 | EE | Takehiro Ito,
Erik D. Demaine,
Xiao Zhou,
Takao Nishizeki:
Approximability of Partitioning Graphs with Supply and Demand.
ISAAC 2006: 121-130 |
47 | EE | 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): 142-154 (2006) |
2005 |
46 | EE | Takehiro Ito,
Akira Kato,
Xiao Zhou,
Takao Nishizeki:
Algorithms for Finding Distance-Edge-Colorings of Graphs.
COCOON 2005: 798-807 |
45 | EE | Zhengbing Bian,
Qian-Ping Gu,
Xiao Zhou:
Tight Bounds for Wavelength Assignment on Trees of Rings.
IPDPS 2005 |
44 | EE | Xiao Zhou,
Takao Nishizeki:
Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends.
ISAAC 2005: 166-175 |
43 | EE | Takehiro Ito,
Xiao Zhou,
Takao Nishizeki:
Partitioning graphs of supply and demand.
ISCAS (1) 2005: 160-163 |
42 | EE | Takehiro Ito,
Xiao Zhou,
Takao Nishizeki:
Partitioning trees of supply and demand.
Int. J. Found. Comput. Sci. 16(4): 803-827 (2005) |
41 | EE | Xiao Zhou,
Yuki Matsuo,
Takao Nishizeki:
List total colorings of series-parallel graphs.
J. Discrete Algorithms 3(1): 47-60 (2005) |
2004 |
40 | EE | Zhengbing Bian,
Qian-Ping Gu,
Xiao Zhou:
Wavelength Assignment on Bounded Degree Trees of Rings.
ICPADS 2004: 73-80 |
39 | EE | Ronghua Liang,
Zhongyu Chen,
Xujia Qin,
Xiao Zhou,
Liang Tang:
Perception and emotion modeling of avatars in IVE.
SMC (3) 2004: 2871-2876 |
38 | EE | Takehiro Ito,
Xiao Zhou,
Takao Nishizeki:
Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size.
WG 2004: 365-376 |
37 | EE | Xiao Zhou,
Takao Nishizeki:
Algorithm for the Cost Edge-Coloring of Trees.
J. Comb. Optim. 8(1): 97-108 (2004) |
2003 |
36 | EE | Xiao Zhou,
Yuki Matsuo,
Takao Nishizeki:
List Total Colorings of Series-Parallel Graphs.
COCOON 2003: 172-181 |
35 | EE | Xiao Zhou,
Takao Nishizeki:
Multicolorings of Series-Parallel Graphs.
Algorithmica 38(2): 271-297 (2003) |
2002 |
34 | EE | Takehiro Ito,
Takao Nishizeki,
Xiao Zhou:
Algorithms for the Multicolorings of Partial k-Trees.
COCOON 2002: 430-439 |
33 | EE | Takehiro Ito,
Xiao Zhou,
Takao Nishizeki:
Partitioning Trees of Supply and Demand.
ISAAC 2002: 612-623 |
2001 |
32 | EE | Xiao Zhou,
Takao Nishizeki:
Algorithm for the Cost Edge-Coloring of Trees.
COCOON 2001: 288-297 |
31 | EE | Shuji Isobe,
Xiao Zhou,
Takao Nishizeki:
Total Colorings of Degenerated Graphs.
ICALP 2001: 506-517 |
30 | EE | Xiao Zhou,
Takao Nishizeki:
Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs.
ISAAC 2001: 514-524 |
29 | | Takao Nishizeki,
Jens Vygen,
Xiao Zhou:
The edge-disjoint paths problem is NP-complete for series-parallel graphs.
Discrete Applied Mathematics 115(1-3): 177-186 (2001) |
2000 |
28 | EE | Xiao Zhou,
Takao Nishizeki:
Finding Independent Spanning Trees in Partial k-Trees.
ISAAC 2000: 168-179 |
27 | EE | Xiao Zhou,
Syurei Tamura,
Takao Nishizeki:
Finding Edge-Disjoint Paths in Partial k-Trees.
Algorithmica 26(1): 3-30 (2000) |
26 | EE | Xiao Zhou,
K. Fuse,
Takao Nishizeki:
A Linear Algorithm for Finding [{g, f}]-Colorings of Partial {k}-Trees.
Algorithmica 27(3): 227-243 (2000) |
25 | EE | Abul Kashem,
Xiao Zhou,
Takao Nishizeki:
Algorithms for generalized vertex-rankings of partial k-trees.
Theor. Comput. Sci. 240(2): 407-427 (2000) |
1999 |
24 | EE | Shuji Isobe,
Xiao Zhou,
Takao Nishizeki:
A Linear Algorithm for Finding Total Colorings of Partial k-Trees.
ISAAC 1999: 347-356 |
23 | | Shuji Isobe,
Xiao Zhou,
Takao Nishizeki:
A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees.
Int. J. Found. Comput. Sci. 10(2): 171-194 (1999) |
22 | EE | Xiao Zhou,
Takao Nishizeki:
Decompositions to Degree-Constrainded Subgraphs Are Simply Reducible to Edge-Colorings.
J. Comb. Theory, Ser. B 75(2): 270-287 (1999) |
21 | EE | Xiao Zhou,
Takao Nishizeki:
Edge-Coloring and f-Coloring for Various Classes of Graphs.
J. Graph Algorithms Appl. 3(1): (1999) |
1998 |
20 | EE | Xiao Zhou,
Takao Nishizeki:
The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees.
ISAAC 1998: 417-426 |
19 | | Shuji Isobe,
Xiao Zhou,
Takao Nishizeki:
A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees.
WG 1998: 100-113 |
1997 |
18 | | Abul Kashem,
Xiao Zhou,
Takao Nishizeki:
Generalized Vertex-Rankings of Partial k-trees.
COCOON 1997: 212-221 |
17 | EE | Abul Kashem,
Xiao Zhou,
Takao Nishizeki:
An NC Parallel Algorithm for Generalized Vertex-Rankings of Partial k-Trees.
ISPAN 1997: 105-111 |
16 | | Xiao Zhou,
Hitoshi Suzuki,
Takao Nishizeki:
An NC Parallel Algorithm for Edge-Coloring Series-Parallel Multigraphs.
J. Algorithms 23(2): 359-374 (1997) |
1996 |
15 | | Xiao Zhou,
Syurei Tamura,
Takao Nishizeki:
Finding Edge-Disjoint Paths in Partial k-Trees (Extended Abstract).
ISAAC 1996: 203-212 |
14 | | Xiao Zhou,
Abul Kashem,
Takao Nishizeki:
Generalized Edge-Ranking of Trees (Extended Abstract).
WG 1996: 390-404 |
13 | | Xiao Zhou,
Hitoshi Suzuki,
Takao Nishizeki:
A Linear Algorithm for Edge-Coloring Series-Parallel Multigraphs.
J. Algorithms 20(1): 174-201 (1996) |
12 | | Xiao Zhou,
Shin-Ichi Nakano,
Takao Nishizeki:
Edge-Coloring Partial k-Trees.
J. Algorithms 21(3): 598-617 (1996) |
1995 |
11 | | Xiao Zhou,
Takao Nishizeki:
Simple Reduction of f-Colorings to Edge-Colorings.
COCOON 1995: 223-228 |
10 | | Xiao Zhou,
Takao Nishizeki:
Algorithms for Finding f-Colorings of Partial k-Trees.
ISAAC 1995: 332-341 |
9 | | Xiao Zhou,
Takao Nishizeki:
Finding Optimal Edge-Rankings of Trees.
SODA 1995: 122-131 |
8 | | Shin-Ichi Nakano,
Xiao Zhou,
Takao Nishizeki:
Edge-Coloring Algorithms.
Computer Science Today 1995: 172-183 |
7 | EE | Xiao Zhou,
Nobuaki Nagai,
Takao Nishizeki:
Generalized Vertex-Rankings of Trees.
Inf. Process. Lett. 56(6): 321-328 (1995) |
1994 |
6 | | Xiao Zhou,
Takao Nishizeki:
An Efficient Algorithm for Edge-Ranking Trees.
ESA 1994: 118-129 |
5 | | Xiao Zhou,
Takao Nishizeki:
Edge-Coloring and f-Coloring for Various Classes of Graphs.
ISAAC 1994: 199-207 |
4 | | Xiao Zhou,
Shin-Ichi Nakano,
Takao Nishizeki:
A Parallel Algorithm for Edge-Coloring Partial k-Trees.
SWAT 1994: 359-369 |
1993 |
3 | | Xiao Zhou,
Shin-Ichi Nakano,
Takao Nishizeki:
A Linear Algorithm for Edge-Coloring Partial k-Trees.
ESA 1993: 409-418 |
2 | | Xiao Zhou,
Hitoshi Suzuki,
Takao Nishizeki:
Sequential and parallel algorithms for edge-coloring series-parallel multigraphs.
IPCO 1993: 129-145 |
1992 |
1 | | Xiao Zhou,
Shin-Ichi Nakano,
Hitoshi Suzuki,
Takao Nishizeki:
An Efficient Algorithm for Edge-Coloring Series-Parallel Multigraphs.
LATIN 1992: 516-529 |