 | 2011 |
|---|
| 11 |       | Burkay Genç,
Cem Evrendilek,
Brahim Hnich:
Covering points with orthogonally convex polygons.
Comput. Geom. 44(5): 249-264 (2011) |
| 10 | | Therese C. Biedl,
Burkay Genç:
Reconstructing orthogonal polyhedra from putative vertex sets.
Comput. Geom. 44(8): 409-417 (2011) |
| 9 | | Therese C. Biedl,
Burkay Genç:
Stoker's Theorem for Orthogonal Polyhedra.
Int. J. Comput. Geometry Appl. 21(4): 383-391 (2011) |
| 2010 |
|---|
| 8 | | Cem Evrendilek,
Burkay Genç,
Brahim Hnich:
Covering oriented points in the plane with orthogonal polygons is NP-complete.
Electronic Notes in Discrete Mathematics 36: 303-310 (2010) |
| 2009 |
|---|
| 7 | | Therese C. Biedl,
Burkay Genç:
Cauchy's Theorem for Orthogonal Polyhedra of Genus 0.
ESA 2009: 71-82 |
| 2006 |
|---|
| 6 | | Ugur Dogrusöz,
Burkay Genç:
A multi-graph approach to complexity management in interactive graph visualization.
Computers & Graphics 30(1): 86-97 (2006) |
| 5 | | Burkay Genç,
Ugur Dogrusöz:
A layout algorithm for signaling pathways.
Inf. Sci. 176(2): 135-149 (2006) |
| 2005 |
|---|
| 4 | | Therese C. Biedl,
Burkay Genç:
Complexity of Octagonal and Rectangular Cartograms.
CCCG 2005: 117-120 |
| 2004 |
|---|
| 3 | | Therese C. Biedl,
Burkay Genç:
When can a graph form an orthogonal polyhedron?
CCCG 2004: 53-56 |
| 2003 |
|---|
| 2 | | Burkay Genç,
Ugur Dogrusöz:
A Constrained, Force-Directed Layout Algorithm for Biological Pathways.
Graph Drawing 2003: 314-319 |
| 2002 |
|---|
| 1 | | Ugur Dogrusöz,
Burkay Genç:
A Framework for Complexity Management in Graph Visualization.
Graph Drawing 2002: 368-369 |
Data released under the ODC-BY 1.0 license — See also our legal information page