( en | de | ru )

 

Disambiguation of "Morgenstern, Gila"

Author of the publication

copydeleteadd this publication to your clipboard
Symmetric Connectivity with Directional Antennas.

, , and . ALGOSENSORS, volume 7718 of Lecture Notes in Computer Science, page 18-29. Springer, (2012)

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.

Karin Birge Gilardoni-Büch

Andrea Gilardoni

Alexander Gilanschah

Roger Gilabert-Oriol

Parviz Gila

 

Other publications of authors with the same name

Approximation Schemes for Covering and Packing., , , and . WALCOM, volume 7748 of Lecture Notes in Computer Science, page 89-100. Springer, (2013)Conflict-Free Coloring of Points on a Line with respect to a Set of Intervals., , and . CCCG, page 93-96. Carleton University, Ottawa, Canada, (2007)Approximation Schemes for Covering and Packing, , , and . CoRR, (2012)Typeness for omega-Regular Automata., , and . ATVA, volume 3299 of Lecture Notes in Computer Science, page 324-338. Springer, (2004)A Scheme for Computing Minimum Covers within Simple Regions., and . WADS, volume 5664 of Lecture Notes in Computer Science, page 447-458. Springer, (2009)Student Poster Session., , , and . WG, volume 7551 of Lecture Notes in Computer Science, page 4-6. Springer, (2012)Symmetric Connectivity with Directional Antennas., , and . ALGOSENSORS, volume 7718 of Lecture Notes in Computer Science, page 18-29. Springer, (2012)Stabbing Polygonal Chains with Rays is Hard to Approximate., , and . CCCG, Carleton University, Ottawa, Canada, (2013)Settling the bound on the rectilinear link radius of a simple rectilinear polygon., and . Inf. Process. Lett., 111 (3): 103-106 (2011)A Scheme for Computing Minimum Covers within Simple Regions., and . Algorithmica, 62 (1-2): 349-360 (2012)