While graph covering is a fundamental and well-studied problem, this field lacks a broad
and unified literature review. The holistic overview of graph covering given in this article …

Networks of coupled oscillators have far-reaching implications across various fields,
providing insights into a plethora of dynamics. This review offers an in-depth overview of …

Cardinality estimation is one of the most important problems in query optimization. Recently,
machine learning-based techniques have been proposed to effectively estimate cardinality …

What does it mean today to study a problem from a computational point of view? We focus
on parameterized complexity and on Column 16 “Graph Restrictions and Their Effect” of DS …

Learning to predict solutions to real-valued combinatorial graph problems promises efficient
approximations. As demonstrated based on the NP-hard edge clique cover number …

An abundance of real-world problems manifest as covering edges and/or vertices of a graph
with cliques that are optimized for some objectives. We consider different structural …

We study the problem of learning the clusters of a given graph in the self-directed learning
setup. This learning setting is a variant of online learning, where rather than an adversary …

Abstract The Edge Clique Cover (ECC) problem is concerned with covering edges of a
graph with the minimum number of cliques, which is an NP-hard problem. This problem has …

We develop an FPT algorithm and a bi-kernel for the Weighted Edge Clique Partition
(WECP) problem, where a graph with $ n $ vertices and integer edge weights is given …

The edge clique covering problem consists in covering the edges of a graph using the
minimum number of cliques. The problem is NP-hard and even state-of-the-art heuristic …