Academic Background

• Asst. Prof.: 2009 Izmir University of Economics, Faculty of Engineering and Computer Sciences
  
• PhD: 2008 University of Waterloo, School of Computer Science
  Topic: Reconstructing Orthogonal Polyhedra
• MSc: 2002 Bilkent University, Computer Engineering Department
  Topic: Complexity Management in Graph Visualization
• BSc: 2000 Bilkent University, Industrial Engineering Department
• High School: 1996 Ankara Fen Lisesi (Ankara Science High)

Courses Taught

Employement History

• 2010-: e-Learning Coordinator in Izmir University of Economics
• 2009-: Vice Provost (Academic Affairs) in Izmir University of Economics
• 2009-: Assistant Professor in Izmir University of Economics, Faculty of Computer Science
• 2008-2009: Lecturer in Izmir University of Economics, Faculty of Computer Science
• 2005-2006: Sessional Instructor in University of Waterloo, School of Computer Science
• 2003-2007: Teaching Assistant in University of Waterloo, School of Computer Science
• 2000-2003: Teaching Assistant in Bilkent University, Computer Engineering Department

Recent Research

1. [SCI] Reconstructing Orthogonal Polyhedra from Putative Vertex Sets, T. Biedl, B. Genc, Computational Geometry: Theory and Applications, 44(8), p.409-417, 2011
2. [SCI] Stoker's Theorem For Orthogonal Polyhedra, T. Biedl, B. Genc, International Journal of Computational Geometry and Applications, 21(4), 2011
3. [SCI] Covering Points With Orthogonally Convex Polygons, B. Genc, C. Evrendilek, B. Hnich, Computational Geometry: Theory and Applications, 44(5), p.249-264, 2010
4. Covering oriented points in the plane with orthogonal polygons is NP-complete, C. Evrendilek, B. Genc, B. Hnich, in proceedings of ISCO 2010 - International Symposium on Combinatorial Optimization, Electronic Notes in Discrete Mathematics, 36(1), p.303-310, 2010
5. [CPCI] Cauchy's Theorem for Orthogonal Polyhedra of Genus 0, T.C. Biedl, B. Genc, Proceedings of 17 ^th European Symposium on Algorithms, LNCS 5757, p.71-82, 2009
6. Cauchy's Theorem for Orthogonal Polyhedra of Genus 0, T.C. Biedl, B. Genc, Technical Report, ID:CS-2008-26, School of Computer Science, University of Waterloo, 2008
7. Reconstructing Orthogonal Polyhedra, PhD Thesis, School of Computer Science, University of Waterloo, 2008
8. Reconstructing Orthogonal Polyhedra from Putative Vertex Sets, T.C. Biedl, B. Genc, Technical Report, ID:CS-2007-28, School of Computer Science, University of Waterloo, 2007
9. [SCI] A Layout Algorithm for Signaling Pathways, B. Genc, U. Dogrusoz, Information Sciences, 176(2), p.135-149, 2006
10. [SCI] A Multi-Graph Approach to Complexity Management in Interactive Graph Visualization, U. Dogrusoz, B. Genc, Computers & Graphics, 30(1), p.86-97, 2006
11. Complexity of Octagonal and Rectangular Cartograms, T.C. Biedl, B. Genc, Technical Report, ID:CS-2005-13, School of Computer Science, University of Waterloo, 2005
12. Complexity of Octagonal and Rectangular Cartograms, T.C. Biedl, B. Genc, Proc. 17th CCCG, p.117-120, 2005
13. When Can a Graph Form an Orthogonal Polyhedron, T.C. Biedl, B. Genc, Proc. 16th CCCG, p.53-56, 2004
14. A Constrained, Force-Directed Layout Algorithm for Biological Pathways, B.Genc, U. Dogrusoz, Graph Drawing 2003, LNCS v.2912, p.314-319, 2003
15. A Framework for Complexity Management in Graph Visualization, MSc Thesis, Computer Engineering Department, Bilkent University, 2002
16. A Framework for Complexity Management in Graph Visualization, U. Dogrusoz, B. Genc, Graph Drawing 2002, LNCS v.2528, p.368-369, 2002