This article briefly describes the most important algorithms and techniques used in the treedepth decomposition heuristic solver called "ExTREEm", submitted to the 5th Parameterized Algorithms and Computational Experiments Challenge (PACE 2020) co-organized with the 15th International Symposium on Parameterized and Exact Computation (IPEC 2020)
The cluster editing problem is to transform an input graph into a cluster graph by performing a mini...
Vertex elimination is a graph operation that turns the neighborhood of a vertex into a clique and re...
A treedepth solver based on the algorithm described on A Faster Parameterized Algorithm for Treedept...
We describe a heuristic algorithm for computing treedepth decompositions, submitted for the https://...
This paper introduces Tweed-Plus, a heuristic solver for the treedepth problem. The solver uses two ...
This document describes the heuristic for computing treedepth decompositions of undirected graphs us...
We describe tdULL, an algorithm for computing treedepth decompositions of minimal depth. An implemen...
We describe the FlowCutter submission to the PACE 2020 heuristic tree-depth challenge. The task of t...
We describe SMS, our submission to the exact treedepth track of PACE 2020. SMS computes the treedept...
We present a novel algorithm for the minimum-depth elimination tree problem, which is equivalent to ...
AbstractAn elimination tree is a form of recursive factorization for Bayesian networks. Elimination ...
This document provides a short overview of our treedepth solver PID^{?} in the version that we submi...
This article briefly describes the most important algorithms and techniques used in the cluster edit...
A widely used class of algorithms for computing tree decompositions of graphs are heuristics that co...
In this paper we present a dynamic programming algorithm for finding optimal elimination trees for c...
The cluster editing problem is to transform an input graph into a cluster graph by performing a mini...
Vertex elimination is a graph operation that turns the neighborhood of a vertex into a clique and re...
A treedepth solver based on the algorithm described on A Faster Parameterized Algorithm for Treedept...
We describe a heuristic algorithm for computing treedepth decompositions, submitted for the https://...
This paper introduces Tweed-Plus, a heuristic solver for the treedepth problem. The solver uses two ...
This document describes the heuristic for computing treedepth decompositions of undirected graphs us...
We describe tdULL, an algorithm for computing treedepth decompositions of minimal depth. An implemen...
We describe the FlowCutter submission to the PACE 2020 heuristic tree-depth challenge. The task of t...
We describe SMS, our submission to the exact treedepth track of PACE 2020. SMS computes the treedept...
We present a novel algorithm for the minimum-depth elimination tree problem, which is equivalent to ...
AbstractAn elimination tree is a form of recursive factorization for Bayesian networks. Elimination ...
This document provides a short overview of our treedepth solver PID^{?} in the version that we submi...
This article briefly describes the most important algorithms and techniques used in the cluster edit...
A widely used class of algorithms for computing tree decompositions of graphs are heuristics that co...
In this paper we present a dynamic programming algorithm for finding optimal elimination trees for c...
The cluster editing problem is to transform an input graph into a cluster graph by performing a mini...
Vertex elimination is a graph operation that turns the neighborhood of a vertex into a clique and re...
A treedepth solver based on the algorithm described on A Faster Parameterized Algorithm for Treedept...