Research Interests

My research interests are in the mathematical theory behind large real-world networks, including social networks, information networks and the World Wide Web. As such, my interests span mathematical and algorithmic problems in areas such as network routing and partitioning, spectral graph theory, random walks, and PageRank. Also, my research also concerns algorithmic and complexity issues of combinatorial optimization problems arising from computer-aid design.
I am currently a fifth-year Ph.D. student in the Department of Computer Science and Engineering at UCSD. My advisor is Prof. Fan Chung Graham.

Publications

  • Improved distributed multicommodity maximum flow. under review.
        (Work with Fan Chung and Stephen Young)

  • Braess paradox in expanders. under review.
        (Work with Fan Chung and Stephen Young)

  • Character design and stamp algorithms for character projection electron-beam lithography. ASP-DAC 2012, in press.
        (Work with Peng Du, Shih-Hung Weng, and Chung-Kuan Cheng)

  • Routing for power minimization in the speed scaling model. Tran. Network, in press.
        (Work with Matthew Andrews, Antonio Fernandez Anta, Lisa Zhang)

  • Approximation and hardness results for label cut and related problems. J. Comb. Optim. 21(2): 192-208 (2011).
        (Work with Peng Zhang and Jin-Yi Cai)

  • A sharp PageRank algorithm with applications to edge ranking and graph sparsification. WAW 2010, pp. 2-14.
        (Work with Fan Chung)

  • Routing and scheduling for energy and delay minimization in the powerdown model. INFOCOM 2010, pp. 2435-2443.
        (Work with Matthew Andrews, Antonio Fernandez Anta and Lisa Zhang)

  • Routing for energy minimization in the speed scaling model. INFOCOM 2010, pp. 21-25.
        (Work with Matthew Andrews, Antonio Fernandez Anta and Lisa Zhang)

  • An adaptive parallel flow for power distribution network simulation using discrete fourier transform. ASP-DAC 2010, pp. 125-130.
        (Work with Xiang Hu and Chung-Kuan Cheng)

  • Clustering with feature order preferences. Intell. Data Anal. 14(4): 479-495 (2010).
        (Work with Jun Sun, Jiangwei Xue, Zhiyong Shen, and Yi-Dong Shen)

  • PageRank and random walks on graphs. Bolyai Society Math. Stud. 20: 43-62, (2010).
        (Work with Fan Chung)

  • On the bound of time-domain power supply noise based on frequency-domain target impedance. SLIP 2009, pp. 69-76.
        (Work with Xiang Hu, Peng Du, Yulei Zhang, Amirali Shayan Arani, Christopher Pan, A. Ege Engin, and Chung-Kuan Cheng.)

  • Approximation and hardness results for the label cuts and related problems. TAMC 2009, pp. 460-469.
        (Work with Peng Zhang and Jin-Yi Cai)

  • Clustering with feature order preferences. PRICAI 2008, pp. 382-393 (Best Student Paper Award).
        (Work with Jun Sun, Jiangwei Xue, Zhiyong Shen, and Yidong Shen)

  • Analysis of greedy approximations with nonsubmodular potential functions. SODA 2008, pp. 167-175.
        (Work with Ding-Zhu Du, Ronald L. Graham, Panos M. Pardalos, Pengjun Wan, and Weilin Wu)

  • On the complexity and approximation of the min-sum and min-max disjoint paths problems. ESCAPE 2007, pp. 70-81.
        (Work with Peng Zhang)

  • Computational complexity of counting problems on 3-regular planar graphs. Theor. Comput. Sci. 384(1): 111-125, (2007).
        (Work with Mingji Xia and Peng Zhang)

  • A network flow approach to the minimum common integer partition problem. Theor. Comput. Sci. 369(1-3), 456-462, (2006).
        (Work with Peng Zhang and Tao Jiang)

  • #3-regular bipartite planar vertex cover is #P-complete. TAMC 2006, pp. 356-364.
        (Work with Mingji Xia)


  • Website templates