default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
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
- 2024
[j117]József Balogh, Felix Christian Clemen, Adrian Dumitrescu:
On a Traveling Salesman Problem for Points in the Unit Cube. Algorithmica 86(9): 3054-3078 (2024)- [j116]Adrian Dumitrescu, Josef Tkadlec:
Piercing All Translates of a Set of Axis-Parallel Rectangles. Electron. J. Comb. 31(1) (2024) - [j115]Adrian Dumitrescu
:
The Dirac-Goodman-Pollack Conjecture. Discret. Comput. Geom. 72(2): 728-742 (2024) - [j114]Adrian Dumitrescu, Csaba D. Tóth:
Observation routes and external watchman routes. Theor. Comput. Sci. 1019: 114818 (2024) - [c93]Adrian Dumitrescu, János Pach:
Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs. GD 2024: 9:1-9:10 - [i56]Adrian Dumitrescu, János Pach:
Partitioning complete geometric graphs into plane subgraphs. CoRR abs/2405.17172 (2024) - [i55]Péter Ágoston, Adrian Dumitrescu, Arsenii Sagdeev, Karamjeet Singh, Ji Zeng:
Maximizing the Maximum Degree in Ordered Yao Graphs. CoRR abs/2406.08913 (2024) - 2023
- [c92]Adrian Dumitrescu, Andrzej Lingas:
Finding Small Complete Subgraphs Efficiently. IWOCA 2023: 185-196 - [c91]Adrian Dumitrescu, Csaba D. Tóth:
Maximal Distortion of Geodesic Diameters in Polygonal Domains. IWOCA 2023: 197-208 - [c90]Adrian Dumitrescu, Csaba D. Tóth:
Observation Routes and External Watchman Routes. WADS 2023: 401-415 - [i54]Adrian Dumitrescu:
Two-sided convexity testing with certificates. CoRR abs/2302.07423 (2023) - [i53]Adrian Dumitrescu, Csaba D. Tóth:
Maximal Distortion of Geodesic Diameters in Polygonal Domains. CoRR abs/2304.03484 (2023) - [i52]Adrian Dumitrescu, Csaba D. Tóth:
Observation Routes and External Watchman Routes. CoRR abs/2306.11522 (2023) - [i51]Adrian Dumitrescu, Andrzej Lingas:
Finding Small Complete Subgraphs Efficiently. CoRR abs/2308.11146 (2023) - [i50]József Balogh, Felix Christian Clemen, Adrian Dumitrescu:
On a Traveling Salesman Problem for Points in the Unit Cube. CoRR abs/2310.02839 (2023) - [i49]Adrian Dumitrescu, János Pach, Géza Tóth:
Two trees are better than one. CoRR abs/2312.09916 (2023) - 2022
- [j113]Adrian Dumitrescu, Csaba D. Tóth:
Online Unit Clustering and Unit Covering in Higher Dimensions. Algorithmica 84(5): 1213-1231 (2022) - [j112]Adrian Dumitrescu, Anirban Ghosh, Csaba D. Tóth:
Sparse hop spanners for unit disk graphs. Comput. Geom. 100: 101808 (2022) - [i48]Adrian Dumitrescu, Josef Tkadlec:
Lattice and Non-lattice Piercing of Axis-Parallel Rectangles: Exact Algorithms and a Separation Result. CoRR abs/2204.10385 (2022) - [i47]Adrian Dumitrescu, Csaba D. Tóth:
Finding Points in Convex Position in Density-Restricted Sets. CoRR abs/2205.03437 (2022) - [i46]Adrian Dumitrescu:
Peeling Sequences. CoRR abs/2211.05968 (2022) - 2021
- [j111]Adrian Dumitrescu:
Finding a mediocre player. Discret. Appl. Math. 293: 15-24 (2021) - [j110]Ke Chen, Adrian Dumitrescu, Wolfgang Mulzer, Csaba D. Tóth:
On the Stretch Factor of Polygonal Chains. SIAM J. Discret. Math. 35(3): 1592-1614 (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
- [j109]Adrian Dumitrescu, Csaba D. Tóth:
Problems on track runners. Comput. Geom. 88: 101611 (2020) - [j108]Adrian Dumitrescu:
On the shortest separating cycle. Comput. Geom. 88: 101612 (2020) - [j107]Adrian Dumitrescu:
Distinct distances in planar point sets with forbidden 4-point patterns. Discret. Math. 343(9): 111967 (2020) - [j106]Ke Chen, Adrian Dumitrescu:
On Wegner's inequality for axis-parallel rectangles. Discret. Math. 343(12): 112091 (2020) - [j105]Ke Chen, Adrian Dumitrescu:
On the longest spanning tree with neighborhoods. Discret. Math. Algorithms Appl. 12(5): 2050067:1-2050067:16 (2020) - [j104]Ke Chen, Adrian Dumitrescu:
Selection Algorithms with Small Groups. Int. J. Found. Comput. Sci. 31(3): 355-369 (2020) - [j103]Adrian Dumitrescu, Ritankar Mandal:
New lower bounds for the number of pseudoline arrangements. J. Comput. Geom. 11(1): 60-92 (2020) - [j102]Jean-Lou De Carufel, Adrian Dumitrescu, Wouter Meulemans, Tim Ophelders, Claire Pennarun, Csaba D. Tóth, Sander Verdonschot:
Convex polygons in cartesian products. J. Comput. Geom. 11(2): 205-233 (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 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): 3 (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): 31 (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. GD 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]Adrian Dumitrescu, Csaba D. Tóth:
Packing anchored rectangles. CoRR abs/1107.5102 (2011) - [i14]Adrian Dumitrescu, Sariel Har-Peled, Csaba D. Tóth:
Minimum Convex Partitions and Maximum Empty Polytopes. CoRR abs/1112.1124 (2011) - 2010
- [j43]Sergey Bereg, Adrian Dumitrescu, Minghui Jiang:
On Covering Problems of Rado. Algorithmica 57(3): 538-561 (2010) - [j42]Adrian Dumitrescu, Csaba D. Tóth:
Long Non-crossing Configurations in the Plane. Discret. Comput. Geom. 44(4): 727-752 (2010) - [j41]Adrian Dumitrescu, Minghui Jiang:
Monochromatic simplices of any volume. Discret. Math. 310(4): 956-960 (2010) - [j40]Adrian Dumitrescu, Evan Hilscher:
On convexification of polygons by pops. Discret. Math. 310(19): 2542-2545 (2010) - [j39]Sergey Bereg, Adrian Dumitrescu, Minghui Jiang:
Maximum Area Independent Sets in Disk Intersection Graphs. Int. J. Comput. Geom. Appl. 20(2): 105-118 (2010) - [j38]Adrian Dumitrescu, Howi Kok, Ichiro Suzuki, Pawel Zylinski:
Vision-Based Pursuit-Evasion in a Grid. SIAM J. Discret. Math. 24(3): 1177-1204 (2010) - [c49]Adrian Dumitrescu, Csaba D. Tóth:
Watchman tours for polygons with holes. CCCG 2010: 113-116 - [c48]Adrian Dumitrescu:
Approximate euclidean ramsey theorems. CCCG 2010: 131-134 - [c47]Adrian Dumitrescu, Minghui Jiang:
Constrained k-center and movement to independence. CCCG 2010: 233-236 - [c46]Adrian Dumitrescu:
The traveling salesman problem for lines and rays in the plane. CCCG 2010: 257-260 - [c45]Adrian Dumitrescu, Evan Hilscher:
Convexification of polygons by length preserving transformations. SCG 2010: 113-114 - [c44]Adrian Dumitrescu, Minghui Jiang:
Minimum-Perimeter Intersecting Polygons. LATIN 2010: 433-445 - [c43]Adrian Dumitrescu, Minghui Jiang:
The Forest Hiding Problem. SODA 2010: 1566-1579 - [c42]Adrian Dumitrescu, Minghui Jiang:
Dispersion in Unit Disks. STACS 2010: 299-310 - [c41]Adrian Dumitrescu, Csaba D. Tóth:
Long Non-crossing Configurations in the Plane. STACS 2010: 311-322 - [i13]Adrian Dumitrescu:
Approximate Euclidean Ramsey theorems. CoRR abs/1004.1654 (2010) - [i12]Adrian Dumitrescu, János Pach:
Opaque sets. CoRR abs/1005.2218 (2010) - [i11]Adrian Dumitrescu, Minghui Jiang:
Coloring translates and homothets of a convex body. CoRR abs/1008.1360 (2010) - [i10]Adrian Dumitrescu, André Schulz, Adam Sheffer, Csaba D. Tóth:
Bounds on the maximum multiplicity of some common geometric graphs. CoRR abs/1012.5664 (2010)
2000 – 2009
- 2009
- [j37]Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García Olaverri, Clemens Huemer, Ferran Hurtado, Mikio Kano, Alberto Márquez, David Rappaport, Shakhar Smorodinsky, Diane L. Souvaine, Jorge Urrutia, David R. Wood:
Compatible geometric matchings. Comput. Geom. 42(6-7): 617-626 (2009) - [j36]Sergey Bereg, Prosenjit Bose, Adrian Dumitrescu, Ferran Hurtado, Pavel Valtr:
Traversing a Set of Points with a Minimum Number of Turns. Discret. Comput. Geom. 41(4): 513-532 (2009) - [j35]Adrian Dumitrescu, Csaba D. Tóth, Guangwu Xu:
On stars and Steiner stars. Discret. Optim. 6(3): 324-332 (2009) - [j34]Adrian Dumitrescu, Micha Sharir, Csaba D. Tóth:
Extremal problems on triangle areas in two and three dimensions. J. Comb. Theory A 116(7): 1177-1198 (2009) - [j33]Adrian Dumitrescu, Csaba D. Tóth:
Light orthogonal networks with constant geometric dilation. J. Discrete Algorithms 7(1): 112-129 (2009) - [c40]Adrian Dumitrescu, Minghui Jiang:
Piercing Translates and Homothets of a Convex Body. ESA 2009: 131-142 - [c39]Adrian Dumitrescu, János Pach, Géza Tóth:
Drawing Hamiltonian Cycles with No Large Angles. GD 2009: 3-14 - [c38]Adrian Dumitrescu, Csaba D. Tóth:
New Bounds on the Average Distance from the Fermat-Weber Center of a Planar Convex Body. ISAAC 2009: 132-141 - [c37]Adrian Dumitrescu, Csaba D. Tóth, Guangwu Xu:
On stars and Steiner stars: II. SODA 2009: 311-317 - [c36]Adrian Dumitrescu, Minghui Jiang:
On Reconfiguration of Disks in the Plane and Related Problems. WADS 2009: 254-265 - [i9]Adrian Dumitrescu, János Pach:
Minimum clique partition in unit disk graphs. CoRR abs/0909.1552 (2009) - [i8]Adrian Dumitrescu, Minghui Jiang:
On the largest empty axis-parallel box amidst n points. CoRR abs/0909.3127 (2009) - [i7]Adrian Dumitrescu, Csaba D. Tóth:
Long non-crossing configurations in the plane. CoRR abs/0909.4094 (2009) - [i6]Adrian Dumitrescu, Minghui Jiang:
Piercing translates and homothets of a convex body. CoRR abs/0910.4172 (2009) - [i5]Adrian Dumitrescu, Evan Hilscher:
On convexification of polygons by pops. CoRR abs/0911.4146 (2009) - [i4]Adrian Dumitrescu, Minghui Jiang:
Dispersion in unit disks. CoRR abs/0912.2125 (2009) - [i3]Adrian Dumitrescu:
Metric inequalities for polygons. CoRR abs/0912.3929 (2009) - 2008
- [j32]Adrian Dumitrescu, Minghui Jiang:
On a Covering Problem for Equilateral Triangles. Electron. J. Comb. 15(1) (2008) - [j31]Adrian Dumitrescu, Csaba D. Tóth:
On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space. Comb. Probab. Comput. 17(2): 203-224 (2008) - [j30]Adrian Dumitrescu:
On distinct distances and lambda-free point sets. Discret. Math. 308(24): 6533-6538 (2008) - [j29]Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García Olaverri, Clemens Huemer, Ferran Hurtado, Mikio Kano, Alberto Márquez, David Rappaport, Shakhar Smorodinsky, Diane L. Souvaine, Jorge Urrutia, David R. Wood:
Compatible Geometric Matchings. Electron. Notes Discret. Math. 31: 201-206 (2008) - [j28]Sergey Bereg, Adrian Dumitrescu, János Pach:
Sliding Disks in the Plane. Int. J. Comput. Geom. Appl. 18(5): 373-387 (2008) - [j27]Adrian Dumitrescu:
On distinct distances among points in general position and other related problems. Period. Math. Hung. 57(2): 165-176 (2008) - [j26]Gruia Calinescu, Adrian Dumitrescu, János Pach:
Reconfigurations in Graphs and Grids. SIAM J. Discret. Math. 22(1): 124-138 (2008) - [j25]Adrian Dumitrescu, Ichiro Suzuki, Pawel Zylinski:
Offline variants of the "lion and man" problem: - Some problems and techniques for measuring crowdedness and for safe path planning - . Theor. Comput. Sci. 399(3): 220-235 (2008) - [c35]Adrian Dumitrescu, Minghui Jiang:
Sweeping Points. APPROX-RANDOM 2008: 63-76 - [c34]Adrian Dumitrescu:
On distinct distances among points in general position and other related problems. CCCG 2008 - [c33]Adrian Dumitrescu, Minghui Jiang:
Monochromatic simplices of any volume. CCCG 2008 - [c32]Adrian Dumitrescu, Micha Sharir, Csaba D. Tóth:
Extremal problems on triangle areas in two and three dimensions. SCG 2008: 208-217 - [c31]Adrian Dumitrescu, Csaba D. Tóth:
Minimum weight convex Steiner partitions. SODA 2008: 581-590 - [c30]Adrian Dumitrescu, Csaba D. Tóth:
On stars and Steiner stars. SODA 2008: 1233-1240 - [c29]Adrian Dumitrescu, Howi Kok, Ichiro Suzuki, Pawel Zylinski:
Vision-Based Pursuit-Evasion in a Grid. SWAT 2008: 53-64 - [c28]Sergey Bereg, Adrian Dumitrescu, Minghui Jiang:
On Covering Problems of Rado. SWAT 2008: 294-305 - [i2]Adrian Dumitrescu, Csaba D. Tóth, Guangwu Xu:
On stars and Steiner stars. II. CoRR abs/0806.4858 (2008) - 2007
- [j24]Adrian Dumitrescu, Guangwu Xu:
On a query algorithm for a divisibility problem. ACM Commun. Comput. Algebra 41(4): 122-124 (2007) - [j23]Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein, Günter Rote:
On the geometric dilation of closed curves, graphs, and point sets. Comput. Geom. 36(1): 16-38 (2007) - [j22]Adrian Dumitrescu, Csaba D. Tóth:
Analysis of two Sweep-line Algorithms for Constructing Spanning Trees and Steiner Trees. J. Univers. Comput. Sci. 13(11): 1615-1627 (2007) - [c27]Sergey Bereg, Prosenjit Bose, Adrian Dumitrescu, Ferran Hurtado, Pavel Valtr:
Traversing a set of points with a minimum number of turns. SCG 2007: 46-55 - [c26]Adrian Dumitrescu, Ichiro Suzuki, Pawel Zylinski:
Offline variants of the "lion and man" problem. SCG 2007: 102-111 - [c25]Adrian Dumitrescu, Csaba D. Tóth:
Distinct Triangle Areas in a Planar Point Set. IPCO 2007: 119-129 - [c24]Adrian Dumitrescu, Csaba D. Tóth:
On the number of tetrahedra with minimum, unit, and distinct volumes in three-space. SODA 2007: 1114-1123 - [c23]Adrian Dumitrescu, Csaba D. Tóth:
Light Orthogonal Networks with Constant Geometric Dilation. STACS 2007: 175-187 - 2006
- [j21]Sergey Bereg, Adrian Dumitrescu:
The Lifting Model for Reconfiguration. Discret. Comput. Geom. 35(4): 653-669 (2006) - [j20]Adrian Dumitrescu:
On Distinct Distances from a Vertex of a Convex Polygon. Discret. Comput. Geom. 36(4): 503-509 (2006) - [j19]Adrian Dumitrescu, János Pach:
Pushing Squares Around. Graphs Comb. 22(1): 37-50 (2006) - [c22]Gruia Calinescu, Adrian Dumitrescu, János Pach:
Reconfigurations in Graphs and Grids. LATIN 2006: 262-273 - 2005
- [j18]Adrian Dumitrescu:
On some monotone path problems in line arrangements. Comput. Geom. 32(1): 13-25 (2005) - [j17]Gabriela Araujo, Adrian Dumitrescu, Ferran Hurtado, Marc Noy, Jorge Urrutia:
On the chromatic number of some geometric type Kneser graphs. Comput. Geom. 32(1): 59-69 (2005) - [j16]Adrian Dumitrescu:
Monotone Paths in Line Arrangements with a Small Number of Directions. Discret. Comput. Geom. 33(4): 687-697 (2005) - [j15]Gruia Calinescu, Adrian Dumitrescu, Howard J. Karloff, Peng-Jun Wan:
Separating Points by Axis-parallel Lines. Int. J. Comput. Geom. Appl. 15(6): 575-590 (2005) - [j14]Adrian Dumitrescu:
A Remark on the Erdős-Szekeres Theorem. Am. Math. Mon. 112(10): 921-924 (2005) - [c21]Sergey Bereg, Adrian Dumitrescu:
The lifting model for reconfiguration. SCG 2005: 55-62 - [c20]Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein, Günter Rote:
On Geometric Dilation and Halving Chords. WADS 2005: 244-255 - [i1]Adrian Dumitrescu, Ansgar Grüne, Günter Rote:
Improved lower bound on the geometric dilation of point sets. EuroCG 2005: 37-40 - 2004
- [j13]Adrian Dumitrescu:
An approximation algorithm for cutting out convex polygons. Comput. Geom. 29(3): 223-231 (2004) - [j12]Adrian Dumitrescu:
The cost of cutting out convex n-gons. Discret. Appl. Math. 143(1-3): 353-358 (2004) - [j11]Adrian Dumitrescu, Joseph S. B. Mitchell, Micha Sharir:
Binary Space Partitions for Axis-Parallel Segments, Rectangles, and Hyperrectangles. Discret. Comput. Geom. 31(2): 207-227 (2004) - [j10]Adrian Dumitrescu, Ichiro Suzuki, Masafumi Yamashita:
Formations for Fast Locomotion of Metamorphic Robotic Systems. Int. J. Robotics Res. 23(6): 583-593 (2004) - [j9]Adrian Dumitrescu, Sumanta Guha:
Extreme Distances in Multicolored Point Sets. J. Graph Algorithms Appl. 8: 27-38 (2004) - [j8]Adrian Dumitrescu, Ichiro Suzuki, Masafumi Yamashita:
Motion planning for metamorphic systems: feasibility, decidability, and distributed reconfiguration. IEEE Trans. Robotics 20(3): 409-418 (2004) - [c19]Adrian Dumitrescu:
A remark on the Erdös-Szekeres theorem. CCCG 2004: 2-3 - [c18]Gruia Calinescu, Adrian Dumitrescu, Peng-Jun Wan:
Separating points by axis-parallel lines. CCCG 2004: 7-10 - [c17]Adrian Dumitrescu, Günter Rote:
On the Fréchet distance of a set of curves. CCCG 2004: 162-165 - [c16]Adrian Dumitrescu:
On some monotone path problems in line arrangements. CCCG 2004: 200-203 - [c15]Adrian Dumitrescu:
On distinct distances from a vertex of a convex polygon. SCG 2004: 57-60 - [c14]Adrian Dumitrescu, János Pach:
Pushing squares around. SCG 2004: 116-123 - [c13]Sergey Bereg, Adrian Dumitrescu, János Pach:
Sliding Disks in the Plane. JCDCG 2004: 37-47 - 2003
- [j7]Adrian Dumitrescu, Joseph S. B. Mitchell:
Approximation algorithms for TSP with neighborhoods in the plane. J. Algorithms 48(1): 135-159 (2003) - [c12]Adrian Dumitrescu:
Efficient Algorithms for Generation of Combinatorial Covering Suites. ISAAC 2003: 300-308 - [c11]Christine T. Cheng, Adrian Dumitrescu, Patrick J. Schroeder:
Generating Small Combinatorial Test Suites to Cover Input-Output Relationships. QSIC 2003: 76-82 - [c10]Adrian Dumitrescu:
An approximation algorithm for cutting out convex polygons. SODA 2003: 823-827 - 2002
- [j6]Adrian Dumitrescu, Géza Tóth:
Ramsey-Type Results for Unions of Comparability Graphs. Graphs Comb. 18(2): 245-251 (2002) - [j5]Adrian Dumitrescu, János Pach:
Partitioning Colored Point Sets into Monochromatic Parts. Int. J. Comput. Geom. Appl. 12(5): 401-412 (2002) - [c9]Adrian Dumitrescu, Sumanta Guha:
Extreme Distances in Multicolored Point Sets. International Conference on Computational Science (3) 2002: 14-25 - [c8]Adrian Dumitrescu, Ichiro Suzuki, Masafumi Yamashita:
High Speed Formations of Reconfigurable Modular Robotic Systems. ICRA 2002: 123-128 - 2001
- [j4]Adrian Dumitrescu, Rick Kaye:
Matching colored points in the plane: Some new results. Comput. Geom. 19(1): 69-85 (2001) - [j3]Adrian Dumitrescu, Bernd Gärtner, Samuele Pedroni, Emo Welzl:
Enumerating triangulation paths. Comput. Geom. 20(1-2): 3-12 (2001) - [j2]Adrian Dumitrescu, William L. Steiger:
Space-time trade-offs for some ranking and searching queries. Inf. Process. Lett. 79(5): 237-241 (2001) - [c7]Adrian Dumitrescu, Joseph S. B. Mitchell, Micha Sharir:
Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles. SCG 2001: 141-150 - [c6]Adrian Dumitrescu, Joseph S. B. Mitchell:
Approximation algorithms for TSP with neighborhoods in the plane. SODA 2001: 38-46 - [c5]Adrian Dumitrescu, János Pach:
Partitioning Colored Point Sets into Monochromatic Parts. WADS 2001: 264-275 - 2000
- [j1]Adrian Dumitrescu, William L. Steiger:
On a matching problem in the plane. Discret. Math. 211: 183-195 (2000) - [c4]Adrian Dumitrescu, Bernd Gärtner, Samuele Pedroni, Emo Welzl:
Enumerating Triangulation Paths. CCCG 2000
1990 – 1999
Coauthor Index
[j114] [c91] [c90] [i53] [i52] [j113] [j112] [i47] [j110] [j109] [j102] [j101] [c87] [c86] [i43] [c84] [c82] [i40] [j94] [c80] [i37] [j92] [j90] [c77] [c76] [i35] [j86] [j83] [c73] [c71] [r1] [i32] [i30] [j82] [j79] [j78] [c68] [i28] [i27] [j75] [j73] [j71] [j70] [c67] [c66] [i25] [i23] [i22] [j63] [c63] [c60] [i21] [i20] [j58] [j53] [c58] [c57] [c56] [c54] [j52] [j46] [c50] [i15] [i14] [j42] [c49] [c41] [i10] [j35] [j34] [j33] [c38] [c37] [i7] [j31] [c32] [c31] [c30] [i2] [j22] [c25] [c24] [c23]
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 2024-10-30 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
