default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthew J. Katz
Matya Katz
Person information
- affiliation: Ben-Gurion University, Beersheba, Israel
Other persons with a similar name
- Matthew Katz
- Matthew L. Katz (aka: Matthew Lubelski Katz)
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j80]Tsuri Farhana, Matthew J. Katz:
Spanners under the Hausdorff and Fréchet distances. Inf. Process. Lett. 187: 106513 (2025)- 2024
- [j79]Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir
:
On reverse shortest paths in geometric proximity graphs. Comput. Geom. 117: 102053 (2024) - [c84]Boris Aronov, Tsuri Farhana, Matthew J. Katz, Indu Ramesh:
Discrete Fréchet Distance Oracles. SoCG 2024: 10:1-10:14 - [c83]Rathish Das, Omrit Filtser, Matthew J. Katz, Joseph S. B. Mitchell:
Robustly Guarding Polygons. SoCG 2024: 47:1-47:17 - [c82]Pankaj K. Agarwal, Haim Kaplan, Matthew J. Katz, Micha Sharir:
Segment Proximity Graphs and Nearest Neighbor Queries Amid Disjoint Segments. ESA 2024: 7:1-7:20 - [c81]Matthew J. Katz, Rachel Saban, Micha Sharir:
Near-Linear Algorithms for Visibility Graphs over a 1.5-Dimensional Terrain. ESA 2024: 77:1-77:17 - [i30]Rathish Das, Omrit Filtser, Matthew J. Katz, Joseph S. B. Mitchell:
Robustly Guarding Polygons. CoRR abs/2403.11861 (2024) - [i29]Boris Aronov, Tsuri Farhana, Matthew J. Katz, Indu Ramesh:
Discrete Fr\'echet Distance Oracles. CoRR abs/2404.04065 (2024) - 2023
- [j78]Arnold Filtser, Omrit Filtser, Matthew J. Katz:
Approximate Nearest Neighbor for Curves: Simple, Efficient, and Deterministic. Algorithmica 85(5): 1490-1519 (2023) - [j77]Stav Ashur, Matthew J. Katz:
A 4-approximation of the 2π3-MST. Comput. Geom. 108: 101914 (2023) - [j76]Matthew J. Katz, Micha Sharir:
Bottleneck matching in the plane. Comput. Geom. 112: 101986 (2023) - [j75]Paz Carmi, Matthew J. Katz, Pat Morin:
Stabbing Pairwise Intersecting Disks by Four Points. Discret. Comput. Geom. 70(4): 1751-1784 (2023) - [c80]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: 247-262 - [c79]Haim Kaplan, Matthew J. Katz, Rachel Saban, Micha Sharir:
The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs. ESA 2023: 67:1-67:14 - [i28]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 abs/2302.06776 (2023) - [i27]Haim Kaplan, Matthew J. Katz, Rachel Saban, Micha Sharir:
The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs. CoRR abs/2307.14663 (2023) - [i26]Tsuri Farhana, Matthew J. Katz:
Spanners under the Hausdorff and Fréchet Distances. CoRR abs/2311.06013 (2023) - 2022
- [j74]Stav Ashur, Omrit Filtser, Matthew J. Katz, Rachel Saban:
Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains. Comput. Geom. 101: 101832 (2022) - [j73]Boris Aronov, Omrit Filtser, Matthew J. Katz, Khadijeh Sheikhan:
Bipartite Diameter and Other Measures Under Translation. Discret. Comput. Geom. 68(3): 647-663 (2022) - [c78]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: 4:1-4:14 - [c77]Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir:
On Reverse Shortest Paths in Geometric Proximity Graphs. ISAAC 2022: 42:1-42:19 - [c76]Boris Aronov, Matthew J. Katz:
Dynamic Approximate Multiplicatively-Weighted Nearest Neighbors. SWAT 2022: 11:1-11:14 - [i25]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 abs/2203.10241 (2022) - [i24]Matthew J. Katz, Micha Sharir:
Bottleneck Matching in the Plane. CoRR abs/2205.05887 (2022) - 2021
- [j72]Paz Carmi, Matthew J. Katz, Rachel Saban, Yael Stein:
Improved PTASs for convex barrier coverage. Comput. Geom. 92: 101684 (2021) - [j71]Stav Ashur, Omrit Filtser, Matthew J. Katz:
A constant-factor approximation algorithm for vertex guarding a WV-polygon. J. Comput. Geom. 12(1): 128-144 (2021) - [j70]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz:
Minimizing total interference in asymmetric sensor networks. Theor. Comput. Sci. 889: 171-181 (2021) - [c75]Stav Ashur, Matthew J. Katz:
A 4-Approximation of the $\frac{2\pi }{3}$-MST. WADS 2021: 129-143 - [i23]Matthew J. Katz, Micha Sharir:
Efficient algorithms for optimization problems involving distances in a point set. CoRR abs/2111.02052 (2021) - 2020
- [j69]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): 2784-2808 (2020) - [j68]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) - [j67]Aritra Banik, Matthew J. Katz, Eli Packer, Marina Simakov:
Tracking Paths. Discret. Appl. Math. 282: 22-34 (2020) - [j66]Omrit Filtser, Matthew J. Katz:
Algorithms for the discrete Fréchet distance under translation. J. Comput. Geom. 11(1): 156-175 (2020) - [j65]Boris Aronov, Gali Bar-On, Matthew J. Katz:
Resolving SINR Queries in a Dynamic Setting. SIAM J. Comput. 49(6): 1271-1290 (2020) - [c74]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz:
Minimizing Total Interference in Asymmetric Sensor Networks. ALGOSENSORS 2020: 1-16 - [c73]Arnold Filtser, Omrit Filtser, Matthew J. Katz:
Approximate Nearest Neighbor for Curves - Simple, Efficient, and Deterministic. ICALP 2020: 48:1-48:19 - [c72]Boris Aronov, Matthew J. Katz, Elad Sulami:
Dynamic Time Warping-Based Proximity Problems. MFCS 2020: 9:1-9:12 - [c71]Stav Ashur, Omrit Filtser, Matthew J. Katz:
A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon. WAOA 2020: 81-96 - [i22]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz:
Minimizing Total Interference in Asymmetric Sensor Networks. CoRR abs/2004.08847 (2020) - [i21]Stav Ashur, Matthew J. Katz:
A 4-Approximation of the $\frac{2π}{3}$-MST. CoRR abs/2010.11571 (2020)
2010 – 2019
- 2019
- [j64]Greg Aloupis, Paz Carmi, Lilach Chaitman-Yerushalmi, Matthew J. Katz, Stefan Langerman:
Bottleneck detour tree of points on a path. Comput. Geom. 79: 30-36 (2019) - [j63]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: 10-16 (2019) - [j62]Boris Aronov, Matthew J. Katz:
Guest Editors' Foreword. Discret. Comput. Geom. 61(4): 695-697 (2019) - [c70]Boris Aronov, Omrit Filtser, Matthew J. Katz, Khadijeh Sheikhan:
Bipartite Diameter and Other Measures Under Translation. STACS 2019: 8:1-8:14 - [c69]Boris Aronov, Omrit Filtser, Michael Horton, Matthew J. Katz, Khadijeh Sheikhan:
Efficient Nearest-Neighbor Query and Clustering of Planar Curves. WADS 2019: 28-42 - [c68]Stav Ashur, Omrit Filtser, Matthew J. Katz, Rachel Saban:
Terrain-Like Graphs: PTASs for Guarding Weakly-Visible Polygons and Terrains. WAOA 2019: 1-17 - [i20]Arnold Filtser, Omrit Filtser, Matthew J. Katz:
Approximate Nearest Neighbor for Curves - Simple, Efficient, and Deterministic. CoRR abs/1902.07562 (2019) - [i19]Boris Aronov, Omrit Filtser, Michael Horton, Matthew J. Katz, Khadijeh Sheikhan:
Efficient Nearest-Neighbor Query and Clustering of Planar Curves. CoRR abs/1904.11026 (2019) - [i18]Stav Ashur, Omrit Filtser, Matthew J. Katz:
A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon. CoRR abs/1907.01228 (2019) - 2018
- [j61]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: 75-86 (2018) - [j60]Boris Aronov, Matthew J. Katz:
Batched Point Location in SINR Diagrams via Algebraic Tools. ACM Trans. Algorithms 14(4): 41:1-41:29 (2018) - [c67]Matthew J. Katz:
Geometric Problems and Structures Arising from the Study of Wireless Networks. CCCG 2018: 1 - [c66]Boris Aronov, Gali Bar-On, Matthew J. Katz:
Resolving SINR Queries in a Dynamic Setting. ICALP 2018: 145:1-145:13 - [c65]Omrit Filtser, Matthew J. Katz:
Algorithms for the Discrete Fréchet Distance Under Translation. SWAT 2018: 20:1-20:14 - [i17]Matthew J. Katz:
A PTAS for vertex guarding weakly-visible polygons - An extended abstract. CoRR abs/1803.02160 (2018) - [i16]Boris Aronov, Gali Bar-On, Matthew J. Katz:
Resolving SINR Queries in a Dynamic Setting. CoRR abs/1804.10654 (2018) - [i15]Paz Carmi, Matthew J. Katz, Pat Morin:
Stabbing Pairwise Intersecting Disks by Four Points. CoRR abs/1812.06907 (2018) - 2017
- [j59]Rom Aschner, Matthew J. Katz:
Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints. Algorithmica 77(2): 349-373 (2017) - [j58]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): 32-46 (2017) - [c64]Aritra Banik, Matthew J. Katz, Eli Packer, Marina Simakov:
Tracking Paths. CIAC 2017: 67-79 - [c63]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: 6:1-6:12 - [c62]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: 241-252 - [c61]Paz Carmi, Matthew J. Katz, Rachel Saban, Yael Stein:
Improved PTASs for Convex Barrier Coverage. WAOA 2017: 26-40 - [c60]Harel Yedidsion, Aritra Banik, Paz Carmi, Matthew J. Katz, Michael Segal:
Efficient data retrieval in faulty sensor networks using a mobile mule. WiOpt 2017: 1-8 - [e1]Boris Aronov, Matthew J. Katz:
33rd International Symposium on Computational Geometry, SoCG 2017, July 4-7, 2017, Brisbane, Australia. LIPIcs 77, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-038-5 [contents] - [i14]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 abs/1709.02579 (2017) - [i13]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 abs/1710.00876 (2017) - 2016
- [c59]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: 34:1-34:11 - [c58]Chenglin Fan, Omrit Filtser, Matthew J. Katz, Binhai Zhu:
On the General Chain Pair Simplification Problem. MFCS 2016: 37:1-37:14 - 2015
- [j57]Paz Carmi, Eran Friedman, Matthew J. Katz:
Spiderman graph: Visibility in urban regions. Comput. Geom. 48(3): 251-259 (2015) - [j56]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz:
Bottleneck Steiner tree with bounded number of Steiner vertices. J. Discrete Algorithms 30: 96-100 (2015) - [j55]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): 29:1-29:29 (2015) - [c57]Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov:
Conflict-free Covering. CCCG 2015 - [c56]Aritra Banik, Matthew J. Katz, Marina Simakov:
Bottleneck Segment Matching. CCCG 2015 - [c55]Boris Aronov, Matthew J. Katz:
Batched Point Location in SINR Diagrams via Algebraic Tools. ICALP (1) 2015: 65-77 - [c54]Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov:
Choice Is Hard. ISAAC 2015: 318-328 - [c53]Chenglin Fan, Omrit Filtser, Matthew J. Katz, Tim Wylie, Binhai Zhu:
On the Chain Pair Simplification Problem. WADS 2015: 351-362 - [i12]Omrit Filtser, Matthew J. Katz:
The Discrete Fréchet Gap. CoRR abs/1506.04861 (2015) - [i11]Jean-Lou De Carufel, Matya Katz, Matias Korman, André van Renssen, Marcel Roeloffzen, Shakhar Smorodinsky:
On Kinetic Range Spaces and their Applications. CoRR abs/1507.02130 (2015) - 2014
- [j54]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): 397-409 (2014) - [j53]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Yohai Trabelsi:
Bottleneck non-crossing matching in the plane. Comput. Geom. 47(3): 447-457 (2014) - [j52]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): 1-23 (2014) - [c52]Rom Aschner, Gui Citovsky, Matthew J. Katz:
Exploiting Geometry in the SINR _k Model. ALGOSENSORS 2014: 125-135 - [c51]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: 25-33 - [c50]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: 377 - [c49]Rom Aschner, Matthew J. Katz:
Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints. ICALP (2) 2014: 387-398 - [i10]Rom Aschner, Matthew J. Katz:
Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints. CoRR abs/1402.6096 (2014) - [i9]Omrit Filtser, Matthew J. Katz, Tim Wylie, Binhai Zhu:
On the Chain Pair Simplification Problem. CoRR abs/1409.2457 (2014) - [i8]Boris Aronov, Matthew J. Katz:
Batched Point Location in SINR Diagrams via Algebraic Tools. CoRR abs/1412.0962 (2014) - 2013
- [j51]Prosenjit Bose, Paz Carmi, Lilach Chaitman-Yerushalmi, Sébastien Collette, Matthew J. Katz, Stefan Langerman:
Stable Roommates Spanner. Comput. Geom. 46(2): 120-130 (2013) - [j50]Rom Aschner, Matthew J. Katz, Gila Morgenstern:
Symmetric connectivity with directional antennas. Comput. Geom. 46(9): 1017-1026 (2013) - [c48]Rom Aschner, Matthew J. Katz, Gila Morgenstern, Yelena Yuditsky:
Approximation Schemes for Covering and Packing. WALCOM 2013: 89-100 - [i7]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 abs/1310.5245 (2013) - 2012
- [j49]Matthew J. Katz, Gila Morgenstern:
A Scheme for Computing Minimum Covers within Simple Regions. Algorithmica 62(1-2): 349-360 (2012) - [j48]A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz:
The MST of symmetric disk graphs is light. Comput. Geom. 45(1-2): 54-61 (2012) - [j47]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): 508-514 (2012) - [j46]Elad Horev, Matthew J. Katz, Roi Krakovski, Atsuhiro Nakamoto:
Polychromatic 4-coloring of cubic bipartite plane graphs. Discret. Math. 312(4): 715-719 (2012) - [c47]Rom Aschner, Matthew J. Katz, Gila Morgenstern:
Symmetric Connectivity with Directional Antennas. ALGOSENSORS 2012: 18-29 - [c46]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Yohai Trabelsi:
Bottleneck Non-crossing Matching in the Plane. ESA 2012: 36-47 - [c45]Rom Aschner, Matthew J. Katz, Gila Morgenstern:
Do Directional Antennas Facilitate in Reducing Interferences? SWAT 2012: 201-212 - [i6]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Yohai Trabelsi:
Bottleneck Non-Crossing Matching in the Plane. CoRR abs/1202.4146 (2012) - [i5]Rom Aschner, Matthew J. Katz, Gila Morgenstern, Yelena Yuditsky:
Approximation Schemes for Covering and Packing. CoRR abs/1209.5199 (2012) - 2011
- [j45]Paz Carmi, Matthew J. Katz, Zvi Lotker, Adi Rosén:
Connectivity guarantees for wireless networks with directional antennas. Comput. Geom. 44(9): 477-485 (2011) - [j44]Matthew J. Katz, Gila Morgenstern:
Guarding Orthogonal Art Galleries with Sliding Cameras. Int. J. Comput. Geom. Appl. 21(2): 241-250 (2011) - [j43]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Gila Morgenstern:
Multi Cover of a Polygon Minimizing the Sum of Areas. Int. J. Comput. Geom. Appl. 21(6): 685-698 (2011) - [j42]Matthew J. Katz, Gila Morgenstern:
Settling the bound on the rectilinear link radius of a simple rectilinear polygon. Inf. Process. Lett. 111(3): 103-106 (2011) - [j41]Haim Kaplan, Matthew J. Katz, Gila Morgenstern, Micha Sharir:
Optimal Cover of Points by Disks in a Simple Polygon. SIAM J. Comput. 40(6): 1647-1661 (2011) - [j40]A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz:
Minimum power energy spanners in wireless ad hoc networks. Wirel. Networks 17(5): 1251-1258 (2011) - [c44]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz:
Bottleneck Steiner Tree with Bounded Number of Steiner Vertices. CCCG 2011 - [c43]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Michael Segal:
The euclidean bottleneck steiner path problem. SCG 2011: 440-447 - [c42]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. WADS 2011: 134-146 - [c41]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Gila Morgenstern:
Multi Cover of a Polygon Minimizing the Sum of Areas. WALCOM 2011: 134-145 - [i4]Rom Aschner, Matthew J. Katz, Gila Morgenstern:
Symmetric Connectivity with Directional Antennas. CoRR abs/1108.0492 (2011) - 2010
- [c40]Boaz Ben-Moshe, Paz Carmi, Lilach Chaitman, Matthew J. Katz, Gila Morgenstern, Yael Stein:
Direction assignment in wireless networks. CCCG 2010: 39-42 - [c39]Haim Kaplan, Matthew J. Katz, Gila Morgenstern, Micha Sharir:
Optimal Cover of Points by Disks in a Simple Polygon. ESA (1) 2010: 475-486 - [c38]A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz:
Minimum Power Energy Spanners in Wireless Ad Hoc Networks. INFOCOM 2010: 2411-2416 - [c37]A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz:
The MST of Symmetric Disk Graphs Is Light. SWAT 2010: 236-247
2000 – 2009
- 2009
- [j39]Boris Aronov, Paz Carmi, Matthew J. Katz:
Minimum-Cost Load-Balancing Partitions. Algorithmica 54(3): 318-336 (2009) - [j38]Yefim Dinitz, Matthew J. Katz, Roi Krakovski:
Guarding Rectangular Partitions. Int. J. Comput. Geom. Appl. 19(6): 579-594 (2009) - [j37]A. Karim Abu-Affash, Matthew J. Katz:
Improved bounds on the average distance to the Fermat-Weber center of a convex object. Inf. Process. Lett. 109(6): 329-333 (2009) - [j36]Elad Horev, Matthew J. Katz, Roi Krakovski, Maarten Löffler:
Polychromatic 4-coloring of guillotine subdivisions. Inf. Process. Lett. 109(13): 690-694 (2009) - [c36]Matthew J. Katz, Gila Morgenstern:
A Scheme for Computing Minimum Covers within Simple Regions. WADS 2009: 447-458 - 2008
- [j35]Paz Carmi, Matthew J. Katz, Nissan Lev-Tov:
Polynomial-time approximation schemes for piercing and covering with applications in wireless networks. Comput. Geom. 39(3): 209-218 (2008) - [j34]Matthew J. Katz, Gabriel S. Roisman:
On guarding the vertices of rectilinear domains. Comput. Geom. 39(3): 219-228 (2008) - [j33]Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz:
Approximating the Visible Region of a Point on a Terrain. GeoInformatica 12(1): 21-36 (2008) - [c35]A. Karim Abu-Affash, Matthew J. Katz:
Improved Bounds on the Average Distance to the Fermat-Weber Center of a Convex Object. CCCG 2008 - 2007
- [j32]Paz Carmi, Matthew J. Katz, Michael Segal, Hanan Shpungin:
Fault-Tolerant Power Assignment and Backbone in Wireless Networks. Ad Hoc Sens. Wirel. Networks 4(4): 355-366 (2007) - [j31]Paz Carmi, Matthew J. Katz:
Power Assignment in Radio Networks with Two Power Levels. Algorithmica 47(2): 183-201 (2007) - [j30]Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell:
A Constant-Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding. SIAM J. Comput. 36(6): 1631-1647 (2007) - [c34]Matthew J. Katz, Nissan Lev-Tov, Gila Morgenstern:
Conflict-Free Coloring of Points on a Line with respect to a Set of Intervals. CCCG 2007: 93-96 - [c33]Boaz Ben-Moshe, Matthew J. Katz, Igor Zaslavsky:
Distance Preserving Terrain Simplification - An Experimental Study. CCCG 2007: 129-132 - [c32]Paz Carmi, Matthew J. Katz, Nissan Lev-Tov:
Covering Points by Unit Disks of Fixed Location. ISAAC 2007: 644-655 - 2006
- [j29]Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell:
The minimum-area spanning tree problem. Comput. Geom. 35(3): 218-225 (2006) - [c31]Boris Aronov, Paz Carmi, Matthew J. Katz:
Minimum-cost load-balancing partitions. SCG 2006: 301-308 - [c30]Paz Carmi, Michael Segal, Matthew J. Katz, Hanan Shpungin:
Fault-Tolerant Power Assignment and Backbone in Wireless Networks. PerCom Workshops 2006: 80-84 - [c29]Olaf A. Hall-Holt, Matthew J. Katz, Piyush Kumar, Joseph S. B. Mitchell, Arik Sityon:
Finding large sticks and potatoes in polygons. SODA 2006: 474-483 - [c28]Matthew J. Katz, Gabriel S. Roisman:
On Guarding Rectilinear Domains. SWAT 2006: 220-231 - [i3]Paz Carmi, Matthew J. Katz:
Power Assignment in Radio Networks with Two Power Levels. Geometric Networks and Metric Space Embeddings 2006 - 2005
- [j28]Paz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew J. Katz, Michael Segal:
Geographic Quorum System Approximations. Algorithmica 41(4): 233-244 (2005) - [j27]Matthew J. Katz, Joseph S. B. Mitchell, Yuval Nir:
Orthogonal segment stabbing. Comput. Geom. 30(2): 197-205 (2005) - [j26]Paz Carmi, Sariel Har-Peled, Matthew J. Katz:
On the Fermat-Weber center of a convex object. Comput. Geom. 32(3): 188-195 (2005) - [j25]Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen:
TSP with neighborhoods of varying size. J. Algorithms 57(1): 22-36 (2005) - [c27]Paz Carmi, Matthew J. Katz:
Minimum-Cost Load-Balancing Partitions. CCCG 2005: 65-67 - [c26]Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell:
A constant-factor approximation algorithm for optimal terrain guarding. SODA 2005: 515-524 - [c25]Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell:
The Minimum-Area Spanning Tree Problem. WADS 2005: 195-204 - [i2]Paz Carmi, Matthew J. Katz:
The minimum area spanning tree problem. EuroCG 2005: 191-194 - 2004
- [j24]Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell, Yuval Nir:
Visibility preserving terrain simplification-- an experimental study. Comput. Geom. 28(2-3): 175-190 (2004) - [j23]Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz:
Computing all large sums-of-pairs in Rn and the discrete planar two-watchtower problem. Inf. Process. Lett. 89(3): 137-139 (2004) - [c24]Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz:
Approximating the Visible Region of a Point on a Terrain. ALENEX/ANALC 2004: 120-128 - [c23]Boaz Ben-Moshe, Olaf A. Hall-Holt, Matthew J. Katz, Joseph S. B. Mitchell:
Computing the visibility graph of points within a polygon. SCG 2004: 27-35 - [c22]Paz Carmi, Matthew J. Katz:
Power Assignment in Radio Networks with Two Power Levels. SWAT 2004: 431-441 - 2003
- [j22]Matthew J. Katz, Frank Nielsen, Michael Segal:
Maintenance of a Piercing Set for Intervals with Applications. Algorithmica 36(1): 59-73 (2003) - [j21]Mark de Berg, Haggai David, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels:
Guarding scenes against invasive hypercubes. Comput. Geom. 26(2): 99-117 (2003) - 2002
- [j20]Mark de Berg, A. Frank van der Stappen, Jules Vleugels, Matthew J. Katz:
Realistic Input Models for Geometric Algorithms. Algorithmica 34(1): 81-97 (2002) - [j19]Matthew J. Katz, Klara Kedem:
Sixteenth European Workshop on Computational Geometry - Editorial. Comput. Geom. 21(1-2): 1 (2002) - [j18]Mark de Berg, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels:
Models and motion planning. Comput. Geom. 23(1): 53-68 (2002) - [j17]Matthew J. Katz, Klara Kedem, Michael Segal:
Improved algorithms for placing undesirable facilities. Comput. Oper. Res. 29(13): 1859-1872 (2002) - [j16]L. Paul Chew, Haggai David, Matthew J. Katz, Klara Kedem:
Walking around fat obstacles. Inf. Process. Lett. 83(3): 135-140 (2002) - [c21]Boaz Ben-Moshe, Joseph S. B. Mitchell, Matthew J. Katz, Yuval Nir:
Visibility preserving terrain simplification: an experimental study. SCG 2002: 303-311 - [c20]Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen:
TSP with Neighborhoods of Varying Size. ESA 2002: 187-199 - 2001
- [j15]Alon Efrat, Alon Itai, Matthew J. Katz:
Geometry Helps in Bottleneck Matching and Related Problems. Algorithmica 31(1): 1-28 (2001) - [j14]Matthew J. Katz, Kasturi R. Varadarajan:
A Tight Bound on the Number of Geometric Permutations of Convex Fat Objects in Rd. Discret. Comput. Geom. 26(4): 543-548 (2001) - [c19]Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell:
Farthest neighbors and center points in the presence of rectangular obstacles. SCG 2001: 164-171 - [c18]Matthew J. Katz, Kasturi R. Varadarajan:
A tight bound on the number of geometric permutations of convex fat objects in Rd. SCG 2001: 249-251 - 2000
- [j13]Matthew J. Katz, Klara Kedem, Michael Segal:
Discrete rectilinear 2-center problems. Comput. Geom. 15(4): 203-214 (2000) - [j12]Alon Efrat, Matthew J. Katz, Frank Nielsen, Micha Sharir:
Dynamic data structures for fat objects and their applications. Comput. Geom. 15(4): 215-227 (2000) - [j11]Boaz Ben-Moshe, Matthew J. Katz, Michael Segal:
Obnoxious Facility Location: Complete Service with Minimal Harm. Int. J. Comput. Geom. Appl. 10(6): 581-592 (2000) - [j10]Alon Efrat, Matthew J. Katz:
Computing Euclidean bottleneck matchings in higher dimensions. Inf. Process. Lett. 75(4): 169-174 (2000) - [c17]Matthew J. Katz, Frank Nielsen, Michael Segal:
Maintenance of a Percing Set for Intervals with Applications. ISAAC 2000: 552-563 - [i1]Matthew J. Katz, Frank Nielsen, Michael Segal:
Shooter Location through Piercing Sets. EuroCG 2000: 55-58
1990 – 1999
- 1999
- [j9]Alon Efrat, Matthew J. Katz:
On the union of k-curved objects. Comput. Geom. 14(4): 241-254 (1999) - [j8]Olivier Devillers, Matthew J. Katz:
Optimal Line Bipartitions of Point Sets. Int. J. Comput. Geom. Appl. 9(1): 39-51 (1999) - [j7]Eyal Assa, Matthew J. Katz:
3-Piercing of d-Dimensional Boxes and Homothetic Triangles. Int. J. Comput. Geom. Appl. 9(3): 249-260 (1999) - [c16]Boaz Ben-Moshe, Matthew J. Katz, Michael Segal:
Obnoxious facility location: Complete service with minimal harm. CCCG 1999 - [c15]Matthew J. Katz, Klara Kedem, Michael Segal:
Improved algorithms for placing undesirable facilities. CCCG 1999 - 1998
- [c14]Alon Efrat, Matthew J. Katz:
On the Union of k-Curved Objects. SCG 1998: 206-213 - [c13]Mark de Berg, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels:
Models and Motion Planning. SWAT 1998: 83-94 - [c12]Matthew J. Katz, Klara Kedem, Michael Segal:
Constrained Square-Center Problems. SWAT 1998: 95-106 - [c11]Mark de Berg, Haggai David, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels:
Guarding Scenes against Invasive Hypercubes. WAE 1998: 110-120 - 1997
- [j6]Matthew J. Katz:
3-D Vertical Ray Shooting and 2-D Point Enclosure, Range Searching, and Arc Shooting Amidst Convex Fat Objects. Comput. Geom. 8: 299-316 (1997) - [j5]Matthew J. Katz, Micha Sharir:
An Expander-Based Approach to Geometric Optimization. SIAM J. Comput. 26(5): 1384-1408 (1997) - [c10]Mark de Berg, Matthew J. Katz, A. Frank van der Stappen, Jules Vleugels:
Realistic Input Models for Geometric Algorithms. SCG 1997: 294-303 - [c9]Alon Efrat, Matthew J. Katz, Frank Nielsen, Micha Sharir:
Dynamic Data Structures for Fat Objects and Their Applications. WADS 1997: 297-306 - 1996
- [c8]Matthew J. Katz, Frank Nielsen:
On Piercing Sets of Objects. SCG 1996: 113-121 - [c7]Olivier Devillers, Matthew J. Katz:
Optimal Line Bipartitions of Point Sets. ISAAC 1996: 45-54 - [c6]Alon Efrat, Matthew J. Katz:
Computing Fair and Bottleneck Matchings in Geormetric Graphs. ISAAC 1996: 115-125 - 1995
- [j4]Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir:
Computing Depth Orders for Fat Objects and Related Problems. Comput. Geom. 5: 187-206 (1995) - [c5]Matthew J. Katz:
Improved Algorithms in Geometric Optimization via Expanders. ISTCS 1995: 78-87 - 1994
- [b1]Matthew J. Katz:
Geometric optimization via expanders and visibility of fat objects in three dimensions: two studies in computational geometry. Tel Aviv University, Israel, 1994 - [c4]Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir:
Computing Depth Orders and Related Problems. SWAT 1994: 1-12 - 1993
- [j3]Matthew J. Katz, Micha Sharir:
Optimal Slope Selection via Expanders. Inf. Process. Lett. 47(3): 115-122 (1993) - [j2]Matthew J. Katz, Jeffrey S. Rosenschein:
Verifying plans for multiple agents. J. Exp. Theor. Artif. Intell. 5(1): 39-56 (1993) - [c3]Matthew J. Katz, Micha Sharir:
Optimal Slope Selection Via Expanders. CCCG 1993: 139-144 - [c2]Matthew J. Katz, Micha Sharir:
An Expander-Based Approach to Geometric Optimization. SCG 1993: 198-207 - 1992
- [j1]Matthew J. Katz, Mark H. Overmars, Micha Sharir:
Efficient Hidden Surface Removal for Objects with Small Union Size. Comput. Geom. 2: 223-234 (1992) - 1991
- [c1]Matthew J. Katz, Mark H. Overmars, Micha Sharir:
Efficient Hidden Surface Removal for Objects with small Union Size. SCG 1991: 31-40
1980 – 1989
- 1989
- [p1]Matthew J. Katz, Jeffrey S. Rosenschein:
Plans for Multiple Agents. Distributed Artificial Intelligence 1989: 197-228
Coauthor Index
[j75] [j72] [j70] [j69] [j68] [c74] [i22] [j64] [j63] [j61] [i15] [c63] [c62] [c61] [c60] [i14] [i13] [j57] [j56] [c57] [c54] [j54] [j53] [j52] [c51] [j51] [j48] [c46] [i6] [j45] [j43] [j40] [c44] [c43] [c42] [c41] [c40] [c38] [c37] [j39] [j35] [j33] [j32] [j31] [c32] [j29] [c31] [c30] [i3] [j28] [j26] [c27] [c25] [i2] [j23] [c24] [c22]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 00:44 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
