Guarding orthogonal art galleries with sliding cameras MJ Katz, G Morgenstern International Journal of Computational Geometry & Applications 21 (02), 241-250, 2011 | 39 | 2011 |

Symmetric connectivity with directional antennas R Aschner, MJ Katz, G Morgenstern Computational Geometry 46 (9), 1017-1026, 2013 | 32 | 2013 |

Approximation schemes for covering and packing R Aschner, MJ Katz, G Morgenstern, Y Yuditsky International Workshop on Algorithms and Computation, 89-100, 2013 | 32 | 2013 |

Approximation Algorithms for *B* _{1}-EPG GraphsD Epstein, MC Golumbic, G Morgenstern Algorithms and Data Structures: 13th International Symposium, WADS 2013 …, 2013 | 32 | 2013 |

Multi cover of a polygon minimizing the sum of areas AK Abu-Affash, P Carmi, MJ Katz, G Morgenstern International Journal of Computational Geometry & Applications 21 (06), 685-698, 2011 | 27 | 2011 |

Typeness for *ω*-Regular AutomataO Kupferman, G Morgenstern, A Murano Automated Technology for Verification and Analysis: Second International …, 2004 | 25 | 2004 |

Typeness for ω-regular automata O Kupferman, G Morgenstern, A Murano International Journal of Foundations of Computer Science 17 (04), 869-883, 2006 | 23 | 2006 |

Expressiveness results at the bottom of the ω-regular hierarchy G Morgenstern M. Sc. Thesis, The Hebrew University, 2003 | 16 | 2003 |

Conflict-free coloring of points on a line with respect to a set of intervals MJ Katz, N Lev-Tov, G Morgenstern Computational Geometry 45 (9), 508-514, 2012 | 15 | 2012 |

Optimal cover of points by disks in a simple polygon H Kaplan, MJ Katz, G Morgenstern, M Sharir SIAM Journal on Computing 40 (6), 1647-1661, 2011 | 14 | 2011 |

Do directional antennas facilitate in reducing interferences? R Aschner, MJ Katz, G Morgenstern Scandinavian Workshop on Algorithm Theory, 201-212, 2012 | 11 | 2012 |

Direction assignment in wireless networks. B Ben-Moshe, P Carmi, L Chaitman, MJ Katz, G Morgenstern, Y Stein CCCG 10, 39-42, 2010 | 10 | 2010 |

Conflict-free coloring of points on a line with respect to a set of intervals MJ Katz, N Lev-Tov, G Morgenstern 19th Annual Canadian Conference on Computational Geometry, CCCG 2007, 2007 | 8 | 2007 |

A scheme for computing minimum covers within simple regions MJ Katz, G Morgenstern Algorithmica 62, 349-360, 2012 | 7 | 2012 |

Edge-intersection graphs of boundary-generated paths in a grid MC Golumbic, G Morgenstern, D Rajendraprasad Discrete Applied Mathematics 236, 214-222, 2018 | 6 | 2018 |

Graph-Theoretic Concepts in Computer Science: 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers MC Golumbic, M Stern, A Levy, G Morgenstern Springer, 2012 | 6 | 2012 |

Stabbing Polygonal Chains with Rays is Hard to Approximate. S Chaplick, E Cohen, G Morgenstern CCCG, 141-144, 2013 | 5 | 2013 |

Settling the bound on the rectilinear link radius of a simple rectilinear polygon MJ Katz, G Morgenstern Information processing letters 111 (3), 103-106, 2011 | 5 | 2011 |

Hardness and approximation for L-EPG and B1-EPG graphs D Epstein, MC Golumbic, A Lahiri, G Morgenstern Discrete Applied Mathematics 281, 224-228, 2020 | 2 | 2020 |

Edge Intersection Graphs of Paths on a Grid MC Golumbic, G Morgenstern 50 years of Combinatorics, Graph Theory, and Computing, 193-209, 2019 | 1 | 2019 |