Matthew J. Katz

Publication Activity (10 Years)

Years Active: 1991-2024
Publications (10 Years): 70

Top Venues

CoRR

Comput. Geom.

Algorithmica

Discret. Comput. Geom.

Publications

Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir
On reverse shortest paths in geometric proximity graphs. Comput. Geom. 117 (2024)
Haim Kaplan, Matthew J. Katz, Rachel Saban, Micha Sharir
The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs. CoRR (2023)
Matthew J. Katz, Micha Sharir
Bottleneck matching in the plane. Comput. Geom. 112 (2023)
Paz Carmi, Matthew J. Katz, Pat Morin
Stabbing Pairwise Intersecting Disks by Four Points. Discret. Comput. Geom. 70 (4) (2023)
Kerem Geva, Matthew J. Katz, Joseph S. B. Mitchell, Eli Packer
Minimum-Link C-Oriented Paths Visiting a Sequence of Regions in the Plane. CIAC (2023)
Arnold Filtser, Omrit Filtser, Matthew J. Katz
Approximate Nearest Neighbor for Curves: Simple, Efficient, and Deterministic. Algorithmica 85 (5) (2023)
Stav Ashur, Matthew J. Katz
A 4-approximation of the 2π3-MST. Comput. Geom. 108 (2023)
Haim Kaplan, Matthew J. Katz, Rachel Saban, Micha Sharir
The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs. ESA (2023)
Kerem Geva, Matthew J. Katz, Joseph S. B. Mitchell, Eli Packer
Minimum-link C-Oriented Paths Visiting a Sequence of Regions in the Plane. CoRR (2023)
Tsuri Farhana, Matthew J. Katz
Spanners under the Hausdorff and Fréchet Distances. CoRR (2023)
Matthew J. Katz, Micha Sharir
Bottleneck Matching in the Plane. CoRR (2022)
Stav Ashur, Omrit Filtser, Matthew J. Katz, Rachel Saban
Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains. Comput. Geom. 101 (2022)
Boris Aronov, Matthew J. Katz
Dynamic Approximate Multiplicatively-Weighted Nearest Neighbors. SWAT (2022)
Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir
On Reverse Shortest Paths in Geometric Proximity Graphs. ISAAC (2022)
Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Matthew J. Katz, Micha Sharir
Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems. CoRR (2022)
Boris Aronov, Omrit Filtser, Matthew J. Katz, Khadijeh Sheikhan
Bipartite Diameter and Other Measures Under Translation. Discret. Comput. Geom. 68 (3) (2022)
Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Matthew J. Katz, Micha Sharir
Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems. SoCG (2022)
Stav Ashur, Matthew J. Katz
A 4-Approximation of the $\frac{2\pi }{3}$-MST. WADS (2021)
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz
Minimizing total interference in asymmetric sensor networks. Theor. Comput. Sci. 889 (2021)
Stav Ashur, Omrit Filtser, Matthew J. Katz
A constant-factor approximation algorithm for vertex guarding a WV-polygon. J. Comput. Geom. 12 (1) (2021)
Paz Carmi, Matthew J. Katz, Rachel Saban, Yael Stein
Improved PTASs for convex barrier coverage. Comput. Geom. 92 (2021)
Matthew J. Katz, Micha Sharir
Efficient algorithms for optimization problems involving distances in a point set. CoRR (2021)
Paz Carmi, Man-Kwun Chiu, Matthew J. Katz, Matias Korman, Yoshio Okamoto, André van Renssen, Marcel Roeloffzen, Taichi Shiitada, Shakhar Smorodinsky
Balanced line separators of unit disk graphs. Comput. Geom. 86 (2020)
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz
Minimizing Total Interference in Asymmetric Sensor Networks. ALGOSENSORS (2020)
Boris Aronov, Gali Bar-On, Matthew J. Katz
Resolving SINR Queries in a Dynamic Setting. SIAM J. Comput. 49 (6) (2020)
Stav Ashur, Matthew J. Katz
A 4-Approximation of the $\frac{2π}{3}$-MST. CoRR (2020)
Omrit Filtser, Matthew J. Katz
Algorithms for the discrete Fréchet distance under translation. J. Comput. Geom. 11 (1) (2020)
Stav Ashur, Omrit Filtser, Matthew J. Katz
A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon. WAOA (2020)
Boris Aronov, Matthew J. Katz, Elad Sulami
Dynamic Time Warping-Based Proximity Problems. MFCS (2020)
Harel Yedidsion, Stav Ashur, Aritra Banik, Paz Carmi, Matthew J. Katz, Michael Segal
Sensor Network Topology Design and Analysis for Efficient Data Gathering by a Mobile Mule. Algorithmica 82 (10) (2020)
Arnold Filtser, Omrit Filtser, Matthew J. Katz
Approximate Nearest Neighbor for Curves - Simple, Efficient, and Deterministic. ICALP (2020)
Aritra Banik, Matthew J. Katz, Eli Packer, Marina Simakov
Tracking Paths. Discret. Appl. Math. 282 (2020)
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz
Minimizing Total Interference in Asymmetric Sensor Networks. CoRR (2020)
Boris Aronov, Omrit Filtser, Matthew J. Katz, Khadijeh Sheikhan
Bipartite Diameter and Other Measures Under Translation. STACS (2019)
Boris Aronov, Omrit Filtser, Michael Horton, Matthew J. Katz, Khadijeh Sheikhan
Efficient Nearest-Neighbor Query and Clustering of Planar Curves. WADS (2019)
Arnold Filtser, Omrit Filtser, Matthew J. Katz
Approximate Nearest Neighbor for Curves - Simple, Efficient, and Deterministic. CoRR (2019)
Boris Aronov, Omrit Filtser, Michael Horton, Matthew J. Katz, Khadijeh Sheikhan
Efficient Nearest-Neighbor Query and Clustering of Planar Curves. CoRR (2019)
Boris Aronov, Matthew J. Katz
Guest Editors' Foreword. Discret. Comput. Geom. 61 (4) (2019)
Greg Aloupis, Paz Carmi, Lilach Chaitman-Yerushalmi, Matthew J. Katz, Stefan Langerman
Bottleneck detour tree of points on a path. Comput. Geom. 79 (2019)
Esther M. Arkin, Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell, Michael Segal
Locating battery charging stations to facilitate almost shortest paths. Discret. Appl. Math. 254 (2019)
Stav Ashur, Omrit Filtser, Matthew J. Katz, Rachel Saban
Terrain-Like Graphs: PTASs for Guarding Weakly-Visible Polygons and Terrains. WAOA (2019)
Stav Ashur, Omrit Filtser, Matthew J. Katz
A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon. CoRR (2019)
Matthew J. Katz
Geometric Problems and Structures Arising from the Study of Wireless Networks. CCCG (2018)
Matthew J. Katz
A PTAS for vertex guarding weakly-visible polygons - An extended abstract. CoRR (2018)
Omrit Filtser, Matthew J. Katz
Algorithms for the Discrete Fréchet Distance Under Translation. SWAT (2018)
Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov
Selecting and covering colored points. Discret. Appl. Math. 250 (2018)
Boris Aronov, Matthew J. Katz
Batched Point Location in SINR Diagrams via Algebraic Tools. ACM Trans. Algorithms 14 (4) (2018)
Paz Carmi, Matthew J. Katz, Pat Morin
Stabbing Pairwise Intersecting Disks by Four Points. CoRR (2018)
Boris Aronov, Gali Bar-On, Matthew J. Katz
Resolving SINR Queries in a Dynamic Setting. ICALP (2018)
Boris Aronov, Gali Bar-On, Matthew J. Katz
Resolving SINR Queries in a Dynamic Setting. CoRR (2018)
Rom Aschner, Matthew J. Katz
Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints. Algorithmica 77 (2) (2017)
Aritra Banik, Matthew J. Katz, Eli Packer, Marina Simakov
Tracking Paths. CIAC (2017)
Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Su Jia, Matthew J. Katz, Tyler Mayer, Joseph S. B. Mitchell
Network Optimization on Partitioned Pairs of Points. CoRR (2017)
Jean-Lou De Carufel, Matthew J. Katz, Matias Korman, André van Renssen, Marcel Roeloffzen, Shakhar Smorodinsky
On interference among moving sensors and related problems. J. Comput. Geom. 8 (1) (2017)
Paz Carmi, Matthew J. Katz, Rachel Saban, Yael Stein
Improved PTASs for Convex Barrier Coverage. WAOA (2017)
Paz Carmi, Man-Kwun Chiu, Matthew J. Katz, Matias Korman, Yoshio Okamoto, André van Renssen, Marcel Roeloffzen, Taichi Shiitada, Shakhar Smorodinsky
Balanced Line Separators of Unit Disk Graphs. WADS (2017)
Paz Carmi, Man-Kwun Chiu, Matthew J. Katz, Matias Korman, Yoshio Okamoto, André van Renssen, Marcel Roeloffzen, Taichi Shiitada, Shakhar Smorodinsky
Balanced Line Separators of Unit Disk Graphs. CoRR (2017)
Harel Yedidsion, Aritra Banik, Paz Carmi, Matthew J. Katz, Michael Segal
Efficient data retrieval in faulty sensor networks using a mobile mule. WiOpt (2017)
Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Su Jia, Matthew J. Katz, Tyler Mayer, Joseph S. B. Mitchell
Network Optimization on Partitioned Pairs of Points. ISAAC (2017)
Chenglin Fan, Omrit Filtser, Matthew J. Katz, Binhai Zhu
On the General Chain Pair Simplification Problem. MFCS (2016)
Jean-Lou De Carufel, Matthew J. Katz, Matias Korman, André van Renssen, Marcel Roeloffzen, Shakhar Smorodinsky
On Interference Among Moving Sensors and Related Problems. ESA (2016)
Paz Carmi, Eran Friedman, Matthew J. Katz
Spiderman graph: Visibility in urban regions. Comput. Geom. 48 (3) (2015)
Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov
Conflict-free Covering. CCCG (2015)
Aritra Banik, Matthew J. Katz, Marina Simakov
Bottleneck Segment Matching. CCCG (2015)
Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov
Choice Is Hard. ISAAC (2015)
Omrit Filtser, Matthew J. Katz
The Discrete Fréchet Gap. CoRR (2015)
Boris Aronov, Matthew J. Katz
Batched Point Location in SINR Diagrams via Algebraic Tools. ICALP (1) (2015)
Chenglin Fan, Omrit Filtser, Matthew J. Katz, Tim Wylie, Binhai Zhu
On the Chain Pair Simplification Problem. WADS (2015)
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz
Bottleneck Steiner tree with bounded number of Steiner vertices. J. Discrete Algorithms 30 (2015)
Rinat Ben Avraham, Omrit Filtser, Haim Kaplan, Matthew J. Katz, Micha Sharir
The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection. ACM Trans. Algorithms 11 (4) (2015)
Rom Aschner, Matthew J. Katz
Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints. CoRR (2014)
Rom Aschner, Matthew J. Katz
Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints. ICALP (2) (2014)
Esther M. Arkin, Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell, Michael Segal
Locating Battery Charging Stations to Facilitate Almost Shortest Paths. ATMOS (2014)
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Michael Segal
The Euclidean Bottleneck Steiner Path Problem and Other Applications of (α, β)-Pair Decomposition. Discret. Comput. Geom. 51 (1) (2014)
Boris Aronov, Matthew J. Katz
Batched Point Location in SINR Diagrams via Algebraic Tools. CoRR (2014)
Omrit Filtser, Matthew J. Katz, Tim Wylie, Binhai Zhu
On the Chain Pair Simplification Problem. CoRR (2014)
Rinat Ben Avraham, Omrit Filtser, Haim Kaplan, Matthew J. Katz, Micha Sharir
The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection. SoCG (2014)
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Yohai Trabelsi
Bottleneck non-crossing matching in the plane. Comput. Geom. 47 (3) (2014)
Prosenjit Bose, Paz Carmi, Mirela Damian, Robin Y. Flatland, Matthew J. Katz, Anil Maheshwari
Switching to Directional Antennas with Constant Increase in Radius and Hop Distance. Algorithmica 69 (2) (2014)
Rom Aschner, Gui Citovsky, Matthew J. Katz
Exploiting Geometry in the SINR _k Model. ALGOSENSORS (2014)
Rom Aschner, Matthew J. Katz, Gila Morgenstern, Yelena Yuditsky
Approximation Schemes for Covering and Packing. WALCOM (2013)
Rom Aschner, Matthew J. Katz, Gila Morgenstern
Symmetric connectivity with directional antennas. Comput. Geom. 46 (9) (2013)
Prosenjit Bose, Paz Carmi, Lilach Chaitman-Yerushalmi, Sébastien Collette, Matthew J. Katz, Stefan Langerman
Stable Roommates Spanner. Comput. Geom. 46 (2) (2013)
Rinat Ben Avraham, Omrit Filtser, Haim Kaplan, Matthew J. Katz, Micha Sharir
The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection Techniques. CoRR (2013)
Rom Aschner, Matthew J. Katz, Gila Morgenstern
Symmetric Connectivity with Directional Antennas. ALGOSENSORS (2012)
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Yohai Trabelsi
Bottleneck Non-crossing Matching in the Plane. ESA (2012)
Matthew J. Katz, Gila Morgenstern
A Scheme for Computing Minimum Covers within Simple Regions. Algorithmica 62 (1-2) (2012)
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Yohai Trabelsi
Bottleneck Non-Crossing Matching in the Plane CoRR (2012)
Elad Horev, Matthew J. Katz, Roi Krakovski, Atsuhiro Nakamoto
Polychromatic 4-coloring of cubic bipartite plane graphs. Discret. Math. 312 (4) (2012)
Matthew J. Katz, Nissan Lev-Tov, Gila Morgenstern
Conflict-Free Coloring of points on a line with respect to a set of intervals. Comput. Geom. 45 (9) (2012)
A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz
The MST of symmetric disk graphs is light. Comput. Geom. 45 (1-2) (2012)
Rom Aschner, Matthew J. Katz, Gila Morgenstern, Yelena Yuditsky
Approximation Schemes for Covering and Packing CoRR (2012)
Rom Aschner, Matthew J. Katz, Gila Morgenstern
Do Directional Antennas Facilitate in Reducing Interferences? SWAT (2012)
Rom Aschner, Matthew J. Katz, Gila Morgenstern
Symmetric Connectivity with Directional Antennas CoRR (2011)
Haim Kaplan, Matthew J. Katz, Gila Morgenstern, Micha Sharir
Optimal Cover of Points by Disks in a Simple Polygon. SIAM J. Comput. 40 (6) (2011)
Matthew J. Katz, Gila Morgenstern
Guarding Orthogonal Art Galleries with Sliding Cameras. Int. J. Comput. Geom. Appl. 21 (2) (2011)
Matthew J. Katz, Gila Morgenstern
Settling the bound on the rectilinear link radius of a simple rectilinear polygon. Inf. Process. Lett. 111 (3) (2011)
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Gila Morgenstern
Multi Cover of a Polygon Minimizing the Sum of Areas. WALCOM (2011)
Paz Carmi, Matthew J. Katz, Zvi Lotker, Adi Rosén
Connectivity guarantees for wireless networks with directional antennas. Comput. Geom. 44 (9) (2011)
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Michael Segal
The euclidean bottleneck steiner path problem. SCG (2011)

Matthew J. Katz.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Matthew J. Katz