Selected Conference Publications

DBLP Page Publications in Reverse Chronological Order

10-Papers   Full List of Publications   Representative Publications   Journal Publications   Proceedings and Journal Issues Edited

Conference Papers

  1. Z. Yang, L. Lai, X. Lin, K. Hao, W. Zhang, HUGE: An Efficient and Scalable Subgraph Enumeration Engine, SIGMOD 2021.

  2. H. Kim, Y. Choi, K. Park, X. Lin, S-H. Hong, W-S. Han, Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching, SIGMOD 2021.

  3. W. Ni, P. Cheng, L. Chen, X. Lin, When the Recursive Diversity Anonymity Meets the Ring Signature, SIGMOD 2021.

  4. Y. Li, S. Yang, M. A. Cheema, Z. Shao, X. Lin, IndoorViz: A Demonstration System for Indoor Spatial Data Management (demo paper), SIGMOD 2021.

  5. Y. Yang, Y. Fang, M. Orlowska, W. Zhang, X. Lin, Efficient Bi-triangle Counting for Large Bipartite Networks, VLDB 2021.

  6. Z. Lin, F. Zhang, X. Lin, W. Zhang, Z. Tian, Hierarchical Core Maintenance on Large Dynamic Graphs, VLDB 2021.

  7. K. Wang, W. Zhang, X. Lin, Y. Zhang, L. Qin, Y. Zhang, Efficient and Effective Community Search on Large-scale Bipartite Graphs, ICDE 2021.

  8. B. Liu, F. Zhang, W. Zhang, X. Lin, Y. Zhang, Efficient Community Search with Size Constraint, ICDE 2021.

  9. X. Chen, L. Lai, L. Qin, X. Lin, B. Liu, A Framework to Quantify Approximate Simulation on Graph Data, ICDE 2021.

  10. M. Yu, L. Qin, Y. Zhang, W. Zhang, X. Lin, DPTL+: Efficient Parallel Triangle Listing on Batch-Dynamic Graphs, ICDE 2021.

  11. Z. Lai, Y. Peng, S. Yang, X. Lin, W. Zhang, PEFP: Efficient k-hop Constrained s-t Simple Path Enumeration on FPGA, ICDE 2021.

  12. Y. Yu, D. Wen, Y. Zhang, X. Wang, W. Zhang, X. Lin, Efficient Matrix Factorization on Heterogeneous CPU-GPU Systems, ICDE 2021.

  13. P. yang, H. Wang, Y. Zhang, L. Qin, W. Zhang, X. Lin, T3S: Effective Representation Learning for Trajectory Similarity Computation, ICDE 2021.

  14. Q. Luo, D. Yu, Z. Cai, X. Lin, X. Cheng, Hypercore Maintenance in Dynamic Hypergraphs, ICDE 2021.
  15. Q. Linhu, F. Zhang, X. LIN, W. Zhang, Y. Zhang, Global Reinforcement of Social Networks: The Anchored Coreness Problem, SIGMOD2020: 2211-2226.

  16. W. Li, M. Qiao, L. Qin, Y. Zhang, L. Chang, X. LIN, Scale Distance Labeling on Graphs with Core-Periphery Properties, SIGMOD2020: 1367-1381.

  17. D. Ouyang, D. Wen, L. Qin, L. Chang, Y. Zhang, X. LIN, Progressive Top-K Nearest Neighbor Search in Large Road Networks, SIGMOD2020: 1781-1795.

  18. C. Ma, Y. Fang, R. Cheng, L. Lakshmanan, W. Zhang, X. LIN, Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs, SIGMOD2020:1051-1066.

  19. B. Lv, L. Qin, X. LIN, Y. Zhang, Z. Qian, J. Zhou, Maximum Biclique Search at Billion Scale, PVLDB 13(9): 1359-1372(VLDB2020).

  20. H. Kim, S. Min, K. Park, X. LIN, S.H. Hong, W.S. Han, IDAR: Fast Supergraph Search Using DAG Integration, PVLDB 13(9): 1456-1468(VLDB2020).

  21. J. Wang, P. Cheng, L. Zheng, C. Feng, L. Chen, X. LIN, Z. Wang, Demand-Aware Route Planning for Shared Mobility Services, PVLDB 13(7): 979-991(VLDB2020).

  22. Y. Fang, Y. Yang, W. Zhang, X. LIN, X. Cao, Effective and Efficient Community Search over Large Heterogeneous Information Networks, PVLDB 13(6): 854-867(VLDB2020).

  23. Y. Peng, Y. Zhang, X. LIN, W. Zhang, L. Qing, Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond, PVLDB 13(6): 812-825(VLDB2020).

  24. Y. Peng, Y. Zhang, X. LIN, W. Zhang, L. Qin, Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice, PVLDB 13(4): 463-476(VLDB2020).

  25. C. Li, F. Zhang, Y. Zhang, L. Qin, W. Zhang, X. LIN, Efficient Progressive Minimum k-core Search, PVLDB 13(3): 362-375(VLDB2020).

  26. B. Yang, D. Wen, L. Qin, Y. Zhang, X. Wang, X. LIN, Fully Dynamic Depth-First Search in Directed Graphs, PVLDB 13(2): 142-154(VLDB2020).

  27. D. Ouyang, L. Yuan, L. Qin, L. Chang, Y. Zhang, X. LIN, Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees, PVLDB 13(5): 602-615(VLDB2020).

  28. J. Yang, W. Zhang, X. Wang, Y. Zhang, X. LIN, Distributed Streaming Set Sim ilarity Join, ICDE2020: 565-576.

  29. L. Chang, X. Feng, X. LIN, L. Qin, W. Zhang, D. Ouyang: Speeding Up GED Verification for Graph Similarity Search. ICDE2020: 793-804.

  30. D. Chu, F. Zhang, X. LIN, W. Zhang, Y. Zhang, Y. Xia, C. Zhang, Finding the Best k in Core Decomposition: A Time and Space Optimal Solution, ICDE2020: 685-696.

  31. K. Wang, X. LIN, L. Qin, W. Zhang, Y. Zhang, Efficient Bitruss Decomposition for Large-scale Bipartite Graphs, ICDE2020: 661-672.

  32. B. Li, R. Cheng, J. Hu, Y. Fang, M. Ou, R. Luo, K. Chang, X. LIN, MC-Explorer: Analyzing and Visualizing Motif-Cliques on Large Networks, ICDE2020: 1722-1725 (Demo)

  33. W. Zeng, X. Zhao, J. Tang, X. LIN, Collective Entity Alignment via Adaptive Features, ICDE2020: 1870-1873 (short paper)

  34. D. Wen, Y. Huang, Y. Zhang, L. Qin, W. Zhang, X. LIN, Efficiently Answering Span-Reachability Queries in Large Temporal Graphs, ICDE2020: 1153-1164.

  35. X. Chen, L. Lai, L. Qin, X. LIN, StructSim: Querying Structural Node Similarity at Billion Scale, ICDE2020: 1950-1953 (short paper).

  36. W. Ni, P. Cheng, L. Chen, X. LIN, Task Allocation in Dependency-aware Spatial Crowdsourcing, ICDE 2020: 985-996.

  37. C. Zhang, F. Zhang, W. Zhang, B. Liu, Y. Zhang, L. Qin, X. LIN, Exploring Finer Granularity within the Cores: Efficient (k, p)-Core Computation, ICDE2020: 181-192.

  38. M. Li, Y. Zhang, Y. Sun, W. Wang, I. W. Tsang, X. LIN, I/O Efficient Approximate Nearest Neighbour Search based on Learned Functions, ICDE2020: 289-300.

  39. Y. Yang, Y. Fang, X. LIN, W. Zhang, Effective and Efficient Truss Computati on over Larger Heterogeneous Information Networks, ICDE2020: 901-912.

  40. Y. Mao, W. Liu, X. LIN, Adaptive Adversarial Multi-task Representation Learning, ICML2020.

  41. H. Wang, D. Lian, Y. Zhang, L. Qin, X. LIN, GoGNN: Graph of Graphs Neural Network for Predicting Structured Entity Interactions, IJCAI 2020.

  42. Z. Chen, L. Yuan, X. LIN, L. Qin, Efficient Maximal Balanced Clique Enumeration in Signed Networks, WWW2020: 339-349.

  43. K. Wang, X. LIN, L. Qin, W. Zhang, Y. Zhang, Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks, VLDB2019.12(10): 1139-1152(2019).

  44. Z. Zhou, F. Zhang, X. LIN, W. Zhang, C. Chen, K-core Maximization: An Edge Addition Approach, IJCAI2019: 4867-4873.

  45. W. Zhu, M. Zhang, C. Chen, X. Wang, F. Zhang, X. LIN, Pivotal Relationship Identification: The K-Truss Minimization Problem, IJCAI2019: 4874-4880.

  46. B. Liu, L. Yuan, X. LIN, W. Zhang, L. Qin, J. Zhou, Efficient (α,β)-Core Computation: an Index-based Approach, WWW2019: 1130-1141.

  47. W. Li, M. Qiao, L. Qin, Y. Zhang, L. Chang, X. LIN, Scaling Distance Labeling on Small-World Networks, SIGMOD 2019: 1060-1077.

  48. X. Qiu, W. Cen, Z. Qian, Y. Peng, Y. Zhang, X. LIN, J. Zhou, Real-time Constrained Cycle Detection in Large Dynamic Graphs, VLDB2018. 11(12): 1876-1888(2018).

  49. F. Bi, L. Chang, X. LIN, W. Zhang, An Optimal and Progressive Approach to Online Search of Importance-based Top-K Communities, VLDB2018. 11(9): 1056-1068(2018).

  50. D. Wen, L. Qin, Y. Zhang, X. LIN, J. Yu, I/O Efficient Core Graph Decomposition: Application to Degeneracy Ordering, TKDE, 31(1): 75-90(2018) (Best Paper Award in ICDE 2016).

  51. D. Ouyang, L. Qin, L. Chang, X. LIN, Y. Zhang, Q. Zhu, When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks, SIGMOD 2018: 709-724.

  52. K. Wang, X. Cao, X. LIN, W. Zhang, L. Qin, Efficient Computing of Radius-Bounded k-Cores, ICDE 2018: 233-244.

  53. Y. Peng, Y. Zhang, W. Zhang, X. LIN, L. Qin, Efficient Probabilistic K-Core Computation on Uncertain Graphs, ICDE2018: 1192-1203.

  54. F. Zhang, Y. Zhang, L. Qin, W. Zhang, X. LIN, Efficient Reinforcing Social Networks over User Engagement and Tie Strength, ICDE2018: 557-568.

  55. J. Qin, Y. Wang, C. Xiao, W. Wang, X. LIN, Y. Ishikawa, GPH: Similarity Search in Hamming Space, ICDE2018: 29-40.

  56. W. Li, M. Qiao, L. Qin, Y. Zhang, L. Chang, X. LIN, Exacting Eccentricity for Small-World Networks, ICDE2018: 785-796.

  57. Q. Zhu, L. Yuan, F. Zhang, L. Qin, X. LIN, W. Zhang, External Topological Sorting in Large Graphs, DASFAA2018: 203-220.

  58. D. Ouyang, L. Yuan, F. Zhang, Q. Lu, X. LIN, Towards Efficient Path Skyline Computation in Bicriteria Networks, DASFAA 2018: 239-254.

  59. M. Li, Y. Zhang, Y. Sun, W. Wang, I. W. Tsang, X. LIN, An Efficient Exact Nearest Neighbor Search by Compounded Embedding, DASFAA 2018: 37-54.

  60. S. Wang, Y. Zhang, X. LIN, M.A. Cheema, Maximize Spatial Influence of Facility Bundle Considering Reverse k Nearest Neighbors, DASFAA 2018: 684-700.

  61. W. Liu, Z. Liu, I. W. Tsang, W. Zhang, X. LIN, Doubly Approximate Nearest Neighbor Approximation, AAAI 2018: 3683-3690.

  62. L. Yuan, L. Qin, X. LIN, L. Chang, W. Zhang, Effective and Efficient Dynamic Graph Coloring, VLDB2018.11(3): 338-351(2018).

  63. D. Wen, L. Qin, L. Chang, Y. Zhang, X. LIN, Efficient Structural Graph Clustering: An Index-Based Approach, VLDB2018.11(3): 243-255(2018).

  64. F. Zhang, Y. Zhang, L. Qin, W. Zhang, X. LIN, When Engagement Meets Similarity: Efficient (k, r)-Core Computation on Social Networks, VLDB2017.10(10): 998-1009(2017).

  65. P. Li, J. Yao, L. Wang, and X. LIN, SPOT: Selecting occuPations frOm Trajectories, SIGIR 2017: 813-816 (Short Paper)

  66. X. Wang, Q. Lu, X. LIN, Y. Zhang, L. Chang, Leveraging Set Relations in Exact Set Similarity Join, VLDB2017.10(9): 925-936(2017).

  67. Z. Huang, X. LIN, W. Zhang, Y. Zhang, Efficient Matrix Sketching over Distributed Data, Proc. ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS2017): 347-359.

  68. J. Yang, W. Zhang, Y. Zhang, X. LIN, TT-Join: Efficient Set Containment Join, ICDE2017: 509-520.

  69. L. Chang, C. Zhang, X. LIN, L. Qin Scalable Top-K Structural Diversity Search Short Paper, Proceedings of the 32st International Conference on Data Engineering (ICDE2017), 95-98(2017).

  70. H. Zhang, Z. Huang, Z. Wei, W. Zhang, X. LIN, Tracking Matrix Approximations over Distributed Sliding Windows, ICDE2017: 833-844.

  71. Fan Zhang, Wenjie Zhang, Ying Zhang, Lu Qin, XUEMIN LIN, "OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks", 42nd International Conference on Very Large Data Bases (VLDB), 2017. 10(6): 649-660(2017).

  72. T. Gao, X. Cao, G. Cong, J. Lu, X. LIN, Distributed Algorithms on Exact Per sonalized PageRank, SIGMOD2017: 479-494.

  73. F. Zhang, Y. Zhang, L. Qin, W. Zhang, X. LIN, Finding Critical Users for Social Network Engagement: The Collapsed k-Core Problem, AAAI2017: 245-251.

  74. L. Lai, Q. Lu, X. LIN, Y. Zhang, L. Chang, Scalable Distributed Subgraph Enumeration, VLDB 2017. 10(3): 2150-8097(2017).

  75. Y. Wang, W. Zhang, L. Hu, X. LIN, Iterative Views Agreement: An Iterative Low-Rank based Structured Optimization Method to Multi-View Spectral Clustering, IJCAI 2016: 2153-2159.

  76. F. Bi, L. Chang, X. LIN, L. Qin, W. Zhang, Efficient Subgraph Matching by Postponing Cartesian Products, SIGMOD 2016: 1199-1214.

  77. H. Wei, J.X. Yu, C. Lu, X. LIN, Speedup Graph Processing by Graph Ordering, SIGMOD 2016: 1813-1828.

  78. Y. Wang, W. Zhang, L. Hu, X. LIN, Iterative Views Agreement: An Iterative Low-Rank based Structured Optimization Method to Multi-View Spectral Clustering, IJCAI 2016: 2153-2159.

  79. X. Wang, Y. Zhang, W. Zhang, X. LIN, Z. Huang, SKYPE: Top-k Spatial-keyword Publish/Subscribe Over Sliding Window, VLDB2016. 9(10): 588-599(2016).

  80. L. Yuan, L. Qin, X. LIN, L. Chang, W. Zhang, I/O Efficient ECC Graph Decomposition via Graph Reduction, VLDB2016. 9(7): 516-527(2016).

  81. B. Lyu, L. Qin, X. LIN, L. Chang, J.X. Yu, Scalable Supergraph Search in Large Graph Databases, ICDE2016: 157-168.

  82. X. Feng, L. Chang, X. LIN, L. Qin, W. Zhang, Computing Connected Components with Linear Communication Cost in Pregel-like Systems, ICDE2016: 85-96.

  83. L. Chang, W. Li, X. LIN, L. Qin, W. Zhang, pScan: Fast and Exact Structural Graph Clustering, ICDE2016: 253-264.

  84. J. Yang, Y. Zhang, W. Zhang, X. LIN, Influence based cost optimization on user preference, ICDE2016: 709-720.

  85. X. Wang, Y. Zhang, W. Zhang, X. LIN, Distance-Aware Influence Maximization in Geo-social Network, ICDE2016: 1-12.

  86. S. Wang, M. Cheema, X. LIN, Y. Zhang, D. Liu, Efficiently Computing Reverse k Furthest Neighbors, ICDE2016: 1110-1121.

  87. D.-W. Choi, J. Pei, X. LIN, Finding the Minimum Spatial Keyword Cover, ICDE2016: 685-696.

  88. D. Wen, L. Qin, Y. Zhang, X. LIN, J.X. Yu, I/O Efficient Core Graph Decomposition at Web Scale, ICDE2016: 133-144 (BEST PAPER AWARD).

  89. W. Zhang, X. LIN, Y. Zhang, K. Zhu, G. Zhu, Efficient Probabilistic Supergraph Search (ICDE/TKDE Poster), ICDE2016: 1542-1543.

  90. Y. Zheng, H. Wang, X. LIN, M. Wang, Understanding Short Texts through Semantic Enrichment and Hashing (ICDE/TKDE Poster), ICDE2016: 1552-1553.

  91. Yifan Chen, Xiang Zhao, XUEMIN LIN, Towards Frequent Subgraph Mining on Single Large Uncertain Graphs, ICDM2015: 41-50.

  92. Liming Zhan, Ying Zhang, Wenjie Zhang, Xiaoyang Wang, XUEMIN LIN, Range Search on Uncertain Trajectories, CIKM 2015: 921-930

  93. Yang Wang, XUEMIN LIN, Lin Wu and Wenjie Zhang, Effective Multi-Query Expansions: Robust Landmark Retrieval, ACM MM2015: 79-88.

  94. Z. Yu, H. Wang, X. LIN, M. Wang, Learning Term Embeddings for Hypernymy Ide ntification, IJCAI 2015: 1390-1397.

  95. Y. Wang, X. LIN, L. Hu, W. Zhang, LBMCH: Learning Bridging Mapping for Cross-modal Hashing, SIGIR 2015: 999-1002 (short paper)

  96. X. Wang, Y. Zhang, W. Zhang, X. LIN, M. A. Cheema, Optimal Spatial Dominance: An Effective Search of Nearest Neighbor Candidates, SIGMOD 2015: 923-938.

  97. L. Chang, X. LIN, Q. Lu, J. X. Yu, W. Zhang, Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity, SIGMOD 2015: 459-474.

  98. L. Lai, L. Qin, X. LIN, L. Chang, Scalable Subgraph Enumeration in MapReduce, VLDB 2015, 8(10): 974-985(2015).

  99. L. Chang, X. LIN, Q. Lu, J.X. Yu, J. Pei, Efficiently Computing Top-k Short est Path Join, EDBT2015: 133-144.

  100. F. Bi, L. Chang, W. Zhang, X. LIN, Efficient String Similarity Search, DASFAA2015: 545-564.

  101. Y. Han, L. Wang, Y. Zhang, W. Zhang, X. LIN, Spatial Keyword Range Search on Trajectories, DASFAA2015: 223-240.

  102. L. Chang, X. LIN, W. Zhang, J.X. Yu, Y. Zhang, L. Qin, Optimal Enumeration: Efficient Top-k Tree Matching, VLDB 2015, 8(5): 533-544(2015).

  103. S. Yang, M.A., Cheema, X. LIN, W. Wang, Reverse k Nearest Neighbors Query Processing: Experiments and Analysis, VLDB 2015, 8(5): 605-616(2015).

  104. X. Wang, Y. Zhang, W. Zhang, X. LIN, W. Wang, Selectivity Estimation On Streaming Spatio-Textual Data Using Local Correlations, VLDB2015, 8(2): 101-112(2015).

  105. Y. Sun, W. Wang, J. Qin, Y. Zhang, X. LIN, SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index, VLDB 2015, 8(1): 1-12(2015).

  106. J. Wang, S. Song, X. LIN, X. Zhu, J. Pei, Clean Structured Event Logs: A Graph Repair Approach, ICDE2015: 30-41.

  107. L. Yuan, Lu. Qin, X. LIN, L. Chang, W. Zhang, Diversified Top-K Clique Search, ICDE2015: 387-398.

  108. X. Wang, Y. Zhang, W. Zhang, X. LING, W. Wang, AP-Tree: Efficiently Support Continuous Spatial-Keyword Queries Over Stream, ICDE2015: 1107-1118.

  109. X. Wang, Y. Zhang, W. Zhang, X. LIN, Efficiently Identify Local Frequent Keyword Co-occurrence Pattrns in Geo-tagged Twitter Stream, SIGIR 2014: 1215-1218.

  110. Y. Wang, X. LIN, L. Wu, W. Zhang, Q. Zhang, Exploiting Correlation Consensus: Towards Subspace Clustering for Multi-modal data, MM 2014: 981-984.

  111. L. Qu, J.X. Yu, L. Chang, H. Cheng, C. Zhang, X. LIN, Scalable Big Graph Processing in MapReduce, SIGMOD 2014: 827-838.

  112. Y. Zhang, W. Zhang, X. LIN, M. A. Cheema, C. Zhang, Matching Dominance: Capture the Semantics of Dominance for Multi-dimensional Uncertain Objects, SSDBM 2014: 18.

  113. Y. Han, L. Chang, W. Zhang, X. LIN, L. Wang, Efficiently Retrieving Top-k Trajectories by Locations via Traveling Time, ADC 2014: 122-134.

  114. X. Zhao, C. Xiao, W. Zhang, X. LIN, Improving Performance of Graph Similarity Joins Using Selected Substructures, DASFAA 2014 (1): 156-172.

  115. L. Zhan, Y. Zhang, W. Zhang, X. LIN, Identifying Top k Dominating Objects over Uncertain Data, DASFAA 2014 (1): 388-405.

  116. Y. Wang, J. Pei, X. LIN, Q. Zhang, W. Zhang, An iterative fusion approach for graph based semi-supervised learning from multi-views, PAKDD 2014 (2): 162-173.

  117. Y. Wang, X. LIN, Q. Zhang, Shifting Hypergraphs by probabilistic Voting, PAKDD 2014 (2): 234-246. ( Best Paper Runner-Up Award )

  118. W. Yu, X. LIN, W. Zhang, Fast Incremental SimRank on Link-Evolving Graphs, ICDE 2014: 304-315.

  119. S. Yang, M.A. Cheema, X. LIN, Y. Zhang, SLICE: Reviving Regions-Based Pruning for Reverse k Nearest Neighbors Queries, ICDE 2014: 760-771.

  120. M.A. Cheema, Z. Shen, X. LIN, W. Zhang, A Unified Framework for Efficiently Processing Ranking Related Queries, EDBT 2014: 427-438.

  121. C. Zhang, Y. Zhang, W. Zhang, X. LIN, M.A. Cheema, X. Wang, Diversified Spatial Keyword Search on Road Networks, EDBT 2014: 367-378.

  122. X. Zhao, C. Xiao, X. LIN, Q. Liu, W. Zhang, A Partition-Based Approach to Structure Similarity Search, Proceedings of the VLDB Endowment, 2013, 7(3).

  123. W. Yu, X. LIN, W. Zhang, L. Chang, J. Pei, More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarity based on Hype-links. PVLDB 7(1): 13-24 (2013).

  124. Y. Wang, X.LIN, Q. Zhang, Towards Metric Fusion on Multi-view Data: A Cross based Graph Random Walk Approach. CIKM 2013: 805-810

  125. J. Wang, S. Song, Z. Zhu, X. LIN, Efficient Recovery of Missing Events, PVLDB 6(10): 841-852 (2013).

  126. W. Yu, X. LIN, IRWR: Incremental Random Walk with Resatrt, SIGIR 2013: 1017-1020.

  127. L. Chang, J. Yu, L. Qin, X. LIN, C. Liu, W. Liang, Efficiently Computing k-Edge Connected Components via Graph Decomposition, SIGMOD Conference 2013: 205-216.

  128. Z. Zhang, J. Yu, L, Qin, L. Chang, X. LIN, I/O Efficient: Computing SCCs in Massive Graphs, SIGMOD Conference 2013: 181-192.

  129. Q. Liu, K. Taylor, X. Zhao, G. Squire, X. LIN, C. Kloppers, R. Miller, CTrace: Semantic Comparison of Multi-Granularity Process Traces, SIGMOD Conference 2013: 1121-1124 (demo).

  130. Q. Lin, Y. Zhang, W. Zhang, X. LIN, AVR-Tree: Speeding up the Nearest Neighbor Join based Queries, DASFAA (1) 2013: 116-130.

  131. X. Zhao, H. Shang, W. Zhang, X. LIN, On Efficient Graph Substructure Select ion, DASFAA (2) 2013: 284-300

  132. Muhammad Cheema, XUEMIN LIN, Wenjie Zhang, Ying Zhang, A Safe Zone Based Approach for Monitoring Moving Skyline Queries, EDBT 2013: 275-286.

  133. Qing Zhang, Penjie Ye, XUEMIN LIN, Ying Zhang, Skyline Probability over Uncertain Preferences, EDBT 2013: 395-405.

  134. Yang Wang, Muhammad Cheema, XUEMIN LIN, Qing Zhang, Multi-Manifold Ranking: Using Multiple Features for Better Image Retrieval, PAKDD (2) 2013: 449-460.

  135. Weiren Yu, XUEMIN LIN, Wenjie Zhang, Towards efficient SimRank computation on large networks. ICDE 2013: 601-612 (One of the Best Papers )

  136. Chengyuan Zhang, Ying Zhang, Wenjie Zhang, XUEMIN LIN, Inverted Linear Quadtree: Efficient Top K Spatial Keyword Search, ICDE 2013: 901-912

  137. Ming Gao, Cheqing Jin, Wei Wang, XUEMIN LIN, Aoying Zhou, Similarity Query Processing for Probabilistic Sets, ICDE 2013: 913-924

  138. L. Zhan, Y. Zhang, X. LIN, W. Zhang, Finding Top k Most Influential Spatial Facilities Over Uncertain Objects, CIKM 2012: 922-931.

  139. Z. Shen, M.A. Cheema, X. LIN, Loyalty-based Selection: Retrieving Objects That Persistently Satisfy Criteria, CIKM 2012: 2189-2193(short paper)

  140. Weiiren Yu, XUEMIN LIN, Wenjie Zhang, Ying Zhang, Jiajin Le, "SimFusion+: Extending SimiFusion Towards Efficient Estimation on Large Dynamic Networks", SIGIR 2012: 365-374.

  141. Weiren Yu, Jiajin Le, XUEMIN LIN, Wenjie Zhang. "On the Efficiency of Estimating Penetrating Rank on Large Graphs", SSDBM 2012, LNCS, 231-249

  142. Gaoping Zhu, XUEMIN LIN, Ke Zhu, Wenjie Zhang, Jeffrey Xu Yun, "TreeSpan: Efficiently Computing Similarity All-Matching", SIGMOD Conference 2012: 529-540

  143. Ying Zhang , Wenjie Zhang, Qianlu Lin, XUEMIN LIN , Effectively Indexing the Multi-Dimensional Uncertain Objects for Range Searching , EDBT 2012: 504-515

  144. G. Zhu, K. Zhu, W. Zhang, X. LIN, C. Xiao, Efficient Subgraph Similarity Matching, DASFAA (1) 2012: 455-469 (Best Student Paper Award).

  145. W. Zhang, J. Xu, X. Liang, Y. Zhang, X. LIN, Top-k Similarity Join Over Multi-valued Objects, DASFAA (1) 2012: 509-525.

  146. Zhitao Shen, Muhammad Aamir Cheema, XUEMIN LIN, Wenjie Zhang, Haixun Wang, Efficiently Monitoring Top-k Pairs over Sliding Windows, ICDE 2012: 798-809 (one of the Best Papers).

  147. Xiang Zhao, Chuan Xiao, XUEMIN LIN, Wei Wang, Efficient Graph Similarity Joins with Edit Distance Constraints, ICDE 2012: 834-845

  148. Yuanyuan Zhu, Lu Qin, Jeffrey Xu Yu, Yiping Ke, XUEMIN LIN, High Efficiency and Quality: Large Graphs Matching, CIKM 2011, 1755-1764.

  149. P. Peng, L. Zou, L. Chen, X. LIN, D. Zhao, Subgraph Search Over Massive Disk Resident Graphs, SSDBM11, 312-321.

  150. J. Qin, W. Wang, Y. Lu, C. Xiao, X. LIN, Efficient Exact Edit Similarity Query Processing with Asymmetric Signature Schemes,SIGMOD 2011 ( one of the Best Papers ),1033-1044.

  151. X. LIN, Y. Zhang, W. Zhang, M. A. Cheema, Stochastic Skyline Operator, ICDE 2011: 721-732.( Technical Report )

  152. M. A. Cheema, X. LIN, W. Zhang, Y. Zhang, Influence Zone: Efficiently Processing Reverse k Nearest Neighbors Queries, ICDE 2011: 577-588.

  153. M. A. Cheema, X. LIN, H. Wang, J. Wang, W, Zhang, A Unified Approach for Computing Top-k Pairs in Multidimensional Space, ICDE 2011: 1031-1042.

  154. K. Zhu, W. Zhang, G. Zhu, Y. Zhang, X. LIN, BMC: An Efficient Method to Evaluate Probabilistic Reachability Queries, DASFAA 2011: 434-449.

  155. M. Hasan, M. A. Cheema, X. LIN, W. Zhang, A Unified Algorithm for Continuous Monitoring of Spatial Queries , DASFAA 2011: 104-118.

  156. W. Yu, X. LIN, J. Le Taming Computational Complexity: Efficient and Parallel SimRank Optimizzations on Undirected Graphs, pages 280-296, WAIM 2010. Best Paper Runner-Up Award

  157. G. Zhu, X. LIN, W. Zhang, W. Wang, and H. Shang, PrefIndex: An Efficient Supergraph Containment Search Technique , pages 360-378, SSDBM 2010.

  158. W. Yu, X. LIN, J. Le, A Space and Time Efficient Algorithm for SimRank Computation , pages 164-170, APWeb 2010 Best Paper Award

  159. H. Shang, X. LIN, Y. Zhang, J. X. Yu, and W. Wang Connected Substructure Similarity Search , pages 903-914, SIGMOD 2010.

  160. C. Wang, J. Wang, X. LIN, W. Wang, H. Wang, H. Li, MapDupReducer: Detecting Near Duplicates over Massive Datasets (demo), pages 1119-1122, SIGMOD 2010.

  161. K. Zhu, Y. Zhang, X. LIN, G. Zhu, and W. Wang NOVA: A Novel and Efficient Framework for Finding Subgraph Insomophism Mappings in Large Graphs , pages 140-154, DASFAA 2010.

  162. M. Hasan, M. A. Cheema, W. Qu, X. LIN, Efficient Algorithms to Monitor Continuous Constrained k Nearest Neighbor Queries, pages 233-249, DASFAA 2010.

  163. L. Chang, J. X. Yu, L. Qin and X. LIN, Probabilistic Ranking over Relations , pages 477-488, EDBT 2010.

  164. W. Zhang, Y. Zhang, M. A. Cheema, X. LIN, Counting Distincet Objects over Sliding Windows , ADC 2010: 75-84. Best Paper Award

  165. W. Zhang, X. LIN, M. A. Cheema, Y. Zhang, W. Wang, Quantile-Based KNN Over Multi-Valued Objects, pages 16-27, ICDE 2010.

  166. Y. Zhang, X. LIN, G. Zhu, W. Zhang, Q. Lin, Efficient Rank Based KNN Processing over Uncertain Data, pages 28-39, ICDE 2010.

  167. M. A. Cheema, L. Brankovic, X. LIN, W. Zhang, W. Wang, Multi-Guarded Safe Zone: An Efficient Technique to Monitor Moving Circular Range Queries , pages 189-200, ICDE 2010. ( One of the Best Papers)

  168. H. Shang, K. Zhu, X. LIN, Y. Zhang, R. Ichise, Similarity Search on Supergraph Containment , pages 637-648, ICDE 2010.

  169. M. A. Cheema, X. LIN, Y. Zhang, W. Wang, W. Zhang, Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse kNN, pages 1138-1149, VLDB 2009.

  170. W. Wang, C. Xiao, X. LIN, C. Zhang, Efficient Approximate Entity Extraction with Edit Distance Constraints, pages 759-770, SIGMOD 09.

  171. Y. Chen, W. Wang, Z. Liu, X. LIN, Keyword Search on Structured and Semi-structured Data, pages 1005-1010. (tutorial slides)

  172. W. Zhang, X. LIN, Y. Zhang, W. Wang, J.X. Yu , Probilistic Skyline Operator over Sliding Windows, in the Proceedings of 25th IEEE Intational Conference on Data Engineering (ICDE09), pages 1060-1071, Shanghai, China.

  173. C. Xiao, W. Wang, X. LIN, H. Shang, Top-k Set Similarity Joins, in the Proceedings of 25th IEEE Intational Conference on Data Engineering (ICDE09), pages 916-927, Shanghai, China.

  174. Y. Tao, Ling Ding, X. LIN, J. Pei, Distance-based Representative Skyline, in the Proceedings of 25th IEEE Intational Conference on Data Engineering (ICDE09), pages 892-903, Shanghai, China.

  175. Y. Zhang, X. LIN, Y. Tao, W. Zhang, Uncertain Location based Range Aggregates in a multi-dimensional space (short paper), in the Proceedings of 25th IEEE Intational Conference on Data Engineering (ICDE09), pages 1247-1250, Shanghai, China.

  176. M. Hasan, M. A. Cheema, X. LIN, Y. Zhang, Efficient Construction of Safe Regions for moving kNN Queries over Dynamic Datasets, (short paper) in the 11th International Symposium on Spatial and Temporal Databases (SSTD) pp 373-379, Aalborg, Denmark, 2009.

  177. S. Yang, W. Zhang, Y. Zhang, X. Lin, Probabilistic Threshold Range Aggregate Query Processing over Uncertain Data, pages 51-62, APWebWAIM 2009 ( Best Paper Award )

  178. Z. Liu, J. Yu, Y. Ke, X. LIN, L. Chen, Spotting Significant Changing Subgraphs in Evolving Graphs (Short Paper), 8th International Conference on Data Mining (ICDM08), pages 917-922, Pisa, Italy.

  179. H. Shang, Y. Zhang, X. LIN, J. Yu, Taming Verification Hardness: an efficient algorithm for testing subgraph isomorphism, pages 364-375, VLDB2008.

  180. C. Xiao, W. Wang, X. LIN, Ed-Join: An Efficient Algorithm for Similarity Joins With Edit Distance Constraints, pages 933-944, VLDB2008.

  181. C. Jin, K. Yi, L. Chen, J. Yu, X. LIN, Space-Efficient Synopses for Sliding-Window Top-k Queries on Uncertain Streams, pages 301-312, VLDB2008.

  182. W. Zhang, X. LIN, J. Pei, Y. Zhang, Managing Uncertain Data: Probabilistic Approaches (Invited Paper) WAIM 2008: pages 405-412.

  183. X. LIN, Y. Zhang, Aggregate Computation over Data Streams, pages 10-25, APWEB08 (Invited paper and Keynote).

  184. B. Jiang, J. Pei, X. LIN, D. Cheung, J. Han, Mining Preferences from Superi or and Inferior Examples, pages 390-398, KDD08.

  185. J. Pei, M. Hua, Y. Tao, and X. LIN. Mining Uncertain and Probabilistic Data: Problems, Challenges, Methods and Applications, pages 1357-1364, KDD 08. (tutorial slides)

  186. M. Hua, J. Pei, W. Zhang, X. LIN, Ranking Queries on Uncertain Data: A Probabilistic Threshold Approach , in the proceedings of SIGMOD2008, pages 673-686, Canada.

  187. J. Pei, M. Hua, Y. Tao, X. LIN, Query Answering Techniques on Uncertain and Probabilistic Data: tutorial summary, pages 1357-1364, SIGMOD 2008. (tutorial slides)

  188. C. Xiao, W. Wang, X. LIN, J.X. Yu, Efficient Similarity Joins for Near Duplicate Detection , in the proceedings of WWW08, Beijing, China, pages 131-140.

  189. J. Chen, J.X. Yu, X. LIN, H. Wang, P.S. Yu, Fast Computing Reachability for Large Graphs with Hogh Compresion Rate , in the proceedings of EDBT08, pages 193-204, France.

  190. M. Hua, J. Pei, W. Zhang, and X. LIN. Efficiently Answering Probabilistic Threshold Top-k Queries on Uncertain Data, pages 1403-1405, in ICDE08 (poster).

  191. Y. Luo, W. Wang, X. LIN. SPARK: A Keyword Search Engine on Relational Database, pages 1552-1555, ICDE08 (demo).

  192. J. Pei, B. Jiang, X. LIN, and Y. Yuan. Probabilistic Skylines on Uncertain Data . In Proceedings of the 33rd International Conference on Very Large Data Bases (VLDB'07), pages 15-26, Vienna, Austria, September 23-28 2007.

  193. M. Hua, J. Pei, A. W-C Fu, X. LIN, and H-F Leung. Efficiently Answering Top-k Typicality Queries on Large Databases . In Proceedings of the 33rd International Conference on Very Large Data Bases (VLDB'07), pages 890-901, Vienna, Austria, September 23-28

  194. Y. Luo, X. LIN, W. Wang, X. Zhou, SPARK: Top-k Keyword Query in Relational Databases, 26th ACM SIGMOD International Conference on Management o f Data (SIGMOD'07), pages 115-126, 2007.

  195. J. Pei, A.W-C. Fu, X. LIN, H. Wang, Computing Compressed Multidimension al Skyline Cubes Efficiently, IEEE 23rd International Conference on Data Engineering (ICDE'07), pages 96-105, 2007.

  196. X. LIN, Y. Yuan, Q. Zhang, Y. Zhang, Selecting Stars: the k Most Representitive Skyline Operator, IEEE 23rd International Conference on Data Engineering (ICDE'07), pages 86-95, 2007.

  197. B. Ding, J.X. Yu, S. Wang, L. Qing, X. Zhang, X. LIN, Finding Top-k Min-Cost Connected Trees in Databases, IEEE 23rd International Conference on Data Engineering (ICDE'07, Best Student Paper Award), pages 836-845, 2007.

  198. Y. Zhang, X. LIN, Y. Yuan, M. Kitsuregawa, X. Zhou, J. Yu, Summarizing Order Statistics over Data Streams with Duplicates, IEEE 23rd International Conference on Data Engineering (ICDE'07 Short Paper), pages 1329-1333, 2007.

  199. X. LIN, Continuously Maintaining Order Statistics over Data Streams , in the proceedings of 18th Australasian Database Conference (Invited Talk), pages 7-10, 2007.

  200. M.A. Cheema, Y. Yuan, X. LIN, CircularTrip: An Effective Algorithm for Continuous kNN Queries, the 12th International Conference on Database Systems for Advanced Applications (DASFAA2007, short paper), 863-869, 2007.

  201. J. Cheng, J.X. Yu, X. LIN, H. Wang, P.S. Yu, Fast Computation of Reachability Labeling for Large Graphs , in 10th International Conference on Extending Database Technology (EDBT06), pages 961-979.

  202. K. Deng, X. Zhou, H.T. Shen, K. Xu, X. LIN, Surface kNN Query Processing,in the proceedings of 22nd International Conference on Data Engineering (ICDE06), page 78.

  203. Y. Zhang, X. LIN, J. Xu, F. Korn, W. Wang, Space-efficient Relative Error Order Sketch over Data Streams , in the proceedings of 22nd International Conference on Data Engineering (ICDE06), page 51.

  204. B. Wang, X. Yang, G. Wang, L. Chen, S.X. Sean, X. LIN, Continually Answering Constrained k-NN Queries in an Unstructured P2P System, DBISP2P'06 (VLDB'06 workshop), LNCS, pages 397-405, Springer.

  205. Y. Yuan, X. LIN, Q. Liu, W. Wang, J.X. Yu, & Q. Zhang, Efficient Computation of the Skyline Cube , The Proceedings of 31th International Conference on Very Large Databases (VLDB 2005), pages 241-252, Trondheim, Norway, 2005.

  206. W. Wang, H. Wang, H. Lu, H. Jiang, X. LIN, & J. Li, Efficient Processing of XML Path Queries Using the Disk-based F&B Index, The Proceedings of 31th International Conference on Very Large Databases (VLDB 2005), pages 145-156, Trondheim, Norway, 2005.

  207. X. LIN, Y. Yuan, W. Wang, & H. Lu, Stabbing the Sky: Efficient Skyline Computation over Sliding Windows, The Proceedings of 21st International Conference on Data Engineering (ICDE 2005), pages 502-513, 2005.

  208. Z. Liu, J.X. Yu, X. LIN, H. Lu, & W. Wang, Where are the motifs in time-series data, PAKDD05, pages 343-353, LNCS3518 Springer, 2005.

  209. W. Wang, D.B. Do, X. LIN, Term Graph Model for Text Classification, ADMA2005 (Invited Paper), pages 19-30, LNCS3584 Springer, 2005.

  210. Yi Luo, Zheng Liu, XUEMIN LIN, Wei Wang, Jeffrey Xu Yu, Similarity Search with Implicit Object Features, WAIM2005, pages 150-161, LNCS3739 Springer, 2005.

  211. Hongzhi Wang, Wei Wang, Jianzhong Li, XUEMIN LIN, Practical Indexing of XML Documents for Twig Queries, in ASIAN2005, LNCS, Springer, pages 208-222, 2005.

  212. Hongzhi Wang, Wei Wang, XUEMIN LIN, Jianzhong Li, Subgraph Join: Efficient Processing Subgraph Queries on Graph-structured XML Document, WAIM2005, pages 68-80, LNCS3739 Springer,2005

  213. Q. Liu, X. LIN, & Y. Yuan, Summarizing Spatial Relations - A Hybrid Histogram Technique, APweb05 (Best Student Paper Award to Liu and Yuan), pages 464-476, LNCS3399 2005.

  214. H. Wang, W. Wang, X. LIN, J. Li, Labelling scheme and Structural join for Graph-Structured XML Data, APweb05, pages 277-289, LNCS3399, 2005.
  215. X. LIN, H. Lu, J. Xu, and J.X. Yu, Continuously Maintaining Quantile Summaries of the Most Recent N Elements over a Data Stream , The Proceedings of 20th International Conference on Data Engineering (ICDE 2004), pages, 362-374, 2004.

  216. K. Xu, X. Zhou, and X. LIN, Direct Mesh: a Multiresolution Approach to Terrain Visualisation, The Proceedings of 20th International Conference on Data Engineering (ICDE 2004)), pages 766-777, 2004.

  217. Q. Zhang and X. LIN, Clustering Moving Objects for Spatio-temporal Selectivity Estimation, The Proceedings of 15th Australasian Database Conference, (ADC 2004, Best Student Paper Award to Zhang), pages 123-130, 2004.

  218. J. Xu, X. LIN, and X. Zhou, Space Efficient Quantile Summary for Constrained Sliding Windows on a Data Stream, WAIM04, Springer, pages LNCS, pages 34-44, 2004.

  219. Y. Luo, Hai-Xin Lu, and X. LIN, A Scalable and I/O Optimal Skyline Processing Algorithm, WAIM04, Springer, LNCS, pages 218-288, 2004.
  220. X. LIN, Q. Liu, Y. Yuan, and X. Zhou, Multiscale Histograms: Summarizing Topological Relations in Large Spatial Datasets, The proceedings of 29th International Conference on Very Large Data Bases (VLDB'03), pages 814-825, 2003.

  221. H.-X. Lu, Y. Luo, and X. LIN, An Optimal Divide-Conquer Algorithm for 2D Skyline Queries, ADBIS'03, LNCS, pages 46-50, 2003.

  222. X. LIN and Q. Zhang, Error Minimization for Approximate Computation of Range Aggregates, DASFAA03, pages 161-168, 2003.

  223. Q. Liu, Y. Yuan, and X. LIN, Multiresolution Algorithms for Building Spatial Histograms , 14th Australasian Database Conference (ADC2003), pages 145-151, 2003.

  224. Q. Zhang and X. LIN, On Linear-Spline Based Histograms, WAIM 2002, LNCS, Springer-Verlag, pages 354-366, 2002.

  225. X. LIN, H.X. Lu, and Q. Zhang, Graph Partition Based Multi-Way Joins, IDEAS02, IEEE CS Press, pages 23-32, 2002.

  226. X. LIN, Delay Optimizations in Quorum Consensus, 12th Annual International Symposium on Algorithms on Algorithms and Computation (ISAAC01), LNCS, Springer-Verlag, pages 575-586, 2001. ( Full paper )

  227. X. LIN, X. Zhou, C. Liu, and X. Zhou, Efficiently Computing Weighted Proximity Relationships in Spatial Databases, WAIM2001, LNCS, Springer-Verlag, pages 279-290, 2001.

  228. C. Liu, M. Orlowska, X. LIN, X. Zhou, Improving Backward Recovery in Workflow Systems, in 7th International Conference on Database Systyems for Advanced Applications (DASFAA01), pages 276-283, IEEE cs press, 2001.

  229. Y. Li, X. LIN, C. Tsang, An Efficient Distributed Algorithm for Computing Association Rules, Proceedings of 1st International Conference on Web Age Information Management, LNCS 1846, Springer-Verlag, 2000.

  230. X. LIN, X. Zhou, and C. Liu, Efficiently Matching Proximity Relationships in Spatial Database, Proceedings of 6th International Symposium on Spatial Databases (SSD'99), LNCS 1651, Springer-Verlag, pages 188-206, 1999.

  231. X. LIN and P. Eades, Area Minimization for Grid Representation of Hierachically Planar Graphs, COCOON'99, LNCS 1627, Springer-Verlag, 1999.

  232. X. Zhou, Y. Zhang, X. LIN, and C. Liu, On the Optimization of Complex Spatial Queries", Proceedings of 2nd International Symposium on Cooperative Database Systems for Advanced Applications (CODAS'99), Springer-Verlag, pages 252-263, 1999.

  233. C. Liu, M. Orlowska, X. LIN, and X. Zhou, Confirmation: A Solution for Non-compensatability in Workflow Applications, the Proceedings of 15th International Conference on Data Engineering (poster paper), page 102, IEEE cs press, 1999.

  234. X. LIN, C. Liu, Y. Zhang, and X. Zhou, Efficiently Computing Frequent Tree-Like Topology Patterns in a Web Environment , 31st Tool's Asia, IEEE cs press, pages 440-447, 1999.

  235. C. Liu, X. LIN, X. Zhou, and M. Orlowska, Building a Repository for Workflow Systems, 31st Tools's Asia, IEEE cs press, pages 348-357, 1999.

  236. C. Liu, X. Zhou, J. Cao, X. LIN, Global Transaction Management in a Cooperative Database Systems, Proceedings of the 1999 International Symposium on Database, Web and Cooperative Systems, pages 73-78, 1999.

  237. X. LIN, Y. Li, and C. P. Tsang, Reducing Counting Costs in Mining Association Rules by an On-Line Bitmap Index", Proceedings of 9th International Conference on Computing and Information , pages 3-9, 1998.

  238. Y. Li, X. LIN, and C. P. Tsang, An Efficient Algorithm for Mining Distributed Association Rules, Proceedings of 1998 International Conference on Parallel and Distributed Processing Techniques and Applications , pages 1169-1175, 1998.

  239. Y. C. Lin, X. LIN, and X. Zhou, Efficiently Mining Tree Traversal Patterns in a Web Environment, IEEE TENCOON'98 , IEEE, pages 115-118, 1998.

  240. X. LIN and P. Eades, Area Requirements for Drawing Hierarchically Planar Graphs, Graph Grawing'97 , Lecture Notes in Computer Science 1353, Springer-Verlag, pages 219-229, 1998.

  241. P. Eades and X. LIN, Spring Algorithms and Symmetry, COCOON'97 , Lecture Notes in Computer Science 1276, Springer-Verlag, pages 202-211, 1997.

  242. X. LIN, On the Computational Complexity of Optimization of Edges Concentration in Bipartite Graphs, Australian Computer Science Communications (CATS'97), 19(2), pages 9-16, 1997.

  243. P. Eades, Q. Feng, and X. LIN, Straight-Line Drawing Algorithms for Hiera rchical Graphs and Clustered Graphs, Lecture Notes in Computer Science 1190, Springer-Verlag, pages 113-128, 1996 (Graph Drawing'96).

  244. X. LIN and S. Fox, An Effective Parallelization of Execution of Multijoins in Multiprocessor Systems, 2nd International Symposium on Parallel Architectures, Algorithms, and Networks , IEEE cs press, pages 63-69, 1996.

  245. X. LIN and J. Chen, An Optimal Deadlock Resolution Algorithm in Multidatabase Systems, 4th International Conference on Parallel and Distributed Systems , IEEE cs press, pages 516-521, 1996.

  246. X. LIN, A New Quorum Consensus Method with High Fault-Tolerance for Managing Replicated Data, CATS'96 , Australian Computer Science Communication, 18(3), pages 90-99, 1996.

  247. X. LIN and M. E. Orlowska, A Highly Fault-Tolerant Quorum Consenus Method for Managing Replicated Data, 1st Annual International Computing and Combinatorics Conference (COCOON'95), Lecture Notes in Computer Science 959, Springer-Verlag, pages 171-180, 1995.

  248. X. LIN, M. Orlowska and X. Zhou, Using Parallel Semi-Join Reduction to Minimize Distributed Query Response Time, IEEE International Conference on Algorithms and Architectures for Parallel Processing (ICA^3P'95), IEEE CS press, pages 517-526, 1995.

  249. J. Chen and X. LIN, "Clustering Classes Through Graph Transformations", 5th International CASE Symposium , pages 211-216, 1995.

  250. X. LIN and M. Orlowska, "An Efficient Algorithm for Minimizing the Overall Communication Cost in Replicated Data Management", 5th Annual International Symposium on Algorithms and Computation (ISAAC'95), Lecture Notes in Computer Science, Springer-Verlag, pages 246-254, 1994.

  251. X. LIN, M. Orlowska and Y. Zhang, On Data Allocation with the Minimum Overall Communication Cost in Distributed Database Design, Proc. of 5th International Conference on Computing and Information , IEEE CS press, pages 539-544, 1993.

  252. X. LIN, M. Orlowska and Y. Zhang, An Optimal Victim Selection Algorithm for Removing Global Deadlocks in Multidatabase Systems, IEEE Region 10's Ninth Annual International Conference on "Frontiers of Computer Technology", IEEE cs press, pages 501-505, 1994.

  253. X. LIN and Y. Zhang, A New Graphical Method for Vertical Partitioning in Database Design, Advances in Database Research 93, World Scientific, ed. M. E. Orlowska and M. Papazoglo, 131-144, 1993.

  254. P. Eades, T. Lin and X. LIN, Minimum Size h-v Drawings", Advanced Visual Interfaces 1992, Rome, Italy, World Scientific Series in Computer Science Volume 36, 386-394, 1992.

  255. P. Eades and X. LIN, Notes on the Layer Assignment Problem for Drawing Directed Graphs, Proc. of Australian Computer Science Conference 14, 26.1-26.10, 1991.

  256. P. Eades, T. Lin and X. LIN, Representing Trees by Rectangle Inclusion, Proc. of Australian Computer Science Conference 14, 25.1-25.10, 1991.

  257. P. Eades, X. LIN and R. Tamassia, A New Approach for Drawing a Hierarchical Graph, Proc. of Second Canadian Conference on Computational Geometry, 142-146, 1990.

  258. P. Eades, X. LIN and N. Wormald, Performance Guarantees for Motion Planning with Temporal Uncertainty, Proc. of Australian Computer Science Conference 13, 25, 78-87, 1990.

  259. P. Eades and X. LIN, How to Draw a Directed Graph, Proc. of IEEE Workshop on Visual Language, IEEE cs press, 13 -17, 1989.