research
∙
07/03/2023
An FTP Algorithm for Temporal Graph Untangling
Several classical combinatorial problems have been considered and analys...
share
research
∙
09/03/2021
Finding Colorful Paths in Temporal Graphs
The problem of finding paths in temporal graphs has been recently consid...
research
∙
11/16/2020
The Longest Run Subsequence Problem: Further Complexity Results
Longest Run Subsequence is a problem introduced recently in the context ...
research
∙
08/04/2020
Top-k Connected Overlapping Densest Subgraphs in Dual Networks
Networks are largely used for modelling and analysing data and relations...
research
∙
02/18/2020
Computing the k Densest Subgraphs of a Graph
Computing cohesive subgraphs is a central problem in graph theory. While...
research
∙
01/07/2020
Complexity Issues of String to Graph Approximate Matching
The problem of matching a query string to a directed graph, whose vertic...
research
∙
09/07/2018
Top-k Overlapping Densest Subgraphs: Approximation and Complexity
A central problem in graph mining is finding dense subgraphs, with sever...
research
∙
06/11/2018
Reconciling Multiple Genes Trees via Segmental Duplications and Losses
Reconciling gene trees with a species tree is a fundamental problem to u...
research
∙
06/04/2018
