Rosa Enciso
Completion Date: December 19th, 2009
Keywords: algorithms, graph theory, graph theory applications, parameterized complexity
Personal Web Page: http://www.cs.ucf.edu/~renciso
Research Profile
As part of my Ph.D. dissertation, I am studying algorithms for finding communities with different properties in graphs, which have applications in mining data from social networks, finding semantically related websites, among others. I have been working on the problem of partitioning series parallel graphs into alliances with applications to scheduling problems. The research problems I am currently looking at are NP-complete. However, I am studying these problems using the framework introduced by Downey and Fellows, known as parameterized complexity. In this framework, we take problems that have running times exponential in input size, and try to find algorithms with a running time polynomial in the input size, and exponential in a natural parameter k.
One of the things that I find the most exciting about my research area is that graphs are heavily used to model problems in a wide number of areas (e.g. operating systems, computer architecture, networks etc). I am interested in gaining more depth in algorithms, and broadening my experience on algorithmic challenges that arise in differente areas.
Contact Information
E-Mail: EMAIL OBFUSCATED
Phone: 321-276-7008
Categories Posted To:
AI / Machine Learning / Robotics / Vision, Databases / Information Retrieval / Data Mining, Networks / Operating Systems, Numerical/Scientific Computing / HPC / Data-Intensive Scalable Computing, Social Computing / Social Informatics, Theory / Algorithms
