( 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 Grum

Matthew The

Matthew Pugh

 

Other publications of authors with the same name

The MST of Symmetric Disk Graphs Is Light., , , and . SWAT, volume 6139 of Lecture Notes in Computer Science, page 236-247. Springer, (2010)On Guarding Rectilinear Domains., and . SWAT, volume 4059 of Lecture Notes in Computer Science, page 220-231. Springer, (2006)A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon., , and . WAOA, volume 12806 of Lecture Notes in Computer Science, page 81-96. Springer, (2020)Distance Preserving Terrain Simplification - An Experimental Study., , and . CCCG, page 129-132. Carleton University, Ottawa, Canada, (2007)Bottleneck Segment Matching., , and . CCCG, Queen's University, Ontario, Canada, (2015)Conflict-free Covering., , , , , , and . CCCG, Queen's University, Ontario, Canada, (2015)Geometric optimization via expanders and visibility of fat objects in three dimensions: two studies in computational geometry. Tel Aviv University, Israel, (1994)Tel Aviv University Library.Realistic Input Models for Geometric Algorithms., , , and . SCG, page 294-303. ACM, (1997)Settling the bound on the rectilinear link radius of a simple rectilinear polygon., and . Inf. Process. Lett., 111 (3): 103-106 (2011)Computing Fair and Bottleneck Matchings in Geormetric Graphs., and . ISAAC, volume 1178 of Lecture Notes in Computer Science, page 115-125. Springer, (1996)