( 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

Olumuyiwa Matthew

Peter Matthew

Matthew Grum

 

Other publications of authors with the same name

Minimizing Total Interference in Asymmetric Sensor Networks., , and . ALGOSENSORS, volume 12503 of Lecture Notes in Computer Science, page 1-16. Springer, (2020)Realistic Input Models for Geometric Algorithms., , , and . Algorithmica, 34 (1): 81-97 (2002)Computing Euclidean bottleneck matchings in higher dimensions., and . Inf. Process. Lett., 75 (4): 169-174 (2000)Computing Depth Orders for Fat Objects and Related Problems., , and . Comput. Geom., (1995)Approximation Schemes for Covering and Packing., , , and . WALCOM, volume 7748 of Lecture Notes in Computer Science, page 89-100. Springer, (2013)Efficient Hidden Surface Removal for Objects with small Union Size., , and . SCG, page 31-40. ACM, (1991)Minimum-cost load-balancing partitions., , and . SCG, page 301-308. ACM, (2006)Batched Point Location in SINR Diagrams via Algebraic Tools., and . ICALP (1), volume 9134 of Lecture Notes in Computer Science, page 65-77. Springer, (2015)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)Bottleneck Steiner Tree with Bounded Number of Steiner Vertices., , and . CCCG, (2011)