Research

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

-2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018+

  • conference papers
  • journal articles
  • manuscripts

2018+

2017

2016

  • Minghui Jiang. Periodicity of identifying codes in strips. Manuscript, 2016. [ arxiv program ]
  • 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. Edge-disjoint 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 676-687, Springer, December 18-20, 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 551-565, Springer, December 18-20, 2015. [ slides slides6 journal ]

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 128-143, September 4-6, 2014. [ slides slides6 journal ]
  • Minghui Jiang and Haitao Wang. Shortest color-spanning intervals. In Proceedings of the 20th Annual International Computing and Combinatorics Conference (COCOON'14), volume 8591 of Lecture Notes in Computer Science, pages 288-299, Springer, August 4-6, 2014. [ slides slides6 journal ]
  • Francis Y. L. Chin, Bin Fu, Minghui Jiang, Hing-Fung Ting, and Yong Zhang. Competitive algorithms for unbounded one-way 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 32-43, Springer, July 8-11, 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 240-251, Springer, July 1-3, 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 529-538, June 8-11, 2014. [ arxiv ]

2013

2012

  • Minghui Jiang. Clique in 3-track interval graphs is APX-hard. Manuscript, 2012. [ arxiv ]

2011

2010

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 63-76, Springer, August 25-27, 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 319-327, Springer, August 21-24, 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 71-74, August 13-15, 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 294-305, Springer, July 2-4, 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 630-641, Springer, April 7-11, 2008.

2007

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 606-617, Springer, December 22-24, 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 303-308, June 9-11, 2004.
  • Minghui Jiang, Brendan Mumey, Zhongping Qin, Andrew Tomascak, and Binhai Zhu. Approximations for two decomposition-based 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 90-98, Springer, May 14-17, 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 2-7, 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 1-5, 1999.