Deniz Sariöz

According to our database1, Deniz Sariöz authored at least 13 papers between 2002 and 2014.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2014
Representing a Planar Straight-Line Graph Using Few Obstacles.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2012
Geometric Graph Theory and Wireless Sensor Networks.
PhD thesis, 2012

More is more: The benefits of denser sensor deployment.
ACM Trans. Sens. Networks, 2012

2011
On the Structure of Graphs with Low Obstacle Number.
Graphs Comb., 2011

Computing the obstacle number of a plane graph
CoRR, 2011

Convex obstacle numbers of outerplanar graphs and bipartite permutation graphs
CoRR, 2011

Approximating the Obstacle Number for a Graph Drawing Efficiently.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
Small (2,s)-colorable graphs without 1-obstacle representations
CoRR, 2010

Generalized Delaunay Graphs with respect to any Convex Set are Plane Graphs
CoRR, 2010

Graphs with Large Obstacle Numbers.
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

2008
More is more: The benefits of dense sensor deployment.
Proceedings of the IEEE 5th International Conference on Mobile Adhoc and Sensor Systems, 2008

2006
History Trees as Descriptors of Macromolecular Structures.
Proceedings of the Advances in Visual Computing, Second International Symposium, 2006

2002
Data Integration and Access - The Digital Government Research Center's Energy Data Collection (EDC) Project.
Proceedings of the Advances in Digital Government - Technology, Human Factors, and Policy, 2002


  Loading...