Name
Affiliation
Papers
MATTHEW J. KATZ
Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel 84105
24
Collaborators
Citations 
PageRank 
39
130
12.41
Referers 
Referees 
References 
258
275
141
Search Limit
100275
Title
Citations
PageRank
Year
Minimizing Total Interference In Asymmetric Sensor Networks00.342021
Dynamic Time Warping-Based Proximity Problems.00.342020
Resolving Sinr Queries In A Dynamic Setting00.342020
Efficient Nearest-Neighbor Query and Clustering of Planar Curves00.342019
Terrain-Like Graphs: Ptass For Guarding Weakly-Visible Polygons And Terrains00.342019
Stabbing Pairwise Intersecting Disks by Four Points.10.432018
Geometric Problems and Structures Arising from the Study of Wireless Networks.00.342018
A PTAS for vertex guarding weakly-visible polygons - An extended abstract.00.342018
Balanced Line Separators of Unit Disk Graphs.00.342017
Improved PTASs for convex barrier coverage00.342017
On Interference Among Moving Sensors And Related Problems00.342017
Choice Is Hard.40.482015
Conflict-free Covering.30.412015
Switching to directional antennas with constant increase in radius and hop distance120.652014
The Euclidean Bottleneck Steiner Path Problem and Other Applications of (ź,β)-Pair Decomposition10.362014
Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints.60.452014
Exploiting Geometry in the SINR _k Model.10.362014
Locating battery charging stations to facilitate almost shortest paths00.342014
Approximation Schemes for Covering and Packing20.382013
Covering points by unit disks of fixed location401.522007
Distance Preserving Terrain Simplification - An Experimental Study10.392007
A Constant-Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding241.242007
A constant-factor approximation algorithm for optimal terrain guarding211.172005
Approximating the Visible Region of a Point on a Terrain140.842004