Elad Cohen

Orcid: 0000-0001-5745-7990

According to our database1, Elad Cohen authored at least 12 papers between 2008 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
HPTQ: Hardware-Friendly Post Training Quantization.
CoRR, 2021

2017
Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2.
Discret. Math., 2017

2016
Posets and VPG Graphs.
Order, 2016

2014
Characterizations of cographs as intersection graphs of paths on a grid.
Discret. Appl. Math., 2014

Theory and Practice in Large Carpooling Problems.
Proceedings of the 5th International Conference on Ambient Systems, 2014

2013
Stabbing Polygonal Chains with Rays is Hard to Approximate.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012
Intersection graphs of paths on a grid.
PhD thesis, 2012

Vertex Intersection Graphs of Paths on a Grid.
J. Graph Algorithms Appl., 2012

2011
String graphs of k-bend paths on a grid.
Electron. Notes Discret. Math., 2011

Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

2010
On the bi-enhancement of chordal-bipartite probe graphs.
Inf. Process. Lett., 2010

2008
What Is between Chordal and Weakly Chordal Graphs?.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008


  Loading...