New Algorithms for Computing Maximum Perimeter and Maximum Area of the Convex Hull of Imprecise Inputs Based On the Parallel Line Segment Model. - Wenqi Ju; Jun Luo (CCCG, 2009)

NP-Completeness of Spreading Colored Points. - Ovidiu Daescu; Wenqi Ju; Jun Luo 008 (COCOA (1), 2010)

Approximation Algorithm for the Largest Area Convex Hull of Same Size Non-overlapping Axis-Aligned Squares. - Wenqi Ju; Jun Luo (FAW, 2010)

On Some Geometric Problems of Color-Spanning Sets. - Chenglin Fan; Wenqi Ju; Jun Luo 008; Binhai Zhu (FAW-AAIM, 2011)

Largest Area Convex Hull of Axis-Aligned Squares Based on Imprecise Data. - Ovidiu Daescu; Wenqi Ju; Jun Luo 008; Binhai Zhu (COCOON, 2011)

New models and efficient algorithms for hazard detection. - Wenqi Ju; Chenglin Fan; Shuguang Liu; Jinfei Liu (Geoinformatics, 2012)

On some geometric problems of color-spanning sets. - Wenqi Ju; Chenglin Fan; Jun Luo 008; Binhai Zhu; Ovidiu Daescu (J. Comb. Optim., 2013)

Largest area convex hull of imprecise data based on axis-aligned squares. - Wenqi Ju; Jun Luo 008; Binhai Zhu; Ovidiu Daescu (J. Comb. Optim., 2013)