Matthew J. Katz

Inf. Process. Lett., 2025

Online Range Assignment Problems.

[BibT_eX]

[DOI]

Idan Tomer

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

2024

Discrete Fr\'echet Distance Oracles.

[BibT_eX]

[DOI]

CoRR, 2024

Near-Linear Algorithms for Visibility Graphs over a 1.5-Dimensional Terrain.

[BibT_eX]

[DOI]

Rachel Saban

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Segment Proximity Graphs and Nearest Neighbor Queries Amid Disjoint Segments.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Robustly Guarding Polygons.

[BibT_eX]

[DOI]

Rathish Das

Proceedings of the 40th International Symposium on Computational Geometry, 2024

Discrete Fréchet Distance Oracles.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Stabbing Pairwise Intersecting Disks by Four Points.

[BibT_eX]

[DOI]

Pat Morin

Discret. Comput. Geom., December, 2023

Bottleneck matching in the plane.

[BibT_eX]

[DOI]

Comput. Geom., June, 2023

A 4-approximation of the 2π3-MST.

[BibT_eX]

[DOI]

Comput. Geom., 2023

The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Minimum-Link C-Oriented Paths Visiting a Sequence of Regions in the Plane.

[BibT_eX]

[DOI]

Kerem Geva

Eli Packer

Proceedings of the Algorithms and Complexity - 13th International Conference, 2023

2022

Dynamic Approximate Multiplicatively-Weighted Nearest Neighbors.

[BibT_eX]

[DOI]

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

On Reverse Shortest Paths in Geometric Proximity Graphs.

[BibT_eX]

[DOI]

Pankaj K. Agarwal

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

Efficient algorithms for optimization problems involving distances in a point set.

[BibT_eX]

[DOI]

CoRR, 2021

A 4-Approximation of the $\frac{2\pi }{3}$-MST.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

2020

A 4-Approximation of the $\frac{2π}{3}$-MST.

[BibT_eX]

[DOI]

CoRR, 2020

Sensor Network Topology Design and Analysis for Efficient Data Gathering by a Mobile Mule.

[BibT_eX]

[DOI]

Algorithmica, 2020

A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 18th International Workshop, 2020

Dynamic Time Warping-Based Proximity Problems.

[BibT_eX]

[DOI]

Elad Sulami

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Approximate Nearest Neighbor for Curves - Simple, Efficient, and Deterministic.

[BibT_eX]

[DOI]

Arnold Filtser

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Minimizing Total Interference in Asymmetric Sensor Networks.

[BibT_eX]

[DOI]

A. Karim Abu-Affash

Proceedings of the Algorithms for Sensor Systems, 2020

2019

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2019

Bottleneck detour tree of points on a path.

[BibT_eX]

[DOI]

Greg Aloupis

Lilach Chaitman-Yerushalmi

Stefan Langerman

Comput. Geom., 2019

Terrain-Like Graphs: PTASs for Guarding Weakly-Visible Polygons and Terrains.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 17th International Workshop, 2019

Efficient Nearest-Neighbor Query and Clustering of Planar Curves.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Bipartite Diameter and Other Measures Under Translation.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

2018

Selecting and covering colored points.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

A PTAS for vertex guarding weakly-visible polygons - An extended abstract.

[BibT_eX]

[DOI]

CoRR, 2018

Algorithms for the Discrete Fréchet Distance Under Translation.

[BibT_eX]

[DOI]

Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Resolving SINR Queries in a Dynamic Setting.

[BibT_eX]

[DOI]

Gali Bar-On

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Geometric Problems and Structures Arising from the Study of Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017

Efficient data retrieval in faulty sensor networks using a mobile mule.

[BibT_eX]

[DOI]

Proceedings of the 15th International Symposium on Modeling and Optimization in Mobile, 2017

Improved PTASs for Convex Barrier Coverage.

[BibT_eX]

[DOI]

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

Balanced Line Separators of Unit Disk Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Network Optimization on Partitioned Pairs of Points.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Tracking Paths.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016

On the General Chain Pair Simplification Problem.

[BibT_eX]

[DOI]

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

On Interference Among Moving Sensors and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2015

The Discrete Fréchet Gap.

[BibT_eX]

[DOI]

CoRR, 2015

On Kinetic Range Spaces and their Applications.

[BibT_eX]

[DOI]

CoRR, 2015

Spiderman graph: Visibility in urban regions.

[BibT_eX]

[DOI]

Eran Friedman

Comput. Geom., 2015

On the Chain Pair Simplification Problem.

[BibT_eX]

[DOI]

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

Choice Is Hard.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Batched Point Location in SINR Diagrams via Algebraic Tools.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Bottleneck Segment Matching.

[BibT_eX]

[DOI]

Aritra Banik

Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

Conflict-free Covering.

[BibT_eX]

[DOI]

Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014

The Euclidean Bottleneck Steiner Path Problem and Other Applications of (α, β)-Pair Decomposition.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2014

On the Chain Pair Simplification Problem.

[BibT_eX]

[DOI]

CoRR, 2014

Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection.

[BibT_eX]

[DOI]

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

Locating Battery Charging Stations to Facilitate Almost Shortest Paths.

[BibT_eX]

[DOI]

Esther M. Arkin

Proceedings of the 14th Workshop on Algorithmic Approaches for Transportation Modelling, 2014

Exploiting Geometry in the SINR _k Model.

[BibT_eX]

[DOI]

Gui Citovsky

Proceedings of the Algorithms for Sensor Systems, 2014

2013

The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection Techniques.

[BibT_eX]

[DOI]

CoRR, 2013

Stable Roommates Spanner.

[BibT_eX]

[DOI]

Prosenjit Bose

Lilach Chaitman-Yerushalmi

Sébastien Collette

Stefan Langerman

Comput. Geom., 2013

Approximation Schemes for Covering and Packing.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

2012

Polychromatic 4-coloring of cubic bipartite plane graphs.

[BibT_eX]

[DOI]

Discret. Math., 2012

Do Directional Antennas Facilitate in Reducing Interferences?

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory - SWAT 2012, 2012

Bottleneck Non-crossing Matching in the Plane.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2012, 2012

Symmetric Connectivity with Directional Antennas.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2012

2011

Settling the bound on the rectilinear link radius of a simple rectilinear polygon.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

Guarding Orthogonal Art Galleries with Sliding Cameras.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2011

Connectivity guarantees for wireless networks with directional antennas.

[BibT_eX]

[DOI]

Comput. Geom., 2011

Multi Cover of a Polygon Minimizing the Sum of Areas.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

Switching to Directional Antennas with Constant Increase in Radius and Hop Distance.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

The euclidean bottleneck steiner path problem.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

Bottleneck Steiner Tree with Bounded Number of Steiner Vertices.

[BibT_eX]

[DOI]

A. Karim Abu-Affash

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010

The MST of Symmetric Disk Graphs Is Light.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2010

Minimum Power Energy Spanners in Wireless Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

Optimal Cover of Points by Disks in a Simple Polygon.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2010

Direction assignment in wireless networks.

[BibT_eX]

[DOI]

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

2009

Polychromatic 4-coloring of guillotine subdivisions.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Guarding Rectangular Partitions.

[BibT_eX]

[DOI]

Yefim Dinitz

Roi Krakovski

Int. J. Comput. Geom. Appl., 2009

A Scheme for Computing Minimum Covers within Simple Regions.

[BibT_eX]

[DOI]

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

2008

On guarding the vertices of rectilinear domains.

[BibT_eX]

[DOI]

Gabriel S. Roisman

Comput. Geom., 2008

Polynomial-time approximation schemes for piercing and covering with applications in wireless networks.

[BibT_eX]

[DOI]

Nissan Lev-Tov

Comput. Geom., 2008

Improved Bounds on the Average Distance to the Fermat-Weber Center of a Convex Object.

[BibT_eX]

A. Karim Abu-Affash

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

2007

A Constant-Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding.

[BibT_eX]

[DOI]

SIAM J. Comput., 2007

Covering Points by Unit Disks of Fixed Location.

[BibT_eX]

[DOI]

Nissan Lev-Tov

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Conflict-Free Coloring of Points on a Line with respect to a Set of Intervals.

[BibT_eX]

[DOI]

Nissan Lev-Tov

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

Distance Preserving Terrain Simplification - An Experimental Study.

[BibT_eX]

[DOI]

Igor Zaslavsky

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006

On Guarding Rectilinear Domains.

[BibT_eX]

[DOI]

Gabriel S. Roisman

Proceedings of the Algorithm Theory, 2006

Finding large sticks and potatoes in polygons.

[BibT_eX]

[DOI]

Olaf A. Hall-Holt

Piyush Kumar

Arik Sityon

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Fault-Tolerant Power Assignment and Backbone in Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the 4th IEEE Conference on Pervasive Computing and Communications Workshops (PerCom 2006 Workshops), 2006

Power Assignment in Radio Networks with Two Power Levels.

[BibT_eX]

[DOI]

Proceedings of the Geometric Networks and Metric Space Embeddings, 26.11. - 01.12.2006, 2006

Minimum-cost load-balancing partitions.

[BibT_eX]

[DOI]

Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005

Orthogonal segment stabbing.

[BibT_eX]

[DOI]

Yuval Nir

Comput. Geom., 2005

On the Fermat-Weber center of a convex object.

[BibT_eX]

[DOI]

Sariel Har-Peled

Comput. Geom., 2005

Geographic Quorum System Approximations.

[BibT_eX]

[DOI]

Algorithmica, 2005

The Minimum-Area Spanning Tree Problem.

[BibT_eX]

[DOI]

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

A constant-factor approximation algorithm for optimal terrain guarding.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

The minimum area spanning tree problem.

[BibT_eX]

[DOI]

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

Minimum-Cost Load-Balancing Partitions.

[BibT_eX]

[DOI]

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004

Computing all large sums-of-pairs in Rn and the discrete planar two-watchtower problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2004

Computing the visibility graph of points within a polygon.

[BibT_eX]

[DOI]

Olaf A. Hall-Holt

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

Approximating the Visible Region of a Point on a Terrain.

[BibT_eX]

Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

2003

Maintenance of a Piercing Set for Intervals with Applications.

[BibT_eX]

[DOI]

Algorithmica, 2003

2002

Walking around fat obstacles.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

Sixteenth European Workshop on Computational Geometry - Editorial.

[BibT_eX]

Comput. Geom., 2002

TSP with Neighborhoods of Varying Size.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2002

Visibility preserving terrain simplification: an experimental study.

[BibT_eX]

[DOI]

Yuval Nir

Proceedings of the 18th Annual Symposium on Computational Geometry, 2002

2001

A Tight Bound on the Number of Geometric Permutations of Convex Fat Objects in Rd.

[BibT_eX]

[DOI]

Kasturi R. Varadarajan

Discret. Comput. Geom., 2001

Geometry Helps in Bottleneck Matching and Related Problems.

[BibT_eX]

[DOI]

Alon Itai

Algorithmica, 2001

A tight bound on the number of geometric permutations of convex fat objects in Rd.

[BibT_eX]

[DOI]

Kasturi R. Varadarajan

Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

Farthest neighbors and center points in the presence of rectangular obstacles.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

2000

Computing Euclidean bottleneck matchings in higher dimensions.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

Discrete rectilinear 2-center problems.

[BibT_eX]

[DOI]

Comput. Geom., 2000

Maintenance of a Percing Set for Intervals with Applications.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Shooter Location through Piercing Sets.

[BibT_eX]

EuroCG, 2000

1999

3-Piercing of d-Dimensional Boxes and Homothetic Triangles.

[BibT_eX]

[DOI]

Eyal Assa

Int. J. Comput. Geom. Appl., 1999

On the union of k-curved objects.

[BibT_eX]

[DOI]

Comput. Geom., 1999

Improved algorithms for placing undesirable facilities.

[BibT_eX]

[DOI]

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

Obnoxious facility location: Complete service with minimal harm.

[BibT_eX]

[DOI]

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

1998

Guarding Scenes against Invasive Hypercubes.

[BibT_eX]

Jules Vleugels

Proceedings of the Algorithm Engineering, 2nd International Workshop, 1998

Constrained Square-Center Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1998

Models and Motion Planning.

[BibT_eX]

[DOI]

Mark de Berg

Mark H. Overmars

Jules Vleugels

Proceedings of the Algorithm Theory, 1998

On the Union of k-Curved Objects.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997

3-D Vertical Ray Shooting and 2-D Point Enclosure, Range Searching, and Arc Shooting Amidst Convex Fat Objects.

[BibT_eX]

[DOI]

Comput. Geom., 1997

Dynamic Data Structures for Fat Objects and Their Applications.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

Realistic Input Models for Geometric Algorithms.

[BibT_eX]

[DOI]

Mark de Berg

Jules Vleugels

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

Computing Fair and Bottleneck Matchings in Geormetric Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

Optimal Line Bipartitions of Point Sets.

[BibT_eX]

[DOI]

Olivier Devillers

Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

On Piercing Sets of Objects.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995

Computing Depth Orders for Fat Objects and Related Problems.

[BibT_eX]

[DOI]

Pankaj K. Agarwal

Comput. Geom., 1995

Improved Algorithms in Geometric Optimization via Expanders.

[BibT_eX]

[DOI]

Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995

1994

Geometric optimization via expanders and visibility of fat objects in three dimensions: two studies in computational geometry

[BibT_eX]

[DOI]

PhD thesis, 1994

Computing Depth Orders and Related Problems.

[BibT_eX]

[DOI]

Pankaj K. Agarwal

Proceedings of the Algorithm Theory, 1994

1993

Verifying plans for multiple agents.

[BibT_eX]

[DOI]

Jeffrey S. Rosenschein

J. Exp. Theor. Artif. Intell., 1993

An Expander-Based Approach to Geometric Optimization.

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

Optimal Slope Selection Via Expanders.

[BibT_eX]

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1991

Efficient Hidden Surface Removal for Objects with small Union Size.

[BibT_eX]

[DOI]

Mark H. Overmars

Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1989

Plans for Multiple Agents.

[BibT_eX]

[DOI]