research
∙
01/23/2023
Functionality of box intersection graphs
Functionality is a graph complexity measure that extends a variety of pa...
share
research
∙
10/01/2022
Conditions for minimally tough graphs
Katona, Soltész, and Varga showed that no induced subgraph can be exclud...
research
∙
07/20/2022
Computing Tree Decompositions with Small Independence Number
The independence number of a tree decomposition is the maximum of the in...
research
∙
06/30/2022
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure
We continue the study of (tw,ω)-bounded graph classes, that is, heredita...
research
∙
06/29/2022
Finding k-community structures in special graph classes
For a fixed integer k≥ 2, a k-community structure in an undirected graph...
research
∙
02/09/2022
Allocation of Indivisible Items with Individual Preference Graphs
This paper studies the allocation of indivisible items to agents, when e...
research
∙
11/08/2021
Tree decompositions with bounded independence number and their algorithmic applications
In 2020, Dallard, Milanič, and Štorgel initiated a systematic study of g...
research
∙
06/18/2021
Graphs with at most two moplexes
A moplex is a natural graph structure that arises when lifting Dirac's c...
research
∙
07/03/2020
On girth and the parameterized complexity of token sliding and token jumping
In the Token Jumping problem we are given a graph G = (V,E) and two inde...
research
∙
06/10/2020
Treewidth versus clique number in graph classes with a forbidden structure
Treewidth is an important graph invariant, relevant for both structural ...
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
