Xuemin Lin Papers on DiSC'02 Improving Backward Recovery in Workflow Systems Publications Note: Links lead to the DBLP on the Web. Xuemin Lin 36 Xuemin Lin, Peter Eades : Towards area requirements for drawing hierarchically planar graphs. TCS 292 (3): 679-695 (2003) 35 Xuemin Lin, Hai-Xin Lu , Qing Zhang : Graph Partition Based Muti-Way Spatial Joins. IDEAS 2002 : 23-32 34 Qing Zhang , Xuemin Lin: On Linear-Spline Based Histograms. WAIM 2002 : 354-366 33 Dingzhu Du , Peter Eades , Xuemin Lin: Foreword. TCS 289 (2): 877 (2002) 32 Chengfei Liu , Maria E. Orlowska , Xuemin Lin, Xiaofang Zhou : Improving Backward Recovery in Workflow Systems. DASFAA 2001 : 276- 31 Xuemin Lin: Delay Optimizations in Quorum Consensus. ISAAC 2001 : 575-586 30 Xuemin Lin, Xiaomei Zhou , Chengfei Liu , Xiaofang Zhou : Efficiently Computing Weighted Proximity Relationships in Spatial Databases. WAIM 2001 : 279-290 29 Ding-Zhu Du , Peter Eades , Vladimir Estivill-Castro , Xuemin Lin, Arun Sharma : Computing and Combinatorics, 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000, Proceedings. Springer 2000 28 Yijun Li , Xuemin Lin, Chi Ping Tsang : An Efficient Distributed Algorithm for Computing Association Rules. Web-Age Information Management 2000 : 109-120 27 Xuemin Lin, Xiaomei Zhou , Chengfei Liu : Efficient computation of a proximity matching in spatial databases. DKE 33 (1): 85-102 (2000) 26 Xuemin Lin: On the computational complexity of edge concentration. Discrete Applied Mathematics 101 (1-3): 197-205 (2000) 25 Xiaomei Zhou , Xuemin Lin, Chengfei Liu , J. Cao : Spatial Query Processing Using Generalized Filter. IJCIS 9 (1-2): 77-92 (2000) 24 Peter Eades , Xuemin Lin: Spring algorithms and symmetry. TCS 240 (2): 379-405 (2000) 23 Xuemin Lin, Peter Eades : Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs. COCOON 1999 : 92-102 22 Xiaofang Zhou , Yanchun Zhang , Xuemin Lin, Chengfei Liu : On the Optimization of Complex Spatial Queries. CODAS 1999 : 252-263 21 Chengfei Liu , Maria E. Orlowska , Xiaofang Zhou , Xuemin Lin: Confirmation: A Solution for Non-Compensatability in Workflow Applications. ICDE 1999 : 102 20 Xuemin Lin, Xiaomei Zhou , Chengfei Liu : Efficiently Matching Proximity Relationships in Spatial Databases. SSD 1999 : 188-206 19 Xuemin Lin, Yijun Li , Chi Ping Tsang : Applying On-line Bitmap Indexing to Reduce Counting Costs in Mining Association Rules. Information Sciences 120 (1-4): 197-208 (1999) 18 Peter Eades , Xuemin Lin: Spring Algorithms and Symmetry. COCOON 1997 : 202-211 17 Xuemin Lin, Peter Eades : Area Requirements for Drawing Hierarchically Planar Graphs. Graph Drawing 1997 : 219-229 16 Xuemin Lin: A Fully Distributed Quorum Consensus Method with High Fault-Tolerance and Low Communication Overhead. TCS 185 (2): 259-275 (1997) 15 Peter Eades , Qing-Wen Feng , Xuemin Lin: Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. Graph Drawing 1996 : 113-128 14 Xuemin Lin, Jian Chen : An optimal deadlock resolution algorithm in multidatabase systems. ICPADS 1996 : 516-521 13 Peter Eades , Xuemin Lin, Roberto Tamassia : An Algorithm for Drawing a Hierarchical Graph. International Journal of Computational Geometry and Applications 6 (2): 145-156 (1996) 12 Xuemin Lin, Maria E. Orlowska : An Optimal Voting Scheme for Minimizing the Overall Communication Cost in Replicated Data Management. Journal of Parallel and Distributed Computing 35 (1): 97-103 (1996) 11 Xuemin Lin, Maria E. Orlowska : A Highly Fault-Tolerant Quorum Consensus Method for Managing Replicated Data. COCOON 1995 : 171-180 10 Xuemin Lin, Maria E. Orlowska : An Efficient Processing of a Chain Join with the Minimum Communication Cost in Distributed Database Systems. Distributed and Parallel Databases 3 (1): 69-83 (1995) 9 Xuemin Lin, Maria E. Orlowska : An Integer Linear Programming Approach to Data Allocation with the Minimum Total Communication Cost in Distributed Database Systems. Information Sciences 85 (1-3): 1-10 (1995) 8 Xuemin Lin, Maria E. Orlowska : An Efficient Optimal Algorithm for Minimizing the Overall Communication Cost in Replicated Data Management. ISAAC 1994 : 243-251 7 Xuemin Lin, Yanchun Zhang : A New Graphical Method of Vertical Partitioning in Database Design. Australian Database Conference 1993 : 131-144 6 Xuemin Lin, Maria E. Orlowska , Yanchun Zhang : On Data Allocation with the Minimum Overall Communication Costs in Distributed Database Design. ICCI 1993 : 539-544 5 Peter Eades , Xuemin Lin, Nicholas C. Wormald : Performance Guarantees for Motion Planning with Temporal Uncertainty. Australian Computer Journal 25 (1): 21-28 (1993) 4 Xuemin Lin, Maria E. Orlowska , Yanchun Zhang : A Graph Based Cluster Approach for Vertical Partitioning in Database Design. DKE 11 (2): 151- (1993) 3 Peter Eades , Xuemin Lin, W. F. Smyth : A Fast and Effective Heuristic for the Feedback Arc Set Problem. Information Processing Letters 47 (6): 319-323 (1993) 2 Peter Eades , Tao Lin , Xuemin Lin: Two Tree Drawing Conventions. International Journal of Computational Geometry and Applications 3 (2): 133-153 (1993) 1 Peter Eades , Tao Lin , Xuemin Lin: Minimum Size h-v Drawings. Advanced Visual Interfaces 1992 : 386-394 DiSC'02 © 2003 Association for Computing Machinery