University of Florence, we offer two positions, a fellowship and a postdoc
position on Algorithms for (Temporal) Graphs under the supervision of
Andrea Marino (to be contacted for more info: andrea dot marino at unifi
dot it). Candidates with skills in any subset of the following research
topics are welcome: Algorithms and data structures, graph algorithms,
Java/Python programming.
===========================
Title: Algorithms for Exploratory Analysis of (Temporal) Graphs
Description: Research within the field of algorithm design for the analysis
of large real-world networks, with particular focus on transportation
networks. Such networks can be effectively modeled using graphs,
representing mobility and points of interest (POIs), while neglecting
specific uninteresting aspects. Hence, discovering the most
important POIs (centrality), measuring the efficiency of the network
(flow), making the network more robust (network design) can be translated
into problems on graphs. Also, studying indexes and finding clusters, i.e.
well-connected POIs, can help to better visualize the network together with
its constraints. We plan to design efficient
(listing) algorithms to find relevant structures able to guide the
exploration of transportation networks. We will also take into
consideration the dynamic nature of the networks using temporal graphs.
Indeed, in public transportation network connections are available only at
prescribed times, in the same way as in public transportation systems buses
and trains follow a time schedule, meaning that paths are valid only if the
connections are time consistent. In this scenario, classical notions of
graph theory must be rethought taking into account these additional temporal
constraints. The design of new graph algorithms will possibly be integrated
with implementations and practical experiments on real world transportation
networks.
Duration of Contract: 12 months, approximately starting: April 2024
Requirement: PhD
Application Link: look for DISIA and click the title "Algoritmi per
l'Analisi Esplorativa di Grafi (Temporali)" at the following link:
https://stlabtest.dinfo.unifi.it/beta/akademia-candidature/announcements-search
Deadline for application: 7th February 2024 (Italian Time)
The interview will be held on 26th February 2024 at 14:00 on-line.
Project: PRIN MUR 2022ME9Z78 "NextGRAAL: Next-generation algorithms for
constrained GRAph visuALization"
===========================
Title: Algorithms for Graph Based Analysis of DLT Systems
Description: Most modern decentralized systems, as cryptocurrency systems
like Bitcoin and Ethereum, rely on Distributed Ledger Technology to manage
data in a decentralized fashion. By design, data is publicly available and
can be gathered in an automatic way. Ledgers typically store timed
relations among the entities involved, endowed with additional information.
These relations can be formally represented as labeled temporal graphs,
which can be heterogeneous depending on the roles of the entities involved.
The objective is to provide efficient algorithms and tools to analyse such
graphs. This objective includes: (i) The design of a unified theoretical
graph model of ledgers under a common format representation. (ii) The
design of an efficient algorithm for storing compact representations of
graphs according to the defined graph model exploiting temporal locality
and similarity in the data. (iii) The
design of efficient data retrieval algorithms for a graph in the defined
graph model. (iv) The design of anomaly detection algorithms that can
benefit from local or global statistics which can help to highlight
peculiar structures, e.g. using (temporal) centrality indexes or analyzing
(temporal) distances statistics between nodes.
Duration of Contract: 20 months, starting: April 2024
Requirement: Master Degree
Application Link: look for DISIA and click the title "Algoritmi per
l'Analisi dei Grafi di Sistemi DLT" at the following link:
https://stlabtest.dinfo.unifi.it/beta/akademia-candidature/announcements-search
Deadline for application: 7th February 2024 (Italian Time)
The interview will be held on 26th February 2024 at 14:00 on-line.
Project: PRIN MUR P2022NZPJA "DLT-FRUIT: A user centered framework for
facilitating DLTs FRUITion"
**********************************************************
*
* 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
