Combinatorial Computer Science Group

The Group aims to achieve research results in various fields by combining methods of combinatorics, computer science and other areas. Though the goal is to do theoretical research, many of the questions studied are motivated by practical problems.

Description

Results

The published results are in a wide range of areas: in graph theory (vertex and edge colouring, perfect graphs, independent sets, decompositions, clique cover, Ramsey theory, graph domination, maximum cuts, random graphs, tournaments, edge labellings), communication networks (routing, diameter, path systems), hypergraph theory (extremal problems, packing and covering, Helly property, Steiner systems, mixed hypergraphs), theoretical computer science (complexity of algorithms, Boolean functions, formal languages, approximation algorithms), operations research (scheduling, bin packing, on-line algorithms), algebra (polynomial identities over matrix rings), algebraic logic (representations, axiomatizability), process control (control structure selection, model simplification), and theoretical biology (formal models of cell division).