Combinatorial structures, optimization, and algorithms in theoretical Computer Science

Abstract

Computer Science is an area of rapid growth. New technologies emerge and become obsolete in one or two years. New approaches and methods are proposed at an impressive pace. Increasingly complex problems from diverse scientific research domains demand such vigorous developments. It is impossible to imagine any competitive research in any data driven area being developed today without the support of methods, techniques, or technology created by Computer Science researchers. It is evident that the most successful technological advances in Computer Science are the ones based on firm theoretical grounds. Research areas such as data mining and pattern recognition, to mention just two, have methods strongly supported by techniques developed in Theoretical Computer Science. Our goal in this project is to study combinatorial objects and several ways of approaching related structural and algorithmic problems: algebraic, geometric, probabilistic, combinatorial, etc. A deeper understanding of such objects will eventually result in new strategies and more efficient algorithms for solving fundamental combinatorial problems. The team that supports this project has researchers with vast experience covering a wide range of subareas in Theoretical Computer Science. The main scientific discoveries of this research project will be published in well-established conferences and journals, with high circulation and highly selective editorial policy. We shall also further intensify the international exchange activities of the group, as well as student training activities at several levels (from the undergraduate to the postdoctoral level). We shall also organize a FAPESP “Advanced School of Sciences” in the area of Theoretical Computer Science. (AU)