Matthew J. Katz

From MaRDI portal
Person:364842

Available identifiers

zbMath Open katz.matthew-jMaRDI QIDQ364842

List of research outcomes

PublicationDate of PublicationType
Stabbing pairwise intersecting disks by four points2023-12-21Paper
On reverse shortest paths in geometric proximity graphs2023-11-23Paper
Minimum-link \(C\)-oriented paths visiting a sequence of regions in the plane2023-10-04Paper
Bottleneck matching in the plane2023-06-26Paper
Approximate nearest neighbor for curves: simple, efficient, and deterministic2023-04-28Paper
Optimal line bipartitions of point sets2023-01-25Paper
Computing fair and bottleneck matchings in geometric graphs2023-01-25Paper
Models and motion planning2022-12-09Paper
Constrained square-center problems2022-12-09Paper
Computing depth orders and related problems2022-12-09Paper
A 4-approximation of the \(\frac{ 2 \pi}{ 3} \)-MST2022-10-06Paper
Bipartite diameter and other measures under translation2022-09-16Paper
Dynamic data structures for fat objects and their applications2022-08-19Paper
https://portal.mardi4nfdi.de/entity/Q50891692022-07-18Paper
https://portal.mardi4nfdi.de/entity/Q50904542022-07-18Paper
https://portal.mardi4nfdi.de/entity/Q50753472022-05-13Paper
A 4-approximation of the \(\frac{2\pi }{3} \)-MST2022-03-25Paper
A constant-factor approximation algorithm for vertex guarding a WV-polygon2022-03-22Paper
Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains2022-01-03Paper
Minimizing total interference in asymmetric sensor networks2021-10-06Paper
https://portal.mardi4nfdi.de/entity/Q50028342021-07-28Paper
Minimizing total interference in asymmetric sensor networks2021-07-08Paper
Resolving SINR Queries in a Dynamic Setting2021-01-13Paper
Improved PTASs for convex barrier coverage2021-01-07Paper
https://portal.mardi4nfdi.de/entity/Q51362212020-11-25Paper
Sensor network topology design and analysis for efficient data gathering by a mobile mule2020-10-12Paper
Algorithms for the discrete Fréchet distance under translation2020-09-09Paper
https://portal.mardi4nfdi.de/entity/Q51164842020-08-25Paper
Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains2020-08-24Paper
Tracking paths2020-06-05Paper
Balanced line separators of unit disk graphs2020-04-22Paper
Efficient nearest-neighbor query and clustering of planar curves2020-01-16Paper
https://portal.mardi4nfdi.de/entity/Q52401272019-10-24Paper
Batched Point Location in SINR Diagrams via Algebraic Tools2019-03-28Paper
Bottleneck detour tree of points on a path2019-03-20Paper
Locating battery charging stations to facilitate almost shortest paths2019-02-08Paper
Visibility preserving terrain simplification2018-11-23Paper
The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection2018-10-30Paper
Selecting and covering colored points2018-10-26Paper
Improved PTASs for convex barrier coverage2018-06-22Paper
On interference among moving sensors and related problems2018-06-05Paper
The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection2018-04-23Paper
https://portal.mardi4nfdi.de/entity/Q46085972018-03-21Paper
On interference among moving sensors and related problems2018-03-02Paper
Farthest neighbors and center points in the presence of rectngular obstacles2017-09-29Paper
A tight bound on the number of geometric permutations of convex fat objects in {\huge $\mathbf{\reals^d}$}2017-09-29Paper
Computing the visibility graph of points within a polygon2017-09-29Paper
Balanced line separators of unit disk graphs2017-09-22Paper
Tracking Paths2017-07-21Paper
Switching to directional antennas with constant increase in radius and hop distance2017-03-27Paper
Bounded-angle spanning tree: modeling networks with angular constraints2017-03-03Paper
Symmetric Connectivity with Directional Antennas2016-12-19Paper
Choice Is Hard2016-01-11Paper
On the Chain Pair Simplification Problem2015-10-30Paper
Batched Point Location in SINR Diagrams via Algebraic Tools2015-10-27Paper
Bottleneck Steiner tree with bounded number of Steiner vertices2015-02-13Paper
Spiderman graph: visibility in urban regions2014-12-23Paper
https://portal.mardi4nfdi.de/entity/Q29217082014-10-13Paper
Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints2014-07-01Paper
The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition2014-03-25Paper
The euclidean bottleneck steiner path problem2014-03-24Paper
Bottleneck non-crossing matching in the plane2014-01-22Paper
Symmetric connectivity with directional antennas2013-09-03Paper
Approximation Schemes for Covering and Packing2013-04-12Paper
Settling the bound on the rectilinear link radius of a simple rectilinear polygon2013-04-04Paper
Improved algorithms for placing undesirable facilities2013-03-25Paper
Stable roommates spanner2012-12-04Paper
MULTI COVER OF A POLYGON MINIMIZING THE SUM OF AREAS2012-11-23Paper
Bottleneck Non-crossing Matching in the Plane2012-09-25Paper
Conflict-free coloring of points on a line with respect to a set of intervals2012-09-21Paper
Do Directional Antennas Facilitate in Reducing Interferences?2012-08-14Paper
The MST of symmetric disk graphs is light2012-06-08Paper
A scheme for computing minimum covers within simple regions2012-04-26Paper
Polychromatic 4-coloring of cubic bipartite plane graphs2012-04-13Paper
Optimal Cover of Points by Disks in a Simple Polygon2012-03-15Paper
Connectivity guarantees for wireless networks with directional antennas2011-12-28Paper
Switching to Directional Antennas with Constant Increase in Radius and Hop Distance2011-08-12Paper
GUARDING ORTHOGONAL ART GALLERIES WITH SLIDING CAMERAS2011-05-11Paper
Multi Cover of a Polygon Minimizing the Sum of Areas2011-02-20Paper
Optimal Cover of Points by Disks in a Simple Polygon2010-09-06Paper
Polychromatic 4-coloring of guillotine subdivisions2010-08-20Paper
Finding large sticks and potatoes in polygons2010-08-16Paper
The MST of Symmetric Disk Graphs Is Light2010-06-22Paper
Improved bounds on the average distance to the Fermat-Weber center of a convex object2010-06-16Paper
GUARDING RECTANGULAR PARTITIONS2010-02-12Paper
A Scheme for Computing Minimum Covers within Simple Regions2009-10-20Paper
Minimum-cost load-balancing partitions2009-08-27Paper
Computing all large sums-of-pairs in \(\mathbb R^n\) and the discrete planar two-watchtower problem2009-07-09Paper
https://portal.mardi4nfdi.de/entity/Q36015532009-02-10Paper
Covering Points by Unit Disks of Fixed Location2008-05-27Paper
Polynomial-time approximation schemes for piercing and covering with applications in wireless networks2008-03-13Paper
On guarding the vertices of rectilinear domains2008-03-13Paper
A Constant‐Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding2008-01-03Paper
On Guarding Rectilinear Domains2007-09-07Paper
Power assignment in radio networks with two power levels2007-03-12Paper
The minimum-area spanning tree problem2006-10-25Paper
Algorithms and Data Structures2006-10-25Paper
TSP with neighborhoods of varying size2005-11-16Paper
On the Fermat-Weber center of a convex object2005-11-01Paper
Algorithm Theory - SWAT 20042005-09-07Paper
Geographic quorum system approximations2005-04-29Paper
Orthogonal segment stabbing2005-01-31Paper
https://portal.mardi4nfdi.de/entity/Q44725272004-08-04Paper
Guarding scenes against invasive hypercubes.2003-08-25Paper
Maintenance of a piercing set for intervals with applications2003-08-19Paper
https://portal.mardi4nfdi.de/entity/Q44113582003-07-08Paper
A tight bound on the number of geometric permutations of convex fat objects in \(\mathbb{R}^d\)2003-03-18Paper
Walking around fat obstacles.2003-01-21Paper
Realistic input models for geometric algorithms2002-12-01Paper
Models and motion planning2002-09-03Paper
Computing Euclidean bottleneck matchings in higher dimensions2002-07-25Paper
OBNOXIOUS FACILITY LOCATION: COMPLETE SERVICE WITH MINIMAL HARM2001-04-17Paper
3-PIERCING OF d-DIMENSIONAL BOXES AND HOMOTHETIC TRIANGLES2000-12-05Paper
OPTIMAL LINE BIPARTITIONS OF POINT SETS2000-11-07Paper
On the union of \(\kappa\)-curved objects2000-10-22Paper
Discrete rectilinear 2-center problems2000-05-08Paper
Dynamic data structures for fat objects and their applications2000-05-08Paper
3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects1998-06-11Paper
An Expander-Based Approach to Geometric Optimization1998-02-10Paper
Computing depth orders for fat objects and related problems1996-11-10Paper
Optimal slope selection via expanders1993-11-15Paper
Efficient hidden surface removal for objects with small union size1993-05-16Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Matthew J. Katz