Adrian Dumitrescu

CoRR, November, 2025

Note on the Number of Almost Ordinary Triangles.

[BibT_eX]

[DOI]

CoRR, October, 2025

Arcs with increasing chords in Rd.

[BibT_eX]

[DOI]

Zsolt Lángi

CoRR, September, 2025

The number of regular simplices in higher dimensions.

[BibT_eX]

[DOI]

Dingyuan Liu

CoRR, July, 2025

Covering Complete Geometric Graphs by Monotone Paths.

[BibT_eX]

[DOI]

Morteza Saghafian

CoRR, July, 2025

Closed curve covering and multiagent TSP ratios.

[BibT_eX]

[DOI]

Travis Dillon

CoRR, June, 2025

On multiplicities of interpoint distances.

[BibT_eX]

[DOI]

Dingyuan Liu

CoRR, May, 2025

Peeling Sequences.

[BibT_eX]

[DOI]

Discret. Comput. Geom., April, 2025

Almost Congruent Triangles.

[BibT_eX]

[DOI]

József Balogh

Discret. Comput. Geom., April, 2025

Ordered Yao graphs: maximum degree, edge numbers, and clique numbers.

[BibT_eX]

[DOI]

CoRR, April, 2025

A Purely Geometric Variant of the Gale-Berlekamp Switching Game.

[BibT_eX]

[DOI]

CoRR, February, 2025

Two Trees Are Better than One.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2025

General Position Subset Selection in Line Arrangements.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 14th International Conference, 2025

Maximizing the Maximum Degree in Ordered Nearest Neighbor Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2025

2024

The Dirac-Goodman-Pollack Conjecture.

[BibT_eX]

[DOI]

Discret. Comput. Geom., September, 2024

On a Traveling Salesman Problem for Points in the Unit Cube.

[BibT_eX]

[DOI]

József Balogh

Algorithmica, September, 2024

Geometric Variants of the Gale-Berlekamp Switching Game.

[BibT_eX]

[DOI]

CoRR, 2024

Subset Selection Problems in Planar Point Sets.

[BibT_eX]

[DOI]

József Balogh

Dingyuan Liu

CoRR, 2024

A Stopping Game on Zero-Sum Sequences.

[BibT_eX]

[DOI]

Arsenii Sagdeev

CoRR, 2024

Maximizing the Maximum Degree in Ordered Yao Graphs.

[BibT_eX]

[DOI]

CoRR, 2024

Partitioning complete geometric graphs into plane subgraphs.

[BibT_eX]

[DOI]

CoRR, 2024

Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

2023

Two-sided convexity testing with certificates.

[BibT_eX]

[DOI]

CoRR, 2023

Observation Routes and External Watchman Routes.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Maximal Distortion of Geodesic Diameters in Polygonal Domains.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

Finding Small Complete Subgraphs Efficiently.

[BibT_eX]

[DOI]

Andrzej Lingas

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

2022

Peeling Sequences.

[BibT_eX]

[DOI]

CoRR, 2022

Finding Points in Convex Position in Density-Restricted Sets.

[BibT_eX]

[DOI]

CoRR, 2022

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

[BibT_eX]

[DOI]

Josef Tkadlec

CoRR, 2022

Online Unit Clustering and Unit Covering in Higher Dimensions.

[BibT_eX]

[DOI]

Algorithmica, 2022

2021

Finding Triangles or Independent Sets.

[BibT_eX]

[DOI]

CoRR, 2021

Piercing All Translates of a Set of Axis-Parallel Rectangles.

[BibT_eX]

[DOI]

Josef Tkadlec

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

2020

Selection Algorithms with Small Groups.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2020

Distinct distances in planar point sets with forbidden 4-point patterns.

[BibT_eX]

[DOI]

Discret. Math., 2020

On Wegner's inequality for axis-parallel rectangles.

[BibT_eX]

[DOI]

Discret. Math., 2020

Problems on track runners.

[BibT_eX]

[DOI]

Comput. Geom., 2020

On the Cover of the Rolling Stone.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Sparse Hop Spanners for Unit Disk Graphs.

[BibT_eX]

[DOI]

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

Multiparty Selection.

[BibT_eX]

[DOI]

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

2019

Computational Geometry Column 69.

[BibT_eX]

[DOI]

SIGACT News, 2019

Distinct distances and arithmetic progressions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

A Selectable Sloppy Heap.

[BibT_eX]

[DOI]

Algorithms, 2019

New Lower Bounds for the Number of Pseudoline Arrangements.

[BibT_eX]

[DOI]

Ritankar Mandal

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

On the Stretch Factor of Polygonal Chains.

[BibT_eX]

[DOI]

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

A Product Inequality for Extreme Distances.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Computational Geometry, 2019

Convex Polygons in Cartesian Products.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Computational Geometry, 2019

Finding a Mediocre Player.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018

Computational Geometry Column 68.

[BibT_eX]

[DOI]

SIGACT News, 2018

Minimum rectilinear Steiner tree of n points in the unit square.

[BibT_eX]

[DOI]

Comput. Geom., 2018

On the Longest Spanning Tree with Neighborhoods.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

Online Unit Covering in Euclidean Space.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2018

2017

Computational Geometry Column 66.

[BibT_eX]

[DOI]

Khaled M. Elbassioni

SIGACT News, 2017

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Mark de Berg

Khaled M. Elbassioni

Int. J. Comput. Geom. Appl., 2017

Cutting out polygon collections with a saw.

[BibT_eX]

[DOI]

Masud Hasan

Discret. Appl. Math., 2017

Online Unit Clustering in Higher Dimensions.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 15th International Workshop, 2017

A Problem on Track Runners.

[BibT_eX]

Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

On the Shortest Separating Cycle.

[BibT_eX]

Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016

Binary Space Partitions.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Computational Geometry Column 64.

[BibT_eX]

[DOI]

SIGACT News, 2016

Counting Carambolas.

[BibT_eX]

[DOI]

Graphs Comb., 2016

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

[BibT_eX]

[DOI]

CoRR, 2016

Monotone Paths in Geometric Triangulations.

[BibT_eX]

[DOI]

Ritankar Mandal

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

On the Number of Maximum Empty Boxes Amidst n Points.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

Anchored Rectangle and Square Packings.

[BibT_eX]

[DOI]

Kevin Balas

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

Lattice Spanners of Low Degree.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

Lower Bounds on the Dilation of Plane Spanners.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

2015

Computational Geometry Column 61.

[BibT_eX]

[DOI]

SIGACT News, 2015

Constant-Factor Approximation for TSP with Disks.

[BibT_eX]

[DOI]

CoRR, 2015

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

[BibT_eX]

[DOI]

Comput. Geom., 2015

Convex Polygons in Geometric Triangulations.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Select with Groups of 3 or 4.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

On Collections of Polygons Cuttable with a Segment Saw.

[BibT_eX]

[DOI]

Masud Hasan

Proceedings of the Algorithms and Discrete Applied Mathematics, 2015

2014

Computational geometry column 59.

[BibT_eX]

[DOI]

SIGACT News, 2014

Computational Geometry Column 60.

[BibT_eX]

[DOI]

SIGACT News, 2014

The Minimum Guarding Tree Problem.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2014

Covering Paths for Planar Point Sets.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2014

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

[BibT_eX]

[DOI]

CoRR, 2014

Watchman routes for lines and line segments.

[BibT_eX]

[DOI]

Comput. Geom., 2014

On Fence Patrolling by Mobile Agents.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

Nonconvex Cases for Carpenter's Rulers.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

The Opaque Square.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Covering Grids by Trees.

[BibT_eX]

[DOI]

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Computing Opaque Interior Barriers à la Shermer.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2014

2013

Computational geometry column 58.

[BibT_eX]

[DOI]

SIGACT News, 2013

Computational geometry column 56.

[BibT_eX]

[DOI]

SIGACT News, 2013

Metric inequalities for polygons.

[BibT_eX]

[DOI]

J. Comput. Geom., 2013

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

[BibT_eX]

[DOI]

Algorithmica, 2013

The traveling salesman problem for lines, balls and planes.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Systems of distant representatives in euclidean space.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Computational Geometry 2013, 2013

On Fence Patrolling by Mobile Agents.

[BibT_eX]

[DOI]

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

On the Total Perimeter of Homothetic Convex Bodies in a Convex Container.

[BibT_eX]

[DOI]

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012

Computational geometry column 54.

[BibT_eX]

[DOI]

SIGACT News, 2012

Computational geometry column 53.

[BibT_eX]

[DOI]

SIGACT News, 2012

Dispersion in Disks.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2012

Going around in circles.

[BibT_eX]

[DOI]

Comput. Geom., 2012

Watchman Routes for Lines and Segments.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory - SWAT 2012, 2012

Minimum Convex Partitions and Maximum Empty Polytopes.

[BibT_eX]

[DOI]

Sariel Har-Peled

Proceedings of the Algorithm Theory - SWAT 2012, 2012

Packing anchored rectangles.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Covering Paths for Planar Point Sets.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 20th International Symposium, 2012

Monotone Paths in Planar Convex Subdivisions.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

Maximal Empty Boxes Amidst Random Points.

[BibT_eX]

[DOI]

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2011

Minimum Clique Partition in Unit Disk Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2011

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

[BibT_eX]

[DOI]

Discret. Optim., 2011

Sweeping an oval to a vanishing point.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

Bounds on the maximum multiplicity of some common geometric graphs.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

Cutting Out Polygons with a Circular Saw.

[BibT_eX]

[DOI]

Masud Hasan

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

Animal Testing.

[BibT_eX]

[DOI]

Evan Hilscher

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

Opaque Sets.

[BibT_eX]

[DOI]

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

2010

Maximum Area Independent Sets in Disk Intersection Graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2010

On convexification of polygons by pops.

[BibT_eX]

[DOI]

Evan Hilscher

Discret. Math., 2010

Coloring translates and homothets of a convex body

[BibT_eX]

[DOI]

CoRR, 2010

Opaque sets

[BibT_eX]

[DOI]

CoRR, 2010

Long Non-crossing Configurations in the Plane.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Dispersion in Unit Disks.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

The Forest Hiding Problem.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Minimum-Perimeter Intersecting Polygons.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Convexification of polygons by length preserving transformations.

[BibT_eX]

[DOI]

Evan Hilscher

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

Watchman tours for polygons with holes.

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

Constrained k-center and movement to independence.

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

The traveling salesman problem for lines and rays in the plane.

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

Approximate euclidean ramsey theorems.

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009

On stars and Steiner stars.

[BibT_eX]

[DOI]

Guangwu Xu

Discret. Optim., 2009

On the largest empty axis-parallel box amidst n points

[BibT_eX]

[DOI]

CoRR, 2009

On Reconfiguration of Disks in the Plane and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

On stars and Steiner stars: II.

[BibT_eX]

[DOI]

Guangwu Xu

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.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Drawing Hamiltonian Cycles with No Large Angles.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 17th International Symposium, 2009

Piercing Translates and Homothets of a Convex Body.

[BibT_eX]

[DOI]

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 - .

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Compatible Geometric Matchings.

[BibT_eX]

[DOI]

Oswin Aichholzer

Alfredo García Olaverri

Electron. Notes Discret. Math., 2008

On distinct distances and lambda-free point sets.

[BibT_eX]

[DOI]

Discret. Math., 2008

On a Covering Problem for Equilateral Triangles.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

Vision-Based Pursuit-Evasion in a Grid.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2008

On Covering Problems of Rado.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2008

On stars and Steiner stars.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Minimum weight convex Steiner partitions.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Extremal problems on triangle areas in two and three dimensions.

[BibT_eX]

[DOI]

Micha Sharir

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

Monochromatic simplices of any volume.

[BibT_eX]

Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

On distinct distances among points in general position and other related problems.

[BibT_eX]

Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

Sweeping Points.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2008

2007

Analysis of two Sweep-line Algorithms for Constructing Spanning Trees and Steiner Trees.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2007

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

[BibT_eX]

[DOI]

Annette Ebbers-Baumann

Ansgar Grüne

Rolf Klein

Comput. Geom., 2007

On a query algorithm for a divisibility problem.

[BibT_eX]

[DOI]

Guangwu Xu

ACM Commun. Comput. Algebra, 2007

Light Orthogonal Networks with Constant Geometric Dilation.

[BibT_eX]

[DOI]

Proceedings of the STACS 2007, 2007

On the number of tetrahedra with minimum, unit, and distinct volumes in three-space.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Distinct Triangle Areas in a Planar Point Set.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2007

Offline variants of the "lion and man" problem.

[BibT_eX]

[DOI]

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

Traversing a set of points with a minimum number of turns.

[BibT_eX]

[DOI]

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

2006

Reconfigurations in Graphs and Grids.

[BibT_eX]

[DOI]

Gruia Calinescu

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

2005

Separating Points by Axis-parallel Lines.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2005

Monotone Paths in Line Arrangements with a Small Number of Directions.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2005

On the chromatic number of some geometric type Kneser graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2005

On Geometric Dilation and Halving Chords.

[BibT_eX]

[DOI]

Annette Ebbers-Baumann

Ansgar Grüne

Rolf Klein

Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Improved lower bound on the geometric dilation of point sets.

[BibT_eX]

[DOI]

Ansgar Grüne

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

The lifting model for reconfiguration.

[BibT_eX]

[DOI]

Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

2004

Motion planning for metamorphic systems: feasibility, decidability, and distributed reconfiguration.

[BibT_eX]

[DOI]

Masafumi Yamashita

IEEE Trans. Robotics, 2004

Formations for Fast Locomotion of Metamorphic Robotic Systems.

[BibT_eX]

[DOI]

Masafumi Yamashita

Int. J. Robotics Res., 2004

The cost of cutting out convex n-gons.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Sliding Disks in the Plane.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

Pushing squares around.

[BibT_eX]

[DOI]

Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

On distinct distances from a vertex of a convex polygon.

[BibT_eX]

[DOI]

Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

On the Fréchet distance of a set of curves.

[BibT_eX]

[DOI]

Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

On some monotone path problems in line arrangements.

[BibT_eX]

[DOI]

Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

A remark on the Erdös-Szekeres theorem.

[BibT_eX]

[DOI]

Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

Separating points by axis-parallel lines.

[BibT_eX]

[DOI]

Gruia Calinescu

Peng-Jun Wan

Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003

An approximation algorithm for cutting out convex polygons.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Generating Small Combinatorial Test Suites to Cover Input-Output Relationships.

[BibT_eX]

[DOI]

Christine T. Cheng

Patrick J. Schroeder

Proceedings of the 3rd International Conference on Quality Software (QSIC 2003), 2003

Efficient Algorithms for Generation of Combinatorial Covering Suites.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2002

Ramsey-Type Results for Unions of Comparability Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2002

High Speed Formations of Reconfigurable Modular Robotic Systems.

[BibT_eX]

[DOI]

Masafumi Yamashita

Proceedings of the 2002 IEEE International Conference on Robotics and Automation, 2002

Extreme Distances in Multicolored Point Sets.

[BibT_eX]

[DOI]

Sumanta Guha

Proceedings of the Computational Science - ICCS 2002, 2002

2001

Space-time trade-offs for some ranking and searching queries.

[BibT_eX]

[DOI]

William L. Steiger

Inf. Process. Lett., 2001

Matching colored points in the plane: Some new results.

[BibT_eX]

[DOI]

Rick Kaye

Comput. Geom., 2001

Partitioning Colored Point Sets into Monochromatic Parts.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Approximation algorithms for TSP with neighborhoods in the plane.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles.

[BibT_eX]

[DOI]

Micha Sharir

Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

2000

On a matching problem in the plane.

[BibT_eX]

[DOI]

William L. Steiger

Discret. Math., 2000

Enumerating Triangulation Paths.

[BibT_eX]

[DOI]

Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1999

Ramsey-type results for unions of comparability graphs and convex sets inrestricted position.

[BibT_eX]

[DOI]

Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

On two lower bound constructions.

[BibT_eX]

[DOI]

Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

1998

Planar sets with few empty convex polygons.

[BibT_eX]

[DOI]