Here we study the combinatorial structures that appear when abstracting finite and discrete problems encountered in mathematics, computational mathematics and everyday life. More specifically, we study the relationships between several invariants of graphs and partial structures of graphs, discrete optimization, and algorithms related to these. In addition, we work on the development of algorithms for parallel computers which efficiently solve the large linear equation systems met in scientific computation, study the convergence of iterative methods, work on formula manipulation, document processing such as TeX, and image data compression techniques using fractal methods.

Fields of study ; Graph theory, combinatorics, discrete algorithm, optimization, computer graphics, high-performance computing