Gila Morgenstern

According to our database, Gila Morgenstern authored at least 17 papers between 2004 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Helly and strong Helly numbers of B_k-EPG and B_k-VPG graphs.

Claudson F. Bornstein, Gila Morgenstern, Tanilson D. Santos, Uéverton S. Souza, Jayme Luiz Szwarcfiter

Discuss. Math. Graph Theory, 2023

2020

Hardness and approximation for L-EPG and B1-EPG graphs.

Dror Epstein, Martin Charles Golumbic, Abhiruk Lahiri, Gila Morgenstern

Discret. Appl. Math., 2020

2018

Edge-intersection graphs of boundary-generated paths in a grid.

Martin Charles Golumbic, Gila Morgenstern, Deepak Rajendraprasad

Discret. Appl. Math., 2018

2013

Approximation Schemes for Covering and Packing.

Rom Aschner, Matthew J. Katz, Gila Morgenstern, Yelena Yuditsky

Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

Approximation Algorithms for B 1-EPG Graphs.

Dror Epstein, Martin Charles Golumbic, Gila Morgenstern

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Stabbing Polygonal Chains with Rays is Hard to Approximate.

Steven Chaplick, Elad Cohen, Gila Morgenstern

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012

Student Poster Session.

Martin Charles Golumbic, Michal Stern, Avivit Levy, Gila Morgenstern

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

Do Directional Antennas Facilitate in Reducing Interferences?

Rom Aschner, Matthew J. Katz, Gila Morgenstern

Proceedings of the Algorithm Theory - SWAT 2012, 2012

Symmetric Connectivity with Directional Antennas.

Rom Aschner, Matthew J. Katz, Gila Morgenstern

Proceedings of the Algorithms for Sensor Systems, 2012

2011

Settling the bound on the rectilinear link radius of a simple rectilinear polygon.

Matthew J. Katz, Gila Morgenstern

Inf. Process. Lett., 2011

Guarding Orthogonal Art Galleries with Sliding Cameras.

Matthew J. Katz, Gila Morgenstern

Int. J. Comput. Geom. Appl., 2011

Multi Cover of a Polygon Minimizing the Sum of Areas.

A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Gila Morgenstern

Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

2010

Optimal Cover of Points by Disks in a Simple Polygon.

Haim Kaplan, Matthew J. Katz, Gila Morgenstern, Micha Sharir

Proceedings of the Algorithms, 2010

Direction assignment in wireless networks.

Boaz Ben-Moshe, Paz Carmi, Lilach Chaitman, Matthew J. Katz, Gila Morgenstern, Yael Stein

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009

A Scheme for Computing Minimum Covers within Simple Regions.

Matthew J. Katz, Gila Morgenstern

Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

2007

Conflict-Free Coloring of Points on a Line with respect to a Set of Intervals.

Matthew J. Katz, Nissan Lev-Tov, Gila Morgenstern

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2004

Typeness for omega-Regular Automata.

Orna Kupferman, Gila Morgenstern, Aniello Murano

Proceedings of the Automated Technology for Verification and Analysis: Second International Conference, 2004