In: Discrete Applied Mathematics, 2021, vol. 290, p. 17-35
In this paper we continue the systematic study of Contact graphs of Paths on a Grid (CPG graphs) initiated in Deniz et al. (2018). A CPG graph is a graph for which there exists a collection of pairwise interiorly disjoint paths on a grid in one-to-one correspondence with its vertex set such that two vertices are adjacent if and only if the corresponding paths touch at a grid-point. If every...
|
In: Theoretical Computer Science, 2021, vol. 877, p. 18-35
In this paper, we study the problem of deciding whether the total domination number of a given graph Gcan be reduced using exactly one edge contraction (called1-Edge Contraction(γt)). We focus on several graph classes and determine the computational complexity of this problem. By putting together these results, we manage to obtain a complete complexity dichotomy for H-free graphs.
|
In: IEEE 37th International Conference on Data Engineering (ICDE), 2021, p. 2661--2664
Anomaly detection is a fundamental problem that consists of identifying irregular patterns that do not conform to the expected behavior of a system or the generated data. Many anomaly detection techniques have been proposed for time series data. However, selecting the most suitable detection method remains challenging as the proposed techniques widely vary in performance. The appropriate...
|
In: Journal of Antimicrobial Chemotherapy, 2017, vol. 72, no. 10, p. 2787-2791
|
In: Social Cognitive and Affective Neuroscience, 2017, vol. 12, no. 12, p. 1959-1971
|
In: Social Cognitive and Affective Neuroscience, 2017, vol. 12, no. 12, p. 1993-1993
|
In: Psychonomic Bulletin & Review, 2015, vol. 22, no. 4, p. 1029-1034
|
In: Clinical Rheumatology, 2015, vol. 34, no. 3, p. 591-596
|
In: Somnologie - Schlafforschung und Schlafmedizin, 2015, vol. 19, no. 2, p. 133-140
|
In: Cerebral Cortex, 2017, vol. 27, no. 6, p. 3217-3230
|