By Scientia Professor Xuemin Lin

Conference Papers

Lin X; Eades P, 1997, 'Area requirement for drawing hierarchically planar graphs', in Battista D (ed.), 6th International Conference AMAST 1997, Rome, Italy, pp. 219 - 229, presented at 6th International Conference AMAST`97, Rome, Italy, 13 December 1997 - 17 December 1997, http://dx.doi.org/10.1007/3-540-63938-1_64

Eades P; Lin X, 1997, 'Spring algorithms and symmetry', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 202 - 211, http://dx.doi.org/10.1007/bfb0045087

Eades P; Feng QW; Lin X, 1997, 'Straight-line drawing algorithms for hierarchical graphs and clustered graphs', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 113 - 128, http://dx.doi.org/10.1007/3-540-62495-3_42

Lin X; Fox S, 1996, 'Effective parallelization of execution of multijoins in multiprocessor systems', in Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN, pp. 63 - 69

Lin X; Chen J, 1996, 'Optimal deadlock resolution algorithm in multidatabase systems', in Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS, pp. 516 - 521

Lin X; Orlowska ME, 1995, 'A highly fault-tolerant quorum consensus method for managing replicated data', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 171 - 180, http://dx.doi.org/10.1007/BFb0030831

Lin X; Orlowska ME; Zhang Y, 1995, 'Optimal victim selection algorithm for removing global deadlocks in multidatabase systems', in IEEE Region 10's Annual International Conference, Proceedings, pp. 501 - 505

Lin X; Orlowska ME; Zhou X, 1995, 'Using parallel semi-join reduction to minimize distributed query response time', in IEEE International Conference on Algorithms and Architectures for Parallel Processing, pp. 517 - 526

Lin X; Orlowska ME, 1994, 'An efficient optimal algorithm for minimizing the overall communication cost in replicated data management', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 243 - 251, http://dx.doi.org/10.1007/3-540-58325-4_187

Lin X; Orlowska M; Zhang Y, 1993, 'On data allocation with minimum overall communication costs in distributed database design', in Proceedings - ICCI 1993: 5th International Conference on Computing and Information, pp. 539 - 544, http://dx.doi.org/10.1109/ICCI.1993.315314

Conference Proceedings (Editor of)

Eades P; Lin X; Sharma AK; Du DZ; Estivill-Castro V, (eds.), 2000, 'Computing and Combinatorics, 6th Annual International conference, cocoon 2000', Sydney, presented at Computing and Combinatorics, 6th Annual International conference, cocoon 2000, Sydney

Lin X, (ed.), 1998, 'Computing: The Australasian Theory Symposium CATS 1998', Perth, WA, presented at Computing: The Australasian Theory Symposium CATS 1998, Perth, WA, 02 February 1998 - 03 February 1998

Preprints

Linghu Q; Zhang F; Lin X; Zhang W; Zhang Y, 2021, Towards User Engagement Dynamics in Social Networks, , http://dx.doi.org/10.48550/arxiv.2110.12193

Yang Z; Lai L; Lin X; Hao K; Zhang W, 2021, HUGE: An Efficient and Scalable Subgraph Enumeration System, , http://dx.doi.org/10.48550/arxiv.2103.14294

Qin L; Lai L; Hao K; Zhou Z; Zhao Y; Han Y; Lin X; Qian Z; Zhou J, 2020, Taming the Expressiveness and Programmability of Graph Analytical Queries, , http://dx.doi.org/10.48550/arxiv.2004.09045

Ni W; Wu H; Cheng P; Chen L; Lin X; Chen L; Lai X; Zhang X, 2020, CoinMagic: A Differential Privacy Framework for Ring Signature Schemes, , http://dx.doi.org/10.48550/arxiv.2003.06826

Lai L; Qing Z; Yang Z; Jin X; Lai Z; Wang R; Hao K; Lin X; Qin L; Zhang W; Zhang Y; Qian Z; Zhou J, 2019, A Survey and Experimental Analysis of Distributed Subgraph Matching, , http://dx.doi.org/10.48550/arxiv.1906.11518

Fang Y; Yu K; Cheng R; Lakshmanan LVS; Lin X, 2019, Efficient Algorithms for Densest Subgraph Discovery, , http://dx.doi.org/10.48550/arxiv.1906.00341

Back to profile page