Minghui Jiang

Orcid: 0000-0003-1843-9292

Affiliations:
  • Utah State University, Logan, UT, USA


According to our database1, Minghui Jiang authored at least 101 papers between 2003 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Partial order alignment by adjacencies and breakpoints.
CoRR, 2021

Decomposing a graph into subgraphs with small components.
CoRR, 2021

Vertebrate interval graphs.
CoRR, 2021

Partitioning an interval graph into subgraphs with small claws.
CoRR, 2021

Caterpillars and alternating paths.
CoRR, 2021

Disjoint axis-parallel segments without a circumscribing polygon.
CoRR, 2021

Linking disjoint axis-parallel segments into a simple polygon is hard too.
CoRR, 2021

Moving intervals for packing and covering.
CoRR, 2021

Linking disjoint segments into a simple polygon is hard.
CoRR, 2021

On universal covers for carpenter's rule folding.
CoRR, 2021

2019
Computational Geometry Column 69.
SIGACT News, 2019

2018
Periodicity of identifying codes in strips.
Inf. Process. Lett., 2018

On the Number of Maximum Empty Boxes Amidst n Points.
Discret. Comput. Geom., 2018

Minimum rectilinear Steiner tree of n points in the unit square.
Comput. Geom., 2018

Trees, Paths, Stars, Caterpillars and Spiders.
Algorithmica, 2018

2017
Perfect domination and small cycles.
Discret. Math. Algorithms Appl., 2017

2016
Edge-disjoint packing of stars and cycles.
Theor. Comput. Sci., 2016

Shortest color-spanning intervals.
Theor. Comput. Sci., 2016

Kernelization of edge perfect code and its variants.
Discret. Appl. Math., 2016

Perfect vector sets, properly overlapping partitions, and largest empty box.
CoRR, 2016

2015
Quell.
Theor. Comput. Sci., 2015

Competitive algorithms for unbounded one-way trading.
Theor. Comput. Sci., 2015

Computing Opaque Interior Barriers à la Shermer.
SIAM J. Discret. Math., 2015

Systems of distant representatives in Euclidean space.
J. Comb. Theory A, 2015

On Covering Points with Minimum Turns.
Int. J. Comput. Geom. Appl., 2015

On the approximability of covering points by lines and related problems.
Comput. Geom., 2015

2014
Computational Geometry Column 60.
SIGACT News, 2014

Opaque Sets.
Algorithmica, 2014

The Opaque Square.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Competitive Algorithms for Unbounded One-Way Trading.
Proceedings of the Algorithmic Aspects in Information and Management, 2014

2013
Inapproximability of (1, 2)-Exemplar Distance.
IEEE ACM Trans. Comput. Biol. Bioinform., 2013

Computational geometry column 58.
SIGACT News, 2013

Computational geometry column 56.
SIGACT News, 2013

Flipping triangles and rectangles.
J. Comb. Optim., 2013

Maximal Empty Boxes Amidst Random Points.
Comb. Probab. Comput., 2013

On reconfiguration of disks in the plane and related problems.
Comput. Geom., 2013

Recognizing d-Interval Graphs and d-Track Interval Graphs.
Algorithmica, 2013

On the Largest Empty Axis-Parallel Box Amidst <i>n</i> Points.
Algorithmica, 2013

2012
Parameterized complexity in multiple-interval graphs: Domination, partition, separation, irredundancy.
Theor. Comput. Sci., 2012

Tractability and approximability of maximal strip recovery.
Theor. Comput. Sci., 2012

On a Dispersion Problem in Grid Labeling.
SIAM J. Discret. Math., 2012

Dispersion in Disks.
Theory Comput. Syst., 2012

Approximability of constrained LCS.
J. Comput. Syst. Sci., 2012

Clique in 3-track interval graphs is APX-hard
CoRR, 2012

Minimum-Perimeter Intersecting Polygons.
Algorithmica, 2012

The Longest Common Subsequence Problem with Crossing-Free Arc-Annotated Sequences.
Proceedings of the String Processing and Information Retrieval, 2012

Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths.
Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011
Inapproximability of maximal strip recovery.
Theor. Comput. Sci., 2011

On the red/blue spanning tree problem.
Theor. Comput. Sci., 2011

A Computational-Geometry Approach to Digital Image Contour Extraction.
Trans. Comput. Sci., 2011

The Zero Exemplar Distance Problem.
J. Comput. Biol., 2011

New bounds on the average distance from the Fermat-Weber center of a planar convex body.
Discret. Optim., 2011

The Forest Hiding Problem.
Discret. Comput. Geom., 2011

Sweeping an oval to a vanishing point.
Discret. Appl. Math., 2011

Constrained k-center and movement to independence.
Discret. Appl. Math., 2011

An inequality on the edge lengths of triangular meshes.
Comput. Geom., 2011

Piercing Translates and Homothets of a Convex Body.
Algorithmica, 2011

Sweeping Points.
Algorithmica, 2011

Parameterized Complexity in Multiple-Interval Graphs: Domination.
Proceedings of the Parameterized and Exact Computation - 6th International Symposium, 2011

Parameterized Complexity in Multiple-Interval Graphs: Partition, Separation, Irredundancy.
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

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

Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots.
IEEE ACM Trans. Comput. Biol. Bioinform., 2010

K-Partite RNA Secondary Structures.
J. Comput. Biol., 2010

Maximum Area Independent Sets in Disk Intersection Graphs.
Int. J. Comput. Geom. Appl., 2010

Monochromatic simplices of any volume.
Discret. Math., 2010

Coloring translates and homothets of a convex body
CoRR, 2010

On Covering Problems of Rado.
Algorithmica, 2010

Dispersion in Unit Disks.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Recognizing <i>d</i>-Interval Graphs and <i>d</i>-Track Interval Graphs.
Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010

Inapproximability of Maximal Strip Recovery: II.
Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010

2009
A Linear-Time Algorithm for Hamming Distance with Shifts.
Theory Comput. Syst., 2009

On recovering syntenic blocks from comparative maps.
J. Comb. Optim., 2009

On the largest empty axis-parallel box amidst n points
CoRR, 2009

Spreading grid cells
CoRR, 2009

RNA folding on the 3D triangular lattice.
BMC Bioinform., 2009

A PTAS for Cutting Out Polygons with Lines.
Algorithmica, 2009

Computational Geometry of Contour Extraction.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008
Protein Structure-structure Alignment with Discrete FrÉchet Distance.
J. Bioinform. Comput. Biol., 2008

On the sum of distances along a circle.
Discret. Math., 2008

On a Covering Problem for Equilateral Triangles.
Electron. J. Comb., 2008

uShuffle: A useful tool for shuffling biological sequences while preserving the k-let counts.
BMC Bioinform., 2008

Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007
Engineering the Divide-and-Conquer Closest Pair Algorithm.
J. Comput. Sci. Technol., 2007

A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem.
J. Comb. Optim., 2007

On finding a large number of 3D points with a small diameter.
Discret. Appl. Math., 2007

Surface-Embedded Passive RF Exteroception: Kepler, Greed, and Buffon's Needle.
Proceedings of the Ubiquitous Intelligence and Computing, 4th International Conference, 2007

Delta: A Toolset for the Structural Analysis of Biological Sequences on a 3D Triangular Lattice.
Proceedings of the Bioinformatics Research and Applications, Third International Symposium, 2007

A PTAS for the Weighted 2-Interval Pattern Problem over the Preceding-and-Crossing Model.
Proceedings of the Combinatorial Optimization and Applications, 2007

Protein Structure-Structure Alignment with Discrete Fr'echet Distance.
Proceedings of 5th Asia-Pacific Bioinformatics Conference, 2007

Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots.
Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006
A combinatorial theorem on labeling squares with points and its application.
J. Comb. Optim., 2006

A new approximation algorithm for labeling points with circle pairs.
Inf. Process. Lett., 2006

Approximating minimum coloring and maximum independent set in dotted interval graphs.
Inf. Process. Lett., 2006

Passive Radio Frequency Exteroception in Robot Assisted Shopping for the Blind.
Proceedings of the Ubiquitous Intelligence and Computing, Third International Conference, 2006

Subsequence Packing: Complexity, Approximation, and Application.
Proceedings of the Algorithmic Aspects in Information and Management, 2006

2005
Protein Folding on the Hexagonal Lattice in the Hp Model.
J. Bioinform. Comput. Biol., 2005

UPS-<i>k</i>: a set partitioning problem with applications in UPS pickup-delivery system.
Inf. Process. Lett., 2005

2004
Contour interpolation with bounded dihedral angles.
Proceedings of the Ninth ACM Symposium on Solid Modeling and Applications, 2004

New Bounds on Map Labeling with Circular Labels.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Approximations for Two Decomposition-Based Geometric Optimization Problems.
Proceedings of the Computational Science and Its Applications, 2004

2003
A simple factor-3 approximation for labeling points with circles.
Inf. Process. Lett., 2003


  Loading...