Publications

---

My DBLP entry (not necessarily up to date...)

---

PhD Thesis - Covering Geometric Domains ; Hebrew abstract .



Journal papers

• A scheme for computing minimum covers within simple regions.
  M. J. Katz and G. Morgenstern
  Algorithmica, 62(1-2): 349-360 (2012).
  
  
• Optimal cover of points by disks in a simple polygon.
  H. Kaplan, M. J. Katz, G. Morgenstern and M. Sharir.
  SIAM J. Comput., 40(6): 1647-1661 (2011).
  
  
• Multi Cover of a Polygon Minimizing the Sum of Areas.
  A.K. Abu-Affash, P. Carmi, M.J. Katz and G. Morgenstern.
  Int. J. Comput. Geom. , to appear.
  
  
• Settling the Bound on the Rectilinear Link Radius of a Simple Rectilinear Polygon.
  M. J. Katz and G. Morgenstern
  Information Processing Letters, 111 (2011), 103-106.
  
  
• Guarding orthogonal art galleries with sliding cameras.
  M. J. Katz and G. Morgenstern
  Int. J. Comput. Geom. 21 : 2 (2011), 241-250.
  
  
• Conflict-free coloring of points on a line with respect to a set of intervals.
  M.J. Katz, N. Lev-Tov and G. Morgenstern
  Comp. Geom., Theory and Appls, to appear.
  
  
• Typeness for \omega-regular automata.
  O. Kupferman, G. Morgenstern and A. Murano
  Int. J. Found. Comput. Sci. 17(4): 869-884 (2006).

Conference papers

• Symmetric Connectivity with Directional Antennas.
  R. Aschner, M. J. Katz and G. Morgenstern.
  Proc. 8th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS), 2012, to appear.
  CoRR, abs/1108.0492.
  
  
• Do Directional Antennas Facilitate in Reducing Interferences?
  R. Aschner, M. J. Katz and G. Morgenstern.
  13th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), 2012, 201-212.
  
  
• Multi Cover of a Polygon Minimizing the Sum of Areas.
  A.K. Abu-Affash, P. Carmi, M.J. Katz and G. Morgenstern.
  Proc. Workshop on Algorithms and Computation, 2011, 134-145, LNCS 6552
  
  
• Optimal cover of points by disks in a simple polygon.
  H. Kaplan, M. J. Katz, G. Morgenstern and M. Sharir.
  Proc. European Symposium on Algorithms (2010), 475-486.
  Full version.
  
  
• Direction assignment in wireless networks.
  B. Ben-Moshe, P. Carmi, L. Chaitman, M. J. Katz, G. Morgenstern and Y. Stein.
  Proc. 22nd Canadian Conf. on Computational Geometry (2010), 39-42.
  
  
• A scheme for computing minimum covers within simple regions.
  M.J. Katz and G. Morgenstern.
  Proc. 11th Algorithms and Data Structures Symp. 2009, 447-458.



• Guarding orthogonal art galleries with sliding cameras.
  M. J. Katz and G. Morgenstern
  Proc. 25th European Workshop on Computational Geometry. 2009, 159-162.



• Conflict-free coloring of points on a line with respect to a set of intervals.
  M. J. Katz, N. Lev-Tov and G. Morgenstern.
  Proc. 19th Canadian Conf. on Computational Geometry. 2007, 93-96.



• Typeness for \omega-regular automata.
  O. Kupferman, G. Morgenstern and A. Murano
  ATVA 04, 2004.