( en | de | ru )

 

Disambiguation of "Cohen, Elad"

Author of the publication

copydeleteadd this publication to your clipboard
Stabbing Polygonal Chains with Rays is Hard to Approximate.

, , and . CCCG, Carleton University, Ottawa, Canada, (2013)

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.

Leonard Ekangwo Elad

Dominique Eladari

Hossam Eladly

Rudolf Cohen

Serge Cohen

 

Other publications of authors with the same name

Stabbing Polygonal Chains with Rays is Hard to Approximate., , and . CCCG, Carleton University, Ottawa, Canada, (2013)What Is between Chordal and Weakly Chordal Graphs?., , , and . WG, volume 5344 of Lecture Notes in Computer Science, page 275-286. (2008)Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid., , and . WG, volume 6986 of Lecture Notes in Computer Science, page 319-330. Springer, (2011)Characterizations of cographs as intersection graphs of paths on a grid., , and . Discret. Appl. Math., (2014)Vertex Intersection Graphs of Paths on a Grid., , , , , and . J. Graph Algorithms Appl., 16 (2): 129-150 (2012)Intersection graphs of paths on a grid.. University of Haifa, Israel, (2012)Posets and VPG Graphs., , , and . Order, 33 (1): 39-49 (2016)String graphs of k-bend paths on a grid., , , , , and . Electron. Notes Discret. Math., (2011)On the bi-enhancement of chordal-bipartite probe graphs., , , and . Inf. Process. Lett., 110 (5): 193-197 (2010)Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2., , , and . Discret. Math., 340 (2): 209-222 (2017)