In: Biological Journal of the Linnean Society, 2016, vol. 118, no. 3, p. 536-550
|
In: Brain Structure and Function, 2015, vol. 220, no. 2, p. 1077-1091
|
In: Journal of Insect Conservation, 2015, vol. 19, no. 4, p. 703-711
|
Thèse de doctorat : Università della Svizzera italiana, 2020 ; 2020INFO023.
As energy efficiency becomes a crucial concern in almost every kind of digital application, Approximate Computing gains popularity as a potential answer to this ever-growing energy quest. Approximate Computing is a design paradigm particularly suited for error- resilient applications, where small losses in accuracy do not represent a significant reduction in the quality of the result. In these...
|
In: Journal of Graph Algorithms and Applications, 2009, vol. 13, no. 2, p. 99-118
Starting from the basic problem of reconstructing a 2-dimensional im- age given by its projections on two axes, one associates a model of edge coloring in a complete bipartite graph. The complexity of the case with k = 3 colors is open. Variations and special cases are considered for the case k = 3 colors where the graph corresponding to the union of some color classes (for instance colors 1...
|
In: Communications in Mathematical Physics, 2014, vol. 331, no. 3, p. 1029-1039
|
In: Discrete Applied Mathematics, 2016, vol. 204, p. 77-89
Given a graph together with a partition of its vertex set, the minimum selective coloring problem consists of selecting one vertex per partition set such that the chromatic number of the subgraph induced by the selected vertices is minimum. The contribution of this paper is twofold. First, we investigate the complexity status of the minimum selective coloring problem in some specific graph...
|
In: Communications in Mathematical Physics, 2012, vol. 316, no. 1, p. 99-126
|
In: Biodiversity and Conservation, 2013, vol. 22, no. 12, p. 2751-2766
|
In: Aquatic Sciences, 2003, vol. 65, no. 3, p. 239-253
|