Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDAdrian Dumitrescu
Person information
- affiliation: adriandumitrescu.org
- affiliation (Ph.D.): Rutgers University, NJ, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[j109]Adrian Dumitrescu:
Finding a mediocre player. Discret. Appl. Math. 293: 15-24 (2021)- [c89]Adrian Dumitrescu
, Josef Tkadlec:
Piercing All Translates of a Set of Axis-Parallel Rectangles. IWOCA 2021: 295-309 - [i45]Adrian Dumitrescu:
Finding Triangles or Independent Sets. CoRR abs/2105.01265 (2021) - [i44]Adrian Dumitrescu, Josef Tkadlec:
Piercing All Translates of a Set of Axis-Parallel Rectangles. CoRR abs/2106.07459 (2021) - 2020
- [j108]Adrian Dumitrescu, Csaba D. Tóth:
Problems on track runners. Comput. Geom. 88: 101611 (2020) - [j107]Adrian Dumitrescu:
On the shortest separating cycle. Comput. Geom. 88: 101612 (2020) - [j106]Adrian Dumitrescu:
Distinct distances in planar point sets with forbidden 4-point patterns. Discret. Math. 343(9): 111967 (2020) - [j105]Ke Chen, Adrian Dumitrescu:
On Wegner's inequality for axis-parallel rectangles. Discret. Math. 343(12): 112091 (2020) - [j104]Ke Chen, Adrian Dumitrescu:
On the longest spanning tree with neighborhoods. Discret. Math. Algorithms Appl. 12(5): 2050067:1-2050067:16 (2020) - [j103]Ke Chen, Adrian Dumitrescu:
Selection Algorithms with Small Groups. Int. J. Found. Comput. Sci. 31(3): 355-369 (2020) - [j102]Adrian Dumitrescu, Ritankar Mandal:
New lower bounds for the number of pseudoline arrangements. J. Comput. Geom. 11(1): 60-92 (2020) - [j101]Adrian Dumitrescu, Anirban Ghosh, Csaba D. Tóth:
Online unit covering in Euclidean space. Theor. Comput. Sci. 809: 218-230 (2020) - [c88]Ke Chen, Adrian Dumitrescu:
Multiparty Selection. ISAAC 2020: 42:1-42:13 - [c87]Adrian Dumitrescu, Anirban Ghosh, Csaba D. Tóth:
Sparse Hop Spanners for Unit Disk Graphs. ISAAC 2020: 57:1-57:17 - [c86]Adrian Dumitrescu, Csaba D. Tóth:
On the Cover of the Rolling Stone. SODA 2020: 2575-2586 - [i43]Adrian Dumitrescu, Anirban Ghosh, Csaba D. Tóth:
Sparse Hop Spanners for Unit Disk Graphs. CoRR abs/2002.07840 (2020) - [i42]Ke Chen, Adrian Dumitrescu:
Multiparty Selection. CoRR abs/2004.05548 (2020)
2010 – 2019
- 2019
- [j100]Adrian Dumitrescu:
A Selectable Sloppy Heap. Algorithms 12(3): 58 (2019) - [j99]Adrian Dumitrescu:
A product inequality for extreme distances. Comput. Geom. 85 (2019) - [j98]Adrian Dumitrescu:
Distinct distances and arithmetic progressions. Discret. Appl. Math. 256: 38-41 (2019) - [j97]Adrian Dumitrescu, Minghui Jiang:
Computational Geometry Column 69. SIGACT News 50(3): 75-90 (2019) - [c85]Adrian Dumitrescu:
Finding a Mediocre Player. CIAC 2019: 212-223 - [c84]Jean-Lou De Carufel, Adrian Dumitrescu, Wouter Meulemans, Tim Ophelders, Claire Pennarun, Csaba D. Tóth, Sander Verdonschot:
Convex Polygons in Cartesian Products. SoCG 2019: 22:1-22:17 - [c83]Adrian Dumitrescu:
A Product Inequality for Extreme Distances. SoCG 2019: 30:1-30:12 - [c82]Ke Chen, Adrian Dumitrescu, Wolfgang Mulzer, Csaba D. Tóth:
On the Stretch Factor of Polygonal Chains. MFCS 2019: 56:1-56:14 - [c81]Adrian Dumitrescu, Ritankar Mandal:
New Lower Bounds for the Number of Pseudoline Arrangements. SODA 2019: 410-425 - [i41]Adrian Dumitrescu:
Finding a Mediocre Player. CoRR abs/1901.09017 (2019) - [i40]Ke Chen, Adrian Dumitrescu, Wolfgang Mulzer, Csaba D. Tóth:
On the Stretch Factor of Polygonal Chains. CoRR abs/1906.10217 (2019) - [i39]Adrian Dumitrescu:
On the Shortest Separating Cycle. CoRR abs/1912.01541 (2019) - 2018
- [j96]Adrian Dumitrescu, Minghui Jiang:
Minimum rectilinear Steiner tree of n points in the unit square. Comput. Geom. 68: 253-261 (2018) - [j95]Adrian Dumitrescu, Minghui Jiang:
On the Number of Maximum Empty Boxes Amidst n Points. Discret. Comput. Geom. 59(3): 742-756 (2018) - [j94]Adrian Dumitrescu, Ritankar Mandal, Csaba D. Tóth:
Monotone Paths in Geometric Triangulations. Theory Comput. Syst. 62(6): 1490-1524 (2018) - [j93]Adrian Dumitrescu:
Computational Geometry Column 68. SIGACT News 49(4): 46-54 (2018) - [c80]Adrian Dumitrescu, Anirban Ghosh, Csaba D. Tóth:
Online Unit Covering in Euclidean Space. COCOA 2018: 609-623 - [c79]Ke Chen, Adrian Dumitrescu:
On the Longest Spanning Tree with Neighborhoods. FAW 2018: 15-28 - [i38]Adrian Dumitrescu, Ritankar Mandal:
New Lower Bounds for the Number of Pseudoline Arrangements. CoRR abs/1809.03619 (2018) - [i37]Jean-Lou De Carufel, Adrian Dumitrescu, Wouter Meulemans, Tim Ophelders, Claire Pennarun, Csaba D. Tóth, Sander Verdonschot:
Convex Polygons in Cartesian Products. CoRR abs/1812.11332 (2018) - 2017
- [j92]Adrian Dumitrescu, Csaba D. Tóth:
Convex Polygons in Geometric Triangulations. Comb. Probab. Comput. 26(5): 641-659 (2017) - [j91]Adrian Dumitrescu, Anirban Ghosh, Masud Hasan:
Cutting out polygon collections with a saw. Discret. Appl. Math. 228: 98-108 (2017) - [j90]Kevin Balas, Adrian Dumitrescu, Csaba D. Tóth:
Anchored rectangle and square packings. Discret. Optim. 26: 131-162 (2017) - [j89]Mark de Berg, Adrian Dumitrescu, Khaled M. Elbassioni:
Guest Editors' Foreword. Int. J. Comput. Geom. Appl. 27(1-2): 1-2 (2017) - [j88]Khaled M. Elbassioni, Adrian Dumitrescu:
Computational Geometry Column 66. SIGACT News 48(4): 57-74 (2017) - [c78]Adrian Dumitrescu:
On the Shortest Separating Cycle. CCCG 2017: 68-72 - [c77]Adrian Dumitrescu, Csaba D. Tóth:
A Problem on Track Runners. CCCG 2017: 198-201 - [c76]Adrian Dumitrescu, Csaba D. Tóth:
Online Unit Clustering in Higher Dimensions. WAOA 2017: 238-252 - [i36]Adrian Dumitrescu, Joseph S. B. Mitchell:
Approximation algorithms for TSP with neighborhoods in the plane. CoRR abs/1703.01640 (2017) - [i35]Adrian Dumitrescu, Csaba D. Tóth:
Online unit clustering in higher dimensions. CoRR abs/1708.02662 (2017) - [i34]Ke Chen, Adrian Dumitrescu:
On the Longest Spanning Tree with Neighborhoods. CoRR abs/1712.03297 (2017) - 2016
- [j87]Adrian Dumitrescu, Anirban Ghosh:
Lattice spanners of low degree. Discret. Math. Algorithms Appl. 8(3): 1650051:1-1650051:19 (2016) - [j86]Adrian Dumitrescu, Maarten Löffler, André Schulz, Csaba D. Tóth:
Counting Carambolas. Graphs Comb. 32(3): 923-942 (2016) - [j85]Adrian Dumitrescu, Anirban Ghosh:
Lower Bounds on the Dilation of Plane Spanners. Int. J. Comput. Geom. Appl. 26(2): 89-110 (2016) - [j84]Adrian Dumitrescu:
Computational Geometry Column 64. SIGACT News 47(4): 44-47 (2016) - [j83]Adrian Dumitrescu, Csaba D. Tóth:
The Traveling Salesman Problem for Lines, Balls, and Planes. ACM Trans. Algorithms 12(3): 43:1-43:29 (2016) - [c75]Adrian Dumitrescu, Anirban Ghosh:
Lower Bounds on the Dilation of Plane Spanners. CALDAM 2016: 139-151 - [c74]Adrian Dumitrescu, Anirban Ghosh:
Lattice Spanners of Low Degree. CALDAM 2016: 152-163 - [c73]Kevin Balas, Adrian Dumitrescu, Csaba D. Tóth:
Anchored Rectangle and Square Packings. SoCG 2016: 13:1-13:16 - [c72]Adrian Dumitrescu, Minghui Jiang:
On the Number of Maximum Empty Boxes Amidst n Points. SoCG 2016: 36:1-36:13 - [c71]Adrian Dumitrescu, Ritankar Mandal, Csaba D. Tóth:
Monotone Paths in Geometric Triangulations. IWOCA 2016: 411-422 - [r1]Adrian Dumitrescu, Csaba D. Tóth:
Binary Space Partitions. Encyclopedia of Algorithms 2016: 220-223 - [i33]Adrian Dumitrescu, Anirban Ghosh:
Lattice spanners of low degree. CoRR abs/1602.04381 (2016) - [i32]Kevin Balas, Adrian Dumitrescu, Csaba D. Tóth:
Anchored Rectangle and Square Packings. CoRR abs/1603.00060 (2016) - [i31]Adrian Dumitrescu:
A Selectable Sloppy Heap. CoRR abs/1607.07673 (2016) - [i30]Adrian Dumitrescu, Ritankar Mandal, Csaba D. Tóth:
Monotone Paths in Geometric Triangulations. CoRR abs/1608.04812 (2016) - [i29]Adrian Dumitrescu, Minghui Jiang:
Perfect vector sets, properly overlapping partitions, and largest empty box. CoRR abs/1608.06874 (2016) - 2015
- [j82]Adrian Dumitrescu, Csaba D. Tóth:
Packing anchored rectangles. Comb. 35(1): 39-61 (2015) - [j81]Adrian Dumitrescu, Minghui Jiang:
On the approximability of covering points by lines and related problems. Comput. Geom. 48(9): 703-717 (2015) - [j80]Adrian Dumitrescu, Minghui Jiang:
Systems of distant representatives in Euclidean space. J. Comb. Theory, Ser. A 134: 36-50 (2015) - [j79]Adrian Dumitrescu, Minghui Jiang, Csaba D. Tóth:
Computing Opaque Interior Barriers à la Shermer. SIAM J. Discret. Math. 29(3): 1372-1386 (2015) - [j78]Bernardo M. Ábrego, Adrian Dumitrescu, Silvia Fernández, Csaba D. Tóth:
Computational Geometry Column 61. SIGACT News 46(2): 65-77 (2015) - [j77]Ke Chen, Adrian Dumitrescu:
Nonconvex cases for carpenter's rulers. Theor. Comput. Sci. 586: 12-25 (2015) - [c70]Adrian Dumitrescu, Anirban Ghosh, Masud Hasan:
On Collections of Polygons Cuttable with a Segment Saw. CALDAM 2015: 58-68 - [c69]Ke Chen, Adrian Dumitrescu:
Select with Groups of 3 or 4. WADS 2015: 189-199 - [c68]Adrian Dumitrescu, Csaba D. Tóth:
Convex Polygons in Geometric Triangulations. WADS 2015: 289-300 - [i28]Adrian Dumitrescu, Csaba D. Tóth:
Constant-Factor Approximation for TSP with Disks. CoRR abs/1506.07903 (2015) - [i27]Adrian Dumitrescu, Csaba D. Tóth:
A problem on track runners. CoRR abs/1508.07289 (2015) - [i26]Adrian Dumitrescu, Anirban Ghosh:
Lower bounds on the dilation of plane spanners. CoRR abs/1509.07181 (2015) - 2014
- [j76]Adrian Dumitrescu, Minghui Jiang, János Pach:
Opaque Sets. Algorithmica 69(2): 315-334 (2014) - [j75]Adrian Dumitrescu, Anirban Ghosh, Csaba D. Tóth:
On Fence Patrolling by Mobile Agents. Electron. J. Comb. 21(3): P3.4 (2014) - [j74]Adrian Dumitrescu, Joseph S. B. Mitchell, Pawel Zylinski:
Watchman routes for lines and line segments. Comput. Geom. 47(4): 527-538 (2014) - [j73]Adrian Dumitrescu, Dániel Gerbner, Balázs Keszegh, Csaba D. Tóth:
Covering Paths for Planar Point Sets. Discret. Comput. Geom. 51(2): 462-484 (2014) - [j72]Adrian Dumitrescu, Joseph S. B. Mitchell, Pawel Zylinski:
The Minimum Guarding Tree Problem. Discret. Math. Algorithms Appl. 6(1) (2014) - [j71]Adrian Dumitrescu, Sariel Har-Peled, Csaba D. Tóth:
Minimum Convex Partitions and Maximum Empty Polytopes. J. Comput. Geom. 5(1): 86-103 (2014) - [j70]Adrian Dumitrescu, Csaba D. Tóth:
Computational geometry column 59. SIGACT News 45(2): 68-72 (2014) - [j69]Adrian Dumitrescu, Minghui Jiang:
Computational Geometry Column 60. SIGACT News 45(4): 76-82 (2014) - [c67]Adrian Dumitrescu, Minghui Jiang, Csaba D. Tóth:
Computing Opaque Interior Barriers à la Shermer. APPROX-RANDOM 2014: 128-143 - [c66]Adrian Dumitrescu, Csaba D. Tóth:
Covering Grids by Trees. CCCG 2014 - [c65]Adrian Dumitrescu, Minghui Jiang:
The Opaque Square. SoCG 2014: 529 - [c64]Ke Chen, Adrian Dumitrescu:
Nonconvex Cases for Carpenter's Rulers. FUN 2014: 89-99 - [i25]Adrian Dumitrescu, Anirban Ghosh, Csaba D. Tóth:
On Fence Patrolling by Mobile Agents. CoRR abs/1401.6070 (2014) - [i24]Ke Chen, Adrian Dumitrescu:
Select with Groups of $3$ or $4$ Takes Linear Time. CoRR abs/1409.3600 (2014) - [i23]Adrian Dumitrescu, Maarten Löffler, André Schulz, Csaba D. Tóth:
Counting Carambolas. CoRR abs/1410.1579 (2014) - [i22]Adrian Dumitrescu, Csaba D. Tóth:
Convex polygons in geometric triangulations. CoRR abs/1411.1303 (2014) - 2013
- [j68]Adrian Dumitrescu, Minghui Jiang:
On the Largest Empty Axis-Parallel Box Amidst n Points. Algorithmica 66(2): 225-248 (2013) - [j67]Adrian Dumitrescu, Minghui Jiang:
On reconfiguration of disks in the plane and related problems. Comput. Geom. 46(3): 191-202 (2013) - [j66]Adrian Dumitrescu, Minghui Jiang:
Maximal Empty Boxes Amidst Random Points. Comb. Probab. Comput. 22(4): 477-498 (2013) - [j65]Adrian Dumitrescu, Masud Hasan:
Cutting out Polygons with a Circular SAW. Int. J. Comput. Geom. Appl. 23(2): 127-140 (2013) - [j64]Adrian Dumitrescu:
Metric inequalities for polygons. J. Comput. Geom. 4(1): 79-93 (2013) - [j63]Adrian Dumitrescu, André Schulz, Adam Sheffer, Csaba D. Tóth:
Bounds on the Maximum Multiplicity of Some Common Geometric Graphs. SIAM J. Discret. Math. 27(2): 802-826 (2013) - [j62]Adrian Dumitrescu, Minghui Jiang:
Computational geometry column 56. SIGACT News 44(2): 80-87 (2013) - [j61]Adrian Dumitrescu, Minghui Jiang:
Computational geometry column 58. SIGACT News 44(4): 73-78 (2013) - [c63]Adrian Dumitrescu, Csaba D. Tóth:
On the Total Perimeter of Homothetic Convex Bodies in a Convex Container. APPROX-RANDOM 2013: 96-109 - [c62]Ke Chen, Adrian Dumitrescu, Anirban Ghosh:
On Fence Patrolling by Mobile Agents. CCCG 2013 - [c61]Adrian Dumitrescu, Minghui Jiang:
Systems of distant representatives in euclidean space. SoCG 2013: 441-448 - [c60]Adrian Dumitrescu, Csaba D. Tóth:
The traveling salesman problem for lines, balls and planes. SODA 2013: 828-843 - [i21]Adrian Dumitrescu, Dániel Gerbner, Balázs Keszegh, Csaba D. Tóth:
Covering Paths for Planar Point Sets. CoRR abs/1303.0262 (2013) - [i20]Adrian Dumitrescu, Csaba D. Tóth:
The traveling salesman problem for lines, balls and planes. CoRR abs/1303.6659 (2013) - [i19]Adrian Dumitrescu, Minghui Jiang:
The opaque square. CoRR abs/1311.3323 (2013) - [i18]Adrian Dumitrescu, Minghui Jiang:
On the approximability of covering points by lines and related problems. CoRR abs/1312.2549 (2013) - 2012
- [j60]Adrian Dumitrescu, Minghui Jiang:
Minimum-Perimeter Intersecting Polygons. Algorithmica 63(3): 602-615 (2012) - [j59]Adrian Dumitrescu, János Pach, Géza Tóth:
Drawing Hamiltonian Cycles with no Large Angles. Electron. J. Comb. 19(2): P31 (2012) - [j58]Adrian Dumitrescu, Csaba D. Tóth:
Watchman tours for polygons with holes. Comput. Geom. 45(7): 326-333 (2012) - [j57]Adrian Dumitrescu:
Going around in circles. Comput. Geom. 45(7): 370-381 (2012) - [j56]Adrian Dumitrescu:
The Traveling Salesman Problem for Lines and Rays in the Plane. Discret. Math. Algorithms Appl. 4(4) (2012) - [j55]Adrian Dumitrescu, Minghui Jiang:
Dispersion in Disks. Theory Comput. Syst. 51(2): 125-142 (2012) - [j54]Adrian Dumitrescu:
Computational geometry column 53. SIGACT News 43(2): 78-83 (2012) - [j53]Adrian Dumitrescu, Csaba D. Tóth:
Computational geometry column 54. SIGACT News 43(4): 90-97 (2012) - [c59]Adrian Dumitrescu, Minghui Jiang:
Maximal Empty Boxes Amidst Random Points. APPROX-RANDOM 2012: 529-540 - [c58]Adrian Dumitrescu, Günter Rote, Csaba D. Tóth:
Monotone Paths in Planar Convex Subdivisions. COCOON 2012: 240-251 - [c57]Adrian Dumitrescu, Csaba D. Tóth:
Covering Paths for Planar Point Sets. Graph Drawing 2012: 303-314 - [c56]Adrian Dumitrescu, Csaba D. Tóth:
Packing anchored rectangles. SODA 2012: 294-305 - [c55]Adrian Dumitrescu, Joseph S. B. Mitchell, Pawel Zylinski:
Watchman Routes for Lines and Segments. SWAT 2012: 36-47 - [c54]Adrian Dumitrescu, Sariel Har-Peled, Csaba D. Tóth:
Minimum Convex Partitions and Maximum Empty Polytopes. SWAT 2012: 213-224 - [i17]Adrian Dumitrescu:
The traveling salesman problem for lines and rays in the plane. CoRR abs/1204.5828 (2012) - 2011
- [j52]Adrian Dumitrescu, Csaba D. Tóth:
Minimum Weight Convex Steiner Partitions. Algorithmica 60(3): 627-652 (2011) - [j51]Adrian Dumitrescu, Minghui Jiang:
Sweeping Points. Algorithmica 60(3): 703-717 (2011) - [j50]Adrian Dumitrescu, Minghui Jiang:
Piercing Translates and Homothets of a Convex Body. Algorithmica 61(1): 94-115 (2011) - [j49]Adrian Dumitrescu, Minghui Jiang:
Constrained k-center and movement to independence. Discret. Appl. Math. 159(8): 859-865 (2011) - [j48]Adrian Dumitrescu, Minghui Jiang:
Sweeping an oval to a vanishing point. Discret. Appl. Math. 159(14): 1436-1442 (2011) - [j47]Adrian Dumitrescu, Minghui Jiang:
The Forest Hiding Problem. Discret. Comput. Geom. 45(3): 529-552 (2011) - [j46]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) - [j45]Adrian Dumitrescu, János Pach:
Minimum Clique Partition in Unit Disk Graphs. Graphs Comb. 27(3): 399-411 (2011) - [j44]Adrian Dumitrescu:
Approximate Euclidean Ramsey Theorems. J. Comput. Geom. 2(1): 16-29 (2011) - [c53]Adrian Dumitrescu, Minghui Jiang, János Pach:
Opaque Sets. APPROX-RANDOM 2011: 194-205 - [c52]Adrian Dumitrescu, Evan Hilscher:
Animal Testing. ISAAC 2011: 220-229 - [c51]Adrian Dumitrescu, Masud Hasan:
Cutting Out Polygons with a Circular Saw. ISAAC 2011: 230-239 - [c50]Adrian Dumitrescu, André Schulz, Adam Sheffer, Csaba D. Tóth:
Bounds on the maximum multiplicity of some common geometric graphs. STACS 2011: 637-648 - [i16]Adrian Dumitrescu, Minghui Jiang:
Sweeping an oval to a vanishing point. CoRR abs/1101.4667 (2011) - [i15]