Theory of Computation Research Projects

Research in the theory of computation covers a variety of areas ranging from foundational mathematics to analysis of the performance of algorithms. A core of faculty performs research in areas such as graph theory, topology, and discrete mathematics, partly in connection with the Institute of Combinatorial Computing and Discrete Mathematics. Another key area of interest is the development and analysis of algorithms, especially those suited for parallel and distributed systems.

The WVU Institute for Combinatorial Computing and Discrete Mathematics is a collaborative research effort of the departments of Computer Science and Electrical Engineering and the Mathematics Department. Faculty work together on theoretical and applied research problems in areas such as: graph theory, algorithm design and analysis, combinatorics, linear algebra, and related areas. The faculty have several hundred combined publications and numerous research grants and awards. Numerous Masters and Doctoral students have worked under the supervision of the faculty. A weekly seminar is held to discuss problems of interest to the group.

Some of the current research areas are as follows; if you are interested in these areas please feel free to contact the listed faculty members.

• Computational Complexity (Research conducted by Dr. K. Subramani)
• Algorithms (research conducted by Dr. Elaine Eschen, Dr. K. Subramani and Dr. George Trapp)
• Graph theory (research conducted by Dr. Elaine Eschen)
• Information Dissemination (research conducted by Dr. Frances VanScoy)
• Information networks (research conducted by Dr. Elaine Eschen)
• Mathematical Modeling (research conducted by Dr. George Trapp)