We describe SMS, our submission to the exact treedepth track of PACE 2020. SMS computes the treedepth of a graph by branching on the Small Minimal Separators of the graph
This article briefly describes the most important algorithms and techniques used in the cluster edit...
We present an efficient algorithm which computes the set of minimal separators of a graph in O(n³) t...
For each minor-closed graph class we show that a simple variant of Boruvka's algorithm computes a MS...
We describe tdULL, an algorithm for computing treedepth decompositions of minimal depth. An implemen...
This article briefly describes the most important algorithms and techniques used in the treedepth de...
We describe a heuristic algorithm for computing treedepth decompositions, submitted for the https://...
We describe the FlowCutter submission to the PACE 2020 heuristic tree-depth challenge. The task of t...
This document describes the heuristic for computing treedepth decompositions of undirected graphs us...
This paper introduces Tweed-Plus, a heuristic solver for the treedepth problem. The solver uses two ...
International audienceThe Program Committee of the Third Parameterized Algorithms and Computational ...
We show that, for any graph optimization problem in which the feasible solutions can be expressed by...
The paper presents a new original algorithm for solving Steiner tree problem on graph. The algorithm...
The Minimum Size Tree Decomposition (MSTD) and Minimum Size Path Decomposition (MSPD) problems ask f...
This document describes our heuristic Cluster Editing solver, ?Solver, which got the third place in ...
In this article, the Program Committee of the Second Parameterized Algorithms and Computational Expe...
This article briefly describes the most important algorithms and techniques used in the cluster edit...
We present an efficient algorithm which computes the set of minimal separators of a graph in O(n³) t...
For each minor-closed graph class we show that a simple variant of Boruvka's algorithm computes a MS...
We describe tdULL, an algorithm for computing treedepth decompositions of minimal depth. An implemen...
This article briefly describes the most important algorithms and techniques used in the treedepth de...
We describe a heuristic algorithm for computing treedepth decompositions, submitted for the https://...
We describe the FlowCutter submission to the PACE 2020 heuristic tree-depth challenge. The task of t...
This document describes the heuristic for computing treedepth decompositions of undirected graphs us...
This paper introduces Tweed-Plus, a heuristic solver for the treedepth problem. The solver uses two ...
International audienceThe Program Committee of the Third Parameterized Algorithms and Computational ...
We show that, for any graph optimization problem in which the feasible solutions can be expressed by...
The paper presents a new original algorithm for solving Steiner tree problem on graph. The algorithm...
The Minimum Size Tree Decomposition (MSTD) and Minimum Size Path Decomposition (MSPD) problems ask f...
This document describes our heuristic Cluster Editing solver, ?Solver, which got the third place in ...
In this article, the Program Committee of the Second Parameterized Algorithms and Computational Expe...
This article briefly describes the most important algorithms and techniques used in the cluster edit...
We present an efficient algorithm which computes the set of minimal separators of a graph in O(n³) t...
For each minor-closed graph class we show that a simple variant of Boruvka's algorithm computes a MS...
DOI
Add to ORKG