group at the University of Edinburgh. The research group, consisting
of 6 researchers at the moment, works on different aspects of spectral
graph theory and its application. This includes researching spectral
digraph and hypergraph theory, designing efficient spectral algorithms
for graph problems in TCS and machine learning, as well as developing
Spectral Toolkit of Algorithms for Graphs (STAG), which is the first
C++ based open-source library for spectral graph algorithms. More
information about the group activities can be found at the project
webpage https://homepages.inf.ed.ac.uk/hsun4/project.html, and the
STAG website https://staglibrary.io/.
We welcome candidates with research experience in algorithms,
unsupervised learning, or spectral analysis to apply for the post. In
particular, given the opening of multiple posts this time, we also
welcome the candidates whose research broadly matches our group's
research agenda.
More information about the post, including the link for application,
can be found at
Deadline for application: 3 November 2023
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
