<?xml version="1.0"?>
<dblp>
<article key="journals/jcss/ChenKPSX07" mdate="2007-09-21">
<author>Jianer Chen</author>
<author>Iyad A. Kanj</author>
<author>Ljubomir Perkovic</author>
<author>Eric Sedgwick</author>
<author>Ge Xia</author>
<title>Genus characterizes the complexity of certain graph problems: Some tight results.</title>
<pages>892-907</pages>
<year>2007</year>
<volume>73</volume>
<journal>J. Comput. Syst. Sci.</journal>
<number>6</number>
<ee>http://dx.doi.org/10.1016/j.jcss.2006.11.001</ee>
<url>db/journals/jcss/jcss73.html#ChenKPSX07</url>
</article>
</dblp>
