Minghui Jiang

ORCID

Publication Activity (10 Years)

Years Active: 2003-2021
Publications (10 Years): 30

Top Venues

Publications

Rain Jiang, Kai Jiang, Minghui Jiang
Linking disjoint segments into a simple polygon is hard. CoRR (2021)
Rain Jiang, Kai Jiang, Minghui Jiang
Decomposing a graph into subgraphs with small components. CoRR (2021)
Rain Jiang, Kai Jiang, Minghui Jiang
Disjoint axis-parallel segments without a circumscribing polygon. CoRR (2021)
Rain Jiang, Kai Jiang, Minghui Jiang
Partial order alignment by adjacencies and breakpoints. CoRR (2021)
Rain Jiang, Kai Jiang, Minghui Jiang
Moving intervals for packing and covering. CoRR (2021)
Rain Jiang, Kai Jiang, Minghui Jiang
Linking disjoint axis-parallel segments into a simple polygon is hard too. CoRR (2021)
Rain Jiang, Kai Jiang, Minghui Jiang
On universal covers for carpenter's rule folding. CoRR (2021)
Rain Jiang, Kai Jiang, Minghui Jiang
Partitioning an interval graph into subgraphs with small claws. CoRR (2021)
Rain Jiang, Kai Jiang, Minghui Jiang
Vertebrate interval graphs. CoRR (2021)
Rain Jiang, Kai Jiang, Minghui Jiang
Caterpillars and alternating paths. CoRR (2021)
Adrian Dumitrescu, Minghui Jiang
Computational Geometry Column 69. SIGACT News 50 (3) (2019)
Adrian Dumitrescu, Minghui Jiang
Minimum rectilinear Steiner tree of n points in the unit square. Comput. Geom. 68 (2018)
Minghui Jiang
Trees, Paths, Stars, Caterpillars and Spiders. Algorithmica 80 (6) (2018)
Adrian Dumitrescu, Minghui Jiang
On the Number of Maximum Empty Boxes Amidst n Points. Discret. Comput. Geom. 59 (3) (2018)
Minghui Jiang
Periodicity of identifying codes in strips. Inf. Process. Lett. 135 (2018)
Minghui Jiang, Yong Zhang
Perfect domination and small cycles. Discret. Math. Algorithms Appl. 9 (3) (2017)
Adrian Dumitrescu, Minghui Jiang
Perfect vector sets, properly overlapping partitions, and largest empty box. CoRR (2016)
Minghui Jiang
Periodicity of identifying codes in strips. CoRR (2016)
Adrian Dumitrescu, Minghui Jiang
On the Number of Maximum Empty Boxes Amidst n Points. SoCG (2016)
Minghui Jiang, Yong Zhang
Kernelization of edge perfect code and its variants. Discret. Appl. Math. 214 (2016)
Minghui Jiang, Haitao Wang
Shortest color-spanning intervals. Theor. Comput. Sci. 609 (2016)
Minghui Jiang, Ge Xia, Yong Zhang
Edge-disjoint packing of stars and cycles. Theor. Comput. Sci. 640 (2016)
Adrian Dumitrescu, Minghui Jiang
On the approximability of covering points by lines and related problems. Comput. Geom. 48 (9) (2015)
Adrian Dumitrescu, Minghui Jiang, Csaba D. Tóth
Computing Opaque Interior Barriers à la Shermer. SIAM J. Discret. Math. 29 (3) (2015)
Minghui Jiang
Trees, Paths, Stars, Caterpillars and Spiders. COCOA (2015)
Minghui Jiang
On Covering Points with Minimum Turns. Int. J. Comput. Geom. Appl. 25 (1) (2015)
Minghui Jiang, Ge Xia, Yong Zhang
Edge-Disjoint Packing of Stars and Cycles. COCOA (2015)
Francis Y. L. Chin, Bin Fu, Jiuling Guo, Shuguang Han, Jueliang Hu, Minghui Jiang, Guohui Lin, Hing-Fung Ting, Luping Zhang, Yong Zhang, Diwei Zhou
Competitive algorithms for unbounded one-way trading. Theor. Comput. Sci. 607 (2015)
Adrian Dumitrescu, Minghui Jiang
Systems of distant representatives in Euclidean space. J. Comb. Theory, Ser. A 134 (2015)
Minghui Jiang, Pedro J. Tejada, Haitao Wang
Quell. Theor. Comput. Sci. 593 (2015)
Adrian Dumitrescu, Minghui Jiang
Computational Geometry Column 60. SIGACT News 45 (4) (2014)
Minghui Jiang, Pedro J. Tejada, Haitao Wang
Quell. FUN (2014)
Adrian Dumitrescu, Minghui Jiang, János Pach
Opaque Sets. Algorithmica 69 (2) (2014)
Adrian Dumitrescu, Minghui Jiang
The Opaque Square. SoCG (2014)
Francis Y. L. Chin, Bin Fu, Minghui Jiang, Hing-Fung Ting, Yong Zhang
Competitive Algorithms for Unbounded One-Way Trading. AAIM (2014)
Minghui Jiang, Haitao Wang
Shortest Color-Spanning Intervals. COCOON (2014)
Adrian Dumitrescu, Minghui Jiang, Csaba D. Tóth
Computing Opaque Interior Barriers à la Shermer. APPROX-RANDOM (2014)
Minghui Jiang
Recognizing d-Interval Graphs and d-Track Interval Graphs. Algorithmica 66 (3) (2013)
Adrian Dumitrescu, Minghui Jiang
On reconfiguration of disks in the plane and related problems. Comput. Geom. 46 (3) (2013)
Adrian Dumitrescu, Minghui Jiang
On the approximability of covering points by lines and related problems. CoRR (2013)
Adrian Dumitrescu, Minghui Jiang
Maximal Empty Boxes Amidst Random Points. Comb. Probab. Comput. 22 (4) (2013)
Adrian Dumitrescu, Minghui Jiang
Systems of distant representatives in euclidean space. SoCG (2013)
Adrian Dumitrescu, Minghui Jiang
Computational geometry column 58. SIGACT News 44 (4) (2013)
Adrian Dumitrescu, Minghui Jiang
Computational geometry column 56. SIGACT News 44 (2) (2013)
Minghui Jiang
Flipping triangles and rectangles. J. Comb. Optim. 26 (4) (2013)
Laurent Bulteau, Minghui Jiang
Inapproximability of (1, 2)-Exemplar Distance. IEEE ACM Trans. Comput. Biol. Bioinform. 10 (6) (2013)
Adrian Dumitrescu, Minghui Jiang
The opaque square. CoRR (2013)
Adrian Dumitrescu, Minghui Jiang
Points. Algorithmica 66 (2) (2013)
Adrian Dumitrescu, Minghui Jiang
Dispersion in Disks. Theory Comput. Syst. 51 (2) (2012)
Adrian Dumitrescu, Minghui Jiang
Maximal Empty Boxes Amidst Random Points. APPROX-RANDOM (2012)
Minghui Jiang
Approximability of constrained LCS. J. Comput. Syst. Sci. 78 (3) (2012)
Adrian Dumitrescu, Minghui Jiang
Minimum-Perimeter Intersecting Polygons. Algorithmica 63 (3) (2012)
Guillaume Blin, Laurent Bulteau, Minghui Jiang, Pedro J. Tejada, Stéphane Vialette
Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths. CPM (2012)
Minghui Jiang, Yong Zhang
Parameterized complexity in multiple-interval graphs: Domination, partition, separation, irredundancy. Theor. Comput. Sci. 461 (2012)
Minghui Jiang, Vincent Pilaud, Pedro J. Tejada
On a Dispersion Problem in Grid Labeling. SIAM J. Discret. Math. 26 (1) (2012)
Guillaume Blin, Minghui Jiang, Stéphane Vialette
The Longest Common Subsequence Problem with Crossing-Free Arc-Annotated Sequences. SPIRE (2012)
Laurent Bulteau, Minghui Jiang
Inapproximability of (1, 2)-Exemplar Distance. ISBRA (2012)
Laurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu
Tractability and approximability of maximal strip recovery. Theor. Comput. Sci. (2012)
Minghui Jiang
On Covering Points with Minimum Turns. FAW-AAIM (2012)
Minghui Jiang
Clique in 3-track interval graphs is APX-hard CoRR (2012)
Sergey Bereg, Minghui Jiang, Boting Yang, Binhai Zhu
On the red/blue spanning tree problem. Theor. Comput. Sci. 412 (23) (2011)
Adrian Dumitrescu, Minghui Jiang
Sweeping an oval to a vanishing point. Discret. Appl. Math. 159 (14) (2011)
Minghui Jiang, Yong Zhang
Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy CoRR (2011)
Minghui Jiang, Yong Zhang
Parameterized Complexity in Multiple-Interval Graphs: Partition, Separation, Irredundancy. COCOON (2011)
Adrian Dumitrescu, Minghui Jiang
Constrained k-center and movement to independence. Discret. Appl. Math. 159 (8) (2011)
Minghui Jiang
Inapproximability of maximal strip recovery. Theor. Comput. Sci. 412 (29) (2011)
Minghui Jiang, Xiaojun Qi, Pedro J. Tejada
A Computational-Geometry Approach to Digital Image Contour Extraction. Trans. Comput. Sci. 13 (2011)
Minghui Jiang, Yong Zhang
Parameterized Complexity in Multiple-Interval Graphs: Domination. IPEC (2011)
Adrian Dumitrescu, Minghui Jiang
The Forest Hiding Problem. Discret. Comput. Geom. 45 (3) (2011)
Minghui Jiang
An inequality on the edge lengths of triangular meshes. Comput. Geom. 44 (2) (2011)
Laurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu
Tractability and Approximability of Maximal Strip Recovery. CPM (2011)
Minghui Jiang
Flipping Triangles and Rectangles. COCOON (2011)
Adrian Dumitrescu, Minghui Jiang, Csaba D. Tóth
New bounds on the average distance from the Fermat-Weber center of a planar convex body. Discret. Optim. 8 (3) (2011)
Adrian Dumitrescu, Minghui Jiang
Sweeping Points. Algorithmica 60 (3) (2011)
Adrian Dumitrescu, Minghui Jiang, János Pach
Opaque Sets. APPROX-RANDOM (2011)
Adrian Dumitrescu, Minghui Jiang
Sweeping an oval to a vanishing point CoRR (2011)
Minghui Jiang
The Zero Exemplar Distance Problem. J. Comput. Biol. 18 (9) (2011)
Adrian Dumitrescu, Minghui Jiang
Piercing Translates and Homothets of a Convex Body. Algorithmica 61 (1) (2011)
Minghui Jiang
Approximability of Constrained LCS. ISAAC (2) (2010)
Sergey Bereg, Adrian Dumitrescu, Minghui Jiang
On Covering Problems of Rado. Algorithmica 57 (3) (2010)
Minghui Jiang, Vincent Pilaud, Pedro J. Tejada
On a dispersion problem in grid labeling. CCCG (2010)
Minghui Jiang
On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs. CPM (2010)
Minghui Jiang
Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots. IEEE ACM Trans. Comput. Biol. Bioinform. 7 (2) (2010)
Adrian Dumitrescu, Minghui Jiang
The Forest Hiding Problem. SODA (2010)
Adrian Dumitrescu, Minghui Jiang
Dispersion in Unit Disks. STACS (2010)
Adrian Dumitrescu, Minghui Jiang
Constrained k-center and movement to independence. CCCG (2010)
Minghui Jiang
The zero exemplar distance problem CoRR (2010)
Adrian Dumitrescu, Minghui Jiang
Coloring translates and homothets of a convex body CoRR (2010)
Minghui Jiang, Pedro J. Tejada, Ramoni O. Lasisi, Shanhong Cheng, D. Scott Fechser
K-Partite RNA Secondary Structures. J. Comput. Biol. 17 (7) (2010)
Adrian Dumitrescu, Minghui Jiang
Minimum-Perimeter Intersecting Polygons. LATIN (2010)
Minghui Jiang
The Zero Exemplar Distance Problem. RECOMB-CG (2010)
Adrian Dumitrescu, Minghui Jiang
Monochromatic simplices of any volume. Discret. Math. 310 (4) (2010)
Sergey Bereg, Adrian Dumitrescu, Minghui Jiang
Maximum Area Independent Sets in Disk Intersection Graphs. Int. J. Comput. Geom. Appl. 20 (2) (2010)
Minghui Jiang
Inapproximability of Maximal Strip Recovery: II. FAW (2010)
Minghui Jiang
-Track Interval Graphs. FAW (2010)
Minghui Jiang
On the parameterized complexity of some optimization problems related to multiple-interval graphs. Theor. Comput. Sci. 411 (49) (2010)
Adrian Dumitrescu, Minghui Jiang
Piercing translates and homothets of a convex body CoRR (2009)
Minghui Jiang
A Linear-Time Algorithm for Hamming Distance with Shifts. Theory Comput. Syst. 44 (3) (2009)
Joel Gillespie, Martin Mayne, Minghui Jiang
RNA folding on the 3D triangular lattice. BMC Bioinform. 10 (2009)
Sergey Bereg, Minghui Jiang, Boting Yang, Binhai Zhu
On the Red/Blue Spanning Tree Problem. TAMC (2009)

Minghui Jiang.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Minghui Jiang