Adrian Dumitrescu

Affiliations:
  • adriandumitrescu.org
  • Rutgers University, NJ, USA (Ph.D.)


According to our database1, Adrian Dumitrescu authored at least 160 papers between 1998 and 2024.

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

2024
Piercing All Translates of a Set of Axis-Parallel Rectangles.
Electron. J. Comb., 2024

2023
Two trees are better than one.
CoRR, 2023

Two-sided convexity testing with certificates.
CoRR, 2023

Observation Routes and External Watchman Routes.
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Maximal Distortion of Geodesic Diameters in Polygonal Domains.
Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

Finding Small Complete Subgraphs Efficiently.
Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

2022
Peeling Sequences.
CoRR, 2022

Finding Points in Convex Position in Density-Restricted Sets.
CoRR, 2022

Lattice and Non-lattice Piercing of Axis-Parallel Rectangles: Exact Algorithms and a Separation Result.
CoRR, 2022

Sparse hop spanners for unit disk graphs.
Comput. Geom., 2022

Online Unit Clustering and Unit Covering in Higher Dimensions.
Algorithmica, 2022

2021
On the Stretch Factor of Polygonal Chains.
SIAM J. Discret. Math., 2021

Finding a mediocre player.
Discret. Appl. Math., 2021

Finding Triangles or Independent Sets.
CoRR, 2021

2020
Online unit covering in Euclidean space.
Theor. Comput. Sci., 2020

New lower bounds for the number of pseudoline arrangements.
J. Comput. Geom., 2020

Convex polygons in cartesian products.
J. Comput. Geom., 2020

Selection Algorithms with Small Groups.
Int. J. Found. Comput. Sci., 2020

On the longest spanning tree with neighborhoods.
Discret. Math. Algorithms Appl., 2020

Distinct distances in planar point sets with forbidden 4-point patterns.
Discret. Math., 2020

On Wegner's inequality for axis-parallel rectangles.
Discret. Math., 2020

Problems on track runners.
Comput. Geom., 2020

On the shortest separating cycle.
Comput. Geom., 2020

On the Cover of the Rolling Stone.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Multiparty Selection.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

2019
Computational Geometry Column 69.
SIGACT News, 2019

Distinct distances and arithmetic progressions.
Discret. Appl. Math., 2019

A product inequality for extreme distances.
Comput. Geom., 2019

A Selectable Sloppy Heap.
Algorithms, 2019

2018
Computational Geometry Column 68.
SIGACT News, 2018

Monotone Paths in Geometric Triangulations.
Theory Comput. Syst., 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

2017
Computational Geometry Column 66.
SIGACT News, 2017

Guest Editors' Foreword.
Int. J. Comput. Geom. Appl., 2017

Anchored rectangle and square packings.
Discret. Optim., 2017

Cutting out polygon collections with a saw.
Discret. Appl. Math., 2017

Convex Polygons in Geometric Triangulations.
Comb. Probab. Comput., 2017

Online Unit Clustering in Higher Dimensions.
Proceedings of the Approximation and Online Algorithms - 15th International Workshop, 2017

A Problem on Track Runners.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016
Binary Space Partitions.
Encyclopedia of Algorithms, 2016

The Traveling Salesman Problem for Lines, Balls, and Planes.
ACM Trans. Algorithms, 2016

Computational Geometry Column 64.
SIGACT News, 2016

Lower Bounds on the Dilation of Plane Spanners.
Int. J. Comput. Geom. Appl., 2016

Counting Carambolas.
Graphs Comb., 2016

Lattice spanners of low degree.
Discret. Math. Algorithms Appl., 2016

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

2015
Nonconvex cases for carpenter's rulers.
Theor. Comput. Sci., 2015

Computational Geometry Column 61.
SIGACT News, 2015

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

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

Constant-Factor Approximation for TSP with Disks.
CoRR, 2015

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

Packing anchored rectangles.
Comb., 2015

Select with Groups of 3 or 4.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

On Collections of Polygons Cuttable with a Segment Saw.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2015

2014
Computational geometry column 59.
SIGACT News, 2014

Computational Geometry Column 60.
SIGACT News, 2014

Minimum Convex Partitions and Maximum Empty Polytopes.
J. Comput. Geom., 2014

The Minimum Guarding Tree Problem.
Discret. Math. Algorithms Appl., 2014

Covering Paths for Planar Point Sets.
Discret. Comput. Geom., 2014

Select with Groups of $3$ or $4$ Takes Linear Time.
CoRR, 2014

Watchman routes for lines and line segments.
Comput. Geom., 2014

On Fence Patrolling by Mobile Agents.
Electron. J. Comb., 2014

Opaque Sets.
Algorithmica, 2014

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

Covering Grids by Trees.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
Computational geometry column 58.
SIGACT News, 2013

Computational geometry column 56.
SIGACT News, 2013

Bounds on the Maximum Multiplicity of Some Common Geometric Graphs.
SIAM J. Discret. Math., 2013

Metric inequalities for polygons.
J. Comput. Geom., 2013

Cutting out Polygons with a Circular SAW.
Int. J. Comput. Geom. Appl., 2013

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

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

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

On Fence Patrolling by Mobile Agents.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

On the Total Perimeter of Homothetic Convex Bodies in a Convex Container.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012
Computational geometry column 54.
SIGACT News, 2012

Computational geometry column 53.
SIGACT News, 2012

Dispersion in Disks.
Theory Comput. Syst., 2012

The Traveling Salesman Problem for Lines and Rays in the Plane.
Discret. Math. Algorithms Appl., 2012

Watchman tours for polygons with holes.
Comput. Geom., 2012

Going around in circles.
Comput. Geom., 2012

Drawing Hamiltonian Cycles with no Large Angles.
Electron. J. Comb., 2012

Minimum-Perimeter Intersecting Polygons.
Algorithmica, 2012

Watchman Routes for Lines and Segments.
Proceedings of the Algorithm Theory - SWAT 2012, 2012

Covering Paths for Planar Point Sets.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

Monotone Paths in Planar Convex Subdivisions.
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

2011
Approximate Euclidean Ramsey Theorems.
J. Comput. Geom., 2011

Minimum Clique Partition in Unit Disk Graphs.
Graphs Comb., 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

Minimum Weight Convex Steiner Partitions.
Algorithmica, 2011

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

Sweeping Points.
Algorithmica, 2011

Animal Testing.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010
Vision-Based Pursuit-Evasion in a Grid.
SIAM J. Discret. Math., 2010

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

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

On convexification of polygons by pops.
Discret. Math., 2010

Long Non-crossing Configurations in the Plane.
Discret. Comput. Geom., 2010

Coloring translates and homothets of a convex body
CoRR, 2010

Opaque sets
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

Convexification of polygons by length preserving transformations.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009
Light orthogonal networks with constant geometric dilation.
J. Discrete Algorithms, 2009

Extremal problems on triangle areas in two and three dimensions.
J. Comb. Theory, Ser. A, 2009

On stars and Steiner stars.
Discret. Optim., 2009

Traversing a Set of Points with a Minimum Number of Turns.
Discret. Comput. Geom., 2009

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

On stars and Steiner stars: II.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

New Bounds on the Average Distance from the Fermat-Weber Center of a Planar Convex Body.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008
Offline variants of the "lion and man" problem: - Some problems and techniques for measuring crowdedness and for safe path planning - .
Theor. Comput. Sci., 2008

Reconfigurations in Graphs and Grids.
SIAM J. Discret. Math., 2008

On distinct distances among points in general position and other related problems.
Period. Math. Hung., 2008

Sliding Disks in the Plane.
Int. J. Comput. Geom. Appl., 2008

Compatible Geometric Matchings.
Electron. Notes Discret. Math., 2008

On distinct distances and lambda-free point sets.
Discret. Math., 2008

On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space.
Comb. Probab. Comput., 2008

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

On stars and Steiner stars.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007
Analysis of two Sweep-line Algorithms for Constructing Spanning Trees and Steiner Trees.
J. Univers. Comput. Sci., 2007

On the geometric dilation of closed curves, graphs, and point sets.
Comput. Geom., 2007

On a query algorithm for a divisibility problem.
ACM Commun. Comput. Algebra, 2007

Distinct Triangle Areas in a Planar Point Set.
Proceedings of the Integer Programming and Combinatorial Optimization, 2007

Offline variants of the "lion and man" problem.
Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

2006
Pushing Squares Around.
Graphs Comb., 2006

On Distinct Distances from a Vertex of a Convex Polygon.
Discret. Comput. Geom., 2006

The Lifting Model for Reconfiguration.
Discret. Comput. Geom., 2006

2005
A Remark on the Erdős-Szekeres Theorem.
Am. Math. Mon., 2005

Separating Points by Axis-parallel Lines.
Int. J. Comput. Geom. Appl., 2005

Monotone Paths in Line Arrangements with a Small Number of Directions.
Discret. Comput. Geom., 2005

On some monotone path problems in line arrangements.
Comput. Geom., 2005

On the chromatic number of some geometric type Kneser graphs.
Comput. Geom., 2005

On Geometric Dilation and Halving Chords.
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Improved lower bound on the geometric dilation of point sets.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

2004
Motion planning for metamorphic systems: feasibility, decidability, and distributed reconfiguration.
IEEE Trans. Robotics, 2004

Extreme Distances in Multicolored Point Sets.
J. Graph Algorithms Appl., 2004

Formations for Fast Locomotion of Metamorphic Robotic Systems.
Int. J. Robotics Res., 2004

Binary Space Partitions for Axis-Parallel Segments, Rectangles, and Hyperrectangles.
Discret. Comput. Geom., 2004

The cost of cutting out convex <i>n</i>-gons.
Discret. Appl. Math., 2004

An approximation algorithm for cutting out convex polygons.
Comput. Geom., 2004

On the Fréchet distance of a set of curves.
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

Separating points by axis-parallel lines.
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003
Approximation algorithms for TSP with neighborhoods in the plane.
J. Algorithms, 2003

Generating Small Combinatorial Test Suites to Cover Input-Output Relationships.
Proceedings of the 3rd International Conference on Quality Software (QSIC 2003), 2003

Efficient Algorithms for Generation of Combinatorial Covering Suites.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2002
Partitioning Colored Point Sets into Monochromatic Parts.
Int. J. Comput. Geom. Appl., 2002

Ramsey-Type Results for Unions of Comparability Graphs.
Graphs Comb., 2002

High Speed Formations of Reconfigurable Modular Robotic Systems.
Proceedings of the 2002 IEEE International Conference on Robotics and Automation, 2002

2001
Space-time trade-offs for some ranking and searching queries.
Inf. Process. Lett., 2001

Matching colored points in the plane: Some new results.
Comput. Geom., 2001

Enumerating triangulation paths.
Comput. Geom., 2001

2000
On a matching problem in the plane.
Discret. Math., 2000

1999
Ramsey-type results for unions of comparability graphs and convex sets inrestricted position.
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

On two lower bound constructions.
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

1998
Planar sets with few empty convex polygons.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998


  Loading...