Algorithms and Complexity Research at Glasgow

 

Description: Description: Description: [A lattice of stable matchings]Description: Description: Description: [A cycle decomposition]Description: Description: Description: [A graph instance]Description: Description: Description: [A suffix tree structure]

 

 

 

These pages give information about research into the design and analysis of algorithms and into computational complexity, carried out by members of the Formal Analysis, Theory and Algorithms research group

 

People

Current and recent Glasgow Algorithms and Complexity people, together with their research interests

 

Projects

Current and recent Glasgow Algorithms and Complexity research projects

 

Collaboration

Information about practical collaboration that we are involved in that incorporate our matching algorithms

 

Publications

Information about Glasgow Algorithms and Complexity publications and technical reports

 

Resources

Some links relating to research in Algorithms and Complexity

 

Applications

Information about applications of optimal matching algorithms in centralised matching schemes across the world

.

MATCH-UP

We are co-organising MATCH-UP 2015 to be held at the University of Glasgow from 16-17 April 2015.

 

Description: Description: Description: The University of Glasgow                                                           Description: Description: Description: DCS2