research
∙
08/10/2022
Roman Census: Enumerating and Counting Roman Dominating Functions on Graph Classes
The concept of Roman domination has recently been studied concerning enu...
share
research
∙
04/10/2022
Minimal Roman Dominating Functions: Extensions and Enumeration
Roman domination is one of the many variants of domination that keeps mo...
research
∙
12/23/2021
A Multi-Objective Degree-Based Network Anonymization Approach
Enormous amounts of data collected from social networks or other online ...
research
∙
11/11/2021
A Note on the Maximum Number of Minimal Connected Dominating Sets in a Graph
We prove constructively that the maximum possible number of minimal conn...
research
∙
07/02/2021
An Improved Fixed-Parameter Algorithm for 2-Club Cluster Edge Deletion
A 2-club is a graph of diameter at most two. In the decision version of ...
research
∙
06/08/2020
Graph Minors Meet Machine Learning: the Power of Obstructions
Computational intractability has for decades motivated the development o...
research
∙
01/01/2019
On the Parameterized Cluster Editing with Vertex Splitting Problem
In the Cluster Editing problem, a given graph is to be transformed into ...
research
∙
12/29/2018
A Dynamically Turbo-Charged Greedy Heuristic for Graph Coloring
We introduce a dynamic version of the graph coloring problem and prove i...
research
∙
03/12/2018
Partitioning a graph into degenerate subgraphs
Let G = (V, E) be a graph with maximum degree k≥ 3 distinct from K_k+1. ...
research
∙
03/08/2018
