| 2011 |
|---|
| 10 | Path-tree: An efficient reachability indexing scheme for large directed graphs. Ruoming Jin, Ning Ruan, Yang Xiang, Haixun Wang. ACM Trans. Database Syst. (36): 7 (2011). Web SearchBibTeXDownload |
| 9 | Distance Preserving Graph Simplification. Ning Ruan, Ruoming Jin, Yan Huang. CoRR (abs/1110.0517) (2011). Web SearchBibTeXDownload |
| 2010 |
|---|
| 8 | Solutions to quadratic minimization problems with box and integer constraints. David Yang Gao, Ning Ruan. J. Global Optimization (47): 463-484 (2010). Web SearchBibTeXDownload |
| 7 | A Survey of Algorithms for Dense Subgraph Discovery. Victor E. Lee, Ning Ruan, Ruoming Jin, Charu C. Aggarwal. Managing and Mining Graph Data 2010, 303-336. Web SearchBibTeXDownload |
| 6 | Computing label-constraint reachability in graph databases. Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yang Xiang. SIGMOD Conference 2010, 123-134. Web SearchBibTeXDownload |
| 2009 |
|---|
| 5 | A Sparsification Approach for Temporal Graphical Model Decomposition. Ning Ruan, Ruoming Jin, Victor E. Lee, Kun Huang. ICDM 2009, 447-456. Web SearchBibTeXDownload |
| 4 | Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality. David Yang Gao, Ning Ruan, Hanif D. Sherali. J. Global Optimization (45): 473-497 (2009). Web SearchBibTeXDownload |
| 3 | 3-HOP: a high-compression indexing scheme for reachability query. Ruoming Jin, Yang Xiang, Ning Ruan, David Fuhry. SIGMOD Conference 2009, 813-826. Web SearchBibTeXDownload |
| 2008 |
|---|
| 2 | Effective and efficient itemset pattern summarization: regression-based approaches. Ruoming Jin, Muad Abu-Ata, Yang Xiang, Ning Ruan. KDD 2008, 399-407. Web SearchBibTeXDownload |
| 1 | Efficiently answering reachability queries on very large directed graphs. Ruoming Jin, Yang Xiang, Ning Ruan, Haixun Wang. SIGMOD Conference 2008, 595-608. Web SearchBibTeXDownload |
