Mehmet Baysan

Postodoctoral Fellow
Rotman School of Management
University of Toronto

m (dot) baysan (at) utoronto (dot) ca

PhD Graduate
Department of Computer Science
University of Texas at Dallas

baysan (at) utdallas (dot) edu

---

Education:

1. PhD. on Computer Science, University of Texas at Dallas, Dallas, TX (2008)
2. M.S. on Computer Science, University of Texas at Dallas, Dallas, TX (2005)
3. B.S. on Computer Science, Bilkent University, Ankara, Turkey (2003)

---

My Research Interests are Algorithms, Graph Theory and Combinatorial Optimization and Wireless Networks.

---

Publications

Journal Articles

1. M. Baysan, R. Chandrasekaran, K. Sarac, “A Polynomial Time Solution to Minimum Forwarding Set Problem for Disk Graphs” submitted to IEEE Transactions on Parallel and Distributed Systems (2008)

2. R. Chandrasekaran, M. Dwande and M. Baysan, “Graph Labelings and Applications: Analysis of the Covering Problem” submitted to Discrete Optimization (2008)

3. M. Baysan, K. Sarac, S. Bereg and R. Chandrasekaran, “A Polynomial Time Solution to Minimum Forwarding Set Problem in Wireless Ad Hoc Networks” accepted to IEEE Transactions on Parallel and Distributed Systems (2007)

4. Avinash Chiganmi, Mehmet Baysan, Kamil Sarac and Ravi Prakash, “Variable Power Broadcast using Local Information in Ad Hoc Networks” accepted to Ad Hoc Networks (2006)

---

Teaching

I have assisted teaching of following courses recently.

Summer 2008

CS 6363-0U1: Computer Algorithms

CS 4349-0U1: Advanced Algorithms Design and Analysis

Spring 2008

CS 6382.501 Theory of Computation
CS 6381.001 Combinatorics and Graph Algorithms

Fall 2007

CS 6363.001 and CS 6363.002 Design and Analysis of Algorithms

Spring 2007

CS 2305.001 Discrete Math For Computing
CS 6363.003 Design and Analysis of Algorithms

---

My OPNET simulations page

---

Last Updated on Jan, 2008.