A simple factor-3 approximation for labeling points with circles. - Minghui Jiang 001; Jianbo Qian; Zhongping Qin; Binhai Zhu; Robert J. Cimikowski (Inf. Process. Lett., 2003)

Approximations for Two Decomposition-Based Geometric Optimization Problems. - Minghui Jiang 001; Brendan Mumey; Zhongping Qin; Andrew Tomascak; Binhai Zhu (ICCSA (3), 2004)

New Bounds on Map Labeling with Circular Labels. - Minghui Jiang 001; Sergey Bereg; Zhongping Qin; Binhai Zhu (ISAAC, 2004)

Contour interpolation with bounded dihedral angles. - Sergey Bereg; Minghui Jiang 001; Binhai Zhu (Symposium on Solid Modeling and Applications, 2004)

UPS-k: a set partitioning problem with applications in UPS pickup-delivery system. - Minghui Jiang 001 (Inf. Process. Lett., 2005)

Protein Folding on the Hexagonal Lattice in the Hp Model. - Minghui Jiang 001; Binhai Zhu (J. Bioinform. Comput. Biol., 2005)

Subsequence Packing: Complexity, Approximation, and Application. - Minghui Jiang 001 (AAIM, 2006)

Passive Radio Frequency Exteroception in Robot Assisted Shopping for the Blind. - Chaitanya Gharpure; Vladimir A. Kulyukin; Minghui Jiang 001; Aliasgar Kutiyanawala (UIC, 2006)

Approximating minimum coloring and maximum independent set in dotted interval graphs. - Minghui Jiang 001 (Inf. Process. Lett., 2006)

A new approximation algorithm for labeling points with circle pairs. - Minghui Jiang 001 (Inf. Process. Lett., 2006)

A combinatorial theorem on labeling squares with points and its application. - Binhai Zhu; Minghui Jiang 001 (J. Comb. Optim., 2006)

Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots. - Minghui Jiang 001 (AAIM, 2007)

Protein Structure-Structure Alignment with Discrete Fr'echet Distance. - Minghui Jiang 001; Ying Xu; Binhai Zhu (APBC, 2007)

A PTAS for the Weighted 2-Interval Pattern Problem over the Preceding-and-Crossing Model. - Minghui Jiang 001 (COCOA, 2007)

Delta: A Toolset for the Structural Analysis of Biological Sequences on a 3D Triangular Lattice. - Minghui Jiang 001; Martin Mayne; Joel Gillespie (ISBRA, 2007)

Surface-Embedded Passive RF Exteroception: Kepler, Greed, and Buffon's Needle. - Vladimir A. Kulyukin; Aliasgar Kutiyanawala; Minghui Jiang 001 (UIC, 2007)

On finding a large number of 3D points with a small diameter. - Minghui Jiang 001 (Discret. Appl. Math., 2007)

A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem. - Minghui Jiang 001 (J. Comb. Optim., 2007)

Engineering the Divide-and-Conquer Closest Pair Algorithm. - Minghui Jiang 001; Joel Gillespie (J. Comput. Sci. Technol., 2007)

Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance. - Sergey Bereg; Minghui Jiang 001; Wencheng Wang 001; Boting Yang; Binhai Zhu (LATIN, 2008)

uShuffle: A useful tool for shuffling biological sequences while preserving the k-let counts. - Minghui Jiang 001; James Anderson; Joel Gillespie; Martin Mayne (BMC Bioinform., 2008)

On a Covering Problem for Equilateral Triangles. - Adrian Dumitrescu; Minghui Jiang 001 (Electron. J. Comb., 2008)

On the sum of distances along a circle. - Minghui Jiang 001 (Discret. Math., 2008)

Protein Structure-structure Alignment with Discrete FrÉchet Distance. - Minghui Jiang 001; Ying Xu; Binhai Zhu (J. Bioinform. Comput. Biol., 2008)

Computational Geometry of Contour Extraction. - Pedro J. Tejada; Xiaojun Qi 001; Minghui Jiang 001 (CCCG, 2009)

A PTAS for Cutting Out Polygons with Lines. - Sergey Bereg; Ovidiu Daescu; Minghui Jiang 001 (Algorithmica, 2009)

RNA folding on the 3D triangular lattice. - Joel Gillespie; Martin Mayne; Minghui Jiang 001 (BMC Bioinform., 2009)

Spreading grid cells - Minghui Jiang 001; Pedro J. Tejada (CoRR, 2009)

On the largest empty axis-parallel box amidst n points - Adrian Dumitrescu; Minghui Jiang 001 (CoRR, 2009)

On recovering syntenic blocks from comparative maps. - Zhixiang Chen 001; Bin Fu; Minghui Jiang 001; Binhai Zhu (J. Comb. Optim., 2009)

A Linear-Time Algorithm for Hamming Distance with Shifts. - Minghui Jiang 001 (Theory Comput. Syst., 2009)

Inapproximability of Maximal Strip Recovery: II. - Minghui Jiang 001 (FAW, 2010)

Recognizing d-Interval Graphs and d-Track Interval Graphs. - Minghui Jiang 001 (FAW, 2010)

Dispersion in Unit Disks. - Adrian Dumitrescu; Minghui Jiang 001 (STACS, 2010)

On Covering Problems of Rado. - Sergey Bereg; Adrian Dumitrescu; Minghui Jiang 001 (Algorithmica, 2010)

Coloring translates and homothets of a convex body - Adrian Dumitrescu; Minghui Jiang 001 (CoRR, 2010)

Monochromatic simplices of any volume. - Adrian Dumitrescu; Minghui Jiang 001 (Discret. Math., 2010)

Maximum Area Independent Sets in Disk Intersection Graphs. - Sergey Bereg; Adrian Dumitrescu; Minghui Jiang 001 (Int. J. Comput. Geom. Appl., 2010)

K-Partite RNA Secondary Structures. - Minghui Jiang 001; Pedro J. Tejada; Ramoni O. Lasisi; Shanhong Cheng; D. Scott Fechser (J. Comput. Biol., 2010)

Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots. - Minghui Jiang 001 (IEEE ACM Trans. Comput. Biol. Bioinform., 2010)

On the parameterized complexity of some optimization problems related to multiple-interval graphs. - Minghui Jiang 001 (Theor. Comput. Sci., 2010)

Parameterized Complexity in Multiple-Interval Graphs: Partition, Separation, Irredundancy. - Minghui Jiang 001; Yong Zhang 053 (COCOON, 2011)

Parameterized Complexity in Multiple-Interval Graphs: Domination. - Minghui Jiang 001; Yong Zhang 053 (IPEC, 2011)

Sweeping Points. - Adrian Dumitrescu; Minghui Jiang 001 (Algorithmica, 2011)

Piercing Translates and Homothets of a Convex Body. - Adrian Dumitrescu; Minghui Jiang 001 (Algorithmica, 2011)

An inequality on the edge lengths of triangular meshes. - Minghui Jiang 001 (Comput. Geom., 2011)

Constrained k-center and movement to independence. - Adrian Dumitrescu; Minghui Jiang 001 (Discret. Appl. Math., 2011)

Sweeping an oval to a vanishing point. - Adrian Dumitrescu; Minghui Jiang 001 (Discret. Appl. Math., 2011)

The Forest Hiding Problem. - Adrian Dumitrescu; Minghui Jiang 001 (Discret. Comput. Geom., 2011)

New bounds on the average distance from the Fermat-Weber center of a planar convex body. - Adrian Dumitrescu; Minghui Jiang 001; Csaba D. Tóth (Discret. Optim., 2011)

The Zero Exemplar Distance Problem. - Minghui Jiang 001 (J. Comput. Biol., 2011)

A Computational-Geometry Approach to Digital Image Contour Extraction. - Minghui Jiang 001; Xiaojun Qi 001; Pedro J. Tejada (Trans. Comput. Sci., 2011)

On the red/blue spanning tree problem. - Sergey Bereg; Minghui Jiang 001; Boting Yang; Binhai Zhu (Theor. Comput. Sci., 2011)

Inapproximability of maximal strip recovery. - Minghui Jiang 001 (Theor. Comput. Sci., 2011)

Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths. - Guillaume Blin; Laurent Bulteau; Minghui Jiang 001; Pedro J. Tejada; Stéphane Vialette (CPM, 2012)

The Longest Common Subsequence Problem with Crossing-Free Arc-Annotated Sequences. - Guillaume Blin; Minghui Jiang 001; Stéphane Vialette (SPIRE, 2012)

Minimum-Perimeter Intersecting Polygons. - Adrian Dumitrescu; Minghui Jiang 001 (Algorithmica, 2012)

Clique in 3-track interval graphs is APX-hard - Minghui Jiang 001 (CoRR, 2012)

Approximability of constrained LCS. - Minghui Jiang 001 (J. Comput. Syst. Sci., 2012)

Dispersion in Disks. - Adrian Dumitrescu; Minghui Jiang 001 (Theory Comput. Syst., 2012)

On a Dispersion Problem in Grid Labeling. - Minghui Jiang 001; Vincent Pilaud; Pedro J. Tejada (SIAM J. Discret. Math., 2012)

Tractability and approximability of maximal strip recovery. - Laurent Bulteau; Guillaume Fertin; Minghui Jiang 001; Irena Rusu (Theor. Comput. Sci., 2012)

Parameterized complexity in multiple-interval graphs: Domination, partition, separation, irredundancy. - Minghui Jiang 001; Yong Zhang 053 (Theor. Comput. Sci., 2012)

On the Largest Empty Axis-Parallel Box Amidst n Points. - Adrian Dumitrescu; Minghui Jiang 001 (Algorithmica, 2013)

Recognizing d-Interval Graphs and d-Track Interval Graphs. - Minghui Jiang 001 (Algorithmica, 2013)

On reconfiguration of disks in the plane and related problems. - Adrian Dumitrescu; Minghui Jiang 001 (Comput. Geom., 2013)

Maximal Empty Boxes Amidst Random Points. - Adrian Dumitrescu; Minghui Jiang 001 (Comb. Probab. Comput., 2013)

Flipping triangles and rectangles. - Minghui Jiang 001 (J. Comb. Optim., 2013)

Computational geometry column 56. - Adrian Dumitrescu; Minghui Jiang 001 (SIGACT News, 2013)

Computational geometry column 58. - Adrian Dumitrescu; Minghui Jiang 001 (SIGACT News, 2013)

Inapproximability of (1, 2)-Exemplar Distance. - Laurent Bulteau; Minghui Jiang 001 (IEEE ACM Trans. Comput. Biol. Bioinform., 2013)

Competitive Algorithms for Unbounded One-Way Trading. - Francis Y. L. Chin; Bin Fu; Minghui Jiang 001; Hing-Fung Ting; Yong Zhang 001 (AAIM, 2014)

The Opaque Square. - Adrian Dumitrescu; Minghui Jiang 001 (SoCG, 2014)

Opaque Sets. - Adrian Dumitrescu; Minghui Jiang 001; János Pach (Algorithmica, 2014)

Computational Geometry Column 60. - Adrian Dumitrescu; Minghui Jiang 001 (SIGACT News, 2014)

On the approximability of covering points by lines and related problems. - Adrian Dumitrescu; Minghui Jiang 001 (Comput. Geom., 2015)

On Covering Points with Minimum Turns. - Minghui Jiang 001 (Int. J. Comput. Geom. Appl., 2015)

Systems of distant representatives in Euclidean space. - Adrian Dumitrescu; Minghui Jiang 001 (J. Comb. Theory A, 2015)

Computing Opaque Interior Barriers à la Shermer. - Adrian Dumitrescu; Minghui Jiang 001; Csaba D. Tóth (SIAM J. Discret. Math., 2015)

Competitive algorithms for unbounded one-way trading. - Francis Y. L. Chin; Bin Fu; Jiuling Guo; Shuguang Han; Jueliang Hu; Minghui Jiang 001; Guohui Lin; Hing-Fung Ting; Luping Zhang; Yong Zhang 001; Diwei Zhou (Theor. Comput. Sci., 2015)

Quell. - Minghui Jiang 001; Pedro J. Tejada; Haitao Wang 001 (Theor. Comput. Sci., 2015)

Perfect vector sets, properly overlapping partitions, and largest empty box. - Adrian Dumitrescu; Minghui Jiang 001 (CoRR, 2016)

Kernelization of edge perfect code and its variants. - Minghui Jiang 001; Yong Zhang 053 (Discret. Appl. Math., 2016)

Shortest color-spanning intervals. - Minghui Jiang 001; Haitao Wang 001 (Theor. Comput. Sci., 2016)

Edge-disjoint packing of stars and cycles. - Minghui Jiang 001; Ge Xia; Yong Zhang 053 (Theor. Comput. Sci., 2016)

Perfect domination and small cycles. - Minghui Jiang 001; Yong Zhang 053 (Discret. Math. Algorithms Appl., 2017)

Trees, Paths, Stars, Caterpillars and Spiders. - Minghui Jiang 001 (Algorithmica, 2018)

Minimum rectilinear Steiner tree of n points in the unit square. - Adrian Dumitrescu; Minghui Jiang 001 (Comput. Geom., 2018)

On the Number of Maximum Empty Boxes Amidst n Points. - Adrian Dumitrescu; Minghui Jiang 001 (Discret. Comput. Geom., 2018)

Periodicity of identifying codes in strips. - Minghui Jiang 001 (Inf. Process. Lett., 2018)

Computational Geometry Column 69. - Adrian Dumitrescu; Minghui Jiang 001 (SIGACT News, 2019)

On universal covers for carpenter's rule folding. - Rain Jiang; Kai Jiang; Minghui Jiang 001 (CoRR, 2021)

Linking disjoint segments into a simple polygon is hard. - Rain Jiang; Kai Jiang; Minghui Jiang 001 (CoRR, 2021)

Moving intervals for packing and covering. - Rain Jiang; Kai Jiang; Minghui Jiang 001 (CoRR, 2021)

Linking disjoint axis-parallel segments into a simple polygon is hard too. - Rain Jiang; Kai Jiang; Minghui Jiang 001 (CoRR, 2021)

Disjoint axis-parallel segments without a circumscribing polygon. - Rain Jiang; Kai Jiang; Minghui Jiang 001 (CoRR, 2021)

Caterpillars and alternating paths. - Rain Jiang; Kai Jiang; Minghui Jiang 001 (CoRR, 2021)

Partitioning an interval graph into subgraphs with small claws. - Rain Jiang; Kai Jiang; Minghui Jiang 001 (CoRR, 2021)

Vertebrate interval graphs. - Rain Jiang; Kai Jiang; Minghui Jiang 001 (CoRR, 2021)

Decomposing a graph into subgraphs with small components. - Rain Jiang; Kai Jiang; Minghui Jiang 001 (CoRR, 2021)

Partial order alignment by adjacencies and breakpoints. - Rain Jiang; Kai Jiang; Minghui Jiang 001 (CoRR, 2021)