default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXiao Zhou 0001
Person information
- affiliation: Tohoku University, Faculty of Engineering, Department of Information Engineering, Japan
Other persons with the same name
- Xiao Zhou — disambiguation page
- Xiao Zhou 0002
![[0000-0002-1331-7379]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-1331-7379")
— Shandong University, School of Mechanical, Electrical and Information Engineering, Weihai, China (and 1 more) - Xiao Zhou 0003 — PLA Strategic Support Force Information Engineering University, Institute of Geospatial Information, Zhengzhou, China (and 3 more)
- Xiao Zhou 0004 — Tencent Inc, Pattern Recognition Center, Wechat AI, China
- Xiao Zhou 0005 — Renmin University of China, Beijing, China (and 1 more)
- Xiao Zhou 0006 — Wuhan University of Technology, School of Mechanical and Electronic Engineering, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[c70]Tatsuhiro Suga, Akira Suzuki, Yuma Tamura, Xiao Zhou:
Changing Induced Subgraph Isomorphisms Under Extended Reconfiguration Rules. WALCOM 2025: 346-360- [i7]Tatsuhiro Suga, Akira Suzuki, Yuma Tamura, Xiao Zhou:
Changing Induced Subgraph Isomorphisms Under Extended Reconfiguration Rules. CoRR abs/2501.14450 (2025) - 2024
- [c69]Takahiro Suzuki, Kei Kimura, Akira Suzuki, Yuma Tamura, Xiao Zhou:
Parameterized Complexity of Weighted Target Set Selection. TAMC 2024: 320-331 - [c68]Naoki Domon, Akira Suzuki, Yuma Tamura, Xiao Zhou:
The Shortest Path Reconfiguration Problem Based on Relaxation of Reconfiguration Rules. WALCOM 2024: 227-241 - [c67]Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou:
On the Complexity of List H-Packing for Sparse Graph Classes. WALCOM 2024: 421-435 - 2023
- [j51]Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura, Xiao Zhou:
Decremental optimization of vertex-colouring under the reconfiguration framework. Int. J. Comput. Math. Comput. Syst. Theory 8(1): 80-92 (2023) - [c66]Kota Kumakura, Akira Suzuki, Yuma Tamura, Xiao Zhou:
On the Routing Problems in Graphs with Ordered Forbidden Transitions. COCOON (1) 2023: 359-370 - [c65]Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura, Xiao Zhou:
Parameterized Complexity of Optimizing List Vertex-Coloring Through Reconfiguration. WALCOM 2023: 279-290 - [i6]Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou:
On the complexity of list H-packing for sparse graph classes. CoRR abs/2312.08639 (2023) - 2021
- [j50]Yuma Tamura, Takehiro Ito, Xiao Zhou:
Approximability of the independent feedback vertex set problem for bipartite graphs. Theor. Comput. Sci. 849: 227-236 (2021) - [c64]Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura, Xiao Zhou:
Decremental Optimization of Vertex-Coloring Under the Reconfiguration Framework. COCOON 2021: 355-366 - 2020
- [c63]Yuma Tamura, Takehiro Ito, Xiao Zhou:
Minimization and Parameterized Variants of Vertex Partition Problems on Graphs. ISAAC 2020: 40:1-40:13 - [c62]Yuma Tamura, Takehiro Ito, Xiao Zhou:
Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs. WALCOM 2020: 286-295
2010 – 2019
- 2019
- [j49]Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou:
The Coloring Reconfiguration Problem on Specific Graph Classes. IEICE Trans. Inf. Syst. 102-D(3): 423-429 (2019) - [c61]Haruka Mizuta, Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou:
Reconfiguration of Minimum Steiner Trees via Vertex Exchanges. MFCS 2019: 79:1-79:11 - 2018
- [j48]Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou:
The Complexity of (List) Edge-Coloring Reconfiguration Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(1): 232-238 (2018) - [j47]Hiroki Maniwa, Takayuki Oki, Akira Suzuki, Kei Uchizawa, Xiao Zhou:
Computational Power of Threshold Circuits of Energy at most Two. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(9): 1431-1439 (2018) - [j46]Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou:
Parameterized complexity of the list coloring reconfiguration problem with graph parameters. Theor. Comput. Sci. 739: 65-79 (2018) - [c60]Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou:
Algorithms for Coloring Reconfiguration Under Recolorability Constraints. ISAAC 2018: 37:1-37:13 - [i5]Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou:
Complexity of Reconfiguration Problems for Constraint Satisfaction. CoRR abs/1812.10629 (2018) - 2017
- [j45]Haruka Mizuta, Takehiro Ito, Xiao Zhou:
Reconfiguration of Steiner Trees in an Unweighted Graph. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(7): 1532-1540 (2017) - [c59]Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou:
The Coloring Reconfiguration Problem on Specific Graph Classes. COCOA (1) 2017: 152-162 - [c58]Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou:
Complexity of Coloring Reconfiguration under Recolorability Constraints. ISAAC 2017: 62:1-62:12 - [c57]Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou:
Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters. MFCS 2017: 51:1-51:13 - [c56]Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou:
The Complexity of (List) Edge-Coloring Reconfiguration Problem. WALCOM 2017: 347-358 - [i4]Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou:
Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters. CoRR abs/1705.07551 (2017) - 2016
- [j44]Takehiro Ito, Hiroyuki Nooka, Xiao Zhou:
Reconfiguration of Vertex Covers in a Graph. IEICE Trans. Inf. Syst. 99-D(3): 598-606 (2016) - [j43]Yusuke Aoki, Bjarni V. Halldórsson, Magnús M. Halldórsson, Takehiro Ito, Christian Konrad, Xiao Zhou:
The minimum vulnerability problem on specific graph classes. J. Comb. Optim. 32(4): 1288-1304 (2016) - [j42]Kei Uchizawa, Daiki Yashima, Xiao Zhou:
Threshold Circuits Detecting Global Patterns in Two-dimensional Maps. J. Graph Algorithms Appl. 20(1): 115-131 (2016) - [c55]Haruka Mizuta, Takehiro Ito, Xiao Zhou:
Reconfiguration of Steiner Trees in an Unweighted Graph. IWOCA 2016: 163-175 - [i3]Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou:
The Complexity of (List) Edge-Coloring Reconfiguration Problem. CoRR abs/1609.00109 (2016) - 2015
- [j41]Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou:
The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(6): 1168-1178 (2015) - [j40]Yuma Tamura, Takehiro Ito, Xiao Zhou:
Algorithms for the Independent Feedback Vertex Set Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(6): 1179-1188 (2015) - [c54]Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou:
Competitive Diffusion on Weighted Graphs. WADS 2015: 422-433 - [c53]Kei Uchizawa, Daiki Yashima, Xiao Zhou:
Threshold Circuits for Global Patterns in 2-Dimensional Maps. WALCOM 2015: 306-316 - 2014
- [j39]Taku Okada, Akira Suzuki, Takehiro Ito, Xiao Zhou:
On the Minimum Caterpillar Problem in Digraphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(3): 848-857 (2014) - [j38]Kazuhide Nishikawa, Takao Nishizeki, Xiao Zhou:
Bandwidth consecutive multicolorings of graphs. Theor. Comput. Sci. 532: 64-72 (2014) - [j37]Takehiro Ito, Kazuto Kawamura, Hirotaka Ono, Xiao Zhou:
Reconfiguration of list L(2,1)-labelings in a graph. Theor. Comput. Sci. 544: 84-97 (2014) - [j36]Kei Uchizawa, Takanori Aoki, Takehiro Ito, Xiao Zhou:
Generalized rainbow connectivity of graphs. Theor. Comput. Sci. 555: 35-42 (2014) - [c52]Yusuke Aoki, Bjarni V. Halldórsson, Magnús M. Halldórsson, Takehiro Ito, Christian Konrad, Xiao Zhou:
The Minimum Vulnerability Problem on Graphs. COCOA 2014: 299-313 - [c51]Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou:
The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs. COCOA 2014: 314-328 - [c50]Takehiro Ito, Hiroyuki Nooka, Xiao Zhou:
Reconfiguration of Vertex Covers in a Graph. IWOCA 2014: 164-175 - [c49]Yuma Tamura, Takehiro Ito, Xiao Zhou:
Deterministic Algorithms for the Independent Feedback Vertex Set Problem. IWOCA 2014: 351-363 - [i2]Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou:
The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs. CoRR abs/1407.4235 (2014) - [i1]Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou:
Computational Complexity of Competitive Diffusion on (Un)weighted Graphs. CoRR abs/1412.3334 (2014) - 2013
- [j35]Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki, Xiao Zhou:
On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms. Algorithmica 67(2): 161-179 (2013) - [j34]Akira Suzuki, Kei Uchizawa, Xiao Zhou:
Energy-Efficient Threshold Circuits Computing mod Functions. Int. J. Found. Comput. Sci. 24(1): 15-30 (2013) - [j33]Akira Suzuki, Kei Uchizawa, Xiao Zhou:
Energy and fan-in of logic circuits computing symmetric Boolean functions. Theor. Comput. Sci. 505: 74-80 (2013) - [c48]Kei Uchizawa, Zhenghong Wang, Hiroki Morizumi, Xiao Zhou:
Complexity of Counting Output Patterns of Logic Circuits. CATS 2013: 37-43 - [c47]Taku Okada, Akira Suzuki, Takehiro Ito, Xiao Zhou:
On the Minimum Caterpillar Problem in Digraphs. COCOON 2013: 729-736 - [c46]Akira Suzuki, Kei Uchizawa, Xiao Zhou:
Energy-Efficient Threshold Circuits Detecting Global Pattern in 1-Dimentional Arrays. TAMC 2013: 248-259 - [c45]Kei Uchizawa, Takanori Aoki, Takehiro Ito, Xiao Zhou:
Generalized Rainbow Connectivity of Graphs. WALCOM 2013: 233-244 - 2012
- [j32]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) - [j31]Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki:
Minimum Cost Partitions of Trees with Supply and Demand. Algorithmica 64(3): 400-415 (2012) - [j30]Takehiro Ito, Kazuto Kawamura, Xiao Zhou:
An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree. IEICE Trans. Inf. Syst. 95-D(3): 737-745 (2012) - [j29]Xiao Zhou, Takashi Hikino, Takao Nishizeki:
Small grid drawings of planar graphs with balanced partition. J. Comb. Optim. 24(2): 99-115 (2012) - [c44]Kazuhide Nishikawa, Takao Nishizeki, Xiao Zhou:
Algorithms for Bandwidth Consecutive Multicolorings of Graphs - (Extended Abstract). FAW-AAIM 2012: 117-128 - [c43]Takehiro Ito, Kazuto Kawamura, Hirotaka Ono, Xiao Zhou:
Reconfiguration of List L(2, 1)-Labelings in a Graph. ISAAC 2012: 34-43 - 2011
- [j28]Takehiro Ito, Naoki Sakamoto, Xiao Zhou, Takao Nishizeki:
Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings. IEICE Trans. Inf. Syst. 94-D(2): 190-195 (2011) - [c42]Akira Suzuki, Kei Uchizawa, Xiao Zhou:
Energy-Efficient Threshold Circuits Computing Mod Functions. CATS 2011: 105-110 - [c41]Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki, Xiao Zhou:
On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms. COCOON 2011: 86-97 - [c40]Takehiro Ito, Kazuto Kawamura, Xiao Zhou:
An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree. TAMC 2011: 94-105 - [c39]Akira Suzuki, Kei Uchizawa, Xiao Zhou:
Energy and Fan-In of Threshold Circuits Computing Mod Functions. TAMC 2011: 154-163 - 2010
- [j27]Xiao Zhou, Takao Nishizeki:
Convex Drawings of Internally Triconnected Plane Graphs on O(N2) Grids. Discret. Math. Algorithms Appl. 2(3): 347-362 (2010) - [c38]Takehiro Ito, Naoki Sakamoto, Xiao Zhou, Takao Nishizeki:
Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings. FAW 2010: 274-284 - [c37]Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki:
Minimum Cost Partitions of Trees with Supply and Demand. ISAAC (2) 2010: 351-362 - [c36]Xiao Zhou, Takashi Hikino, Takao Nishizeki:
Small Grid Drawings of Planar Graphs with Balanced Bipartition. WALCOM 2010: 47-57
2000 – 2009
- 2009
- [j26]Zhengbing Bian, Qian-Ping Gu, Xiao Zhou:
Efficient algorithms for wavelength assignment on trees of rings. Discret. Appl. Math. 157(5): 875-889 (2009) - [j25]Takehiro Ito, Xiao Zhou, Takao Nishizeki:
Partitioning graphs of supply and demand. Discret. Appl. Math. 157(12): 2620-2633 (2009) - [c35]Xiao Zhou, Takao Nishizeki:
Convex Drawings of Internally Triconnected Plane Graphs on O(n2) Grids. ISAAC 2009: 760-770 - 2008
- [j24]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) - [j23]Xiao Zhou, Takao Nishizeki:
Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends. SIAM J. Discret. Math. 22(4): 1570-1604 (2008) - [c34]Takehiro Ito, Takeaki Uno, Xiao Zhou, Takao Nishizeki:
Partitioning a Weighted Tree to Subtrees of Almost Uniform Size. ISAAC 2008: 196-207 - 2007
- [j22]Shuji Isobe, Xiao Zhou, Takao Nishizeki:
Total Colorings Of Degenerate Graphs. Comb. 27(2): 167-182 (2007) - [j21]Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki:
Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size. IEICE Trans. Inf. Syst. 90-D(2): 449-456 (2007) - [j20]Yuki Matsuo, Xiao Zhou, Takao Nishizeki:
Sufficient Condition and Algorithm for List Total Colorings of Series-Parallel Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(5): 907-916 (2007) - [j19]Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki:
Algorithms for finding distance-edge-colorings of graphs. J. Discrete Algorithms 5(2): 304-322 (2007) - [c33]Xiao Zhou, Takao Nishizeki:
Orthogonal drawings of series-parallel graphs with minimum bends. WALCOM 2007: 3-12 - 2006
- [j18]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) - [c32]Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki:
Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size. COCOON 2006: 63-72 - [c31]Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki:
Approximability of Partitioning Graphs with Supply and Demand. ISAAC 2006: 121-130 - 2005
- [j17]Takehiro Ito, Xiao Zhou, Takao Nishizeki:
Partitioning trees of supply and demand. Int. J. Found. Comput. Sci. 16(4): 803-827 (2005) - [j16]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
- [j15]Xiao Zhou, Takao Nishizeki:
Multicolorings of Series-Parallel Graphs. Algorithmica 38(2): 271-297 (2004) - [j14]Shuji Isobe, Xiao Zhou, Takao Nishizeki:
Cost Total Colorings of Trees. IEICE Trans. Inf. Syst. 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]Takehiro Ito, Xiao Zhou, Takao Nishizeki:
Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size. WG 2004: 365-376 - 2003
- [j12]Tomoya Fujino, Xiao Zhou, Takao Nishizeki:
List Edge-Colorings of Series-Parallel Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(5): 1034-1045 (2003) - [c24]Xiao Zhou, Yuki Matsuo, Takao Nishizeki:
List Total Colorings of Series-Parallel Graphs. COCOON 2003: 172-181 - 2002
- [c23]Takehiro Ito, Takao Nishizeki, Xiao Zhou:
Algorithms for the Multicolorings of Partial k-Trees. COCOON 2002: 430-439 - [c22]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. Discret. Appl. Math. 115(1-3): 177-186 (2001) - [c21]Xiao Zhou, Takao Nishizeki:
Algorithm for the Cost Edge-Coloring of Trees. COCOON 2001: 288-297 - [c20]Shuji Isobe, Xiao Zhou, Takao Nishizeki:
Total Colorings of Degenerated Graphs. ICALP 2001: 506-517 - [c19]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]Mohammod Abul Kashem, Xiao Zhou, Takao Nishizeki:
Algorithms for generalized vertex-rankings of partial k-trees. Theor. Comput. Sci. 240(2): 407-427 (2000) - [c18]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 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): 1-18 (1999) - [c17]Shuji Isobe, Xiao Zhou, Takao Nishizeki:
A Linear Algorithm for Finding Total Colorings of Partial k-Trees. ISAAC 1999: 347-356 - 1998
- [c16]Xiao Zhou, Takao Nishizeki:
The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees. ISAAC 1998: 417-426 - [c15]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) - [c14]Mohammod Abul Kashem, Xiao Zhou, Takao Nishizeki:
Generalized Vertex-Rankings of Partial k-trees. COCOON 1997: 212-221 - [c13]Mohammod 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) - [c12]Xiao Zhou, Syurei Tamura, Takao Nishizeki:
Finding Edge-Disjoint Paths in Partial k-Trees (Extended Abstract). ISAAC 1996: 203-212 - [c11]Xiao Zhou, Mohammod 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) - [c10]Xiao Zhou, Takao Nishizeki:
Simple Reduction of f-Colorings to Edge-Colorings. COCOON 1995: 223-228 - [c9]Xiao Zhou, Takao Nishizeki:
Algorithms for Finding f-Colorings of Partial k-Trees. ISAAC 1995: 332-341 - [c8]Xiao Zhou, Takao Nishizeki:
Finding Optimal Edge-Rankings of Trees. SODA 1995: 122-131 - [p1]Shin-Ichi Nakano, Xiao Zhou, Takao Nishizeki:
Edge-Coloring Algorithms. Computer Science Today 1995: 172-183 - 1994
- [c7]Xiao Zhou, Takao Nishizeki:
An Efficient Algorithm for Edge-Ranking Trees. ESA 1994: 118-129 - [c6]Xiao Zhou, Takao Nishizeki:
Edge-Coloring and f-Coloring for Various Classes of Graphs. ISAAC 1994: 199-207 - [c5]Xiao Zhou, Takao Nishizeki:
Optimal parallel algorithm for edge-coloring partial k-trees with bounded degrees. ISPAN 1994: 167-174 - [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
[j50] [c63] [c62] [j49] [c61] [j48] [j46] [c60] [i5] [j45] [c59] [c58] [c57] [c56] [i4] [j44] [j43] [c55] [i3] [j41] [j40] [c54] [j39] [j37] [j36] [c52] [c51] [c50] [c49] [i2] [i1] [j35] [c47] [c45] [j32] [j31] [j30] [c43] [j28] [c41] [c40] [c38] [c37] [j25] [j24] [c34] [j21] [j19] [j18] [c32] [c31] [j17] [c30] [c27] [c25] [c23] [c22]
[j38] [j32] [j31] [j29] [c44] [j28] [j27] [c38] [c37] [c36] [j25] [c35] [j24] [j23] [c34] [j22] [j21] [j20] [j19] [c33] [j18] [c32] [c31] [j17] [j16] [c30] [c28] [c27] [j15] [j14] [j13] [c25] [j12] [c24] [c23] [c22] [j11] [c21] [c20] [c19] [j10] [j9] [j8] [c18] [j7] [j6] [j5] [c17] [c16] [c15] [j4] [c14] [c13] [j3] [j2] [c12] [c11] [j1] [c10] [c9] [c8] [p1] [c7] [c6] [c5] [c4] [c3] [c2] [c1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-15 22:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
