Research

Research Interests

Design, analysis, and implementation of algorithms and data structures with applications to:
Graph Drawing and Information Visualization, Graphics and Animation, Computational Geometry
For current interests, see Employment/Research Opportunities.

Refereed Journal Papers

1. A.O. Cakiroglu, C. Erten, O. Karatas, M. Sozdinler, "Crossing Minimization in Weighted Bipartite Graphs", Journal of Discrete Algorithms (JDA), to appear.

2. A. Efrat, C. Erten, S. G. Kobourov, "Fixed-Location Circular-Arc Drawing of Planar Graphs", Journal of Graph Algorithms and Applications (JGAA), vol.11, no.1, pp.145-164, 2007.

3. P. Brass, E. Cenek, C. Duncan, A. Efrat, C. Erten, D. Ismailescu, S. Kobourov, A. Lubiw, J. Mitchell, ``On Simultaneous Planar Graph Embeddings'', Computational Geometry: Theory and Applications (CGTA), vol.36, pp.117-130, 2007.

4. C. Erten, S. G. Kobourov, "Simultaneous Embedding of a Planar Graph and Its Dual on the Grid," Theory of Computing Systems (TOCS), vol. 38, pp.313-327, 2005.

5. C. Erten, S. G. Kobourov, "Simultaneous Embedding of Planar Graphs with Few Bends", Journal of Graph Algorithms and Applications (JGAA), vol.9, no.3, pp.347-364, 2005.

6. C. Erten, S. G. Kobourov, V. Le, and A. Navabi, "Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes", Journal of Graph Algorithms and Applications (JGAA), vol. 9, no. 1, pp.165-182, 2005.

Refereed Conference Publications in Proceedings

7. C. Erten, M. Sozdinler, "A Robust Biclustering Method Based on Crossing Minimization in Bipartite Graphs", Proc. Int. Symp. Graph Drawing (GD), to appear.

8. U. Brandes, C. Erten, J. Fowler, F. Frati, M. Geyer, C. Gutwenger, S. Hong, M. Kaufmann, S. Kobourov, G. Liotta, P. Mutzel, A. Symvonis, Colored Simultaneous Geometric Embeddings, Proc. 13th Annual International Computing and Combinatorics Conference (COCOON 2007), Lecture Notes in Computer Science, to appear, 2007.

9. A.O. Cakiroglu, C. Erten, O. Karatas, M. Sozdinler, Crossing Minimization in Weighted Bipartite Graphs, Proc. 6th Workshop on Experimental Algorithms (WEA 2007), Lecture Notes in Computer Science 4525, Springer-Verlag, pp. 122-135, 2007.

10. A. Efrat, C. Erten, D. Forrester, A. Iyer, S. Kobourov, Force-directed Approaches to Sensor Localization, Proc. 8th ACM/SIAM Workshop on Algorithm Engineering and Experiments (ALENEX), pp.108-118, 2006.

11. P. Borunda, C. Brewer, C. Erten, N. King, Z. Nation, M. Shokhriev, GSPIM: Graphical Visualization Tool for MIPS Assembly Programming and Simulation, ACM SIGCSE Bulletin, vol. 38, no.1, pp.244-248, 2006.

12. C. Erten, S. G. Kobourov, Simultaneous Embedding of Planar Graphs with Few Bends, Proc. 12th Int. Symp. Graph Drawing (GD), Lecture Notes in Computer Science 3383, Springer-Verlag, pp. 195-205, 2004.

13. C. Erten, S. G. Kobourov, C. Pitta, Morphing Planar Graphs, Proc. 20th ACM Symposium on Computational Geometry (SoCG), pp.451-452, 2004.

14. C. Erten, P. Harding, S. G. Kobourov, K. Wampler, G. Yee, Exploring the Computing Literature Using Temporal Graph Visualization, IS&T/SPIE 16th Annual Symposium on Electronic Imaging Conference, Visualization and Data Analysis (VDA):5295-05, 2004.

15. C. Erten, S. G. Kobourov, V. Le, A. Navabi, "Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes", Proc. 11th Int. Symp. Graph Drawing (GD), Lecture Notes in Computer Science 2912, Springer-Verlag, pp. 437-449, 2003.

16. A. Efrat, C. Erten, S. G. Kobourov, "Fixed-Location Circular-Arc Drawing of Planar Graphs", Proc. 11th Int. Symp. Graph Drawing (GD), Lecture Notes in Computer Science 2912, Springer-Verlag, pp. 147-158, 2003.

17. C. Erten, S. .G. Kobourov, C. Pitta, "Intersection-Free Morphing of Planar Graphs", Proc. 11th Int. Symp. Graph Drawing (GD), Lecture Notes in Computer Science 2912, Springer-Verlag, pp. 320-332, 2003.

18. C. Erten, P. J. Harding, S. G. Kobourov, K. Wampler, and G. Yee, "GraphAEL: Graph Animations with Evolving Layouts", Proc. 11th Int. Symp. Graph Drawing (GD), Lecture Notes in Computer Science 2912, Springer-Verlag, pp. 98-110, 2003.

19. P. Brass, E. Cenek, C. A. Duncan, A. Efrat, C. Erten, D. Ismailescu, S. G. Kobourov, A. Lubiw, J. S. B. Mitchell, "On Simultaneous Planar Graph Embeddings," Proc. 8th Workshop on Algorithms and Data Structures (WADS), Lecture Notes in Computer Science 2748, Springer-Verlag, pp. 243-255, 2003.

20. C. Erten and S. G. Kobourov, "Simultaneous Embedding of a Planar Graph and Its Dual on the Grid," Proc. 13th Intl. Symp. on Algorithms & Computation (ISAAC), Lecture Notes in Computer Science 2518, Springer-Verlag, pp.575-587, 2002.

Other Publications

21. Esther Arkin, Alon Efrat, Cesim Erten, Ferran Hurtado, Joseph Mitchell, Valentin Polishchuk and Carola Wenk, "Shortest Tour of a Sequence of Disjoint Segments in L_1", 16th Fall Workshop on Computational and Combinatorial Geometry, 2006.

22. C. Erten, "Simultaneous Embedding and Visualization of Graphs", PhD Thesis, University of Arizona, 2004.

23. C. Erten, S. G. Kobourov, "Simultaneous Embeddings", 12th Workshop on Computational Geometry, DIMACS, 2002.