Academic Background

• 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

Courses Taught

• 2009-2010 Fall CS380 Computational Geometry
• 2009-2010 Fall CS105 Discrete Structures of Computer Science
• 2009-2010 Fall SE541 Game Programming I
• 2009-2010 Fall CA320/CGT551 Introduction to Computer Games
• 2008-2009 Spring ISE318 Quality Control and Reliability
• 2008-2009 Fall CS380 Computational Geometry
• 2008-2009 Fall & Spring CS100 Introduction to Computer and IT
• 2006 CS126DE Introduction to Software Development

Employement History

• 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. 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
2. 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
3. Reconstructing Orthogonal Polyhedra, PhD Thesis, School of Computer Science, University of Waterloo, 2008
4. 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
5. A Layout Algorithm for Signaling Pathways, B. Genc, U. Dogrusoz, Information Sciences, 176(2), p.135-149, 2006
6. A Multi-Graph Approach to Complexity Management in Interactive Graph Visualization, U. Dogrusoz, B. Genc, Computers & Graphics, 30(1), p.86-97, 2006
7. 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
8. Complexity of Octagonal and Rectangular Cartograms, T.C. Biedl, B. Genc, Proc. 17th CCCG, p.117-120, 2005
9. When Can a Graph Form an Orthogonal Polyhedron, T.C. Biedl, B. Genc, Proc. 16th CCCG, p.53-56, 2004
10. A Constrained, Force-Directed Layout Algorithm for Biological Pathways, B.Genc, U. Dogrusoz, Graph Drawing 2003, LNCS v.2912, p.314-319, 2003
11. A Framework for Complexity Management in Graph Visualization, MSc Thesis, Computer Engineering Department, Bilkent University, 2002
12. A Framework for Complexity Management in Graph Visualization, U. Dogrusoz, B. Genc, Graph Drawing 2002, LNCS v.2528, p.368-369, 2002