( en | de | ru )

 

Disambiguation of "Katz, Matthew J."

Author of the publication

copydeleteadd this publication to your clipboard
A constant-factor approximation algorithm for optimal terrain guarding.

, , and . SODA, page 515-524. SIAM, (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Matthew Mellon

Matthew David

Matthew Smith

Peter Matthew

Olumuyiwa Matthew

 

Other publications of authors with the same name

Efficient Hidden Surface Removal for Objects with Small Union Size, , and . Computational Geometry: Theory and Applications, (1992)Bottleneck Steiner Tree with Bounded Number of Steiner Vertices., , and . CCCG, (2011)Resolving SINR Queries in a Dynamic Setting., , and . ICALP, volume 107 of LIPIcs, page 145:1-145:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Minimizing Total Interference in Asymmetric Sensor Networks., , and . ALGOSENSORS, volume 12503 of Lecture Notes in Computer Science, page 1-16. Springer, (2020)Minimum-Link C-Oriented Paths Visiting a Sequence of Regions in the Plane., , , and . CIAC, volume 13898 of Lecture Notes in Computer Science, page 247-262. Springer, (2023)Minimum-Cost Load-Balancing Partitions., and . CCCG, page 65-67. (2005)Conflict-Free Coloring of Points on a Line with respect to a Set of Intervals., , and . CCCG, page 93-96. Carleton University, Ottawa, Canada, (2007)Computing Euclidean bottleneck matchings in higher dimensions., and . Inf. Process. Lett., 75 (4): 169-174 (2000)Approximation Schemes for Covering and Packing., , , and . WALCOM, volume 7748 of Lecture Notes in Computer Science, page 89-100. Springer, (2013)Minimum-cost load-balancing partitions., , and . SCG, page 301-308. ACM, (2006)