Остановите войну!
for scientists:
default search action
Minghui Jiang 0001
- > Home > Persons > Minghui Jiang 0001
Publications
- 2019
- [j65]Adrian Dumitrescu, Minghui Jiang:
Computational Geometry Column 69. SIGACT News 50(3): 75-90 (2019) - 2018
- [j63]Adrian Dumitrescu, Minghui Jiang:
Minimum rectilinear Steiner tree of n points in the unit square. Comput. Geom. 68: 253-261 (2018) - [j62]Adrian Dumitrescu, Minghui Jiang:
On the Number of Maximum Empty Boxes Amidst n Points. Discret. Comput. Geom. 59(3): 742-756 (2018) - 2016
- [c53]Adrian Dumitrescu, Minghui Jiang:
On the Number of Maximum Empty Boxes Amidst n Points. SoCG 2016: 36:1-36:13 - [i13]Adrian Dumitrescu, Minghui Jiang:
Perfect vector sets, properly overlapping partitions, and largest empty box. CoRR abs/1608.06874 (2016) - 2015
- [j56]Adrian Dumitrescu, Minghui Jiang:
On the approximability of covering points by lines and related problems. Comput. Geom. 48(9): 703-717 (2015) - [j54]Adrian Dumitrescu, Minghui Jiang:
Systems of distant representatives in Euclidean space. J. Comb. Theory, Ser. A 134: 36-50 (2015) - [j53]Adrian Dumitrescu, Minghui Jiang, Csaba D. Tóth:
Computing Opaque Interior Barriers à la Shermer. SIAM J. Discret. Math. 29(3): 1372-1386 (2015) - 2014
- [j50]Adrian Dumitrescu, Minghui Jiang, János Pach:
Opaque Sets. Algorithmica 69(2): 315-334 (2014) - [j49]Adrian Dumitrescu, Minghui Jiang:
Computational Geometry Column 60. SIGACT News 45(4): 76-82 (2014) - [c49]Adrian Dumitrescu, Minghui Jiang, Csaba D. Tóth:
Computing Opaque Interior Barriers à la Shermer. APPROX-RANDOM 2014: 128-143 - [c47]Adrian Dumitrescu, Minghui Jiang:
The Opaque Square. SoCG 2014: 529 - 2013
- [j48]Adrian Dumitrescu, Minghui Jiang:
On the Largest Empty Axis-Parallel Box Amidst n Points. Algorithmica 66(2): 225-248 (2013) - [j46]Adrian Dumitrescu, Minghui Jiang:
On reconfiguration of disks in the plane and related problems. Comput. Geom. 46(3): 191-202 (2013) - [j45]Adrian Dumitrescu, Minghui Jiang:
Maximal Empty Boxes Amidst Random Points. Comb. Probab. Comput. 22(4): 477-498 (2013) - [j43]Adrian Dumitrescu, Minghui Jiang:
Computational geometry column 56. SIGACT News 44(2): 80-87 (2013) - [j42]Adrian Dumitrescu, Minghui Jiang:
Computational geometry column 58. SIGACT News 44(4): 73-78 (2013) - [c45]Adrian Dumitrescu, Minghui Jiang:
Systems of distant representatives in euclidean space. SoCG 2013: 441-448 - [i12]Adrian Dumitrescu, Minghui Jiang:
The opaque square. CoRR abs/1311.3323 (2013) - [i11]Adrian Dumitrescu, Minghui Jiang:
On the approximability of covering points by lines and related problems. CoRR abs/1312.2549 (2013) - 2012
- [j40]Adrian Dumitrescu, Minghui Jiang:
Minimum-Perimeter Intersecting Polygons. Algorithmica 63(3): 602-615 (2012) - [j38]Adrian Dumitrescu, Minghui Jiang:
Dispersion in Disks. Theory Comput. Syst. 51(2): 125-142 (2012) - [c43]Adrian Dumitrescu, Minghui Jiang:
Maximal Empty Boxes Amidst Random Points. APPROX-RANDOM 2012: 529-540 - 2011
- [j34]Adrian Dumitrescu, Minghui Jiang:
Sweeping Points. Algorithmica 60(3): 703-717 (2011) - [j33]Adrian Dumitrescu, Minghui Jiang:
Piercing Translates and Homothets of a Convex Body. Algorithmica 61(1): 94-115 (2011) - [j31]Adrian Dumitrescu, Minghui Jiang:
Constrained k-center and movement to independence. Discret. Appl. Math. 159(8): 859-865 (2011) - [j30]Adrian Dumitrescu, Minghui Jiang:
Sweeping an oval to a vanishing point. Discret. Appl. Math. 159(14): 1436-1442 (2011) - [j29]Adrian Dumitrescu, Minghui Jiang:
The Forest Hiding Problem. Discret. Comput. Geom. 45(3): 529-552 (2011) - [j28]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): 417-427 (2011) - [c39]Adrian Dumitrescu, Minghui Jiang, János Pach:
Opaque Sets. APPROX-RANDOM 2011: 194-205 - [i9]Adrian Dumitrescu, Minghui Jiang:
Sweeping an oval to a vanishing point. CoRR abs/1101.4667 (2011) - 2010
- [j23]Sergey Bereg, Adrian Dumitrescu, Minghui Jiang:
On Covering Problems of Rado. Algorithmica 57(3): 538-561 (2010) - [j22]Adrian Dumitrescu, Minghui Jiang:
Monochromatic simplices of any volume. Discret. Math. 310(4): 956-960 (2010) - [j21]Sergey Bereg, Adrian Dumitrescu, Minghui Jiang:
Maximum Area Independent Sets in Disk Intersection Graphs. Int. J. Comput. Geom. Appl. 20(2): 105-118 (2010) - [c33]Adrian Dumitrescu, Minghui Jiang:
Constrained k-center and movement to independence. CCCG 2010: 233-236 - [c28]Adrian Dumitrescu, Minghui Jiang:
Minimum-Perimeter Intersecting Polygons. LATIN 2010: 433-445 - [c26]Adrian Dumitrescu, Minghui Jiang:
The Forest Hiding Problem. SODA 2010: 1566-1579 - [c25]Adrian Dumitrescu, Minghui Jiang:
Dispersion in Unit Disks. STACS 2010: 299-310 - [i6]Adrian Dumitrescu, Minghui Jiang:
Coloring translates and homothets of a convex body. CoRR abs/1008.1360 (2010) - 2009
- [c22]Adrian Dumitrescu, Minghui Jiang:
Piercing Translates and Homothets of a Convex Body. ESA 2009: 131-142 - [c18]Adrian Dumitrescu, Minghui Jiang:
On Reconfiguration of Disks in the Plane and Related Problems. WADS 2009: 254-265 - [i4]Adrian Dumitrescu, Minghui Jiang:
On the largest empty axis-parallel box amidst n points. CoRR abs/0909.3127 (2009) - [i3]Adrian Dumitrescu, Minghui Jiang:
Piercing translates and homothets of a convex body. CoRR abs/0910.4172 (2009) - [i2]Adrian Dumitrescu, Minghui Jiang:
Dispersion in unit disks. CoRR abs/0912.2125 (2009) - 2008
- [j12]Adrian Dumitrescu, Minghui Jiang:
On a Covering Problem for Equilateral Triangles. Electron. J. Comb. 15(1) (2008) - [c17]Adrian Dumitrescu, Minghui Jiang:
Sweeping Points. APPROX-RANDOM 2008: 63-76 - [c16]Adrian Dumitrescu, Minghui Jiang:
Monochromatic simplices of any volume. CCCG 2008 - [c13]Sergey Bereg, Adrian Dumitrescu, Minghui Jiang:
On Covering Problems of Rado. SWAT 2008: 294-305
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-12-08 00:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint