Global Paths Matching is an implementation of the global paths graph matching algorithm proposed by Maue and Sanders in "Engineering Algorithms for Approximate Weighted Matching" (WEA'07). Given a graph G=(V,E), a matching M is a set of edges without common vertices, i.e. the graph G=(V,M) has a degree of at most one. The algorithm scans the edges in order of decreasing weight (or rating), constructing a collection of paths and even length cycles. These paths initially contain no edges. While scanning the edges, the set is extended by successively adding applicable edges, which are those connecting two endpoints of different paths or two endpoints of an odd length path. Optimal solutions/matchings are computed for each path and cycle using dynamic programming.

KaHIP - Karlsruhe High Quality Partitioning - is a family of graph partitioning programs that tackle the balanced graph partitioning problem. It focuses on solution quality and implements flow-based methods, more-localized local searches, and several parallel and sequential meta-heuristics.

HEALPix is a set of scientific tools implementing the Hierarchical Equal Area isoLatitude Pixelation of the sphere. As suggested in the name, this pixelation produces a subdivision of a spherical surface in which every single pixel covers the same surface area. HEALPix provides various programs and libraries in C, C++, Fortran, GDL/IDL, Java, and Python which facilitate discretization, simulation, processing, analysis, and visualization of data on the sphere up to very high resolution. It is the state-of-the-art program used in astronomy and cosmology to deal with massive full-sky data sets.

Kelvin is a units converter intended for scientists, teachers, and students who need a reliable tool for fast conversion. Some categories included are: acceleration, area, frequency, atomic physics, density, electrical capacitance, electromagnetic radiation, energy/work, flow, force, fuel consumption, illumination, length, luminance, luminous flux, magnetomotive force, mass, power, prefixes and suffixes, pressure and stress, specific heat, speed/velocity, temperature, thermal resistance, time, torque, viscosity (dynamic), viscosity (kinematic), volume, and dry/liquid capacity.

GRALE is a set of tools - a library and a number of accompanying applications - to study gravitational lenses. Gravitational lenses are astronomical objects so massive that their gravitational pull even deflects light rays. This can cause multiple copies of the same background object to be visible, like a cosmic mirage. The locations and shapes of these copies can provide information about the mass distribution of the gravitational lens, which GRALE can help recover using a genetic algorithm-based method. Apart from these so-called lens inversions, it's also possible to simulate gravitational lenses.

GraphInsight is visualization software that lets you explore graph data through high quality interactive representations. Data exploration and knowledge extraction from graphs is of great interest nowadays: knowledge is disseminated in social networks, and services are powered by cloud computing platforms. Data miners deal with graphs every day. Humans are extremely good at identifying patterns and outliers. Interacting visually with your data can give you better intuition and higher confidence in what you are looking for.

SourceAFIS is a fingerprint recognition/matching SDK (library), or more generally an Automated Fingerprint Identification System (AFIS). It essentially compares two fingerprints and decides whether they belong to the same person. It can quickly search a large database of registered fingerprints. It comes with an easy-to-use API (pure .NET and Java) plus assorted applications and tools.

A Java component for manipulating PowerPoint presentations.