research
∙
07/13/2021
Polynomial delay algorithm for minimal chordal completions
Motivated by the problem of enumerating all tree decompositions of a gra...
share
research
∙
07/02/2020
Efficient enumeration of maximal split subgraphs and sub-cographs and related classes
In this paper, we are interested in algorithms that take in input an arb...
research
∙
04/25/2020
Lazy listing of equivalence classes – A paper on dynamic programming and tropical circuits
When a problem has more than one solution, it is often important, depend...
research
∙
04/12/2019
The Perfect Matching Reconfiguration Problem
We study the perfect matching reconfiguration problem: Given two perfect...
research
∙
09/14/2018
Reconfiguration of graphs with connectivity constraints
A graph G realizes the degree sequence S if the degrees of its vertices ...
research
∙
12/11/2017
