Matthew J. Katz

发表

Polychromatic 4-coloring of guillotine subdivisions

Maarten Löffler, Elad Horev, Matthew J. Katz, 2009, Inf. Process. Lett..

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

Matthew J. Katz, Paz Carmi, Nissan Lev-Tov, 2008, Comput. Geom..

Balanced line separators of unit disk graphs

Yoshio Okamoto, Marcel Roeloffzen, Matthew J. Katz, 2020, Comput. Geom..

The Discrete Fréchet Gap pdf

Matthew J. Katz, Omrit Filtser, 2015, ArXiv.

The MST of symmetric disk graphs is light

Matthew J. Katz, Paz Carmi, A. Karim Abu-Affash, 2010, Comput. Geom..

On piercing sets of objects

Frank Nielsen, Matthew J. Katz, M. J. Katz, 1996, SCG '96.

Dynamic data structures for fat objects and their applications

Frank Nielsen, Micha Sharir, Matthew J. Katz, 1997, Comput. Geom..

Optimal Cover of Points by Disks in a Simple Polygon

Haim Kaplan, Micha Sharir, Matthew J. Katz, 2010, SIAM J. Comput..

Bottleneck detour tree of points on a path

Matthew J. Katz, Paz Carmi, Stefan Langerman, 2019, Comput. Geom..

Maintenance of a Piercing Set for Intervals with Applications

Frank Nielsen, Michael Segal, Matthew J. Katz, 2000, Algorithmica.

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

Michael Segal, Matthew J. Katz, Paz Carmi, 2014, Discret. Comput. Geom..

On the Fermat-Weber center of a convex object

Matthew J. Katz, Sariel Har-Peled, Paz Carmi, 2005, Comput. Geom..

Finding large sticks and potatoes in polygons

Joseph S. B. Mitchell, Matthew J. Katz, Piyush Kumar, 2006, SODA '06.

Bottleneck non-crossing matching in the plane

Matthew J. Katz, Paz Carmi, A. Karim Abu-Affash, 2014, Comput. Geom..

Maintenance of a Percing Set for Intervals with Applications

Frank Nielsen, Michael Segal, Matthew J. Katz, 2000, ISAAC.

Computing Depth Orders for Fat Objects and Related Problems

Micha Sharir, Matthew J. Katz, Pankaj K. Agarwal, 1995, Comput. Geom..

The MST of symmetric disk graphs is light

Matthew J. Katz, Paz Carmi, A. Karim Abu-Affash, 2012, Comput. Geom..

Esther M. Arkin, Joseph S. B. Mitchell, Matthew J. Katz, 2015, ISAAC.

Sixteenth European Workshop on Computational Geometry - Editorial

Matthew J. Katz, Klara Kedem, 2002, Comput. Geom..

Batched Point Location in SINR Diagrams via Algebraic Tools

Boris Aronov, Matthew J. Katz, M. J. Katz, 2014, ICALP.

Efficient Hidden Surface Removal for Objects with Small Union Size

Micha Sharir, Matthew J. Katz, Mark H. Overmars, 1992, Comput. Geom..

Front Matter, Table of Contents, Foreword, Conference Organization, External Reviewers, Sponsors

Boris Aronov, Matthew J. Katz, 2017, Symposium on Computational Geometry.

On Kinetic Range Spaces and their Applications pdf

Marcel Roeloffzen, Matthew J. Katz, Jean-Lou De Carufel, 2015, ArXiv.

Symmetric connectivity with directional antennas

Matthew J. Katz, Rom Aschner, Gila Morgenstern, 2013, Comput. Geom..

Minimum-cost load-balancing partitions

Matthew J. Katz, Paz Carmi, 2006, SCG '06.

Visibility preserving terrain simplification: an experimental study

Joseph S. B. Mitchell, Matthew J. Katz, Boaz Ben-Moshe, 2002, SCG '02.

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

Matthew J. Katz, Stav Ashur, 2020, ArXiv.

Multi Cover of a Polygon Minimizing the Sum of Areas

Matthew J. Katz, Paz Carmi, A. Karim Abu-Affash, 2011, WALCOM.

Bottleneck Steiner Tree with Bounded Number of Steiner Vertices

Matthew J. Katz, Paz Carmi, A. Karim Abu-Affash, 2011, CCCG.

Walking around fat obstacles

Matthew J. Katz, Klara Kedem, L. Paul Chew, 2002, Inf. Process. Lett..

Covering Points by Unit Disks of Fixed Location

Matthew J. Katz, Paz Carmi, Nissan Lev-Tov, 2007, ISAAC.

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

Joseph S. B. Mitchell, Matthew J. Katz, Boaz Ben-Moshe, 2007, SIAM J. Comput..

Approximation Schemes for Covering and Packing

Matthew J. Katz, Yelena Yuditsky, Rom Aschner, 2012, WALCOM.

Optimal Line Bipartitions of Point Sets

Matthew J. Katz, Olivier Devillers, 1999, Int. J. Comput. Geom. Appl..

Polychromatic 4-coloring of cubic bipartite plane graphs

Elad Horev, Matthew J. Katz, Roi Krakovski, 2012, Discret. Math..

Dynamic Data Structures for Fat Objects and Their Applications

Frank Nielsen, Micha Sharir, Matthew J. Katz, 1997, WADS.

Computing the visibility graph of points within a polygon

Joseph S. B. Mitchell, Matthew J. Katz, Boaz Ben-Moshe, 2004, SCG '04.

Balanced Line Separators of Unit Disk Graphs

Yoshio Okamoto, Marcel Roeloffzen, Matthew J. Katz, 2017, WADS.

Multi Cover of a Polygon Minimizing the Sum of Areas

Matthew J. Katz, Paz Carmi, A. Karim Abu-Affash, 2011, Int. J. Comput. Geom. Appl..

On the union of k-curved objects

Matthew J. Katz, Alon Efrat, 1999, Comput. Geom..

14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2014, September 11, 2014, Wroclaw, Poland

Esther M. Arkin, Joseph S. B. Mitchell, Matthew J. Katz, 2014, ATMOS.

Network Optimization on Partitioned Pairs of Points

Esther M. Arkin, Joseph S. B. Mitchell, Matthew J. Katz, 2017, ISAAC.

An Expander-Based Approach to Geometric Optimization

Micha Sharir, Matthew J. Katz, 1997, SIAM J. Comput..

Orthogonal segment stabbing

Joseph S. B. Mitchell, Matthew J. Katz, Yuval Nir, 2005, Comput. Geom..

Improved PTASs for Convex Barrier Coverage

Matthew J. Katz, Paz Carmi, Yael Stein, 2017, WAOA.

Efficient Nearest-Neighbor Query and Clustering of Planar Curves

Boris Aronov, Matthew J. Katz, Omrit Filtser, 2019, WADS.

TSP with Neighborhoods of Varying Size

Joachim Gudmundsson, Mark de Berg, Matthew J. Katz, 2002, ESA.

Guarding Orthogonal Art Galleries with Sliding Cameras

Matthew J. Katz, Gila Morgenstern, M. J. Katz, 2011, Int. J. Comput. Geom. Appl..

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

Matthew J. Katz, Kasturi Varadarajan, 2001, Discret. Comput. Geom..

3-Piercing of d-Dimensional Boxes and Homothetic Triangles

Matthew J. Katz, Eyal Assa, 1999, Int. J. Comput. Geom. Appl..

Bottleneck non-crossing matching in the plane pdf

Matthew J. Katz, Paz Carmi, A. Karim Abu-Affash, 2012, Comput. Geom..

Bipartite Diameter and Other Measures Under Translation

Boris Aronov, Matthew J. Katz, Omrit Filtser, 2019, Discrete & Computational Geometry.

Minimum power energy spanners in wireless ad hoc networks

Matthew J. Katz, Paz Carmi, A. Karim Abu-Affash, 2010, 2010 Proceedings IEEE INFOCOM.

Farthest neighbors and center points in the presence of rectngular obstacles

Joseph S. B. Mitchell, Matthew J. Katz, Boaz Ben-Moshe, 2001, SCG '01.

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

Matthew J. Katz, Paz Carmi, Boaz Ben-Moshe, 2004, Inf. Process. Lett..

Improved bounds on the average distance to the Fermat-Weber center of a convex object

Matthew J. Katz, A. Karim Abu-Affash, 2009, Inf. Process. Lett..

Matthew J. Katz, Eli Packer, Aritra Banik, 2017, CIAC.

TSP with neighborhoods of varying size

Joachim Gudmundsson, Mark de Berg, Matthew J. Katz, 2005, J. Algorithms.

Minimizing Total Interference in Asymmetric Sensor Networks

Matthew J. Katz, Paz Carmi, A. Karim Abu-Affash, 2020, ALGOSENSORS.

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

Matthew J. Katz, Nissan Lev-Tov, Gila Morgenstern, 2012, CCCG.

Matthew J. Katz, Eli Packer, Aritra Banik, 2020, Discret. Appl. Math..

Minimum power energy spanners in wireless ad hoc networks

Matthew J. Katz, Paz Carmi, A. Karim Abu-Affash, 2011, Wirel. Networks.

Distance Preserving Terrain Simplification - An Experimental Study

Matthew J. Katz, Boaz Ben-Moshe, Igor Zaslavsky, 2007, CCCG.

Locating battery charging stations to facilitate almost shortest paths

Esther M. Arkin, Joseph S. B. Mitchell, Michael Segal, 2019, Discret. Appl. Math..

The minimum area spanning tree problem

Joseph S. B. Mitchell, Matthew J. Katz, Paz Carmi, 2006, EuroCG.

Stable Roommates Spanner

Prosenjit Bose, Matthew J. Katz, Paz Carmi, 2013, Comput. Geom..

On the union of κ-curved objects

Matthew J. Katz, Alon Efrat, M. J. Katz, 1998, SCG '98.

Stabbing Pairwise Intersecting Disks by Four Points pdf

Pat Morin, Matthew J. Katz, Paz Carmi, 2018, Discrete & Computational Geometry.

Constrained Square-Center Problems

Michael Segal, Matthew J. Katz, Klara Kedem, 1998, SWAT.

Obnoxious facility location: Complete service with minimal harm

Matthew J. Katz, Boaz Ben-Moshe, Michael Segal, 2000, CCCG.

Selecting and covering colored points

Esther M. Arkin, Joseph S. B. Mitchell, Matthew J. Katz, 2018, Discret. Appl. Math..

Models and Motion Planning

Mark de Berg, Matthew J. Katz, Mark H. Overmars, 1998, SWAT.

Improved algorithms in geometric optimization via expanders

Matthew J. Katz, 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

Plans for Multiple Agents

Matthew J. Katz, Jeffrey S. Rosenschein, M. J. Katz, 1989, Distributed Artificial Intelligence.

Approximate Nearest Neighbor for Curves: Simple, Efficient, and Deterministic pdf

Matthew J. Katz, Arnold Filtser, Omrit Filtser, 2019, Algorithmica.

Algorithms for the Discrete Fréchet Distance Under Translation

Matthew J. Katz, Omrit Filtser, M. J. Katz, 2020, SWAT.

A Scheme for Computing Minimum Covers within Simple Regions

Matthew J. Katz, Gila Morgenstern, M. J. Katz, 2012, Algorithmica.

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

Matthew J. Katz, 1997, Comput. Geom..

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

Haim Kaplan, Micha Sharir, Matthew J. Katz, 2014, Symposium on Computational Geometry.

Computing Fair and Bottleneck Matchings in Geormetric Graphs

Matthew J. Katz, Alon Efrat, M. J. Katz, 1996, ISAAC.

Batched Point Location in SINR Diagrams via Algebraic Tools pdf

Boris Aronov, Matthew J. Katz, 2015, ICALP.

Proceedings of the 30th Canadian Conference on Computational Geometry, CCCG 2018, August 8-10, 2018, University of Manitoba, Winnipeg, Manitoba, Canada

Erik Jan van Leeuwen, Kyle Fox, Marcel Roeloffzen, 2018, CCCG.

Dynamic Time Warping-Based Proximity Problems

Boris Aronov, Matthew J. Katz, Elad Sulami, 2020, MFCS.

Power Assignment in Radio Networks with Two Power Levels

Matthew J. Katz, Paz Carmi, 2004, SWAT.

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

Haim Kaplan, Micha Sharir, Matthew J. Katz, 2015, TALG.

On Guarding Rectilinear Domains

Matthew J. Katz, Gabriel S. Roisman, M. J. Katz, 2006, SWAT.

Visibility preserving terrain simplification-- an experimental study

Joseph S. B. Mitchell, Matthew J. Katz, Boaz Ben-Moshe, 2004, Comput. Geom..

On the General Chain Pair Simplification Problem

Matthew J. Katz, Binhai Zhu, Omrit Filtser, 2016, MFCS.

On Interference Among Moving Sensors and Related Problems

Marcel Roeloffzen, Matthew J. Katz, Jean-Lou De Carufel, 2016, ESA.

Efficient hidden surface removal for objects with small union size

Micha Sharir, Matthew J. Katz, Mark H. Overmars, 1991, SCG '91.

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

Prosenjit Bose, Matthew J. Katz, Paz Carmi, 2012, Algorithmica.

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

Matthew J. Katz, Omrit Filtser, Stav Ashur, 2019, ArXiv.

Symmetric Connectivity with Directional Antennas

Matthew J. Katz, Rom Aschner, Gila Morgenstern, 2012, ALGOSENSORS.

Approximating the Visible Region of a Point on a Terrain

Matthew J. Katz, Paz Carmi, Boaz Ben-Moshe, 2008, GeoInformatica.

Improved PTASs for convex barrier coverage

Matthew J. Katz, Paz Carmi, Yael Stein, 2021, Comput. Geom..

A Scheme for Computing Minimum Covers within Simple Regions

Matthew J. Katz, Gila Morgenstern, M. J. Katz, 2009, Algorithmica.

Minimum-Cost Load-Balancing Partitions

Boris Aronov, Matthew J. Katz, Paz Carmi, 2007, Algorithmica.

Bottleneck Segment Matching

Matthew J. Katz, Aritra Banik, Marina Simakov, 2015, CCCG.

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

Matthew J. Katz, Stav Ashur, 2020 .

Optimal Slope Selection Via Expanders

Micha Sharir, Matthew J. Katz, 1993, CCCG.

Spiderman graph: Visibility in urban regions

Matthew J. Katz, Paz Carmi, Eran Friedman, 2015, Comput. Geom..

Guest Editors’ Foreword

Boris Aronov, Matthew J. Katz, 2019, Discret. Comput. Geom..

Improved algorithms for placing undesirable facilities

Michael Segal, Matthew J. Katz, Klara Kedem, 2002, CCCG.

Models and motion planning

Mark de Berg, Matthew J. Katz, Mark H. Overmars, 2002, Comput. Geom..

On interference among moving sensors and related problems

Marcel Roeloffzen, Matthew J. Katz, Jean-Lou De Carufel, 2017, J. Comput. Geom..

A tight bound on the number of geometric permutations of convex fat objects in {\huge $\mathbf{\reals^d}$}

Matthew J. Katz, Kasturi R. Varadarajan, 2001, SCG '01.

Optimal Line Bipartitions of Point Sets

Matthew J. Katz, Olivier Devillers, 1996, ISAAC.

Resolving SINR Queries in a Dynamic Setting

Boris Aronov, Matthew J. Katz, Gali Bar-On, 2018, ICALP.

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

Matthew J. Katz, Gila Morgenstern, 2011, Inf. Process. Lett..

On the Chain Pair Simplification Problem pdf

Matthew J. Katz, Binhai Zhu, Omrit Filtser, 2015, WADS.

Geographic Quorum System Approximations

Michael Segal, Matthew J. Katz, Sariel Har-Peled, 2005, Algorithmica.

An expander-based approach to geometric optimization

Micha Sharir, Matthew J. Katz, 1993, SCG '93.

Guarding scenes against invasive hypercubes

Mark de Berg, Matthew J. Katz, Mark H. Overmars, 2003, Comput. Geom..

Efficient data retrieval in faulty sensor networks using a mobile mule

Michael Segal, Matthew J. Katz, Paz Carmi, 2017, 2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt).

Realistic input models for geometric algorithms

Mark de Berg, Matthew J. Katz, Jules Vleugels, 1997, SCG '97.

Connectivity guarantees for wireless networks with directional antennas

Matthew J. Katz, Paz Carmi, Adi Rosén, 2011, Comput. Geom..

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

Prosenjit Bose, Matthew J. Katz, Paz Carmi, 2011, WADS.

Direction assignment in wireless networks

Matthew J. Katz, Paz Carmi, Boaz Ben-Moshe, 2010, CCCG.

Realistic Input Models for Geometric Algorithms

Mark de Berg, Matthew J. Katz, Jules Vleugels, 2002, Algorithmica.

Optimal Cover of Points by Disks in a Simple Polygon

Haim Kaplan, Micha Sharir, Matthew J. Katz, 2011, SIAM J. Comput..

Guarding Rectangular Partitions

Matthew J. Katz, Roi Krakovski, Yefim Dinitz, 2009, Int. J. Comput. Geom. Appl..

Discrete rectilinear 2-center problems

Michael Segal, Matthew J. Katz, Klara Kedem, 2000, Comput. Geom..

Conflict-free Covering

Esther M. Arkin, Joseph S. B. Mitchell, Matthew J. Katz, 2015, CCCG.

On guarding the vertices of rectilinear domains

Matthew J. Katz, Gabriel S. Roisman, M. J. Katz, 2008, Comput. Geom..

Fault-tolerant power assignment and backbone in wireless networks

Hanan Shpungin, Matthew J. Katz, Paz Carmi, 2006, Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06).

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

Matthew J. Katz, 2018, ArXiv.

The euclidean bottleneck steiner path problem

Michael Segal, Matthew J. Katz, Paz Carmi, 2011, SoCG '11.

Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints

Matthew J. Katz, Rom Aschner, 2015, Algorithmica.

Locating Battery Charging Stations to Facilitate Almost Shortest Paths

Esther M. Arkin, Joseph S. B. Mitchell, Michael Segal, 2014, ATMOS.

Geometry Helps in Bottleneck Matching and Related Problems

Alon Itai, Matthew J. Katz, Alon Efrat, 2001, Algorithmica.

Computing Euclidean bottleneck matchings in higher dimensions

Matthew J. Katz, Alon Efrat, 2000, Inf. Process. Lett..

Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints

Matthew J. Katz, Rom Aschner, 2014, ICALP.

Resolving SINR Queries in a Dynamic Setting

Boris Aronov, Matthew J. Katz, Gali Bar-On, 2020, SIAM J. Comput..

Computing Depth Orders and Related Problems

Micha Sharir, Matthew J. Katz, Pankaj K. Agarwal, 1994, SWAT.

Shooter Location through Piercing Sets

Frank Nielsen, Michael Segal, Matthew J. Katz, 2000, EuroCG.

Exploiting Geometry in the SINR _k Model

Matthew J. Katz, Rom Aschner, Gui Citovsky, 2014, ALGOSENSORS.

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

Michael Segal, Matthew J. Katz, Paz Carmi, 2020, Algorithmica.

Do Directional Antennas Facilitate in Reducing Interferences?

Matthew J. Katz, Rom Aschner, Gila Morgenstern, 2012, SWAT.

A constant-factor approximation algorithm for optimal terrain guarding

Joseph S. B. Mitchell, Matthew J. Katz, Boaz Ben-Moshe, 2005, SODA '05.

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

Matthew J. Katz, Omrit Filtser, Stav Ashur, 2019, WAOA.

Verifying plans for multiple agents

Matthew J. Katz, Jeffrey S. Rosenschein, M. J. Katz, 1993, J. Exp. Theor. Artif. Intell..

Geometric Problems and Structures Arising from the Study of Wireless Networks

Matthew J. Katz, 2018, CCCG.

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

Micha Sharir, Matthew J. Katz, 2021, ArXiv.

Minimizing total interference in asymmetric sensor networks

Matthew J. Katz, Paz Carmi, A. Karim Abu-Affash, 2021, Theor. Comput. Sci..

A framework for 1-D compaction with forbidden region avoidance

Michael Segal, Matthew J. Katz, Klara Kedem, 1992 .