I am Assistant Professor of Electrical Engineering and Computer Science at the University of Kansas, Lawrence. I received my doctorate in Computer Science at the University of California, Los Angeles in 2008. My general research area is theoretical computer science, with focus on theoretical modelling and guarantees for reliable routing in wireless networks. My research interests include game theory, graph theory, randomized algorithms, wireless networks, social networks, network security, and machine learning.

Fall 2009 EECS764: Analysis of Algorithms

Spring 2009 EECS210: Discrete Structures

Fall 2008 EECS712: Network Security

Milan Bradonjic, Gunes Ercal-Ozkaya, Adam Meyerson, and Alan Roytman "On the Price of Mediation." ACM Conference on Electronic Commerce (EC) 2009.

Stephan Eidenbenz, Gunes Ercal-Ozkaya, Adam Meyerson, and Allon Percus, "On a Locally Minimum Cost Forwarding Game." ACM International Workshop on Foundations of Wireless Ad Hoc and Sensor Networking and Computing (FOWANC) 2009.

Gunes Ercal, Rafit Izhak-Ratzin, Rupak Majumdar, and Adam Meyerson, "Frugal Routing on Wireless Ad-Hoc Networks." Symposium on Algorithmic Game Theory (SAGT) 2008.

Chen Avin and Gunes Ercal, "On the Cover Time and Mixing Time of Random Geometric Graphs." Theoretical Computer Science, 380 (1-2), pages 2-22, 2007.

Xiaohui Bei, Wei Chen, Gunes Ercal-Ozkaya, Xiao Fu, Michael Hughes, and Sarah McBride, "On Pure and Approximate Nash Equilibria in Betweenness Centrality Games." Submitted.

All published and submitted papers

I run a weekly reading group, Topics in Network Theory (TiNT). If you are interested in working with me, I highly encourage you to attend the TiNT meetings.