Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Xiao Zhou
2010 – today
- 2013
[c56]Taku Okada, Akira Suzuki, Takehiro Ito, Xiao Zhou: On the Minimum Caterpillar Problem in Digraphs. COCOON 2013: 729-736- [c55]Akira Suzuki, Kei Uchizawa, Xiao Zhou: Energy-Efficient Threshold Circuits Detecting Global Pattern in 1-Dimentional Arrays. TAMC 2013: 248-259
- [c54]Kei Uchizawa, Takanori Aoki, Takehiro Ito, Xiao Zhou: Generalized Rainbow Connectivity of Graphs. WALCOM 2013: 233-244
- 2012
- [j36]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): 823-841 (2012)
- [j35]Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki: Minimum Cost Partitions of Trees with Supply and Demand. Algorithmica 64(3): 400-415 (2012)
- [j34]Takehiro Ito, Kazuto Kawamura, Xiao Zhou: An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree. IEICE Transactions 95-D(3): 737-745 (2012)
- [j33]Xiao Zhou, Takashi Hikino, Takao Nishizeki: Small grid drawings of planar graphs with balanced partition. J. Comb. Optim. 24(2): 99-115 (2012)
- [j32]Philippe Caillou, Javier Gil Quijano, Xiao Zhou: Automated observation of multi-agent based simulations A statistical analysis approach. Stud. Inform. Univ. 10(3): 62-86 (2012)
- [j31]
- [j30]
- [c53]Kazuhide Nishikawa, Takao Nishizeki, Xiao Zhou: Algorithms for Bandwidth Consecutive Multicolorings of Graphs - (Extended Abstract). FAW-AAIM 2012: 117-128
- [c52]Qing Wang, Qiming Zeng, Jian Jiao, Xiao Zhou, Cunren Liang, Sheng Gao: Determination of vertical antenna pattern of high-resolution airborne SAR and radiometric calibration. IGARSS 2012: 4022-4025
- [c51]Ye Yun, Qiming Zeng, Jian Jiao, Cunren Liang, Qing Wang, Xiao Zhou, Dapeng Yan: Calibration of airborne interferometric SAR data by external dem without artificial calibrators. IGARSS 2012: 4501-4504
- [c50]Xiao Zhou, Qiming Zeng, Jian Jiao, Qing Wang, Sheng Gao: Geometric calibration and geolocation of airborne SAR images. IGARSS 2012: 4513-4516
- [c49]Takehiro Ito, Kazuto Kawamura, Hirotaka Ono, Xiao Zhou: Reconfiguration of List L(2, 1)-Labelings in a Graph. ISAAC 2012: 34-43
- 2011
- [j29]Takehiro Ito, Naoki Sakamoto, Xiao Zhou, Takao Nishizeki: Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings. IEICE Transactions 94-D(2): 190-195 (2011)
- [j28]Xiao Zhou, Fang Yang, Jian Song: A Novel Noise Suppression Method in Channel Estimation. IEICE Transactions 94-A(10): 2027-2030 (2011)
- [j27]Zong-Rong Li, Xiao Zhou, Ai-Jing Tian: Interdisciplinary Research between Theoretical Informatics and the Humanities. Information 2(3): 546-559 (2011)
- [c48]Akira Suzuki, Kei Uchizawa, Xiao Zhou: Energy-Efficient Threshold Circuits Computing Mod Functions. CATS 2011: 105-110
- [c47]Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki, Xiao Zhou: On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms. COCOON 2011: 86-97
- [c46]Ben-Xian Yao, Xiao Zhou: Gender Stereotype in Foreign Media Advertisement: Performance Feature, Function and Mechanism. CSISE (3) 2011: 653-660
- [c45]Xiao Zhou, Cai-Zhi Zhu, Shin'ichi Satoh, Yu-tang Guo: Efficient quantization of color sift for image classification. ICIP 2011: 1073-1076
- [c44]Takehiro Ito, Kazuto Kawamura, Xiao Zhou: An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree. TAMC 2011: 94-105
- [c43]Akira Suzuki, Kei Uchizawa, Xiao Zhou: Energy and Fan-In of Threshold Circuits Computing Mod Functions. TAMC 2011: 154-163
- 2010
- [j26]Xiao Zhou, Takao Nishizeki: Convex Drawings of Internally Triconnected Plane Graphs on O(N2) Grids. Discrete Math., Alg. and Appl. 2(3): 347-362 (2010)
- [c42]Takehiro Ito, Naoki Sakamoto, Xiao Zhou, Takao Nishizeki: Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings. FAW 2010: 274-284
- [c41]Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki: Minimum Cost Partitions of Trees with Supply and Demand. ISAAC (2) 2010: 351-362
- [c40]Xiao Zhou, Takashi Hikino, Takao Nishizeki: Small Grid Drawings of Planar Graphs with Balanced Bipartition. WALCOM 2010: 47-57
2000 – 2009
- 2009
- [j25]Zhengbing Bian, Qian-Ping Gu, Xiao Zhou: Efficient algorithms for wavelength assignment on trees of rings. Discrete Applied Mathematics 157(5): 875-889 (2009)
- [j24]Takehiro Ito, Xiao Zhou, Takao Nishizeki: Partitioning graphs of supply and demand. Discrete Applied Mathematics 157(12): 2620-2633 (2009)
- [c39]Xiao Zhou, Takao Nishizeki: Convex Drawings of Internally Triconnected Plane Graphs on O(n2) Grids. ISAAC 2009: 760-770
- 2008
- [j23]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)
- [j22]Xiao Zhou, Takao Nishizeki: Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends. SIAM J. Discrete Math. 22(4): 1570-1604 (2008)
- [c38]Xiao Zhou, Guilin Zhang: CFAR Method Based on Half Side Gaussian Model for Small Target Detection. CIS (2) 2008: 229-232
- [c37]Takehiro Ito, Takeaki Uno, Xiao Zhou, Takao Nishizeki: Partitioning a Weighted Tree to Subtrees of Almost Uniform Size. ISAAC 2008: 196-207
- [c36]Xiao Zhou, Guohua Zhang, Guilin Zhang: Approved HG-CFAR Method for Infrared Small Target Detection. PACIIA (2) 2008: 877-881
- 2007
- [j21]Shuji Isobe, Xiao Zhou, Takao Nishizeki: Total Colorings Of Degenerate Graphs. Combinatorica 27(2): 167-182 (2007)
- [j20]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)
- [j19]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)
- [j18]Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki: Algorithms for finding distance-edge-colorings of graphs. J. Discrete Algorithms 5(2): 304-322 (2007)
- [c35]Xiao Zhou, Takao Nishizeki: Orthogonal drawings of series-parallel graphs with minimum bends. WALCOM 2007: 3-12
- 2006
- [j17]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)
- [c34]Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki: Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size. COCOON 2006: 63-72
- [c33]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
- [c32]Weilong Ding, Wei-tong Zhang, Xiao Zhou: An Improved Algorithm Based on Sub-Structures for Creating Virtual Plant. ICAT Workshops 2006: 200-204
- [c31]Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki: Approximability of Partitioning Graphs with Supply and Demand. ISAAC 2006: 121-130
- 2005
- [j16]Takehiro Ito, Xiao Zhou, Takao Nishizeki: Partitioning trees of supply and demand. Int. J. Found. Comput. Sci. 16(4): 803-827 (2005)
- [j15]Xiao Zhou, Yuki Matsuo, Takao Nishizeki: List total colorings of series-parallel graphs. J. Discrete Algorithms 3(1): 47-60 (2005)
- [c30]Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki: Algorithms for Finding Distance-Edge-Colorings of Graphs. COCOON 2005: 798-807
- [c29]Zhengbing Bian, Qian-Ping Gu, Xiao Zhou: Tight Bounds for Wavelength Assignment on Trees of Rings. IPDPS 2005
- [c28]Xiao Zhou, Takao Nishizeki: Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends. ISAAC 2005: 166-175
- [c27]Takehiro Ito, Xiao Zhou, Takao Nishizeki: Partitioning graphs of supply and demand. ISCAS (1) 2005: 160-163
- 2004
- [j14]Shuji Isobe, Xiao Zhou, Takao Nishizeki: Cost Total Colorings of Trees. IEICE Transactions 87-D(2): 337-342 (2004)
- [j13]Xiao Zhou, Takao Nishizeki: Algorithm for the Cost Edge-Coloring of Trees. J. Comb. Optim. 8(1): 97-108 (2004)
- [c26]Zhengbing Bian, Qian-Ping Gu, Xiao Zhou: Wavelength Assignment on Bounded Degree Trees of Rings. ICPADS 2004: 73-80
- [c25]Ronghua Liang, Zhongyu Chen, Xujia Qin, Xiao Zhou, Liang Tang: Perception and emotion modeling of avatars in IVE. SMC (3) 2004: 2871-2876
- [c24]Takehiro Ito, Xiao Zhou, Takao Nishizeki: Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size. WG 2004: 365-376
- 2003
- [j12]Xiao Zhou, Takao Nishizeki: Multicolorings of Series-Parallel Graphs. Algorithmica 38(2): 271-297 (2003)
- [c23]Xiao Zhou, Yuki Matsuo, Takao Nishizeki: List Total Colorings of Series-Parallel Graphs. COCOON 2003: 172-181
- 2002
- [c22]Takehiro Ito, Takao Nishizeki, Xiao Zhou: Algorithms for the Multicolorings of Partial k-Trees. COCOON 2002: 430-439
- [c21]Takehiro Ito, Xiao Zhou, Takao Nishizeki: Partitioning Trees of Supply and Demand. ISAAC 2002: 612-623
- 2001
- [j11]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)
- [c20]
- [c19]
- [c18]Xiao Zhou, Takao Nishizeki: Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs. ISAAC 2001: 514-524
- 2000
- [j10]Xiao Zhou, Syurei Tamura, Takao Nishizeki: Finding Edge-Disjoint Paths in Partial k-Trees. Algorithmica 26(1): 3-30 (2000)
- [j9]Xiao Zhou, K. Fuse, Takao Nishizeki: A Linear Algorithm for Finding [{g, f}]-Colorings of Partial {k}-Trees. Algorithmica 27(3): 227-243 (2000)
- [j8]Abul Kashem, Xiao Zhou, Takao Nishizeki: Algorithms for generalized vertex-rankings of partial k-trees. Theor. Comput. Sci. 240(2): 407-427 (2000)
- [c17]Xiao Zhou, Takao Nishizeki: Finding Independent Spanning Trees in Partial k-Trees. ISAAC 2000: 168-179
1990 – 1999
- 1999
- [j7]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)
- [j6]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)
- [j5]Xiao Zhou, Takao Nishizeki: Edge-Coloring and f-Coloring for Various Classes of Graphs. J. Graph Algorithms Appl. 3(1) (1999)
- [c16]Shuji Isobe, Xiao Zhou, Takao Nishizeki: A Linear Algorithm for Finding Total Colorings of Partial k-Trees. ISAAC 1999: 347-356
- 1998
- [c15]Xiao Zhou, Takao Nishizeki: The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees. ISAAC 1998: 417-426
- [c14]Shuji Isobe, Xiao Zhou, Takao Nishizeki: A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees. WG 1998: 100-113
- 1997
- [j4]Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki: An NC Parallel Algorithm for Edge-Coloring Series-Parallel Multigraphs. J. Algorithms 23(2): 359-374 (1997)
- [c13]Abul Kashem, Xiao Zhou, Takao Nishizeki: Generalized Vertex-Rankings of Partial k-trees. COCOON 1997: 212-221
- [c12]Abul Kashem, Xiao Zhou, Takao Nishizeki: An NC Parallel Algorithm for Generalized Vertex-Rankings of Partial k-Trees. ISPAN 1997: 105-111
- 1996
- [j3]Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki: A Linear Algorithm for Edge-Coloring Series-Parallel Multigraphs. J. Algorithms 20(1): 174-201 (1996)
- [j2]Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki: Edge-Coloring Partial k-Trees. J. Algorithms 21(3): 598-617 (1996)
- [c11]Xiao Zhou, Syurei Tamura, Takao Nishizeki: Finding Edge-Disjoint Paths in Partial k-Trees (Extended Abstract). ISAAC 1996: 203-212
- [c10]Xiao Zhou, Abul Kashem, Takao Nishizeki: Generalized Edge-Ranking of Trees (Extended Abstract). WG 1996: 390-404
- 1995
- [j1]Xiao Zhou, Nobuaki Nagai, Takao Nishizeki: Generalized Vertex-Rankings of Trees. Inf. Process. Lett. 56(6): 321-328 (1995)
- [p1]Shin-Ichi Nakano, Xiao Zhou, Takao Nishizeki: Edge-Coloring Algorithms. Computer Science Today 1995: 172-183
- [c9]
- [c8]Xiao Zhou, Takao Nishizeki: Algorithms for Finding f-Colorings of Partial k-Trees. ISAAC 1995: 332-341
- [c7]
- 1994
- [c6]
- [c5]Xiao Zhou, Takao Nishizeki: Edge-Coloring and f-Coloring for Various Classes of Graphs. ISAAC 1994: 199-207
- [c4]Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki: A Parallel Algorithm for Edge-Coloring Partial k-Trees. SWAT 1994: 359-369
- 1993
- [c3]Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki: A Linear Algorithm for Edge-Coloring Partial k-Trees. ESA 1993: 409-418
- [c2]Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki: Sequential and parallel algorithms for edge-coloring series-parallel multigraphs. IPCO 1993: 129-145
- 1992
- [c1]Xiao Zhou, Shin-Ichi Nakano, Hitoshi Suzuki, Takao Nishizeki: An Efficient Algorithm for Edge-Coloring Series-Parallel Multigraphs. LATIN 1992: 516-529
Coauthor Index
[j36] [j35] [j33] [c53] [j29] [j26] [c42] [c41] [c40] [j24] [c39] [j23] [j22] [c37] [j21] [j20] [j19] [j18] [c35] [j17] [c34] [c31] [j16] [j15] [c30] [c28] [c27] [j14] [j13] [c24] [j12] [c23] [c22] [c21] [j11] [c20] [c19] [c18] [j10] [j9] [j8] [c17] [j7] [j6] [j5] [c16] [c15] [c14] [j4] [c13] [c12] [j3] [j2] [c11] [c10] [j1] [p1] [c9] [c8] [c7] [c6] [c5] [c4] [c3] [c2] [c1]
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-23 22:19 CEST by the dblp team