Email: feierustc at gmail.com / feichen at kth.se 

I am a postdoc working with Danupon Nanongkai at KTH Royal Institute of Technology, Sweden. I finished my PhD in August 2014 at the University of Hong Kong under the supervision of Hubert Chan, with whom I worked as a postdoc from September 2014 to July 2015. I received my BEng degree from University of Science and Technology of China (USTC) in 2010. 

Research Interests

Algorithms

Thesis

  • Linear Programming Techniques for Algorithms with Applications in Economics. (pdf)
    The University of Hong Kong, 2014.

Publications

  • Beating Ratio 0.5 for Weighted Oblivious Matching Problems. (pdf)
    Melika Abolhassani, T-H. Hubert Chan, Fei Chen, Hossein Esfandiari, Mohammadtaghi Hajiaghayi, Hamid Mahini and Xiaowei Wu. In ESA 2016.
  • Revealing Optimal Thresholds for Generalized Secretary Problem via Continuous LP: Impacts on Online K-Item Auction and Bipartite K-Matching with Random Arrival Order. (pdf, omitted proofs for the secretary problem can be found here)
    T-H. Hubert Chan, Fei Chen and Shaofeng H.-C. Jiang. In SODA 2015.


  • Perfect Pipelining for Streaming Large File in Peer-to-peer Networks. (pdf)
    Fei Chen and Xiaowei Wu. In TCS 2014.

  • Ranking on Arbitrary Graphs: Rematch via Continuous LP with Monotone and Boundary Condition Constraints. (pdf)
    T-H. Hubert Chan, Fei Chen, Xiaowei Wu and Zhichao Zhao. In SODA 2014.

  • Optimizing Social Welfare for Network Bargaining Games in the Face of Unstability, Greed and Spite. (pdf)
    T-H. Hubert Chan, Fei Chen and Li Ning. In ESA 2012.

Teaching

  • Teaching assistant for Discrete Mathematics (CSIS1118 Spring 2011, CSIS1118/COMP2121 Spring 2013, CSIS1118/COMP2121 Fall 2013).
  • Teaching assistant for Randomized Algorithms/Advanced Algorithm Analysis (CSIS0351/CSIS8601 Fall 2011, COMP8601 Fall 2013).