Research
✨
Minghui Jiang's research interests are in the areas of
theoretical computer science
and
discrete mathematics.
2018+

Minghui Jiang.
Trees, paths, stars, caterpillars and spiders.
Algorithmica,
80:19641982, 2018.

Minghui Jiang.
Periodicity of identifying codes in strips.
Information Processing Letters,
135:7784, 2018.
[
arxiv
program
personalized Share link
]

Adrian Dumitrescu and Minghui Jiang.
On the number of maximum empty boxes amidst n points.
Discrete & Computational Geometry,
59:742756, 2018.

Adrian Dumitrescu and Minghui Jiang.
Minimum rectilinear Steiner tree of n points in the unit square.
Computational Geometry: Theory and Applications,
68:253261, 2018.
2017
2016

Adrian Dumitrescu and Minghui Jiang.
Perfect vector sets, properly overlapping partitions, and largest empty box.
Manuscript, 2016.
[
arxiv
]
2015

Minghui Jiang, Ge Xia, and Yong Zhang.
Edgedisjoint packing of stars and cycles.
In
Proceedings of the 9th Annual International Conference on Combinatorial Optimization and Applications (COCOA'15),
volume 9486 of Lecture Notes in Computer Science, pages 676687,
Springer,
December 1820, 2015.
[
journal
]

Minghui Jiang.
Trees, paths, stars, caterpillars and spiders.
In
Proceedings of the 9th Annual International Conference on Combinatorial Optimization and Applications (COCOA'15),
volume 9486 of Lecture Notes in Computer Science, pages 551565,
Springer,
December 1820, 2015.
[
slides
slides6
journal
]

Francis Y.L. Chin, Bin Fu, Jiuling Guo, Shuguang Han, Jueliang Hu,
Minghui Jiang, Guohui Lin, HingFung Ting, Luping Zhang,
Yong Zhang, and Diwei Zhou.
Competitive algorithms for unbounded oneway trading.
Theoretical Computer Science,
607:3548, 2015.

Adrian Dumitrescu and Minghui Jiang.
On the approximability of covering points by lines and related problems.
Computational Geometry: Theory and Applications,
48:703717, 2015.
[
arxiv
]

Adrian Dumitrescu, Minghui Jiang, and Csaba D. Tóth.
Computing opaque interior barriers à la Shermer.
SIAM Journal on Discrete Mathematics,
29:13721386, 2015.

Minghui Jiang, Pedro J. Tejada, and Haitao Wang.
Quell.
Theoretical Computer Science,
593:7078, 2015.

Minghui Jiang.
On covering points with minimum turns.
International Journal of Computational Geometry & Applications,
25:19, 2015.

Adrian Dumitrescu and Minghui Jiang.
Systems of distant representatives in Euclidean space.
Journal of Combinatorial Theory, Series A,
134:3650, 2015.
2014

Adrian Dumitrescu, Minghui Jiang, and Csaba D. Tóth.
Computing opaque interior barriers à la Shermer.
In
Proceedings of the 17th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'14),
volume 28 of Leibniz International Proceedings in Informatics,
pages 128143,
September 46, 2014.
[
slides
slides6
journal
]

Minghui Jiang and Haitao Wang.
Shortest colorspanning intervals.
In
Proceedings of the 20th Annual International Computing and Combinatorics Conference (COCOON'14),
volume 8591 of Lecture Notes in Computer Science, pages 288299,
Springer,
August 46, 2014.
[
slides
slides6
journal
]

Francis Y. L. Chin, Bin Fu, Minghui Jiang, HingFung Ting, and Yong Zhang.
Competitive algorithms for unbounded oneway trading.
In
Proceedings of the 10th International Conference on Algorithmic Aspects of Information and Management (AAIM'14),
volume 8546 of Lecture Notes in Computer Science, pages 3243,
Springer,
July 811, 2014.
[
journal
]

Minghui Jiang, Pedro J. Tejada, and Haitao Wang.
Quell.
In
Proceedings of the 7th International Conference on Fun with Algorithms (FUN'14),
volume 8496 of Lecture Notes in Computer Science, pages 240251,
Springer,
July 13, 2014.
[
slides
slides6
journal
]

Adrian Dumitrescu and Minghui Jiang.
The opaque square.
In
Proceedings of the 30th ACM Symposium on Computational Geometry (SOCG'14),
pages 529538,
June 811, 2014.
[
arxiv
]
2013

Laurent Bulteau and Minghui Jiang.
Inapproximability of (1,2)exemplar distance.
IEEE/ACM Transactions on Computational Biology and Bioinformatics,
10:13841390, 2013.

Adrian Dumitrescu and Minghui Jiang.
Computational geometry column 58.
ACM SIGACT News,
44(4):7378, 2013.

Minghui Jiang.
Flipping triangles and rectangles.
Journal of Combinatorial Optimization,
26:755769, 2013.

Adrian Dumitrescu and Minghui Jiang.
Disjoint empty disks supported by a point set.
Journal of Geometry,
104:277295, 2013.
[
arxiv
]

Adrian Dumitrescu and Minghui Jiang.
Computational geometry column 56.
ACM SIGACT News,
44(2):8087, 2013.

Adrian Dumitrescu and Minghui Jiang.
Maximal empty boxes amidst random points.
Combinatorics, Probability and Computing,
22:477498, 2013.

Minghui Jiang.
Recognizing dinterval graphs and dtrack interval graphs.
Algorithmica,
66:541563, 2013.

Adrian Dumitrescu and Minghui Jiang.
On the largest empty axisparallel box amidst n points.
Algorithmica,
66:225248, 2013.
[
arxiv
]

Adrian Dumitrescu and Minghui Jiang.
On reconfiguration of disks in the plane and related problems.
Computational Geometry: Theory and Applications,
46:191202, 2013.
2012

Guillaume Blin, Minghui Jiang, and Stéphane Vialette.
The longest common subsequence problem with crossingfree arcannotated sequences.
In
Proceedings of the 19th International Symposium on String Processing and Information Retrieval (SPIRE'12),
volume 7608 of Lecture Notes in Computer Science, pages 130142,
Springer,
October 2125, 2012.

Adrian Dumitrescu and Minghui Jiang.
Maximal empty boxes amidst random points.
In
Proceedings of the 16th International Workshop on Randomization and Computation (RANDOM'12),
volume 7408 of Lecture Notes in Computer Science, pages 529540,
Springer,
August 1517, 2012.
[
slides
slides6
journal
]

Guillaume Blin, Laurent Bulteau, Minghui Jiang, Pedro J. Tejada, and Stéphane Vialette.
Hardness of longest common subsequence for sequences with bounded runlengths.
In
Proceedings of the 23rd Annual Symposium on Combinatorial Pattern Matching (CPM'12),
volume 7354 of Lecture Notes in Computer Science, pages 138148,
Springer,
July 35, 2012.

Laurent Bulteau and Minghui Jiang.
Inapproximability of (1,2)exemplar distance.
In
Proceedings of the 2012 International Symposium on Bioinformatics Research and Applications (ISBRA'12),
volume 7292 of Lecture Notes in Bioinformatics, pages 1323,
Springer,
May 2123, 2012.
[
slides
slides6
journal
]

Minghui Jiang.
On covering points with minimum turns.
In
Proceedings of the 6th International Frontiers of Algorithmics Workshop and the 8th International Conference on Algorithmic Aspects of Information and Management (FAWAAIM'12),
volume 7285 of Lecture Notes in Computer Science, pages 5869,
Springer,
May 1416, 2012.
[
slides
slides6
journal
]

Minghui Jiang and Yong Zhang.
Parameterized complexity in multipleinterval graphs: domination, partition, separation, irredundancy.
Theoretical Computer Science,
461:2744, 2012.
[
arxiv
]

Adrian Dumitrescu and Minghui Jiang.
Coloring translates and homothets of a convex body.
Beiträge zur Algebra und Geometrie,
53:365377, 2012.
[
arxiv
]

Laurent Bulteau, Guillaume Fertin, Minghui Jiang, and Irena Rusu.
Tractability and approximability of maximal strip recovery.
Theoretical Computer Science,
440441:1428, 2012.

Adrian Dumitrescu and Minghui Jiang.
Dispersion in disks.
Theory of Computing Systems,
51:125142, 2012.
[
arxiv
]

Minghui Jiang.
Approximability of constrained LCS.
Journal of Computer and System Sciences,
78:689697, 2012.

Adrian Dumitrescu and Minghui Jiang.
Minimumperimeter intersecting polygons.
Algorithmica,
63:602615, 2012.

Minghui Jiang, Vincent Pilaud, and Pedro J. Tejada.
On a dispersion problem in grid labeling.
SIAM Journal on Discrete Mathematics,
26:3951, 2012.

Minghui Jiang.
Clique in 3track interval graphs is APXhard.
Manuscript, 2012.
[
arxiv
]
2011

Minghui Jiang and Yong Zhang.
Parameterized complexity in multipleinterval graphs: domination.
In
Proceedings of the 6th International Symposium on Parameterized and Exact Computation (IPEC'11),
volume 7112 of Lecture Notes in Computer Science, pages 2740,
Springer,
September 79, 2011.
[
arxiv
journal
]

Adrian Dumitrescu, Minghui Jiang, and János Pach.
Opaque sets.
In
Proceedings of the 14th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'11),
volume 6845 of Lecture Notes in Computer Science, pages 194205,
Springer,
August 1719, 2011.
[
slides
slides6
arxiv
journal
]

Minghui Jiang and Yong Zhang.
Parameterized complexity in multipleinterval graphs: partition, separation, irredundancy.
In
Proceedings of the 17th Annual International Computing and Combinatorics Conference (COCOON'11),
volume 6842 of Lecture Notes in Computer Science, pages 6273,
Springer,
August 1416, 2011.
[
slides
slides6
arxiv
journal
]

Minghui Jiang.
Flipping triangles and rectangles.
In
Proceedings of the 17th Annual International Computing and Combinatorics Conference (COCOON'11),
volume 6842 of Lecture Notes in Computer Science, pages 543554,
August 1416, 2011.
[
slides
slides6
journal
]

Adrian Dumitrescu and Minghui Jiang.
Sweeping an oval to a vanishing point.
In
Proceedings of the XIV Spanish Meeting on Computational Geometry (EGC'11),
volume 8 of Centre de Recerca Matemàtica Documents, pages 5962,
June 2730, 2011.
[
arxiv
journal
]

Laurent Bulteau, Guillaume Fertin, Minghui Jiang, and Irena Rusu.
Tractability and approximability of maximal strip recovery.
In
Proceedings of the 22nd Annual Symposium on Combinatorial Pattern Matching (CPM'11),
volume 6661 of Lecture Notes in Computer Science, pages 336349,
Springer,
June 2729, 2011.
[
journal
]

Minghui Jiang.
The zero exemplar distance problem.
Journal of Computational Biology,
18:10771086, 2011.
[
arxiv
]

Minghui Jiang, Xiaojun Qi, and Pedro J. Tejada.
A computationalgeometry approach to digital image contour extraction.
Transactions on Computational Science,
XIII,
volume 6750 of Lecture Notes in Computer Science, pages 1343, 2011.
[
Contour
]

Adrian Dumitrescu and Minghui Jiang.
Sweeping an oval to a vanishing point.
Discrete Applied Mathematics,
159:14361442, 2011.
[
arxiv
]

Adrian Dumitrescu, Minghui Jiang, and Csaba D. Tóth.
New bounds on the average distance from the FermatWeber center of a planar convex body.
Discrete Optimization,
8:417427, 2011.
[
arxiv
]

Adrian Dumitrescu and Minghui Jiang.
Piercing translates and homothets of a convex body.
Algorithmica,
61:94115, 2011.

Minghui Jiang.
Inapproximability of maximal strip recovery.
Theoretical Computer Science,
412:37593774, 2011.
[
arxiv
]

Sergey Bereg, Minghui Jiang, Boting Yang, and Binhai Zhu.
On the red/blue spanning tree problem.
Theoretical Computer Science,
412:24592467, 2011.

Adrian Dumitrescu and Minghui Jiang.
Sweeping points.
Algorithmica,
60:703717, 2011.

Adrian Dumitrescu and Minghui Jiang.
Constrained kcenter and movement to independence.
Discrete Applied Mathematics,
159:859865, 2011.

Adrian Dumitrescu and Minghui Jiang.
The forest hiding problem.
Discrete & Computational Geometry,
45:529552, 2011.

Minghui Jiang.
An inequality on the edge lengths of triangular meshes.
Computational Geometry: Theory and Applications,
44:100103, 2011.
2010

Minghui Jiang.
Approximability of constrained LCS.
In
Proceedings of the 21st International Symposium on Algorithms and Computation (ISAAC'10),
volume 6507 of Lecture Notes in Computer Science, pages 180191,
Springer,
December 1517, 2010.
[
slides
slides6
annyeonghaseyo
kamsahamnida
journal
]

Minghui Jiang.
The zero exemplar distance problem.
In
Proceedings of the 8th Annual RECOMB Satellite Workshop on Comparative Genomics (RECOMBCG'10),
volume 6398 of Lecture Notes in Bioinformatics, pages 7482,
Springer,
October 911, 2010.
[
slides
slides6
arxiv
journal
]

Minghui Jiang.
Recognizing dinterval graphs and dtrack interval graphs.
In
Proceedings of the 4th International Frontiers of Algorithmics Workshop (FAW'10),
volume 6213 of Lecture Notes in Computer Science, pages 160171,
Springer,
August 1113, 2010.
[
slides
slides6
journal
]

Minghui Jiang.
Inapproximability of maximal strip recovery: II.
In
Proceedings of the 4th International Frontiers of Algorithmics Workshop (FAW'10),
volume 6213 of Lecture Notes in Computer Science, pages 5364,
Springer,
August 1113, 2010.
[
slides
slides6
arxiv
journal
]

Minghui Jiang, Vincent Pilaud, and Pedro J. Tejada.
On a dispersion problem in grid labeling.
In
Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG'10),
pages 7578,
August 911, 2010.
[
journal
]

Adrian Dumitrescu and Minghui Jiang.
Constrained kcenter and movement to independence.
In
Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG'10),
pages 233236,
August 911, 2010.
[
journal
]

Minghui Jiang.
On the parameterized complexity of some optimization problems related to multipleinterval graphs.
In
Proceedings of the 21st Annual Symposium on Combinatorial Pattern Matching (CPM'10),
volume 6129 of Lecture Notes in Computer Science, pages 125137,
Springer,
June 2123, 2010.
[
slides
slides6
journal
]

Adrian Dumitrescu and Minghui Jiang.
Minimumperimeter intersecting polygons.
In
Proceedings of the 9th Latin American Symposium on Theoretical Informatics (LATIN'10),
volume 6034 of Lecture Notes in Computer Science, pages 433445,
Springer,
April 1923, 2010.
[
slides
slides6
journal
]

Adrian Dumitrescu and Minghui Jiang.
Dispersion in unit disks.
In
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS'10),
volume 5 of Leibniz International Proceedings in Informatics,
pages 299310,
March 46, 2010.
[
journal
]

Adrian Dumitrescu and Minghui Jiang.
The forest hiding problem.
In
Proceedings of the 20th Annual ACMSIAM Symposium on Discrete Algorithms (SODA'10),
pages 15661579,
January 1719, 2010.
[
journal
]

Minghui Jiang.
On the parameterized complexity of some optimization problems related to multipleinterval graphs.
Theoretical Computer Science,
411:42534262, 2010.

Minghui Jiang, Pedro J. Tejada, Ramoni O. Lasisi, Shanhong Cheng, and D. Scott Fechser.
Kpartite RNA secondary structures.
Journal of Computational Biology,
17:915925, 2010.
[
Kpartite
]

Minghui Jiang.
Approximation algorithms for predicting RNA secondary structures with arbitrary pseudoknots.
IEEE/ACM Transactions on Computational Biology and Bioinformatics,
7:323332, 2010.

Sergey Bereg, Adrian Dumitrescu, and Minghui Jiang.
Maximum area independent sets in disk intersection graphs.
International Journal of Computational Geometry & Applications,
20:105118, 2010.

Sergey Bereg, Adrian Dumitrescu, and Minghui Jiang.
On covering problems of Rado.
Algorithmica,
57:538561, 2010.

Adrian Dumitrescu and Minghui Jiang.
Covering a disk by disks.
Beiträge zur Algebra und Geometrie,
51:91109, 2010.

Adrian Dumitrescu and Minghui Jiang.
Monochromatic simplices of any volume.
Discrete Mathematics,
310:956960, 2010.
2009

Minghui Jiang.
Inapproximability of maximal strip recovery.
In
Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC'09),
volume 5878 of Lecture Notes in Computer Science, pages 616625,
Springer,
December 1618, 2009.
[
slides
slides6
arxiv
journal
]

Minghui Jiang, Pedro J. Tejada, Ramoni O. Lasisi, Shanhong Cheng, and D. Scott Fechser.
Kpartite RNA secondary structures.
In
Proceedings of the 9th Workshop on Algorithms in Bioinformatics (WABI'09),
volume 5724 of Lecture Notes in Bioinformatics, pages 157168,
Springer,
September 1213, 2009.
[
slides
slides6
journal
Kpartite
]

Adrian Dumitrescu and Minghui Jiang.
Piercing translates and homothets of a convex body.
In
Proceedings of the 17th Annual European Symposium on Algorithms (ESA'09),
volume 5757 of Lecture Notes in Computer Science, pages 131142,
Springer,
September 79, 2009.
[
slides
slides6
arxiv
journal
]

Adrian Dumitrescu and Minghui Jiang.
On reconfiguration of disks in the plane and related problems.
In
Proceedings of the 11th Algorithms and Data Structures Symposium (WADS'09),
volume 5664 of Lecture Notes in Computer Science, pages 254265,
Springer,
August 2123, 2009.
[
slides
slides6
journal
]

Minghui Jiang.
An inequality on the edge lengths of triangular meshes.
In
Proceedings of the 21st Canadian Conference on Computational Geometry (CCCG'09),
pages 141144,
August 1719, 2009.
[
slides
slides6
journal
]

Pedro J. Tejada, Xiaojun Qi, and Minghui Jiang.
Computational geometry of contour extraction.
In
Proceedings of the 21st Canadian Conference on Computational Geometry (CCCG'09),
pages 2528,
August 1719, 2009.
[
Contour
journal
]

Sergey Bereg, Minghui Jiang, Boting Yang, and Binhai Zhu.
On the red/blue spanning tree problem.
In
Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation (TAMC'09),
volume 5532 of Lecture Notes in Computer Science, pages 118127,
Springer,
May 1822, 2009.
[
journal
]

Joel Gillespie, Martin Mayne, and Minghui Jiang.
RNA folding on the 3D triangular lattice.
BMC Bioinformatics,
10:#369, 2009.
[
DeltaIS
]

Zhixiang Chen, Bin Fu, Minghui Jiang, and Binhai Zhu.
On recovering syntenic blocks from comparative maps.
Journal of Combinatorial Optimization,
18:307318, 2009.

Minghui Jiang.
A lineartime algorithm for Hamming distance with shifts.
Theory of Computing Systems,
44:349355, 2009.

Sergey Bereg, Ovidiu Daescu, and Minghui Jiang.
A PTAS for cutting out polygons with lines.
Algorithmica,
53:157171, 2009.

Minghui Jiang and Pedro J. Tejada.
Spreading grid cells.
Manuscript, 2009.
[
arxiv
journal
]
2008

Adrian Dumitrescu and Minghui Jiang.
Sweeping points.
In
Proceedings of the 11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'08),
volume 5171 of Lecture Notes in Computer Science, pages 6376,
Springer,
August 2527, 2008.
[
slides
slides6
journal
]

Zhixiang Chen, Bin Fu, Minghui Jiang, and Binhai Zhu.
On recovering syntenic blocks from comparative maps.
In
Proceedings of the 2nd Annual International Conference on Combinatorial Optimization and Applications (COCOA'08),
volume 5165 of Lecture Notes in Computer Science, pages 319327,
Springer,
August 2124, 2008.
[
journal
]

Adrian Dumitrescu and Minghui Jiang.
Monochromatic simplices of any volume.
In
Proceedings of the 20th Canadian Conference on Computational Geometry (CCCG'08),
pages 7174,
August 1315, 2008.
[
journal
]

Sergey Bereg, Adrian Dumitrescu, and Minghui Jiang.
On covering problems of Rado.
In
Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT'08),
volume 5124 of Lecture Notes in Computer Science, pages 294305,
Springer,
July 24, 2008.
[
slides
slides6
journal
]

Sergey Bereg, Minghui Jiang, Wencheng Wang, Boting Yang, and Binhai Zhu.
Simplifying 3D polygonal chains under the discrete Fréchet distance.
In
Proceedings of the 8th Latin American Symposium on Theoretical Informatics (LATIN'08),
volume 4957 of Lecture Notes in Computer Science, pages 630641,
Springer,
April 711, 2008.

Minghui Jiang, James Anderson, Joel Gillespie, and Martin Mayne.
uShuffle: a useful tool for shuffling biological sequences while preserving the klet counts.
BMC Bioinformatics,
9:#192, 2008.
[
uShuffle
]

Minghui Jiang, Ying Xu, and Binhai Zhu.
Protein structurestructure alignment with discrete Fréchet distance.
Journal of Bioinformatics and Computational Biology,
6:5164, 2008.
[
applet
]

Adrian Dumitrescu and Minghui Jiang.
On a covering problem for equilateral triangles.
Electronic Journal of Combinatorics,
15:#R37, 2008.

Minghui Jiang.
On the sum of distances along a circle.
Discrete Mathematics,
308:20382045, 2008.
2007

Minghui Jiang.
A PTAS for the weighted 2interval pattern problem over the precedingandcrossing model.
In
Proceedings of the 1st Annual International Conference on Combinatorial Optimization and Applications (COCOA'07),
volume 4616 of Lecture Notes in Computer Science, pages 378387,
Springer,
August 1215, 2007.
[
slides
slides6
journal
]

Minghui Jiang and Vladimir Kulyukin.
Connectthedots in a graph and Buffon's needle on a chessboard: two problems in assisted navigation.
In
Proceedings of the 10th Joint Conference on Information Sciences / the 10th International Conference on Computer Science and Informatics (JCIS/CSI'07),
pages 713719,
World Scientific,
July 1824, 2007.
[
slides
slides6
]

Vladimir Kulyukin, Aliasgar Kutiyanawala, and Minghui Jiang.
Surfaceembedded passive RF exteroception: Kepler, Greed, and Buffon's needle.
In
Proceedings of the 4th International Conference on Ubiquitous Intelligence and Computing (UIC'07),
volume 4611 of Lecture Notes in Computer Science, pages 3342,
Springer,
July 1113, 2007.

Minghui Jiang, James Anderson, Joel Gillespie, and Martin Mayne.
uShuffle: a useful tool for shuffling biological sequences while preserving the klet counts.
In
Proceedings of the 2007 International Conference on Bioinformatics and Computational Biology (BIOCOMP'07),
volume II, pages 605613,
CSREA Press,
June 2528, 2007.
[
journal
uShuffle
]

Minghui Jiang.
Improved approximation algorithms for predicting RNA secondary structures with arbitrary pseudoknots.
In
Proceedings of the 3rd International Conference on Algorithmic Aspects of Information and Management (AAIM'07),
volume 4508 of Lecture Notes in Computer Science, pages 399410,
Springer,
June 68, 2007.
[
slides
slides6
journal
]

Minghui Jiang, Martin Mayne, and Joel Gillespie.
Delta: a toolset for the structural analysis of biological sequences on a 3D triangular lattice.
In
Proceedings of the 3rd International Symposium on Bioinformatics Research and Applications (ISBRA'07),
volume 4463 of Lecture Notes in Bioinformatics, pages 518529,
Springer,
May 710, 2007.
[
journal
Delta
]

Minghui Jiang, Ying Xu, and Binhai Zhu.
Protein structurestructure alignment with discrete Fréchet distance.
In
Proceedings of the 5th Asia Pacific Bioinformatics Conference (APBC'07),
pages 131141,
Imperial College Press,
January 1417, 2007.
[
journal
applet
]
2006

Chaitanya Gharpure, Vladimir Kulyukin, Minghui Jiang, and Aliasgar Kutiyanawala.
Passive radio frequency exteroception in robot assisted shopping for the blind.
In
Proceedings of the 3rd International Conference on Ubiquitous Intelligence and Computing (UIC'06),
volume 4159 of Lecture Notes in Computer Science, pages 5160,
Springer,
September 36, 2006.

Sergey Bereg, Ovidiu Daescu, and Minghui Jiang.
A PTAS for cutting out polygons with lines.
In
Proceedings of the 12th Annual International Computing and Combinatorics Conference (COCOON'06),
volume 4112 of Lecture Notes in Computer Science, pages 176185,
Springer,
August 1518, 2006.
[
journal
]

Minghui Jiang.
Subsequence packing: complexity, approximation, and application.
In
Proceedings of the 2nd International Conference on Algorithmic Aspects of Information and Management (AAIM'06),
volume 4041 of Lecture Notes in Computer Science, pages 314323,
Springer,
June 2022, 2006.
2005

Minghui Jiang, Sergey Bereg, Zhongping Qin, and Binhai Zhu.
New bounds on map labeling with circular labels.
In
Proceedings of the 15th International Symposium on Algorithms and Computation (ISAAC'04),
volume 3341 of Lecture Notes in Computer Science, pages 606617,
Springer,
December 2224, 2004.
[
applet
]

Sergey Bereg, Minghui Jiang, and Binhai Zhu.
Contour interpolation with bounded dihedral angles.
In
Proceedings of the 9th ACM Symposium on Solid Modeling and Applications (SM'04),
pages 303308,
June 911, 2004.

Minghui Jiang, Brendan Mumey, Zhongping Qin, Andrew Tomascak, and Binhai Zhu.
Approximations for two decompositionbased geometric optimization problems.
In
Proceedings of the 2004 International Conference on Computational Science
and its Applications (ICCSA'04),
volume 3045 of Lecture Notes in Computer Science, pages 9098,
Springer,
May 1417, 2004.

Nicholas J. Giordano, Minghui Jiang, and Stu Dietz.
Experimental and computational studies of the piano.
In
Proceedings of the 17th International Congress on Acoustics,
volume 4,
September 27, 2001.

Minghui Jiang and Nicholas J. Giordano.
Sound production by a vibrating piano soundboard: Theory.
In
Program Abstracts of the 138th Meeting of the Acoustical Society of America,
volume 106 of Journal of the Acoustical Society of America,
issue 4, page 2141,
November 15, 1999.

Minghui Jiang and Binhai Zhu.
Protein folding on the hexagonal lattice in the HP model.
Journal of Bioinformatics and Computational Biology,
3:1934, 2005.
[
applet
]

Minghui Jiang.
UPSk: a set partitioning problem with applications in UPS pickupdelivery system.
Information Processing Letters,
93:173175, 2005.

Nicholas J. Giordano and Minghui Jiang.
Physical modeling of the piano.
EURASIP Journal on Applied Signal Processing
(now EURASIP Journal on Advances in Signal Processing),
2004:926933, 2004.

Minghui Jiang, Jianbo Qian, Zhongping Qin, Binhai Zhu, and Robert Cimikowski.
A simple factor3 approximation for labeling points with circles.
Information Processing Letters,
87:101105, 2003.

