research
∙
06/01/2021
Approximate and exact results for the harmonious chromatic number
Graph colorings is a fundamental topic in graph theory that require an a...
share
research
∙
12/10/2020
A novel algorithm for clearing financial obligations between companies – an application within the Romanian Ministry of Economy
The concept of clearing or netting, as defined in the glossaries of Euro...
research
∙
04/16/2019
Heuristic algorithms for the Longest Filled Common Subsequence Problem
At CPM 2017, Castelli et al. define and study a new variant of the Longe...
research
∙
10/18/2018
Complexity of computing the anti-Ramsey numbers
The anti-Ramsey numbers are a fundamental notion in graph theory, introd...
research
∙
06/21/2018
A connection between String Covers and Cover Deterministic Finite Tree Automata Minimization
Data compression plays a crucial part in the cloud based systems of toda...
research
∙
06/21/2018
Hardness and algorithmic results for the approximate cover problem
In CPM 2017, Amir et al. introduce a problem, named approximate string c...
research
∙
06/21/2018
An output-sensitive algorithm for the minimization of 2-dimensional String Covers
String covers are a powerful tool for analyzing the quasi-periodicity of...
research
∙
04/25/2018
The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes
We address the following general question: given a graph class C on whic...
research
∙
04/25/2018
A quasi linear-time b-Matching algorithm on distance-hereditary graphs and bounded split-width graphs
We present a quasi linear-time algorithm for Maximum Matching on distanc...
research
∙
01/07/2018
Local search algorithms for wireless mesh networks
In a multi-channel Wireless Mesh Networks (WMN), each node is able to us...
research
∙
07/17/2017
