research
∙
07/11/2023
MAP- and MLE-Based Teaching
Imagine a learner L who tries to infer a hidden concept from a collectio...
share
research
∙
07/13/2021
The Perfect Matching Cut Problem Revisited
In a graph, a perfect matching cut is an edge cut that is a perfect matc...
research
∙
05/26/2021
On Alternative Models for Leaf Powers
A fundamental problem in computational biology is the construction of ph...
research
∙
05/25/2021
On Dasgupta's hierarchical clustering objective and its relation to other graph parameters
The minimum height of vertex and edge partition trees are well-studied g...
research
∙
05/04/2021
Classes of intersection digraphs with good algorithmic properties
An intersection digraph is a digraph where every vertex v is represented...
research
∙
08/07/2020
Hierarchical Clusterings of Unweighted Graphs
We study the complexity of finding an optimal hierarchical clustering of...
research
∙
10/02/2019
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width
The two weighted graph problems Node Multiway Cut (NMC) and Subset Feedb...
research
∙
07/09/2019
Linear MIM-Width of Trees
We provide an O(n log n) algorithm computing the linear maximum induced ...
research
∙
05/09/2019
Typical Sequences Revisited - Algorithms for Linear Orderings of Series Parallel Digraphs
In this paper, we show that the Cutwidth, Modified Cutwidth, and Vertex ...
research
∙
04/19/2018
Finite Biased Teaching with Infinite Concept Classes
We investigate the teaching of infinite concept classes through the effe...
research
∙
03/09/2018
Generalized distance domination problems and their complexity on graphs of bounded mim-width
We generalise the family of (σ, ρ)-problems and locally checkable vertex...
research
∙
11/14/2017
A note on the complexity of Feedback Vertex Set parameterized by mim-width
We complement the recent algorithmic result that Feedback Vertex Set is ...
research
∙
02/26/2014
