Imagine a learner L who tries to infer a hidden concept from a collectio...
In a graph, a perfect matching cut is an edge cut that is a perfect matc...
A fundamental problem in computational biology is the construction of
ph...
The minimum height of vertex and edge partition trees are well-studied g...
An intersection digraph is a digraph where every vertex v is represented...
We study the complexity of finding an optimal hierarchical clustering of...
The two weighted graph problems Node Multiway Cut (NMC) and Subset Feedb...
We provide an O(n log n) algorithm computing the linear maximum induced
...
In this paper, we show that the Cutwidth, Modified Cutwidth, and Vertex
...
We investigate the teaching of infinite concept classes through the effe...
We generalise the family of (σ, ρ)-problems and locally checkable
vertex...
We complement the recent algorithmic result that Feedback Vertex Set is
...
In this paper we propose a structural parameter of CNF formulas and use ...