index.xml

<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Daydreaming...</title>
    <link>https://terry182.github.io/</link>
    <description>Recent content on Daydreaming...</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en-us</language>
    <copyright>This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.</copyright><atom:link href="https://terry182.github.io/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>About</title>
      <link>https://terry182.github.io/about-me/</link>
      <pubDate>Tue, 16 Jul 2019 09:34:53 +0200</pubDate>
      
      <guid>https://terry182.github.io/about-me/</guid>
      <description>Greetings, I am Hou Teng Cheong. I received my B.S.E. in Electrical Engineering from NTU in 2018.
My research interest includes algorithm design, computational complexity and graph theory. Recently my research focus on hole detecting algorithms.
I am now in suspension of my master program.
  Publications   Finding a Shortest Even Hole in Polynomial Time
Hou-Teng Cheong, Hsueh-I Lu
J. Graph Theory, 2022; Volume 99:425-434</description>
    </item>
    
  </channel>
</rss>