The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Matthew J. Katz: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz
    Approximating the Visible Region of a Point on a Terrain. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:120-128 [Conf]
  2. Boaz Ben-Moshe, Matthew J. Katz, Michael Segal
    Obnoxious facility location: Complete service with minimal harm. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  3. Paz Carmi, Matthew J. Katz
    Minimum-Cost Load-Balancing Partitions. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:65-67 [Conf]
  4. Matthew J. Katz, Klara Kedem, Michael Segal
    Improved algorithms for placing undesirable facilities. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  5. Matthew J. Katz, Micha Sharir
    Optimal Slope Selection Via Expanders. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:139-144 [Conf]
  6. Boris Aronov, Paz Carmi, Matthew J. Katz
    Minimum-cost load-balancing partitions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:301-308 [Conf]
  7. Boaz Ben-Moshe, Olaf Hall-Holt, Matthew J. Katz, Joseph S. B. Mitchell
    Computing the visibility graph of points within a polygon. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:27-35 [Conf]
  8. Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell
    Farthest neighbors and center points in the presence of rectangular obstacles. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:164-171 [Conf]
  9. Boaz Ben-Moshe, Joseph S. B. Mitchell, Matthew J. Katz, Yuval Nir
    Visibility preserving terrain simplification: an experimental study. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:303-311 [Conf]
  10. Mark de Berg, Matthew J. Katz, A. Frank van der Stappen, Jules Vleugels
    Realistic Input Models for Geometric Algorithms. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:294-303 [Conf]
  11. Alon Efrat, Matthew J. Katz
    On the Union of k-Curved Objects. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:206-213 [Conf]
  12. Matthew J. Katz, Frank Nielsen
    On Piercing Sets of Objects. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:113-121 [Conf]
  13. Matthew J. Katz, Mark H. Overmars, Micha Sharir
    Efficient Hidden Surface Removal for Objects with small Union Size. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:31-40 [Conf]
  14. Matthew J. Katz, Micha Sharir
    An Expander-Based Approach to Geometric Optimization. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:198-207 [Conf]
  15. Matthew J. Katz, Kasturi R. Varadarajan
    A tight bound on the number of geometric permutations of convex fat objects in Rd. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:249-251 [Conf]
  16. Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen
    TSP with Neighborhoods of Varying Size. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:187-199 [Conf]
  17. Matthew J. Katz, Frank Nielsen, Michael Segal
    Shooter Location through Piercing Sets. [Citation Graph (0, 0)][DBLP]
    EWCG, 2000, pp:55-58 [Conf]
  18. Olivier Devillers, Matthew J. Katz
    Optimal Line Bipartitions of Point Sets. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1996, pp:45-54 [Conf]
  19. Alon Efrat, Matthew J. Katz
    Computing Fair and Bottleneck Matchings in Geormetric Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1996, pp:115-125 [Conf]
  20. Matthew J. Katz, Frank Nielsen, Michael Segal
    Maintenance of a Percing Set for Intervals with Applications. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:552-563 [Conf]
  21. Matthew J. Katz
    Improved Algorithms in Geometric Optimization via Expanders. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1995, pp:78-87 [Conf]
  22. Paz Carmi, Michael Segal, Matthew J. Katz, Hanan Shpungin
    Fault-Tolerant Power Assignment and Backbone in Wireless Networks. [Citation Graph (0, 0)][DBLP]
    PerCom Workshops, 2006, pp:80-84 [Conf]
  23. Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell
    A constant-factor approximation algorithm for optimal terrain guarding. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:515-524 [Conf]
  24. Olaf Hall-Holt, Matthew J. Katz, Piyush Kumar, Joseph S. B. Mitchell, Arik Sityon
    Finding large sticks and potatoes in polygons. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:474-483 [Conf]
  25. Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir
    Computing Depth Orders and Related Problems. [Citation Graph (0, 0)][DBLP]
    SWAT, 1994, pp:1-12 [Conf]
  26. Paz Carmi, Matthew J. Katz
    Power Assignment in Radio Networks with Two Power Levels. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:431-441 [Conf]
  27. Mark de Berg, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels
    Models and Motion Planning. [Citation Graph (0, 0)][DBLP]
    SWAT, 1998, pp:83-94 [Conf]
  28. Matthew J. Katz, Klara Kedem, Michael Segal
    Constrained Square-Center Problems. [Citation Graph (0, 0)][DBLP]
    SWAT, 1998, pp:95-106 [Conf]
  29. Matthew J. Katz, Gabriel S. Roisman
    On Guarding Rectilinear Domains. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:220-231 [Conf]
  30. Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell
    The Minimum-Area Spanning Tree Problem. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:195-204 [Conf]
  31. Alon Efrat, Matthew J. Katz, Frank Nielsen, Micha Sharir
    Dynamic Data Structures for Fat Objects and Their Applications. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:297-306 [Conf]
  32. Mark de Berg, Haggai David, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels
    Guarding Scenes against Invasive Hypercubes. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1998, pp:110-120 [Conf]
  33. Mark de Berg, A. Frank van der Stappen, Jules Vleugels, Matthew J. Katz
    Realistic Input Models for Geometric Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:34, n:1, pp:81-97 [Journal]
  34. Paz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew J. Katz, Michael Segal
    Geographic Quorum System Approximations. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:41, n:4, pp:233-244 [Journal]
  35. Alon Efrat, Alon Itai, Matthew J. Katz
    Geometry Helps in Bottleneck Matching and Related Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:31, n:1, pp:1-28 [Journal]
  36. Matthew J. Katz, Frank Nielsen, Michael Segal
    Maintenance of a Piercing Set for Intervals with Applications. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:36, n:1, pp:59-73 [Journal]
  37. Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell, Yuval Nir
    Visibility preserving terrain simplification-- an experimental study. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:28, n:2-3, pp:175-190 [Journal]
  38. Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir
    Computing Depth Orders for Fat Objects and Related Problems. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1995, v:5, n:, pp:187-206 [Journal]
  39. Mark de Berg, Haggai David, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels
    Guarding scenes against invasive hypercubes. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:26, n:2, pp:99-117 [Journal]
  40. Mark de Berg, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels
    Models and motion planning. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:23, n:1, pp:53-68 [Journal]
  41. Paz Carmi, Sariel Har-Peled, Matthew J. Katz
    On the Fermat-Weber center of a convex object. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:32, n:3, pp:188-195 [Journal]
  42. Alon Efrat, Matthew J. Katz
    On the union of k-curved objects. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:14, n:4, pp:241-254 [Journal]
  43. Alon Efrat, Matthew J. Katz, Frank Nielsen, Micha Sharir
    Dynamic data structures for fat objects and their applications. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:15, n:4, pp:215-227 [Journal]
  44. Matthew J. Katz
    3-D Vertical Ray Shooting and 2-D Point Enclosure, Range Searching, and Arc Shooting Amidst Convex Fat Objects. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:299-316 [Journal]
  45. Matthew J. Katz, Klara Kedem
    Sixteenth European Workshop on Computational Geometry - Editorial. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:21, n:1-2, pp:1- [Journal]
  46. Matthew J. Katz, Klara Kedem, Michael Segal
    Discrete rectilinear 2-center problems. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:15, n:4, pp:203-214 [Journal]
  47. Matthew J. Katz, Joseph S. B. Mitchell, Yuval Nir
    Orthogonal segment stabbing. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:30, n:2, pp:197-205 [Journal]
  48. Matthew J. Katz, Mark H. Overmars, Micha Sharir
    Efficient Hidden Surface Removal for Objects with Small Union Size. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:223-234 [Journal]
  49. Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell
    The minimum-area spanning tree problem. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:35, n:3, pp:218-225 [Journal]
  50. Matthew J. Katz, Klara Kedem, Michael Segal
    Improved algorithms for placing undesirable facilities. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2002, v:29, n:13, pp:1859-1872 [Journal]
  51. Matthew J. Katz, Kasturi R. Varadarajan
    A Tight Bound on the Number of Geometric Permutations of Convex Fat Objects in Rd. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:4, pp:543-548 [Journal]
  52. Eyal Assa, Matthew J. Katz
    3-Piercing of d-Dimensional Boxes and Homothetic Triangles. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1999, v:9, n:3, pp:249-0 [Journal]
  53. Boaz Ben-Moshe, Matthew J. Katz, Michael Segal
    Obnoxious Facility Location: Complete Service with Minimal Harm. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2000, v:10, n:6, pp:581-592 [Journal]
  54. Olivier Devillers, Matthew J. Katz
    Optimal Line Bipartitions of Point Sets. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1999, v:9, n:1, pp:39-51 [Journal]
  55. Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz
    Computing all large sums-of-pairs in Rn and the discrete planar two-watchtower problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:89, n:3, pp:137-139 [Journal]
  56. L. Paul Chew, Haggai David, Matthew J. Katz, Klara Kedem
    Walking around fat obstacles. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:83, n:3, pp:135-140 [Journal]
  57. Alon Efrat, Matthew J. Katz
    Computing Euclidean bottleneck matchings in higher dimensions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:75, n:4, pp:169-174 [Journal]
  58. Matthew J. Katz, Micha Sharir
    Optimal Slope Selection via Expanders. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:47, n:3, pp:115-122 [Journal]
  59. Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen
    TSP with neighborhoods of varying size. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:57, n:1, pp:22-36 [Journal]
  60. Matthew J. Katz, Micha Sharir
    An Expander-Based Approach to Geometric Optimization. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:5, pp:1384-1408 [Journal]
  61. Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell
    A Constant-Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:6, pp:1631-1647 [Journal]
  62. Boaz Ben-Moshe, Matthew J. Katz, Igor Zaslavsky
    Distance Preserving Terrain Simplification - An Experimental Study. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:129-132 [Conf]
  63. Matthew J. Katz, Nissan Lev-Tov, Gila Morgenstern
    Conflict-Free Coloring of Points on a Line with respect to a Set of Intervals. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:93-96 [Conf]
  64. Paz Carmi, Matthew J. Katz
    Power Assignment in Radio Networks with Two Power Levels. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:47, n:2, pp:183-201 [Journal]

  65. Improved Bounds on the Average Distance to the Fermat-Weber Center of a Convex Object. [Citation Graph (, )][DBLP]


  66. Direction assignment in wireless networks. [Citation Graph (, )][DBLP]


  67. Power Assignment in Radio Networks with Two Power Levels. [Citation Graph (, )][DBLP]


  68. Optimal Cover of Points by Disks in a Simple Polygon. [Citation Graph (, )][DBLP]


  69. The minimum area spanning tree problem. [Citation Graph (, )][DBLP]


  70. Minimum Power Energy Spanners in Wireless Ad Hoc Networks. [Citation Graph (, )][DBLP]


  71. Covering Points by Unit Disks of Fixed Location. [Citation Graph (, )][DBLP]


  72. The MST of Symmetric Disk Graphs Is Light. [Citation Graph (, )][DBLP]


  73. A Scheme for Computing Minimum Covers within Simple Regions. [Citation Graph (, )][DBLP]


  74. Minimum-Cost Load-Balancing Partitions. [Citation Graph (, )][DBLP]


  75. Polynomial-time approximation schemes for piercing and covering with applications in wireless networks. [Citation Graph (, )][DBLP]


  76. On guarding the vertices of rectilinear domains. [Citation Graph (, )][DBLP]


Search in 0.012secs, Finished in 0.018secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002