![]() | ![]() |
Utah State University, USA
List of publications from the DBLP Bibliography Server - FAQother persons with the same name:
| 2012 | ||
|---|---|---|
| 86 | Minghui Jiang: On Covering Points with Minimum Turns. FAW-AAIM 2012: 58-69 | |
| 85 | Laurent Bulteau, Minghui Jiang: Inapproximability of (1, 2)-Exemplar Distance. ISBRA 2012: 13-23 | |
| 84 | Adrian Dumitrescu, Minghui Jiang: Minimum-Perimeter Intersecting Polygons. Algorithmica 63(3): 602-615 (2012) | |
| 83 | Minghui Jiang: Clique in 3-track interval graphs is APX-hard CoRR abs/1204.2202: (2012) | |
| 82 | Minghui Jiang: Approximability of constrained LCS. J. Comput. Syst. Sci. 78(3): 689-697 (2012) | |
| 81 | Minghui Jiang, Vincent Pilaud, Pedro J. Tejada: On a Dispersion Problem in Grid Labeling. SIAM J. Discrete Math. 26(1): 39-51 (2012) | |
| 80 | Adrian Dumitrescu, Minghui Jiang: Dispersion in Disks. Theory Comput. Syst. 51(2): 125-142 (2012) | |
| 2011 | ||
| 79 | Adrian Dumitrescu, Minghui Jiang, János Pach: Opaque Sets. APPROX-RANDOM 2011: 194-205 | |
| 78 | Minghui Jiang: Flipping Triangles and Rectangles. COCOON 2011: 543-554 | |
| 77 | Minghui Jiang, Yong Zhang: Parameterized Complexity in Multiple-Interval Graphs: Partition, Separation, Irredundancy. COCOON 2011: 62-73 | |
| 76 | Laurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu: Tractability and Approximability of Maximal Strip Recovery. CPM 2011: 336-349 | |
| 75 | Minghui Jiang, Yong Zhang: Parameterized Complexity in Multiple-Interval Graphs: Domination. IPEC 2011: 27-40 | |
| 74 | Adrian Dumitrescu, Minghui Jiang: Sweeping Points. Algorithmica 60(3): 703-717 (2011) | |
| 73 | Adrian Dumitrescu, Minghui Jiang: Piercing Translates and Homothets of a Convex Body. Algorithmica 61(1): 94-115 (2011) | |
| 72 | Adrian Dumitrescu, Minghui Jiang: Sweeping an oval to a vanishing point CoRR abs/1101.4667: (2011) | |
| 71 | Minghui Jiang, Yong Zhang: Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy CoRR abs/1110.0187: (2011) | |
| 70 | Minghui Jiang: An inequality on the edge lengths of triangular meshes. Comput. Geom. 44(2): 100-103 (2011) | |
| 69 | Adrian Dumitrescu, Minghui Jiang: The Forest Hiding Problem. Discrete & Computational Geometry 45(3): 529-552 (2011) | |
| 68 | Adrian Dumitrescu, Minghui Jiang: Sweeping an oval to a vanishing point. Discrete Applied Mathematics 159(14): 1436-1442 (2011) | |
| 67 | Adrian Dumitrescu, Minghui Jiang: Constrained k-center and movement to independence. Discrete Applied Mathematics 159(8): 859-865 (2011) | |
| 66 | Adrian Dumitrescu, Minghui Jiang, Csaba D. Tóth: New bounds on the average distance from the Fermat-Weber center of a planar convex body. Discrete Optimization 8(3): 417-427 (2011) | |
| 65 | Sergey Bereg, Minghui Jiang, Boting Yang, Binhai Zhu: On the red/blue spanning tree problem. Theor. Comput. Sci. 412(23): 2459-2467 (2011) | |
| 64 | Minghui Jiang: Inapproximability of maximal strip recovery. Theor. Comput. Sci. 412(29): 3759-3774 (2011) | |
| 63 | Minghui Jiang, Xiaojun Qi, Pedro J. Tejada: A Computational-Geometry Approach to Digital Image Contour Extraction. Transactions on Computational Science 13: 13-43 (2011) | |
| 2010 | ||
| 62 | Adrian Dumitrescu, Minghui Jiang: Constrained k-center and movement to independence. CCCG 2010: 233-236 | |
| 61 | Minghui Jiang, Vincent Pilaud, Pedro J. Tejada: On a dispersion problem in grid labeling. CCCG 2010: 75-78 | |
| 60 | Minghui Jiang: On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs. CPM 2010: 125-137 | |
| 59 | Minghui Jiang: Recognizing d-Interval Graphs and d-Track Interval Graphs. FAW 2010: 160-171 | |
| 58 | Minghui Jiang: Inapproximability of Maximal Strip Recovery: II. FAW 2010: 53-64 | |
| 57 | Minghui Jiang: Approximability of Constrained LCS. ISAAC (2) 2010: 180-191 | |
| 56 | Adrian Dumitrescu, Minghui Jiang: Minimum-Perimeter Intersecting Polygons. LATIN 2010: 433-445 | |
| 55 | Minghui Jiang: The Zero Exemplar Distance Problem. RECOMB-CG 2010: 74-82 | |
| 54 | Adrian Dumitrescu, Minghui Jiang: The Forest Hiding Problem. SODA 2010: 1566-1579 | |
| 53 | Adrian Dumitrescu, Minghui Jiang: Dispersion in Unit Disks. STACS 2010: 299-310 | |
| 52 | Sergey Bereg, Adrian Dumitrescu, Minghui Jiang: On Covering Problems of Rado. Algorithmica 57(3): 538-561 (2010) | |
| 51 | Minghui Jiang: The zero exemplar distance problem CoRR abs/1003.1991: (2010) | |
| 50 | Adrian Dumitrescu, Minghui Jiang: Coloring translates and homothets of a convex body CoRR abs/1008.1360: (2010) | |
| 49 | Adrian Dumitrescu, Minghui Jiang: Monochromatic simplices of any volume. Discrete Mathematics 310(4): 956-960 (2010) | |
| 48 | Minghui Jiang: Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots. IEEE/ACM Trans. Comput. Biology Bioinform. 7(2): 323-332 (2010) | |
| 47 | Sergey Bereg, Adrian Dumitrescu, Minghui Jiang: Maximum Area Independent Sets in Disk Intersection Graphs. Int. J. Comput. Geometry Appl. 20(2): 105-118 (2010) | |
| 46 | Minghui Jiang: On the parameterized complexity of some optimization problems related to multiple-interval graphs. Theor. Comput. Sci. 411(49): 4253-4262 (2010) | |
| 2009 | ||
| 45 | Minghui Jiang: An Inequality on the Edge Lengths of Triangular Meshes. CCCG 2009: 141-144 | |
| 44 | Pedro J. Tejada, Xiaojun Qi, Minghui Jiang: Computational Geometry of Contour Extraction. CCCG 2009: 25-28 | |
| 43 | Adrian Dumitrescu, Minghui Jiang: Piercing Translates and Homothets of a Convex Body. ESA 2009: 131-142 | |
| 42 | Minghui Jiang: Inapproximability of Maximal Strip Recovery. ISAAC 2009: 616-625 | |
| 41 | Sergey Bereg, Minghui Jiang, Boting Yang, Binhai Zhu: On the Red/Blue Spanning Tree Problem. TAMC 2009: 118-127 | |
| 40 | Minghui Jiang, Pedro J. Tejada, Ramoni O. Lasisi, Shanhong Cheng, D. Scott Fechser: K-Partite RNA Secondary Structures. WABI 2009: 157-168 | |
| 39 | Adrian Dumitrescu, Minghui Jiang: On Reconfiguration of Disks in the Plane and Related Problems. WADS 2009: 254-265 | |
| 38 | Sergey Bereg, Ovidiu Daescu, Minghui Jiang: A PTAS for Cutting Out Polygons with Lines. Algorithmica 53(2): 157-171 (2009) | |
| 37 | Joel Gillespie, Martin Mayne, Minghui Jiang: RNA folding on the 3D triangular lattice. BMC Bioinformatics 10: 369 (2009) | |
| 36 | Minghui Jiang, Pedro J. Tejada: Spreading grid cells CoRR abs/0908.3911: (2009) | |
| 35 | Adrian Dumitrescu, Minghui Jiang: On the largest empty axis-parallel box amidst n points CoRR abs/0909.3127: (2009) | |
| 34 | Adrian Dumitrescu, Minghui Jiang: Piercing translates and homothets of a convex body CoRR abs/0910.4172: (2009) | |
| 33 | Adrian Dumitrescu, Minghui Jiang: Dispersion in unit disks CoRR abs/0912.2125: (2009) | |
| 32 | Minghui Jiang: Inapproximability of maximal strip recovery CoRR abs/0912.4935: (2009) | |
| 31 | Zhixiang Chen, Bin Fu, Minghui Jiang, Binhai Zhu: On recovering syntenic blocks from comparative maps. J. Comb. Optim. 18(3): 307-318 (2009) | |
| 30 | Minghui Jiang: A Linear-Time Algorithm for Hamming Distance with Shifts. Theory Comput. Syst. 44(3): 349-355 (2009) | |
| 2008 | ||
| 29 | Adrian Dumitrescu, Minghui Jiang: Sweeping Points. APPROX-RANDOM 2008: 63-76 | |
| 28 | Adrian Dumitrescu, Minghui Jiang: Monochromatic simplices of any volume. CCCG 2008 | |
| 27 | Zhixiang Chen, Bin Fu, Minghui Jiang, Binhai Zhu: On Recovering Syntenic Blocks from Comparative Maps. COCOA 2008: 319-327 | |
| 26 | Sergey Bereg, Minghui Jiang, Wencheng Wang, Boting Yang, Binhai Zhu: Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance. LATIN 2008: 630-641 | |
| 25 | Sergey Bereg, Adrian Dumitrescu, Minghui Jiang: On Covering Problems of Rado. SWAT 2008: 294-305 | |
| 24 | Minghui Jiang, James Anderson, Joel Gillespie, Martin Mayne: uShuffle: A useful tool for shuffling biological sequences while preserving the k-let counts. BMC Bioinformatics 9: (2008) | |
| 23 | Minghui Jiang: On the sum of distances along a circle. Discrete Mathematics 308(10): 2038-2045 (2008) | |
| 22 | Adrian Dumitrescu, Minghui Jiang: On a Covering Problem for Equilateral Triangles. Electr. J. Comb. 15(1): (2008) | |
| 21 | Minghui Jiang, Ying Xu, Binhai Zhu: Protein Structure-structure Alignment with Discrete FrÉchet Distance. J. Bioinformatics and Computational Biology 6(1): 51-64 (2008) | |
| 2007 | ||
| 20 | Minghui Jiang: Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots. AAIM 2007: 399-410 | |
| 19 | Minghui Jiang, Ying Xu, Binhai Zhu: Protein Structure-Structure Alignment with Discrete Fr'echet Distance. APBC 2007: 131-141 | |
| 18 | Minghui Jiang, James Anderson, Joel Gillespie, Martin Mayne: uShuffle: a Useful Tool for Shuffling Biological Sequences While Preserving the K-let Counts. BIOCOMP 2007: 605-613 | |
| 17 | Minghui Jiang: A PTAS for the Weighted 2-Interval Pattern Problem over the Preceding-and-Crossing Model. COCOA 2007: 378-387 | |
| 16 | Minghui Jiang, Martin Mayne, Joel Gillespie: Delta: A Toolset for the Structural Analysis of Biological Sequences on a 3D Triangular Lattice. ISBRA 2007: 518-529 | |
| 15 | Vladimir A. Kulyukin, Aliasgar Kutiyanawala, Minghui Jiang: Surface-Embedded Passive RF Exteroception: Kepler, Greed, and Buffon's Needle. UIC 2007: 33-42 | |
| 14 | Minghui Jiang: On finding a large number of 3D points with a small diameter. Discrete Applied Mathematics 155(17): 2355-2361 (2007) | |
| 13 | Minghui Jiang: A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem. J. Comb. Optim. 13(3): 217-221 (2007) | |
| 12 | Minghui Jiang, Joel Gillespie: Engineering the Divide-and-Conquer Closest Pair Algorithm. J. Comput. Sci. Technol. 22(4): 532-540 (2007) | |
| 2006 | ||
| 11 | Minghui Jiang: Subsequence Packing: Complexity, Approximation, and Application. AAIM 2006: 314-323 | |
| 10 | Sergey Bereg, Ovidiu Daescu, Minghui Jiang: A PTAS for Cutting Out Polygons with Lines. COCOON 2006: 176-185 | |
| 9 | Chaitanya Gharpure, Vladimir A. Kulyukin, Minghui Jiang, Aliasgar Kutiyanawala: Passive Radio Frequency Exteroception in Robot Assisted Shopping for the Blind. UIC 2006: 51-60 | |
| 8 | Minghui Jiang: Approximating minimum coloring and maximum independent set in dotted interval graphs. Inf. Process. Lett. 98(1): 29-33 (2006) | |
| 7 | Minghui Jiang: A new approximation algorithm for labeling points with circle pairs. Inf. Process. Lett. 99(4): 125-129 (2006) | |
| 6 | Binhai Zhu, Minghui Jiang: A combinatorial theorem on labeling squares with points and its application. J. Comb. Optim. 11(4): 411-420 (2006) | |
| 2005 | ||
| 5 | Minghui Jiang: UPS-k: a set partitioning problem with applications in UPS pickup-delivery system. Inf. Process. Lett. 93(4): 173-175 (2005) | |
| 4 | Minghui Jiang, Binhai Zhu: Protein Folding on the Hexagonal Lattice in the Hp Model. J. Bioinformatics and Computational Biology 3(1): 19-34 (2005) | |
| 2004 | ||
| 3 | Minghui Jiang, Brendan Mumey, Zhongping Qin, Andrew Tomascak, Binhai Zhu: Approximations for Two Decomposition-Based Geometric Optimization Problems. ICCSA (3) 2004: 90-98 | |
| 2 | Minghui Jiang, Sergey Bereg, Zhongping Qin, Binhai Zhu: New Bounds on Map Labeling with Circular Labels. ISAAC 2004: 606-617 | |
| 2003 | ||
| 1 | Minghui Jiang, Jianbo Qian, Zhongping Qin, Binhai Zhu, Robert J. Cimikowski: A simple factor-3 approximation for labeling points with circles. Inf. Process. Lett. 87(2): 101-105 (2003) | |
Colors in the list of coauthors
Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page