Journal Publications:
Algorithms for core stability, core largeness, exactness, and extendability of flow games. Qizhi Fang, R. Fleischer, Jian Li, and Xiaoxun Sun. To appear in Frontier of Math in China, 2009. (This journal paper combines this paper and our cocoon07 paper. We fixed some bugs. Now, the thms and pfs should be correct.)
An $O({logn\over loglogn})$ Upper Bound on the Price of Stability for Undirected Shapley Network Design Games. Jian Li.In Information Processing Letter (IPL). 2009.
More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding. Mordecai Golin, Jian Li. In IEEE Transactions on Information Theory, Volume 54, Issue 8, Aug. Page(s):3412 - 3424, 2008
Refereed Conference Publications:
On Computing Compression Trees for Data Collection in Sensor Networks. Jian Li, Amol Deshpande and Samir Khuller. To appear in the 29th Conference on Computer Communications (INFOCOM 2010), San Diego, USA, 2010 [full version in arXiv]
Energy Efficient Scheduling for Data Centers via Partial Shutdown. Samir Khuller, Jian Li, Barna Saha. To appear in the ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), Austin, USA , 2010.
A Unified Approach to Ranking in Probabilistic Databases. Jian Li, Barna Saha and Amol Deshpande. In the 35th International Conference on Very Large Data Bases (VLDB 2009), Lyon, France, 2009. (Best Paper Award) [full version in arXiv] [slides long short]
Consensus Answers for Queries over Probabilistic Databases. Jian Li and Amol Deshpande. In the 28th ACM Symposium on Principles of Database Systems (PODS 2009). Providence, USA, 2009 [slides]
Minimizing communication cost in distributed multi-query processing. Jian Li, Amol Deshpande and Samir Khuller. In International Conference on Data Engineering (ICDE2009), Shanghai, China, 2009 [slides]
More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding. Mordecai Golin, Jian Li. In Proceedings of the 18th International Symposium on Algorithms and Computation (ISAAC 2007), Sendai, Japan, 2007.
Approximating the Maximum Sharing Problem. Amitabh Chaudhary, Danny Z. Chen, Rudolf Fleischer, Jian Li, Xiaobo S. Hu, Michael T. Niemier, Zhiyi Xie, Hong Zhu. In Proceedings of 10th Workshop on Algorithms and Data Structures(WADS 2007) Halifax, Canada, August 15-17, 2007 .
Algorithms for core stability, core largeness, exactness, and extendability of flow games. Qizhi Fang, R. Fleischer, Jian Li, and Xiaoxun Sun. In Proceedings of the 13th Annual International Computing and Combinatorics Conference (COCOON 2007), Banff, Canada, July 16-19, 2007.
Efficient Algorithms for $k$-Disjoint Paths Problems on DAGs. Rudolf Fleischer, Qi Ge, Jian Li, Hong Zhu. In Proceedings of the 3nd International Symposium on Algorithmic Aspects in Information and Management (AAIM 2007), Portland, USA, 2007.
On approximating the maximum simple sharing problem. Danny Z. Chen, R. Fleischer, Jian Li, Zhiyi Xie, and Hong Zhu. In Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC 2006), Kolkata, December 18-20, 2006.
Traversing the machining graph". Danny Z. Chen, R. Fleischer, Jian Li, Haitao Wang, and Hong Zhu. In Proceedings of the 14th Annual International Symposium on Algorithms (ESA 2006), Zurich, Switzerland, Sep 11-13, 2006. Springer LNCS. [full version]
Non-metric multicommodity and multilevel facility location. R. Fleischer, Jian Li, Shijun Tian, and Hong Zhu. In Proceedings of the 2nd International Symposium on Algorithmic Aspects in Information and Management (AAIM 2006), Hong Kong, Jun 20-22, 2006. Springer LNCS 4041, 2006, pp. 138-148.
Approximating spanning trees with inner nodes cost. R. Fleischer, Qi Ge, Jian Li, Shijun Tian, and Haitao Wang. In Proceedings of the 6th International Conference on Parallel and Distributed Computing (PDCAT 2005), Dalian, China, Dec 5-8, 2005, pp. 600-664. [full version]
Some Chinese Papers:
最大简单共享问题的快速近似算法[doc]. 李建,张韬,谢之易,朱洪. 软件学报，2007 (english draft)
关于吹雪机问题的改进近似算法[doc].
李建,王海涛,朱洪.2006年全国理论计算机科学学术年会.
吉林大学学报（工学版）2007年第1期.
多目标需求的设备选址问题的近似算法[doc].
田世俊,李建,朱洪.计算机科学,2005.
内点带权生成树近似算[doc].
王海涛,李建,朱洪.计算机科学
2005.
Under Preparation/Submitted:
Clustering with Diversity. Jian Li, Ke Yi, Qin Zhang.
Improved bounds for stochastic matching. Jian Li, Julian Mestre.
Densest $k$-Subgraph Approximation on Intersection Graphs. Danny Z. Chen, Rudolf Fleischer, Jian Li.
The load-distance balancing problem. Edward Bortnikov, Samir Khuller, Jian Li, Yishay Mansour and Seffi Naor. Journal submission of this paper
Manuscripts
2008.6 Notes On the Peer-to-Peer Data Dissemination Problem
2006.9 an $O(n\loglogn)$ algorithm for 3 letter maximum increasing common sequence problem
2005.6 Graph Theoretical Analysis for Small Components of Complex Network : A Survey
2003.6 数学模型论文-乒乓球赛11分赛制的讨论[doc]
Some Slides of my talks.
2007.9 More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding (CATS talk at UMD)
2007.5 Introdution to prize of stability (at Fudan)
2007.3 Densest k-Subgraph Approximation on Interval Graphs, Chordal Graphs and Planar Graphs (at HKUST)
2007.1 Core Stability of simple flow game (at Fudan)
2006.12 Approximating maximum simple sharing problem (In Taj Bengal Hotel, Kolkata, ISAAC06)
2006.10 Traverse machining graph (at HKUST)
2006.6 Multicommodity and multilevel facility location (at CUHK, AAIM06)
2006.Spring Seminar on Graph Theory and Algorithms (at Fudan)
[lecture 1: tree and extensions] [lecture 2: matching and extensions] [lecture 3: coloring and extensions]
2006.5 A Beginner in Parameterized Complexity
2005.9 triangle partition problem
2005.9 Interval packing problem & Multicommodity demand flow in a line
2005,6 Network Motifs: Simple Building Blocks of Complex Network
My Bachelor Thesis
2004.6 我的毕业论文-东江流域水资源优化配置[doc]