CS Postdoc Profiles

Profiles of Computer Science PhD

* Post a Profile
* Edit a Profile

Click for Available Job Opportunities

mehmet baysan

PhD From: The University of Texas at Dallas
Completion Date: December 27, 2008
Keywords: Algorithms, Combinatorial Optimization, Wireless Networks
Personal Web Page: http://www.utdallas.edu/~mxb033000/

Research Profile

Currently, I am a Postdoctoral Fellow at University of Toronto. I have finished my PhD at The University of Texas at Dallas in November, 2008. I believe that my experience in both theoretical and application oriented research areas make me a strong candidate for a postdoctoral position.

My research interests span both theory and applications. In the theory area, I have studied major problem solving techniques in Algorithms, Graph Theory and Combinatorial Optimization. On the application side, I have worked on important application areas such as Wireless Networks and Internet Protocols. In my studies, I combined theory with new technologies. I focused on problems which are critical for major applications and developed first polynomial time optimal solutions for these problems. These studies have been published in premier journals like the IEEE Transactions on Parallel and Distributed Systems, Discrete Optimization and Ad Hoc Networks. In addition, I have been invited to review manuscripts for respected journals such as the IEEE Transactions on Mobile Computing, Ad Hoc Networks and Information Sciences.

In theory field, I have studied both application oriented and pure mathematical problems. One of the application oriented problems that I studied was the Minimum Forwarding Set Problem (MFSP) for Unit Disk Graphs. I developed the first polynomial time solution for this open problem. Later, I modeled MFSP for Disk Graphs as a Graph Theory problem. This modeling is based on a recent technology which allows wireless nodes to make variable power transmissions. I developed the first polynomial time algorithm for this problem, as well. Currently, I am studying online scheduling problems. I have developed first constant approximation algorithms for some problems. These results will be submitted to major theory journals.

On the application side, I designed techniques for different needs in technology. In some cases, after solving the problem as a mathematical question, I implemented the solution as a protocol. For example, after developing the optimal solution in MFSP, I implemented it as part of the Optimized Link State Routing protocol in the OPNET simulation environment. In other cases, I used heuristics due to the complexity of problem and demonstrated their efficiency by conducting simulations.

During my graduate studies, I had the opportunity to collaborate with outstanding researchers. In addition, I have written a grant proposal with my advisor.

I will enjoy providing additional information if requested. I can be contacted on my cell phone 1-416-662-6847, or via e-mail at EMAIL OBFUSCATED .

Contact Information

E-Mail: EMAIL OBFUSCATED

Phone: 14166626847

Categories Posted To:

Networks / Operating Systems, Theory / Algorithms

Get Adobe Flash playerPlugin by wpburn.com wordpress themes
twitter-icon

Browse Posts in other Research Areas