| 2005 | ||
|---|---|---|
| c11 | Yin-Feng Xu, Wenqiang Dai, Naoki Katoh, Makoto Ohsaki: Triangulating a Convex Polygon with Small Number of Non-standard Bars. COCOON 2005: 481-489 | |
| 2004 | ||
| j9 | Weimin Ma, Yin-Feng Xu, Jane You, James Liu, Kanliang Wang: On The K-Truck Scheduling Problem. Int. J. Found. Comput. Sci. 15(1): 127-141 (2004) | |
| 2003 | ||
| c10 | Günter Rote, Cao An Wang, Lusheng Wang, Yin-Feng Xu: On Constrained Minimum Pseudotriangulations. COCOON 2003: 445-454 | |
| 2002 | ||
| j8 | Alexander Wolff, Michael Thon, Yin-Feng Xu: A Simple Factor-2/3 Approximation Algorithm for Two-Circle Point Labeling. Int. J. Comput. Geometry Appl. 12(4): 269-282 (2002) | |
| j7 | Franz Aurenhammer, Naoki Katoh, Hiromichi Kojima, Makoto Ohsaki, Yin-Feng Xu: Approximating uniform triangular meshes in polygons. Theor. Comput. Sci. 289(2): 879-895 (2002) | |
| c9 | Weimin Ma, Yin-Feng Xu, Jane You, James Liu, Kanliang Wang: New Results on the k-Truck Problem. COCOON 2002: 504-513 | |
| 2001 | ||
| j6 | Siu-Wing Cheng, Yin-Feng Xu: On beta-skeleton as a subgraph of the minimum weight triangulation. Theor. Comput. Sci. 262(1): 459-471 (2001) | |
| 2000 | ||
| j5 | Yin-Feng Xu, Jichang Ye, Binhai Zhu: Computing the Degree-4 Shortest Network under a Given Topology. Discrete & Computational Geometry 23(3): 437-448 (2000) | |
| c8 | Zhongping Qin, Yin-Feng Xu, Binhai Zhu: On Some Optimization Problems in Obnoxious Facility Location. COCOON 2000: 320-329 | |
| c7 | Zhongping Qin, Alexander Wolff, Yin-Feng Xu, Binhai Zhu: New Algorithms for Two-Label Point Labeling. ESA 2000: 368-379 | |
| c6 | Alexander Wolff, Michael Thon, Yin-Feng Xu: A Better Lower Bound for Two-Circle Point Labeling. ISAAC 2000: 422-431 | |
| 1999 | ||
| j4 | Leizhen Cai, Yin-Feng Xu, Binhai Zhu: Computing the Optimal Bridge Between Two Convex Polygons. Inf. Process. Lett. 69(3): 127-130 (1999) | |
| 1998 | ||
| j3 | Oswin Aichholzer, Franz Aurenhammer, Günter Rote, Yin-Feng Xu: Constant-Level Greedy Triangulations Approximate the MWT Well. J. Comb. Optim. 2(4): 361-369 (1998) | |
| 1997 | ||
| j2 | Cao An Wang, Francis Y. L. Chin, Yin-Feng Xu: A New Subgraph of Minimum Weight Triangulations. J. Comb. Optim. 1(2): 115-127 (1997) | |
| 1996 | ||
| j1 | Oswin Aichholzer, Franz Aurenhammer, Siu-Wing Cheng, Naoki Katoh, Günter Rote, Michael Taschwer, Yin-Feng Xu: Triangulations Intersect Nicely. Discrete & Computational Geometry 16(4): 339-359 (1996) | |
| c5 | Andranik Mirzaian, Cao An Wang, Yin-Feng Xu: On Stable Line Segments in Triangulations. CCCG 1996: 62-67 | |
| c4 | Siu-Wing Cheng, Yin-Feng Xu: Approaching the Largest beta-Skeleton within a Minimum Weight Triangulation. Symposium on Computational Geometry 1996: 196-203 | |
| c3 | Cao An Wang, Francis Y. L. Chin, Yin-Feng Xu: A New Subgraph of Minimum Weight Triangulations. ISAAC 1996: 266-274 | |
| 1995 | ||
| c2 | Siu-Wing Cheng, Yin-Feng Xu: Constrained Independence System and Triangulations of Planar Point Sets. COCOON 1995: 41-50 | |
| 1994 | ||
| c1 | Bo-Ting Yang, Yin-Feng Xu, Zhao-yong You: A Chain Decomposition Algorithm for the Proof of a Property on Minimum Weight Triangulations. ISAAC 1994: 423-427 | |
| 1 | Oswin Aichholzer | |
| 2 | Franz Aurenhammer | |
| 3 | Leizhen Cai | |
| 4 | Siu-Wing Cheng | |
| 5 | Francis Y. L. Chin (Francis Yuk-Lun Chin) | |
| 6 | Wenqiang Dai | |
| 7 | Naoki Katoh | |
| 8 | Hiromichi Kojima | |
| 9 | James Liu | |
| 10 | Weimin Ma | |
| 11 | Andranik Mirzaian (Andy Mirzaian) | |
| 12 | Makoto Ohsaki | |
| 13 | Zhongping Qin | |
| 14 | Günter Rote | |
| 15 | Michael Taschwer | |
| 16 | Michael Thon | |
| 17 | Cao An Wang | |
| 18 | Kanliang Wang | |
| 19 | Lusheng Wang | |
| 20 | Alexander Wolff | |
| 21 | Boting Yang (Bo-Ting Yang) | |
| 22 | Jichang Ye | |
| 23 | Jane You (Jia Jane You) | |
| 24 | Zhao-yong You | |
| 25 | Binhai Zhu |
Data released under the ODC-BY 1.0 license — See also our legal information page