<HTML> <HEAD> <TITLE>Xiao Zhou's Home Page</TITLE> </HEAD> <BODY bgColor='#000066' TEXT="#ffffff" Vlink="00ffff" link="00ffff"> <A NAME="top"></A> <H2> <table border=5> <tr><td rowspan=4><img width=130 height=166 src="pic/ZhouPhoto.jpg" alt="Xiao Zhou"></td></tr> </table> Xiao Zhou<br> Professor <br> <a HREF="http://www.is.tohoku.ac.jp/index-e.html"> Graduate School of Information Sciences </a><br> Tohoku University<br> Aobayama 6-6-05, Aoba-ku<br> Sendai 980-8579, Japan<br> </H2> <hr> <table border=5> <tr><td rowspan=4><A href="indexJ.html">Japanese</A></td></tr> </table> <!--<A href="/nszk/zhou/research/Research2007.htm"> xvz9}N(000000000 </A> --!> <br> <HR SIZE=6> Hello and welcome to my Home Page. <br> <HR SIZE=6> <!-- <DL> --> <table border=2> <tr> <td width=200><center><A href="#rec">Research Interests</A></center></td> <td width=200><center><A href="#edu">Education</A></center></td> <td width=200><center><A href="#pro">Professional Appointments</A></center></td> <td width=200><center><A href="#tec">Teaching</A></center></td> </tr><tr> <td width=200><center><A href="#awa">Awards</A></center></td> <td width=200><center><A href="#sup">Graduate Students</A></center></td> <td width=200><center><A href="#act">Activities</A></center></td> <td width=200><center><A href="#paper">Publications</A></center></td> </tr> </table> <DT><A NAME="rec"> <H2>Research Interests</H2> </A> <UL> <LI>Analysis and Design of Discrete Algorithms<br> <LI>Visualization and Graph Drawing<br> <LI>Applied Graph Theory<br> <LI>Computer Science Education <FONT SIZE=2><P ALIGN="RIGHT"><A HREF="#top">Return to the top</A> </UL> <hr> <DT><A NAME="edu"> <H2>Education</H2> </A> <OL> <OL> <LI value="1995"> Ph.D. in Information Sciences, Tohoku University, Japan <br> Advisor: Takao Nishizeki<br> Thesis Topic: Efficient Algorithms for Edge-Coloring Graphs<br> <LI value="1992"> M.S. in Elcectrical Communication Engineering, Tohoku University, Japan<br> Advisor: Takao Nishizeki<br> Thesis Topic: Edge-Coloring Algorithms for Partial k-Trees <LI value="1986"> B.E. in Computer Science, the East China Normal University, China <FONT SIZE=2><P ALIGN="RIGHT"><A HREF="#top">Return to the top</A> </OL> </OL> <hr> <DT><A NAME="pro"> <H2>Professional Appointments</H2> </A> <UL> <table border=0> <tr><td rowspan=0><LI>Apr. 2010 - present</td> <td> Professor, Graduate School of Information Sciences, Tohoku University, Japan <td></tr> <tr><td rowspan=0><LI>Jan. 2001 - Mar. 2010</td> <td> Associate Professor, Graduate School of Information Sciences, Tohoku University, Japan <td></tr> <tr><td width=200><LI>Jun. 2002 - Mar. 2003</td> <td>Visiting Professor, School of Computing Science, Simon Fraser University, Canada </td></tr> <tr><td><LI>Jan. 1998 - Dec. 2000</td> <td> Lecturer, Graduate School of Information Sciences, Tohoku University, Japan </td></tr> <tr><td><LI>Apr. 1995 - Dec. 1997</td> <td> Assistant Professor, Education Center for Information Processing, Tohoku University, Japan </td></tr> </table> <FONT SIZE=2><P ALIGN="RIGHT"><A HREF="#top">Return to the top</A> </UL> <hr> <DT><A NAME="tec"> <H2>Teaching</H2> </A> <UL> <table border=0> <tr><td rowspan=0><LI>1998 - present</td> <td>Introduction of Algorithms (Tohoku University)</td> </tr> <tr><td width=200><LI>2004 - present</td><td>Discrete Mathematics (Tohoku University)</td</tr> <tr><td width=200><LI>2004 - present</td><td>Algorithm and Data Structure (Tohoku University)</td</tr> <tr><td><LI>1998 - 2003 </td><td>C Programming (Tohoku University) </td></tr> <tr><td><LI>1998 - 2001 </td><td>Introduction of Information Processing (Tohoku University)</td></tr> </table> <FONT SIZE=2><P ALIGN="RIGHT"><A HREF="#top">Return to the top</A> </UL> <hr> <DT><A NAME="awa"> <H2>Awards</H2> </A> <UL> <table border=0> <tr><td><LI>2012</td><td><A HREF=img/FAW2012.pdf>Best Paper Award (FAW-AAIM 2012)</A></td></tr> <tr><td><LI>2008</td><td>Best Paper Award (ISAAC 2008)</td></tr> <tr><td><LI>2008</td><td>Achievement Award (IEICE)</td></tr> <tr><td><LI>2004</td><td>Ishita Commemorative Award for Best Research Work</td></tr> <tr><td><LI>1997</td><td>Niwa Commemorative Award for Best Research Work</td></tr> <tr><td width=100><LI>1994</td><td>TELECOM System Technology Student Award</td></tr> <tr><td rowspan=0><LI>1992</td><td>IPSJ (Information Processing Society of Japan) Award for Promising Researchers</td></tr> </table> <FONT SIZE=2><P ALIGN="RIGHT"><A HREF="#top">Return to the top</A> </UL> <hr> <DT><A NAME="sup"> <H2>Graduate Students Supervised</H2> </A> <DD><H2>Current Graduate Students:</H2> <DD> <UL> <table border=0> <tr><td><LI>Takehiro Ito (Ph.D.)</td></tr> <tr><td><LI> Yuki Matsuo (Ph.D.)</td></tr> <tr><td><LI> Akira Kato (M.S.)</td></tr> </td></tr> </table> </UL> <DD><H2>Former Graduate Students:</H2> <DD> <UL> <table border=0> <tr><td><LI>Shuji Isobe (Ph.D.,2002)</td></tr> <tr><td><LI> Md. Abul Kashem (Ph.D., 1998)</td></tr> <tr><td><LI> Akira Kato (M.S., 2005)</td></tr> <tr><td><LI> Yuki Matsuo (M.S., 2004)</td></tr> <tr><td><LI> Takehiro Ito (M.S., 2003)</td></tr> <tr><td><LI> Tomoya Fujino (M.S., 2003)</td></tr> <tr><td><LI> Kenta Sato (M.S., 2003)</td></tr> <tr><td><LI> Takashi Hikota (M.S.,2002)</td></tr> <tr><td><LI> Masanori Kabakura (M.S.,2002)</td></tr> <tr><td><LI> Takashi Hayashi (M.S.,2001)</td></tr> <tr><td><LI> Salahuddin Muhammad Salim Zabir (M.S.,2000)</td></tr> <tr><td><LI> Kazunari Kono (M.S.,2000)</td></tr> <tr><td><LI> Yasuaki Kanari (M.S.,1999)</td></tr> <tr><td><LI> Syurei Tamura (M.S., 1998)</td></tr> <tr><td><LI> Iki Fuse (M.S., 1997)</td></tr> <tr><td><LI> Luwen Zhao (M.S., 1996)</td></tr> <tr><td><LI> Nobuaki Nagai (M.S., 1996)</td></tr> </table> </UL> <FONT SIZE=2><P ALIGN="RIGHT"><A HREF="#top">Return to the top</A> <hr> <DT><A NAME="act"> <H2>Activities</H2> <DD><H2>Associate Editor for Journals:</H2> <DD> <UL> <table border=0> <tr><td><LI>2000 - 2001</td><td> IEICE Trans. on Fundamentals of Electronics, Communication and Computer Sciences, Special Section on Discrete Mathematics and Its Applications</td></tr> <tr><td><LI>2001 - 2005</td><td>IEICE Trans. on Fundamentals of Electronics, Communication and Computer Sciences</td></tr> </table> </UL> <DD><H2>Program Committees:</H2> <DD> <UL> <table border=0> <tr><td><LI>The 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2006), Bergen, Norway, June 22-24, 2006 </td></tr> <tr><td><LI> The 3rd International Conference on Innovative Applications of Information Technology for the Developing World (AACC 2005), Kathomandu, Nepal, December 10-12, 2005 </td></tr> </table> </UL> <DD><H2>Referee for Journals:</H2> <DD> <UL> <table border=0> <tr><td><LI> Algorithmica</td></tr> <tr><td><LI> Combinatorica</td></tr> <tr><td><LI> Discrete Applied Mathematics</td></tr> <tr><td><LI> IEICE Trans. on Fundamentals of Electronics, Communication and Computer Sciences</td></tr> <tr><td><LI> Information Processing Letters</td></tr> <tr><td><LI> International Journal of Foundations of Computer Science</td></tr> <tr><td><LI> Journal of Algorithms</td></tr> <tr><td><LI> Journal of Combinatorial Optimization</td></tr> <tr><td><LI> Journal of Combinatorial Theory</td></tr> <tr><td><LI> Journal of Discrete Algorithms</td></tr> <tr><td><LI> Journal of Graph Algorithms and Applications</td></tr> <tr><td><LI> Theoretical Computer Science</td></tr> </table> </UL> <DD><H2>Referee for Conference:</H2> <DD> <UL> <table border=0> <tr><td><LI> Europian Symposium on Algorithms (ESA)</td></tr> <tr><td><LI> International Conference on Computing and Combinatorics (COCOON)</td></tr> <tr><td><LI> International Conference on Computer and Information Technology (ICCIT)</td></tr> <tr><td><LI> International Symposium on Algorithms and Computation (ISAAC)</td></tr> <tr><td><LI> International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN)</td></tr> <tr><td><LI> International Workshop, Graph-Theoretic Concepts in Computer Science (WG)</td></tr> <tr><td><LI> Scandianavian Workshop on Algorithm Theory (SWAT)</td></tr> </table> </UL> <FONT SIZE=2><P ALIGN="RIGHT"><A HREF="#top">Return to the top</A> <hr> <DT><A NAME="paper"> <H2>Publications</H2> <H2>Journals:</H2> <OL> <P><LI Value="51">Yusuke Aoki, Bjarni V. Halldorsson, Magnus M. Halldorsson, Takehiro Ito, Christian Konrad and <font color=#FF0000>Xiao Zhou,</font><br><STRONG> The Minimum Vulnerability Problem on Specific Graph Classes, </STRONG><BR><I> Journal of Combinatorial Optimization (JCO)</I>, Vol. 32, No. 4, pp. 1288-1304, November 2016. <P><LI Value="50">Takehiro Ito, Hiroyuki Nooka and <font color=#FF0000>Xiao Zhou,</font><br><STRONG> Reconfiguration of Vertex Covers in a Graph, </STRONG><BR><I> IEICE Trans. on Information and Systems</I>, Vol. E99-D, No. 3, pp. 598-606, March 2016. <P><LI Value="49">Yuma Tamura, Takehiro Ito and <font color=#FF0000>Xiao Zhou,</font><br><STRONG> Algorithms for the Independent Feedback Vertex Set Problem, </STRONG><BR><I> IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences</I>, Vol. E98-A, No. 6, pp. 1179-1188, June 2015. <P><LI Value="48">Tatsuhiko Hatanaka, Takehiro Ito and <font color=#FF0000>Xiao Zhou,</font><br><STRONG> The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs, </STRONG><BR><I> IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences</I>, Vol. E98-A, No. 6, pp. 1168-1178, June 2015. <P><LI Value="47">Takashi Hasegawa, Takehiro Ito, Akira Suzuki and <font color=#FF0000>Xiao Zhou,</font><br><STRONG> Experimental Evaluations of Dynamic Algorithm for Maintaining Shortest-Paths Trees on Real-World Networks, </STRONG><BR><I> Interdisciplinary Information Sciences(IIS)</I>, Vol. 21, No. 1, pp. 25-35, March 2015. <P><LI Value="46">Kei Uchizawa, Takanori Aoki, Takehiro Ito and <font color=#FF0000>Xiao Zhou,</font><br><STRONG> Generalized rainbow connectivity of graphs </STRONG><BR><I> Theoretical Computer Science (TCS)</I>, 555, pp. 35-42, 23 October 2014. <P><LI Value="45">Takehiro Ito, Kazuto Kawamura, Hitotaka Ono and <font color=#FF0000>Xiao Zhou</font><br><STRONG> Reconfigure on list L(2,1)-labelings in a graph </STRONG><BR><I> Theoretical Computer Science (TCS)</I>, 544, pp. 84-97, August 2014. <P><LI Value="44">Kazuhide Nishikawa, Takao Nishizeki and <font color=#FF0000>Xiao Zhou</font><br><STRONG> Bandwidth consecutive multicolorings of graphs </STRONG><BR><I> Theoretical Computer Science (TCS)</I>, 532, pp. 64-72, May 2014. <P><LI Value="43">Taku Okada, Akira Suzuki, Takehiro Ito and <font color=#FF0000>Xiao Zhou</font><br><STRONG> On the Minimum Caterpillar Problem in Digraphs </STRONG><BR><I> IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences</I>, Vol. E97-A, No. 3, pp. 848-857, March 2014. <P><LI Value="42">Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki and <font color=#FF0000>Xiao Zhou</font><br><STRONG> On the rainbow connectivity of graphs: complexity and FPT algorithms, </STRONG><BR><I> Algorithmica</I>, 67, Issue 2, pp. 161-179, October 2013. <P><LI Value="41">Akira Suzuki, Kei Uchizawa and <font color=#FF0000>Xiao Zhou</font><br><STRONG> Energy and fan-in of logic circuits computing symmetric Boolean functions </STRONG><BR><I> Theoretical Computer Science (TCS)</I>, 505, pp. 74-80, September 2013. <P><LI Value="40">Akira Suzuki, Kei Uchizawa and <font color=#FF0000>Xiao Zhou</font><br><STRONG> Energy-efficient threshold circuits computing MOD functions </STRONG><BR><I> International Journal of Foundations of Computer Science (IJFCS) </I>, 24, pp. 15-29, January 2013. <P><LI Value="39">Kei Uchizawa and <font color=#FF0000>Xiao Zhou</font><br><STRONG> Energy-efficient threshold circuits for comparison functions </STRONG><BR><I> Interdisciplinary Information Sciences(IIS) </I>, 18, pp. 161-166, January 2012. <P><LI Value="38">Takehiro Ito, Takuya Hara, <font color=#FF0000>Xiao Zhou</font> and Takao Nishizeki<br><STRONG> Minimum cost partitions of trees with supply and demand</STRONG><BR><I> Algorithmica</I>, 64, pp. 400-415, November 2012. <P><LI Value="37"><font color=#FF0000> Xiao Zhou</font>, Takashi Hikino and Takao Nishizeki<br><STRONG> Small grid drawings of planar graphs with balanced partition</STRONG><BR><I> Journal of Combinatorial Optimization</I>, 24, pp. 99-115, August 2012. <P><LI Value="36">Takehiro Ito, Takao Nishizeki, Michael Schroder, Takeaki Uno and <font color=#FF0000>Xiao Zhou</font><br><STRONG> Partitioning a weighted tree into subtrees with weights in a given range</STRONG><BR><I> Algorithmica</I>, Vol. 62, Numbers 3-4, pp. 823-841, April 2012. <P><LI Value="35">Takehiro Ito, Kazuto Kawamura and <font color=#FF0000>Xiao Zhou</font><br><STRONG> An improved sufficient condition for reconfiguration of list edge-colorings in a tree</STRONG><BR><I> IEICE Trans. on Information and Systems</I>, Vol. E95-D, No. 3, pp. 737-745, March 2012. <P><LI Value="34">Takehiro Ito, Naoki Sakamoto, <font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki <br><STRONG> Minimum cost edge-colorings of trees can be reduced to matchings</STRONG><BR><I> IEICE Trans. on Information and Systems</I>, Vol. E94-D, No. 2, pp. 190-195, February 2011. <P><LI Value="33"><font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki <br><STRONG> Convex drawings of internally triconnected plane graphs on $O(n^2)$ grids</STRONG><BR><I> Discrete Mathematics, Algorithms and Applications</I>, 2 (2010), pp. 347-362. <P><LI Value="32">Takehiro Ito, <font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki <br><STRONG> Partitioning graphs with supply and demand</STRONG><BR><I> Discrete Applied Math.</I>, 157 (2009), pp. 2620-2633. <P><LI Value="31">Zhengbing Bian, Qianping Gu and <font color=#FF0000> Xiao Zhou</font> <br> <STRONG>Efficient algorithms for wavelength assignment on trees of rings </STRONG><BR><I> Discrete Applied Mathematics</I>, 157 (2009), pp. 875-889. <P><LI Value="30"><font color=#FF0000> Xiao Zhou</font> and Takao Nishizek <br><STRONG> Orthogonal drawings of series-parallel graphs with minimum bends </STRONG><BR><I> SIAM J. Discrete Math.</I>, 22(2008), pp. 1570-1604. <P><LI Value="29">Takehiro Ito, Erik D. Demaine, <font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki <br><STRONG> Approximability of partitioning graphs with supply and demand</STRONG><BR><I> Journal of Discrete Algorithms</I>, 6(2008), pp. 627-650. <P><LI Value="28">Yuki Matsuo, <font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki <br><STRONG> Sufficient condition and algorithm for list total colorings of series-parallel graphs </STRONG><BR><I> IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences</I>, E90-A(2007), pp. 907-916. <P><LI Value="27">Takehiro Ito, Akira Kato, <font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki <br><STRONG> Algorithms for finding distance-edge-colorings of graphs </STRONG><BR><I> Journal of Discrete Algorithms</I>, 5(2007), pp.304-322. <P><LI Value="26">Takehiro Ito, Kazuya Goto, <font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki <br><STRONG> Partitioning a multi-weighted graph to connected subgraphs of almost uniform size </STRONG><BR><I> IEICE Trans. on Information and Systems</I>, E90-D(2007), pp.449-456. <P><LI Value="25">Shuji Isobe,<font color=#FF0000> Xiao Zhou</font>,Takao Nishizeki <br><STRONG>Total colorings of degenerate graphs</STRONG><BR><I>Combinatorica</I>, 27(2007), pp.167-182. <P><LI Value="24">Takehiro Ito, <font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki <br><STRONG> Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size</STRONG><BR><I> Journal of Discrete Algorithms</I>, 4(2006), pp.142-154. <P><LI Value="23"><font color=#FF0000> Xiao Zhou</font>,Matsuo Yuki,Takao Nishizeki <br><STRONG>List total colorings of series- parallel graphs</STRONG><BR><I>Journal of Discrete Algorithms</I>, <Strong>3</Strong>(2005), pp.47-60 <P><LI Value="22">Takehiro Ito,<font color=#FF0000> Xiao Zhou</font>,Takao Nishizeki <br><STRONG>Partition trees of supply and demand</STRONG><BR><I>International Journal of Foundations of Computer Science</I>, <Strong>16</Strong>(2005), pp. 803-827 <P><LI Value="21">Shuji Isobe,<font color=#FF0000> Xiao Zhou</font>,Takao Nishizeki <br><STRONG>Cost total colorings of trees</STRONG><BR><I>IEICE Trans. on Information and System</I>, <STRONG>E87-D</STRONG>(2004), pp.337-342 <P><LI Value="20"><font color=#FF0000> Xiao Zhou</font>,Takao Nishizeki <br><STRONG>Multicoloring of series-parallel graphs</STRONG><BR><I>Algorithmica</I>, <STRONG>38</STRONG>(2004), pp. 271-297 <P><LI Value="19"><font color=#FF0000> Xiao Zhou</font>,Takao Nishizeki <br><STRONG>Algorithm for the cost edge-colorings of trees</STRONG> <BR><I>Journal of Combinatorial Optimization</I>, <STRONG>8</STRONG>(2004), pp. 97-108 <P><LI Value="18">Tomoya Fujino,<font color=#FF0000> Xiao Zhou</font>,Takao Nishizeki <br><STRONG>List edge-colorings of series -parallel graphs</STRONG><BR><I>IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences</I>, <STRONG>E86-A</STRONG>(2003), pp. 1034-1045 <P><LI Value="17">Takehiro Ito, Takao Nishizeki,<font color=#FF0000> Xiao Zhou</font> <br><STRONG>Algorithms for multicolorings of partial k-trees</STRONG><BR><I>IEICE Trans. on Information and Systems</I>, <STRONG>E86-D</STRONG>(2003), pp. 191 -200 <P><LI Value="16">Tomoya Fujino, Shuji Isobe,<font color=#FF0000> Xiao Zhou</font>,and Takao Nishizeki<br><STRONG>Linear algorithm for finding list edge-colorings of series-parallel graphs</STRONG><BR><I>IEICE Trans. on Information and Systems</I>, <STRONG>E86-D</STRONG>(2003), pp. 186-190 <P><LI Value="15">ΑS_N, <font color=#FF0000> hTf</font>, +Y<br><STRONG>tvR0000000i_rY00000000</STRONG><BR><I>`1XbS0000</I>, <STRONG>1</STRONG>(2002), pp. 21-22 <P><LI Value="14">Takao Nishizeki, Jens Vygen and <font color=#FF0000> Xiao Zhou</font><br><STRONG>The edge-disjoint paths problem is NP-complete for series-parallel graphs</STRONG><BR><I>Discrete Applied Mathematics</I>,<STRONG>115</STRONG>(2001), pp. 177-186 <P><LI Value="13"> Md. Abul Kashem, <font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki<br><STRONG>Algorithms for generalized vertex-rankings of partial <I>k</I>-trees</STRONG><BR><I>Theoretical Computer Science</I>, <STRONG>240</STRONG>(2000), pp. 407-427 <P><LI Value="12"><font color=#FF0000> Xiao Zhou</font>, Yasuaki Kanari and Takao Nishizeki <br><STRONG>Generalized vertex- coloring of partial <I>k</I>-trees</STRONG><BR><I>IEICE Trans. on Fundamentals of Electronics, Communication and Computer Sciences</I>, <STRONG>E83-A</STRONG>(2000), pp. 671-678 <P><LI Value="11"><font color=#FF0000> Xiao Zhou,</font> Kazuki Fuse and Takao Nishizeki<br><STRONG>A linear algorithm for finding [<I>g</I>,<I>f</I>]-colorings of partial <I>k</I>-trees</STRONG><BR><I>Algorithmica</I>, <STRONG>27</STRONG> (2000), pp. 227-243 <P><LI Value="10"><font color=#FF0000> Xiao Zhou,</font> Syurei Tamura and Takao Nishizeki<br><STRONG>Finding edge-disjoint paths in partial <I>k</I>-trees</STRONG><BR><I>Algorithmica</I>, <STRONG>26</STRONG>(2000), pp. 3-30 <P><LI Value="9">Shuji Isobe, <font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki<br><STRONG>A polynomial-time algorithm for finding total colorings of partial <I>k</I>-trees</STRONG><BR><I>International Journal of Foundations of Computer Science</I>,<STRONG>10</STRONG>(1999), pp. 171-194 <P><LI Value="8"><font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki<br><STRONG>Edge-coloring and <I>f</I>-colorings for various classes of graphs</STRONG><BR><I> Journal of Graph Algorithms and Applications</I>,<STRONG>3</STRONG>(1999), pp. 1-18 <P><LI Value="7"><font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki<br><STRONG>Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings</STRONG><BR><I>Journal of Combinatorial Theory, Series B</I>,<STRONG> 75</STRONG>(1999), pp. 270-287 <P><LI Value="6"><font color=#FF0000> Xiao Zhou,</font> Md. Abul Kashem and Takao Nishizeki<br><STRONG>Generalized edge- rankings of trees</STRONG><BR><I>IEICE Trans. on Fundamentals of Electronics, Communication and Computer Sciences</I>, <STRONG>E81-A</STRONG>(1998), pp. 310-320 <P><LI Value="5"><font color=#FF0000> Xiao Zhou,</font> Hitoshi Suzuki and Takao Nishizeki<br><STRONG>An NC parallel algorithm for edge-coloring series-parallel multigraphs</STRONG><BR><I>Journal of Algorithms</I>, <STRONG>23</STRONG>(1997), pp. 359-374 <P><LI Value="4"><font color=#FF0000> Xiao Zhou,</font> Shin-ichi Nakano and Takao Nishizeki<br><STRONG>Edge-coloring partial <I>k</I>-trees</STRONG><BR><I>Journal of Algorithms</I>, <STRONG>21</STRONG>(1996), pp. 598-617 <P><LI Value="3"><font color=#FF0000> Xiao Zhou,</font> Hitoshi Suzuki and Takao Nishizeki<br><STRONG>A linear algorithm for edge-coloring series-parallel multigraphs</STRONG><BR><I>Journal of Algorithms</I>, <STRONG>20</STRONG>(1996), pp. 174-201 <P><LI Value="2"><font color=#FF0000> Xiao Zhou,</font> Nobuaki Nagai and Takao Nishizeki<br><STRONG>Generalized vertex- rankings of trees</STRONG><BR><I>Information Processing Letters</I>, <STRONG>56</STRONG>(1995), pp. 321-328. <P><LI Value="1"><font color=#FF0000> Xiao Zhou </font>and Takao Nishizeki<br><STRONG>Optimal parallel algorithm for edge-coloring partial <I>k</I>-trees with bounded degrees.</STRONG><BR><I>IEICE Trans. on Fundamentals of Electronics, Communication and Computer Sciences</I>, <STRONG>E78-A</STRONG>(1995), pp. 463-469. </OL><P> <FONT SIZE=2><P ALIGN="RIGHT"><A HREF="#top">Return to the top</A> <HR> <H2>Conferences:</H2> <OL> <p><LI Value="61">Hiroki Osawa, Akira Suzuki, Takehiro Ito and <font color=#FF0000> Xiao Zhou</font>, <br><STRONG> The Complexity of (List) Edge-Coloring Reconfiguration Problem, </STRONG><BR> In <I>Proceedings of the 11th International Conference and Workshops on Algorithms and Computation</I> (WALCOM 2017), Lecture Notes in Computer Science, Vol. 10167, pp. 347-358, 2017. (Hsinchu, Taiwan, March 29-31, 2017: Our presentation was on March 30.) <p><LI Value="60">Haruka Mizuta, Takehiro Ito and <font color=#FF0000> Xiao Zhou</font>, <br><STRONG> Reconfiguration of Steiner Trees in an Unweighted Graph, </STRONG><BR> In <I>Proceedings of the 27th International Workshop on Combinatorial Algorithms</I> (IWOCA 2016), Lecture Notes in Computer Science, Vol. 9843, pp. 163-175, 2016. (Helsinki, Finland, August 17-19, 2016: Our presentation was on August 17.) <p><LI Value="59">Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka and <font color=#FF0000> Xiao Zhou</font>, <br><STRONG> Competitive Diffusion on Weighted Graphs, </STRONG><BR> In <I>Proceedings of the 14th Algorithms and Data Structures Symposiums</I> (WADS 2015), Lecture Notes in Computer Science, Vol. 9214, pp. 422-433, 2015. (Victoria, BC, Canada, August 5-7, 2015: Our presentation was on August 6.) <p><LI Value="58">Tatsuhiko Hatanaka, Takehiro Ito and <font color=#FF0000> Xiao Zhou</font>, <br><STRONG> The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs, </STRONG><BR> In <I>Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applicationss</I> (COCOA 2014), Lecture Notes in Computer Science, Vol. 8881, pp. 314-328, 2014. (Maui, Hawaii, USA, December 19-21, 2014: Our presentation was on December 20.) <p><LI Value="57">Yusuke Aoki, Bjarni V. Halldorsson, Magnus M. Halldorsson, Takehiro Ito, Christian Konrad and <font color=#FF0000> Xiao Zhou</font>, <br><STRONG> The Minimum Vulnerability Problem on Graphs, </STRONG><BR> In <I>Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applicationss</I> (COCOA 2014), Lecture Notes in Computer Science, Vol. 8881, pp. 299-313, 2014. (Maui, Hawaii, USA, December 19-21, 2014: Our presentation was on December 20.) <p><LI Value="56">Yuma Tamura, Takehiro Ito and <font color=#FF0000> Xiao Zhou</font>, <br><STRONG> Deterministic Algorithms for the Independent Feedback Vertex Set Problem, </STRONG><BR> In <I>Proceedings of the 25th International Workshop on Combinatorial Algorithmss</I> (IWOCA 2014), Lecture Notes in Computer Science, Vol. 8986, pp. 351-363, 2015. (Duluth, Minnesota, USA, October 15-17, 2014: Our presentation was on October 17.) <p><LI Value="55">Takehiro Ito, Hiroyuki Nooka and <font color=#FF0000> Xiao Zhou</font>, <br><STRONG> Reconfiguration of Vertex Covers in a Graph, </STRONG><BR> In <I>Proceedings of the 25th International Workshop on Combinatorial Algorithmss</I> (IWOCA 2014), Lecture Notes in Computer Science, Vol. 8986, pp. 164-175, 2015. (Duluth, Minnesota, USA, October 15-17, 2014: Our presentation was on October 15.) <p><LI Value="54">Taku Okada, Akira Suzuki, Takehiro Ito, and <font color=#FF0000> Xiao Zhou</font> <br><STRONG> On the minimum caterpillar problem in digraphs, </STRONG><BR> In <I>Proceedings of the 19th Annual International Computing and Combinatorics Conference</I> (COCOON'13), Lect. Notes in Computer Science, Springer, 7936, pp. 729-736, June 2013. <p><LI Value="53"> Akira Suzuki, Kei Uchizawa and <font color=#FF0000> Xiao Zhou</font> <br><STRONG> Energy-efficient threshold circuits detecting global pattern in 1-dimentional arrays, </STRONG><BR> In <I>Proceedings of the 10th Annual Conference on Theory and Applications of Models of Computation</I> (TAMC'13), Lect. Notes in Computer Science, Springer, 7876, pp. 248-259, May 2013. <P><LI Value="52">Kei Uchizawa, Takanori Aoki, Takehiro Ito and <font color=#FF0000> Xiao Zhou,</font> <br><STRONG> Generalized Rainbow Connectivity of Graphs, </STRONG><BR> In <I>Proc. of the 7th International Workshop on Algorithms and Computatio </I> (WALCOM'13), Lect. Notes in Computer Science, Springer, 7748, pp. 233-244, Feb., 2013 <P><LI Value="51">Kei Uchizawa, Zhenghong Wang, Hiroki Morizumi and <font color=#FF0000> Xiao Zhou,</font> <br><STRONG> Complexity of counting output patterns of logic circuits, </STRONG><BR> In <I>Proc. of the 19th edition of Computing: the Australasian Theory Symposium </I> (CATS'13), 141, pp. 37-42, Jan. 2013. <P><LI Value="50">Takehiro Ito, Kazuto Kawamura, Hirotaka Ono and <font color=#FF0000> Xiao Zhou,</font> <br><STRONG> Reconfiguration of list L(2,1)-labelings in a graph, </STRONG><BR> In <I>Proc. of the 23th Annual International Symposium on Algorithms and Computation </I> (ISAAC'12), Lect. Notes in Computer Science, Springer, 7676, pp. 34-43, Dec., 2012 <p><LI Value="49">Yiming Li, Zhiqian Ye and <font color=#FF0000> Xiao Zhou</font> <br><STRONG> Algorithm for cost non-preemptive scheduling of partial k-trees </STRONG><BR> In <I> Proceedings of the 2012 Symposium on Applied and Engineering Mathematics</I> (AEM'12), pp. 233-236, Oct., 2012. <p><LI Value="48">Kazuhide Nishikawa, Takao Nishizeki and <font color=#FF0000> Xiao Zhou</font> <br><STRONG> Algorithms for bandwidth consecutive multicolorings of graphs </STRONG><BR> In <I> Proceedings of FAW-AAIM 2012</I>, Lect. Notes in Computer Science, Springer, 7285, pp. 117-128, 2012. <p><LI Value="47">Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki, and <font color=#FF0000> Xiao Zhou</font> <br><STRONG> On the rainbow connectivity of graphs: complexity and FPT algorithms </STRONG><BR> In <I>Proceedings of the 17th Annual International Computing and Combinatorics Conference</I> (COCOON'11), Lect. Notes in Computer Science, Springer, 6842, pp. 86-97, 2011. <p><LI Value="46"> Akira Suzuki, Kei Uchizawa and <font color=#FF0000> Xiao Zhou</font> <br><STRONG> Energy and fan-in of threshold circuits computing Mod functions </STRONG><BR> In <I>Proceedings of the 8th Annual Conference on Theory and Applications of Models of Computation</I> (TAMC'11), Lect. Notes in Computer Science, Springer, 6648, pp. 154-163, 2011. <p><LI Value="45"> Akira Suzuki, Kei Uchizawa and <font color=#FF0000> Xiao Zhou</font> <br><STRONG> Energy-efficient threshold circuits computing MOD functions </STRONG><BR> In <I>Proc. Proceedings of the 17th Computing: the Australasian Theory Symposium </I> (CATS'11), CRIPT Series, CRIPT, 119, 105-110, 2011. <p><LI Value="44">Takehiro Ito, Takuya Hara, <font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki<br><STRONG> Minimum cost partitions of trees with supply and demand </STRONG><BR> In <I>Proc. of the 21th Annual International Symposium on Algorithms and Computation </I> (ISAAC'10), Lect. Notes in Computer Science, Springer, 6507, pp. 351-362, 2010. <P><LI Value="43">Takehiro Ito, Naoki Sakamoto, <font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki <br><STRONG> Minimum cost edge-colorings of trees can be reduced to matchings </STRONG><BR> In <I>Proc. of the 4th International Frontiers of Algorithmics Workshop</I> (FAW 2010), Lect. Notes in Computer Science, Springer, 6213, pp. 274-284, 2010. <P><LI Value="42"><font color=#FF0000> Xiao Zhou</font>, Takashi Hikino and Takao Nishizeki <br><STRONG> Grid drawings of planar graphs with balanced bipartition </STRONG><BR> In <I>Proc. of the 4th Workshop on Algorithms and Computation </I> (WALCOM'10), Lect. Notes in Computer Science, Springer, 5942, pp. 47-57, 2010. <P><LI Value="41"><font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki <br><STRONG> Convex drawings of internally triconnected plane graphs on O(n^2) grids </STRONG><BR> In <I>Proc. of the 20th Annual International Symposium on Algorithms and Computation </I> (ISAAC'09), Lect. Notes in Computer Science, Springer, 5878, pp. 760-770, 2009. <P><LI Value="40">Takehiro Ito, Takeaki Uno, <font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki <br><STRONG> Partitioning a weighted tree to subtrees of almost uniform size </STRONG><BR> In <I>Proc. of the 19th Annual International Symposium on Algorithms and Computation </I> (ISAAC'08), Lect. Notes in Computer Science, Springer, 5369, pp. 196-207, 2008. <P><LI Value="39">Takehiro Ito, Erik Demaine, <font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki<br><STRONG> Approximability of partition graphs with supply and demand </STRONG><BR> In <I>Proc. of the 17th Annual International Symposium on Algorithms and Computation </I> (ISAAC'06), Lect. Notes in Computer Science, Springer, 4288, pp. 121-130, 2006. <P><LI Value="38">Takehiro Ito, Kazuya Goto, <font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki<br><STRONG> Partitioning a multi-weighted graph to connected subgraphs of almost uniform size </STRONG><BR> In <I> Proc. of the 12th International Conference on Computing and Combinatorics</I> (COCOON'06), Lect. Notes in Computer Science, Springer, 4112, pp. 63-72, 2006 <P><LI Value="37">Yuki Matsuo, <font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki<br><STRONG> Sufficient condition and algorithm for list total colorings of series-parallel graphs </STRONG><BR>In <I>Proc. of the 9th Japan-Korea workshop on Algorithms and Computation</I> (WAAC'06), pp. 49-56, 2006 <P><LI Value="36"><font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki<br><STRONG> Orthogonal drawings of series-parallel graphs with minimum bends</STRONG><BR> In <I>Proc. of the 16th Annual International Symposium on Algorithms and Computation</I> (ISAAC'05), Lect. Notes in Computer Science, Springer, 3827, pp.~166-175, 2005 <P><LI Value="35">Takehiro Ito, Akira Kato, <font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki<br><STRONG> Algorithms for finding distance-edge-colorings of graphs</STRONG><BR> In <I> Proc. of the 11th International Conference on Computing and Combinatorics</I> (COCOON'05), Lect. Notes in Computer Science, Springer, 3595, pp.~798-807, 2005 <P><LI Value="34">Takehiro Ito, <font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki<br><STRONG>Algorithm for partitioning graphs of bounded tree-width of supply and demand</STRONG><BR> In <I>Proc. of the 4th Japanese-Hungarian Symposium on Discrete Mathematics and its Applications</I> (JH'05), pp.~114-121, 2005 <P><LI Value="33">Takehiro Ito, <font color=#FF0000> Xiao Zhou</font>, and Takao Nishizeki <br><STRONG>Partitioning graphs of supply and demand</STRONG><BR>In <I> Proc. of ISCAS 2005</I>, pp.160-163, 2005. <P><LI Value="32">Zhengbing Bian, Qianping Gu and <font color=#FF0000> Xiao Zhou</font> <br><STRONG>Tight Bounds for Wavelength Assignment on Trees of Rings</STRONG>In <I> Proc. of the 19th International Parallel and Distributed Processing Symposium} (IPDPS'05)</I>, CD-ROM, 2005. <P><LI Value="31">Z. Bian, Q. Gu and<font color=#FF0000> Xiao Zhou</font><br><STRONG>Wavelength assignment on bounded degree trees of rings</STRONG><BR>In <I> Proc. of the 10th International Conference on Parallel and Distributed Systems</I>, pp.73-80, 2004 <P><LI Value="30">Takehiro Ito, <font color=#FF0000> Xiao Zhou</font>, and Takao Nishizeki <br><STRONG>Partitioning a weighted graph to connected subgraphs of almost uniform size</STRONG><BR>In <I> Proc. of WG 2004</I>, Lecture Notes in Computer Science, 3353, pp.365-376, 2004 <P><LI Value="29"><font color=#FF0000> Xiao Zhou</font>,Yuki Matsuo and Takao Nishizeki<br><STRONG>List total colorings of series-parallel graphs</STRONG><BR>In <I>Proc. of COCOON 2003</I>, Lect. Notes in Comp. Sci., Springer-verlag, 2697, pp. 172-181, 2003 <P><LI Value="28"><font color=#FF0000> Xiao Zhou</font>,Yuki Matsuo and Takao Nishizeki<br><STRONG>Complexity and algorithm of list total colorings of series-parallel graphs</STRONG><BR>In <I>Proc. of the 7th Japan-Korea workshop on Algorithms and Computation</I>,189-202, 2003 <P><LI Value="27">Tomoya Fujino,<font color=#FF0000> Xiao Zhou</font>and Takao Nishizeki<br><STRONG>List edge-colorings of series-parallel graphs</STRONG><BR>In <I>Proc. of the 3rd Japanese-Hungarian Symposiumon Discrete Mathematics and Its Applications</I>,154-163, 2003 <P><LI Value="26">Takehiro Ito,<font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki<br><STRONG>Partitioning trees of supply and demand </STRONG><BR>In <I>Proc. of the 13th Annual International Symposium on Algorithms and Computation, </I>ISAAC'2002</A><I>Lect. Notes in Computer Science, Springer,</I>2518, pp.612-623, 2002. <P><LI Value="25">Takehiro Ito, Takao Nishizeki and <font color=#FF0000> Xiao Zhou</font><br><STRONG>Algorithm for the multicolorings of partial k-trees</STRONG><BR>In <I>Proc. of the 8th Annual International Conference on Computing and Combinatorics, </I>COCOON'2002</A><I>Lect. Notes in Computer Science, Springer,</I>2387, pp.430-439, 2002. <P><LI Value="24"><font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki<br><STRONG>Efficient algorithm for weighted colorings of series-parallel graphs</STRONG><BR>In <I>Proc. of the 12th Annual International Symposium on Algorithms and Computation, </I>ISAAC'2001</A><I>Lect. Notes in Computer Science, Springer,</I>2223, pp.514-524, 2001. <P><LI Value="23"><font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki<br><STRONG>Algorithm for the cost edge-coloring of trees</STRONG><BR>In <I>Proc. of the 7th Annual International Conference on Computing and Combinatorics, </I>COCOON'2001</A><I>Lect. Notes in Computer Science, Springer,</I>2108, pp.288-297, 2001. <P><LI Value="22">Shuji Isobe, <font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki<br><STRONG>Total colorings of degenerated graphs,</STRONG><BR>In <I>Proc. of the 28th International Colloquiumon Automata, Languages and Programming,Lect. Notes in Computer Science, Springer,</I>2076,506-517, 2001 <P><LI Value="21"><font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki<br><STRONG>Finding independent spanning trees in partial <I>k</I>-trees,</STRONG><BR>In <I>Proc. of the 11th International Symposiumon Algorithms and Computation,Lect. Notes in Computer Science, Springer,</I>1969,168-179,2000 <P><LI Value="20">Shuji Isobe, <font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki<br><STRONG>A linear algorithm for finding total colorings of partial <I>k</I>-trees,</STRONG><BR>In <I>Proc. of the 10th International Symposiumon Algorithms and Computation,Lect. Notes in Computer Science, Springer,</I>1741,347-356,1999 <P><LI Value="19">Takao Nishizeki, Jens Vygen and <font color=#FF0000> Xiao Zhou</font><br><STRONG>The edge-disjoint paths problem is NP-complete for series-parallel graphs</STRONG><BR>In <I>Proc. of the First Japanese-Hungarian Symposiumon Discrete Mathematics and Its Applications</I>,103-110,1999 <P><LI Value="18">Md. Abul Kashem, <font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki<br><STRONG>Algorithms for generalized edge-rankings of partial <I>k</I>-trees</STRONG><BR>In <I>Proc. of the First International Conference on Computer and Information Technology</I>,45-51, 1998 <P><LI Value="17"><font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki<br><STRONG>The edge-disjoint paths problem is NP- complete for partial <I>k</I>-trees</STRONG><BR>In <I>Proc. of the Sixth Annual International Symposiumon Algorithms and Computing, <A HREF=http://jupiter.kaist.ac.kr/~isaac98/>ISAAC'98,</A>Lect. Notes in Computer Science, Springer,</I>1533,417-426, 1998 <P><LI Value="16">Shuji Isobe, <font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki<br><STRONG>A polynomial-time algorithm for finding total colorings of partial <I>k</I>-trees</STRONG><BR>In <I>Proc. of the 24th International Workshop, Graph-Theoretic Concepts in Computer Science,<A HREF=http://ifi.savba.sk/wg98/>WG'98, </A>Lect. Notes in Computer Science, Springer,</I>1517, pp.100-113,1998 <P><LI Value="15">Md. Abul Kashem, <font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki<br><STRONG>An NC parallel algorithm for generalized vertex-rankings of partial <I>k</I>-trees</STRONG><BR>In <I>Proc. of the International Symposium on Parallel Architectures,Algorithms and Networks (I-SPAN'97), </I>pp.105-111, 1997. <P><LI Value="14">Md. Abul Kashem, <font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki<br><STRONG>Generalized vertex- rankings of partial <I>k</I>-trees</STRONG><BR>In <I>Proc. of the Third Annual International Conference on Computing and Combinatorics, </A>Lect. Notes in Computer Science, Springer,</I>1276, pp.212-221, 1997. <P><LI Value="13"><font color=#FF0000> Xiao Zhou,</font> Md. Abul Kashem and Takao Nishizeki<br><STRONG>Generalized edge- rankings of trees</STRONG><BR>In <I>Proc. of the 22nd International Workshop, Graph-Theoretic Concepts in Computer Science,WG'96,Lect. Notes in Computer Science, Springer,</I>1197, 309-404, 1997 <P><LI Value="12"><font color=#FF0000> Xiao Zhou,</font> Syurei Tamura and Takao Nishizeki<br><STRONG>Finding edge-disjoint paths in partial <I>k</I>-trees</STRONG><BR>In <I>Proc. of the Sixth Annual International Symposiumon Algorithms and Computing,Lect. Notes in Computer Science, Springer,</I>1178, 203-212, 1996 <P><LI Value="11"><font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki<br><STRONG>Algorithms for finding <I>f</I>-colorings of partial <I>k</I>-trees</STRONG><BR>In <I>Proc. of the Sixth Annual International Symposiumon Algorithms and Computing,</I><A href="http://wwwcs.newcastle.edu.au/ISAAC/" >ISAAC'95</A><I>Lect. Notes in Computer Science, Springer,</I>1004, 332-341, 1995 <P><LI Value="10"><font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki<br><STRONG>Simple reduction of <I>f</I>-colorings to edge-colorings</STRONG><BR>In <I>Proc. of the First Annual International Conference on Computing and Combinatorics, </I><A href="http://www.math.uwaterloo.ca/~mli/cocoon.html" >COCOON'95</A><I>Lect. Notes in Computer Science, Springer,</I>959, pp.223-228, 1995. <P><LI Value="9"><font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki<br><STRONG>Finding optimal edge-rankings of trees.</STRONG><BR>In <I>Proc. of the Sixth Annual ACM/SIAM Symposium on Discrete Algorithm,</I>pp.122-131, 1995. <P><LI Value="8"><font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki<br><STRONG>Finding optimal edge-rankings of trees.</STRONG><BR> In <I>Proc. of JSPS-NUS Seminar on Computing</I>, (eds) H. Imai, W.F. Wong, K.F. Loe, "Advances in Computing Techniques", World Scientific, pp. 23-35, 1994 <P><LI Value="7"><font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki<br><STRONG>Optimal parallel algorithm for edge- coloring partial <I>k</I>-trees with bounded degrees.</STRONG><BR>In <I>Proc. of the International Symposium on Parallel Architectures,Algorithms and Networks, </I>pp.167-174, 1994. <P><LI Value="6"><font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki<br><STRONG>An efficient algorithm for edge-ranking trees.</STRONG><BR>In <I>Proc. of the Second Europian Symposium on Algorithms,Lect. Notes in Computer Science, Springer-Verlag,</I>855, pp.118-129, 1994. <P><LI Value="5"><font color=#FF0000> Xiao Zhou</font> and Takao Nishizeki<br><STRONG>Edge-coloring and <I>f</I>-coloring for various classes of graphs.</STRONG><BR>In <I>Proc. of the Fifth International Symposium on Algorithms and Computation,Lect. Notes in Computer Science, Springer-Verlag,</I>834, pp.199-207, 1994. <P><LI Value="4"><font color=#FF0000> Xiao Zhou,</font> Shin-ichi Nakano and Takao Nishizeki<br><STRONG>A parallel algorithm for edge-coloring partial <I>k</I>-trees.</STRONG><BR>In <I>Proc. of the Fourth Scandianavian Workshop on Algorithm Theory,Lect. Notes in Computer Science, Springer-Verlag,</I>824, pp.359-369, 1994. <P><LI Value="3"><font color=#FF0000> Xiao Zhou,</font> Shin-ichi Nakano, Hitoshi Suzuki and Takao Nishizeki<br><STRONG>A linear algorithm for edge-coloring partial <I>k</I>-trees.</STRONG><BR>In <I>Proc. of the First Europian Symposium on Algorithms,Lect. Notes in Computer Science, Springer-Verlag,</I>726, pp.409-418, 1993. <BR>(It received the <A href="/nszk/zhou/Gif/Award2.gif"><B>Best Paper Award</B></A>.) <P><LI Value="2"><font color=#FF0000> Xiao Zhou,</font> Hitoshi Suzuki and Takao Nishizeki<br><STRONG>Sequential and parallel algorithms for edge-coloring series-parallelmultigraphs.</STRONG><BR>In <I>Proc. of the Third Conference on Integer Programming and CombinatorialOptimiation, </I>pp.129-145, 1993. <P><LI Value="1"><font color=#FF0000> Xiao Zhou,</font> Shin-ichi Nakano, Hitoshi Suzuki and Takao Nishizeki<br><STRONG>An efficient algorithm for edge-coloring series-parallel multigraphs.</STRONG><BR>In <I>Proc. of LATIN'92, I. Simon (Ed.), Lect. Notes in Computer Science,Springer-Verlag, </I>583, pp.516-529, 1992. </OL> <FONT SIZE=2><P ALIGN="RIGHT"><A HREF="#top">Return to the top</A> <HR> <H2>Other Writing:</H2> <OL> <P><LI Value="3">Haruka Mizuta, Takehiro Ito and <font color=#FF0000> Xiao Zhou</font>, <br><STRONG> Reachability between Steiner Trees in a Graph, </STRONG><BR><I> In Proceedings of the 9th Annual Meeting of Asian Association for Algorithms and Computation</I> (AAAC 2016), Session B1, 2016. <BR> (Taipei, Taiwan, May 14-16, 2016: Our presentation was on May 15 <P><LI Value="2"><font color=#FF0000> Xiao Zhou</font>, and Takao Nishizeki <br><STRONG>Graph Coloring Algorithms</STRONG><BR><I>IEICE Trans. on Information and Systems</I>, <STRONG>E83-D</STRONG>(2000), pp. 407-417 <P><LI Value="1">Shin-ichi Nakano, <font color=#FF0000> Xiao Zhou</font> and T.Nishizeki<br><STRONG>Edge-Coloring Algorithms</STRONG><BR><I>Lect. Notes in Computer Science, Springer-Verlag, Special issue,</I><STRONG>1000</STRONG> (1995), pp.172-183 </OL> <FONT SIZE=2><P ALIGN="RIGHT"><A HREF="#top">Return to the top</A> <HR> </H2> </BODY> </HTML>