Programs for generation of certain types of planar graph, generated in such a way that exactly one member of each isomorphism class is output without the need for storing them.

Tool for investigating Graph Theory, with a GTK interface. Free under GPL. Unix, source code in C++.

A program for computing automorphism groups of graphs and digraphs. It can also produce a canonical labelling.

Software for visualizing graph algorithms. Free under GPL. Unix, Linux, MacOs ad Windows versions.

A general-purpose, extendible computing environment in which discrete mathematical objects representing real world problems can be easily manipulated and visualized.

John Stembridge's Maple packages for symmetric functions, posets, root systems, and finite Coxeter groups.

A GAP share-package for computing with graphs; primarily designed for the efficient construction and analysis of graphs related to groups, combinatorial designs and finite geometries.

Free Java class library that provides mathematical graph-theory objects and algorithms.

We are pursuing research in the area of new parallel methods for graph partitioning and incremental graph partitioning. Efficient methods for graph partitioning and incremental graph partitioning are important for parallelization of a large number of unstructured and/or adaptive applications.

LEDA is a library of the data types and algorithms of combinatorial computing.