Adrian Dumitrescu

According to our database1, Adrian Dumitrescu authored at least 224 papers between 1998 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Distinct distances and arithmetic progressions.
Discrete Applied Mathematics, 2019

On the Stretch Factor of Polygonal Chains.
CoRR, 2019

Finding a Mediocre Player.
CoRR, 2019

A Selectable Sloppy Heap.
Algorithms, 2019

New Lower Bounds for the Number of Pseudoline Arrangements.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

On the Stretch Factor of Polygonal Chains.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

A Product Inequality for Extreme Distances.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

Convex Polygons in Cartesian Products.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

Finding a Mediocre Player.
Proceedings of the Algorithms and Complexity - 11th International Conference, 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.
Discrete & Computational Geometry, 2018

Convex Polygons in Cartesian Products.
CoRR, 2018

New Lower Bounds for the Number of Pseudoline Arrangements.
CoRR, 2018

Minimum rectilinear Steiner tree of n points in the unit square.
Comput. Geom., 2018

On the Longest Spanning Tree with Neighborhoods.
Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

Online Unit Covering in Euclidean Space.
Proceedings of the Combinatorial Optimization and Applications, 2018

2017
Computational Geometry Column 66.
SIGACT News, 2017

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

Anchored rectangle and square packings.
Discrete Optimization, 2017

Cutting out polygon collections with a saw.
Discrete Applied Mathematics, 2017

Convex Polygons in Geometric Triangulations.
Combinatorics, Probability & Computing, 2017

On the Longest Spanning Tree with Neighborhoods.
CoRR, 2017

Online unit clustering in higher dimensions.
CoRR, 2017

Approximation algorithms for TSP with neighborhoods in the plane.
CoRR, 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

On the Shortest Separating Cycle.
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. Geometry Appl., 2016

Counting Carambolas.
Graphs and Combinatorics, 2016

Lattice spanners of low degree.
Discrete Math., Alg. and Appl., 2016

Monotone Paths in Geometric Triangulations.
CoRR, 2016

Lattice spanners of low degree.
CoRR, 2016

A Selectable Sloppy Heap.
CoRR, 2016

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

Anchored Rectangle and Square Packings.
CoRR, 2016

Monotone Paths in Geometric Triangulations.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

On the Number of Maximum Empty Boxes Amidst n Points.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

Anchored Rectangle and Square Packings.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

Lattice Spanners of Low Degree.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

Lower Bounds on the Dilation of Plane Spanners.
Proceedings of the Algorithms and Discrete Applied Mathematics, 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. Discrete Math., 2015

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

A problem on track runners.
CoRR, 2015

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

Lower bounds on the dilation of plane spanners.
CoRR, 2015

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

Packing anchored rectangles.
Combinatorica, 2015

Convex Polygons in Geometric Triangulations.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 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.
JoCG, 2014

The Minimum Guarding Tree Problem.
Discrete Math., Alg. and Appl., 2014

Covering Paths for Planar Point Sets.
Discrete & Computational Geometry, 2014

Convex polygons in geometric triangulations.
CoRR, 2014

Counting Carambolas.
CoRR, 2014

On Fence Patrolling by Mobile Agents.
CoRR, 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.
Electr. J. Comb., 2014

Opaque Sets.
Algorithmica, 2014

Nonconvex Cases for Carpenter's Rulers.
Proceedings of the Fun with Algorithms - 7th International Conference, 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

Computing Opaque Interior Barriers à la Shermer.
Proceedings of the Approximation, 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. Discrete Math., 2013

Metric inequalities for polygons.
JoCG, 2013

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

Maximal Empty Boxes Amidst Random Points.
Combinatorics, Probability & Computing, 2013

The traveling salesman problem for lines, balls and planes
CoRR, 2013

Covering Paths for Planar Point Sets
CoRR, 2013

On the approximability of covering points by lines and related problems.
CoRR, 2013

The opaque square.
CoRR, 2013

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

On the Largest Empty Axis-Parallel Box Amidst n Points.
Algorithmica, 2013

The traveling salesman problem for lines, balls and planes.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Systems of distant representatives in euclidean space.
Proceedings of the Symposuim on Computational Geometry 2013, 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.
Discrete Math., Alg. and Appl., 2012

The traveling salesman problem for lines and rays in the plane
CoRR, 2012

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

Going around in circles.
Comput. Geom., 2012

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

Minimum-Perimeter Intersecting Polygons.
Algorithmica, 2012

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

Minimum Convex Partitions and Maximum Empty Polytopes.
Proceedings of the Algorithm Theory - SWAT 2012, 2012

Packing anchored rectangles.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 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

Maximal Empty Boxes Amidst Random Points.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2011
Approximate Euclidean Ramsey Theorems.
JoCG, 2011

Minimum Clique Partition in Unit Disk Graphs.
Graphs and Combinatorics, 2011

New bounds on the average distance from the Fermat-Weber center of a planar convex body.
Discrete Optimization, 2011

The Forest Hiding Problem.
Discrete & Computational Geometry, 2011

Sweeping an oval to a vanishing point.
Discrete Applied Mathematics, 2011

Constrained k-center and movement to independence.
Discrete Applied Mathematics, 2011

Minimum Convex Partitions and Maximum Empty Polytopes
CoRR, 2011

Packing anchored rectangles
CoRR, 2011

Sweeping an oval to a vanishing point
CoRR, 2011

Minimum Weight Convex Steiner Partitions.
Algorithmica, 2011

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

Sweeping Points.
Algorithmica, 2011

Bounds on the maximum multiplicity of some common geometric graphs.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

Cutting Out Polygons with a Circular Saw.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

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

Opaque Sets.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

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

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

Monochromatic simplices of any volume.
Discrete Mathematics, 2010

On convexification of polygons by pops.
Discrete Mathematics, 2010

Long Non-crossing Configurations in the Plane.
Discrete & Computational Geometry, 2010

Bounds on the maximum multiplicity of some common geometric graphs
CoRR, 2010

Coloring translates and homothets of a convex body
CoRR, 2010

Opaque sets
CoRR, 2010

Approximate Euclidean Ramsey theorems
CoRR, 2010

On Covering Problems of Rado.
Algorithmica, 2010

Long Non-crossing Configurations in the Plane.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Dispersion in Unit Disks.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

The Forest Hiding Problem.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Minimum-Perimeter Intersecting Polygons.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

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

Watchman tours for polygons with holes.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

Constrained k-center and movement to independence.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

The traveling salesman problem for lines and rays in the plane.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

Approximate euclidean ramsey theorems.
Proceedings of the 22nd Annual Canadian Conference 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.
Discrete Optimization, 2009

Traversing a Set of Points with a Minimum Number of Turns.
Discrete & Computational Geometry, 2009

Dispersion in unit disks
CoRR, 2009

On convexification of polygons by pops
CoRR, 2009

Piercing translates and homothets of a convex body
CoRR, 2009

Long non-crossing configurations in the plane
CoRR, 2009

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

Minimum clique partition in unit disk graphs
CoRR, 2009

Metric inequalities for polygons.
CoRR, 2009

Compatible geometric matchings.
Comput. Geom., 2009

On Reconfiguration of Disks in the Plane and Related Problems.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 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

Drawing Hamiltonian Cycles with No Large Angles.
Proceedings of the Graph Drawing, 17th International Symposium, 2009

Piercing Translates and Homothets of a Convex Body.
Proceedings of the Algorithms, 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. Discrete Math., 2008

On distinct distances among points in general position and other related problems.
Periodica Mathematica Hungarica, 2008

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

Compatible Geometric Matchings.
Electronic Notes in Discrete Mathematics, 2008

On distinct distances and lambda-free point sets.
Discrete Mathematics, 2008

On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space.
Combinatorics, Probability & Computing, 2008

On stars and Steiner stars. II
CoRR, 2008

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

Vision-Based Pursuit-Evasion in a Grid.
Proceedings of the Algorithm Theory, 2008

On Covering Problems of Rado.
Proceedings of the Algorithm Theory, 2008

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

Minimum weight convex Steiner partitions.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Extremal problems on triangle areas in two and three dimensions.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

Monochromatic simplices of any volume.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

On distinct distances among points in general position and other related problems.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

Sweeping Points.
Proceedings of the Approximation, 2008

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

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

On a query algorithm for a divisibility problem.
ACM Comm. Computer Algebra, 2007

Light Orthogonal Networks with Constant Geometric Dilation.
Proceedings of the STACS 2007, 2007

On the number of tetrahedra with minimum, unit, and distinct volumes in three-space.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 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, Gyeongju, 2007

Traversing a set of points with a minimum number of turns.
Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, 2007

2006
Pushing Squares Around.
Graphs and Combinatorics, 2006

On Distinct Distances from a Vertex of a Convex Polygon.
Discrete & Computational Geometry, 2006

The Lifting Model for Reconfiguration.
Discrete & Computational Geometry, 2006

Reconfigurations in Graphs and Grids.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

2005
A Remark on the Erdős-Szekeres Theorem.
The American Mathematical Monthly, 2005

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

Monotone Paths in Line Arrangements with a Small Number of Directions.
Discrete & Computational Geometry, 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

The lifting model for reconfiguration.
Proceedings of the 21st ACM Symposium 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.
I. J. Robotics Res., 2004

Binary Space Partitions for Axis-Parallel Segments, Rectangles, and Hyperrectangles.
Discrete & Computational Geometry, 2004

The cost of cutting out convex n-gons.
Discrete Applied Mathematics, 2004

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

Sliding Disks in the Plane.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

Pushing squares around.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

On distinct distances from a vertex of a convex polygon.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

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

On some monotone path problems in line arrangements.
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

A remark on the Erdös-Szekeres theorem.
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

An approximation algorithm for cutting out convex polygons.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete 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. Geometry Appl., 2002

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

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

Extreme Distances in Multicolored Point Sets.
Proceedings of the Computational Science - ICCS 2002, 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

Partitioning Colored Point Sets into Monochromatic Parts.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Approximation algorithms for TSP with neighborhoods in the plane.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles.
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

2000
On a matching problem in the plane.
Discrete Mathematics, 2000

Enumerating Triangulation Paths.
Proceedings of the 12th Canadian Conference on Computational Geometry, 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...