  We report about the results of the application of modern computer algebra
tools for construction of directed strongly regular graphs. The suggested
techniques are based on the investigation of non-commutative association
schemes and Cayley graphs over non-Abelian groups. We demonstrate examples of
directed strongly regular graphs for 28 different parameter sets, for which the
existence of a corresponding digraph has not been known before.
