 | 2008 |
|---|
| 12 |       | Jinsong Tan:
Inapproximability of Maximum Weighted Edge Biclique and Its Applications.
TAMC 2008: 282-293 |
| 11 | | Michael Kearns,
Jinsong Tan:
Biased Voting and the Democratic Primary Problem.
WINE 2008: 639-652 |
| 10 | | Jinsong Tan:
A note on the inapproximability of correlation clustering.
Inf. Process. Lett. 108(5): 331-335 (2008) |
| 2007 |
|---|
| 9 | | Michael Kearns,
Jinsong Tan,
Jennifer Wortman:
Privacy-Preserving Belief Propagation and Sampling.
NIPS 2007 |
| 8 | | Kuzman Ganchev,
Alex Kulesza,
Jinsong Tan,
Ryan Gabbard,
Qian Liu,
Michael Kearns:
Empirical Price Modeling for Sponsored Search.
WINE 2007: 541-548 |
| 7 | | Jinsong Tan,
Kok Seng Chua,
Louxin Zhang,
Song Zhu:
Algorithmic and Complexity Issues of Three Clustering Methods in Microarray Data Analysis.
Algorithmica 48(2): 203-219 (2007) |
| 6 | | Jinsong Tan,
Louxin Zhang:
The Consecutive Ones Submatrix Problem for Sparse Matrices.
Algorithmica 48(3): 287-299 (2007) |
| 5 | | Jinsong Tan:
Inapproximability of Maximum Weighted Edge Biclique via Randomized Reduction and Its Applications
CoRR abs/0704.0468: (2007) |
| 4 | | Jinsong Tan:
A Note on the Inapproximability of Correlation Clustering
CoRR abs/0704.2092: (2007) |
| 2005 |
|---|
| 3 | | Jinsong Tan,
Kok Seng Chua,
Louxin Zhang:
Algorithmic and Complexity Issues of Three Clustering Methods in Microarray Data Analysis.
COCOON 2005: 74-83 |
| 2004 |
|---|
| 2 | | Jinsong Tan,
Louxin Zhang:
Approximation Algorithms for the Consecutive Ones Submatrix Problem on Sparse Matrices.
ISAAC 2004: 835-846 |
| 2003 |
|---|
| 1 | | Jinsong Tan:
On Cheeger inequalities of a graph.
Discrete Mathematics 269(1-3): 315-323 (2003) |
