research
∙
06/30/2023
Safe Edges: A Study of Triangulation in Fill-in and Tree-Width Problems
This paper considers two well-studied problems Minimum Fill-In (Min Fill...
share
research
∙
03/15/2019
Proportionally dense subgraph of maximum size: complexity and approximation
We define a proportionally dense subgraph (PDS) as an induced subgraph o...
research
∙
02/28/2019
Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs
A connected component of a vertex-coloured graph is said to be colourful...
research
∙
02/28/2019
A Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs
A connected component of a vertex-coloured graph is said to be colourful...
research
∙
06/28/2018
Graphs without a partition into two proportionally dense subgraphs
A proportionally dense subgraph (PDS) is an induced subgraph of a graph ...
research
∙
06/28/2018