IA Scholar Query: An Algorithm for the Chromatic Number of a Graph.
https://scholar.archive.org/
Internet Archive Scholar query results feedeninfo@archive.orgSat, 01 Oct 2022 00:00:00 GMTfatcat-scholarhttps://scholar.archive.org/help1440Descriptive Combinatorics and Distributed Algorithms
https://scholar.archive.org/work/pjgjlnfrkzd5vmd7p7c5yr66pe
In this article we shall explore a fascinating area called descriptive combinatorics and its recently discovered connections to distributed algorithms-a fundamental part of computer science that is becoming increasingly important in the modern era of decentralized computation. The interdisciplinary nature of these connections means that there is very little common background shared by the researchers who are interested in them. With this in mind, this article was written under the assumption that the reader would have close to no background in either descriptive set theory or computer science. The reader will judge to what degree this endeavor was successful. The article comprises two parts. In the first part we give a brief introduction to some of the central notions and problems of descriptive combinatorics. The second part is devoted to a survey of some of the results concerning theAnton Bernshteynwork_pjgjlnfrkzd5vmd7p7c5yr66peSat, 01 Oct 2022 00:00:00 GMTEstimation of channel distortion in orthogonal frequency division multiplexing system using pilot technique
https://scholar.archive.org/work/j7kaxzifp5gghlpkx3dcl6dl2m
Orthogonal frequency-division multiplexing (OFDM) is resistant to frequency selective fading due to the longer symbol duration. However, mobile applications channel timing fluctuations in one OFDM signal cause intercarrier-interference (ICI), which reduces performance. This research presented the support vector regression (SVR) model-based channel estimation technique for coherent optical communication systems. Due to the coherent optical orthogonal frequency-division-multiplexed (COOFDM) system, a channel model is developed that includes linear fibre dispersion effects, noise from optical amplifiers, and inter-carrier interference generated by laser phase noise. As a result, for such a system, an accurate channel estimate is essential. Based on this concept, derivation of channel estimation and phase estimation for the system of CO-OFDM. The proposed method is tested and evaluated using MATLAB software. Computer simulation results for several standard methods such as extreme learning machines (ELM) and artificial neural networks (ANN) validate the feasibility of the suggested methodology. The CO-OFDM system's transmission experiments and computer simulations prove that the support vector machine-based model following pilot-assisted phase estimation gives the optimal performance. Therefore, results depicted that the channel estimation utilizing the SVR model gives good performance than the other methods, thus the proposed model gives an accurate CE process, respectively.Nisha Mary Joseph, C. Puttamadappawork_j7kaxzifp5gghlpkx3dcl6dl2mSat, 01 Oct 2022 00:00:00 GMTSuitable Site Selection of Water ATMs (Basis of Interior/Exterior Conditions) Using Graph Theory
https://scholar.archive.org/work/gyyikkgbpjdhnjehfnjwdbjf4q
Maintenance performs a vital role in assuring safety operation, enhancing the quality and accumulating the durability of the system. In this paper a method has been evolved to solve the different kinds of issues like new software installation, upgradation of current software, fixing of required equipment, raw water supply problem etc. To continue the service of water ATMs we cannot start maintenance of all the water ATMs together in any particular site, so authors require a proper network planning. Authors have a developed an algorithm to select the best site for fixing of Water ATMs. So individual can use this algorithm and find out the best sites for setting up of Water ATMs such that maximum numbers of persons gain the advantage of Water ATMs. In addition authors have planned an IoT enable Water ATMs. The IoT enabled technology put in the various function of Water ATMs, safeguarding the quality of water.Nayeemuddin Ahmed, Atowar-Ul Islam, Kanak C. Borawork_gyyikkgbpjdhnjehfnjwdbjf4qSat, 01 Oct 2022 00:00:00 GMTSign language detection using convolutional neural network for teaching and learning application
https://scholar.archive.org/work/bont7frjbzaefjjsmoa27qh72m
Teaching lower school mathematic could be easy for everyone. For teaching in the situation that cannot speak, using sign language is the answer especially someone that have infected with vocal cord infection or critical spasmodic dysphonia or maybe disable people. However, the situation could be difficult, when the sign language is not understandable by the audience. Thus, the purpose of this research is to design a sign language detection scheme for teaching and learning activity. In this research, the image of hand gestures from teacher or presenter will be taken by using a web camera for the system to anticipate and display the image's name. This proposed scheme will detects hand movements and convert it be meaningful information. As a result, it show the model can be the most consistent in term of accuracy and loss compared to others method. Furthermore, the proposed algorithm is expected to contribute the body of knowledge and the society.Wan Mohd Yaakob Wan Bejuri, Nur'Ain Najiha Zakaria, Mohd Murtadha Mohamad, Warusia Mohamed Yassin, Sharifah Sakinah Syed Ahmad, Ngo Hea Choonwork_bont7frjbzaefjjsmoa27qh72mSat, 01 Oct 2022 00:00:00 GMTA novel pre-processing approach based on colour space assessment for digestive neuroendocrine tumour grading in immunohistochemical tissue images
https://scholar.archive.org/work/5a4f2yikqndtpmr2yrtyg7c764
The complexity of histopathological images remains a challenging issue in cancer diagnosis. A pathologist analyses immunohistochemical images to detect a colour-based stain, which is brown for positive nuclei with different intensities and blue for negative nuclei. Several issues emerge during the eyeballing tissue slide analysis, such as colour variations caused by stain inhomogeneity, non-uniform illumination, irregular cell shapes, and overlapping cell nuclei. To overcome those problems, an automated computer-aided diagnosis system is proposed to segment and quantify digestive neuroendocrine tumours. We present a novel pre-processing approach based on colour space assessment. A criterion called pertinence degree is introduced to select the appropriate colour channel, followed by contrast enhancement. Subsequently, the adaptive local threshold technique that uses the modified Laplacian filter is applied to minimize the implementation complexity, highlight edges, and emphasize intensity variation between cells across the slide. Finally, the improved watershed algorithm based on the concave vertex graph is applied for cell separation. The performance of the algorithms for nucleus segmentation is evaluated according to both the object-level and pixel-level criteria. Our approach increases segmentation accuracy, with the F1-score equal to 0.986. There is significant agreement between the applied approach and the expert's ground truth segmentation. The proposed method outperformed the state-of-the-art techniques based on recall, precision, the F1-score, and the Dice coefficient.Hana Rmili, Aymen Mouelhi, Basel Solaiman, Raoudha Doghri, Salam Labidiwork_5a4f2yikqndtpmr2yrtyg7c764Thu, 29 Sep 2022 00:00:00 GMTStructures and Luminescent Properties of Rare-Earth Metal–Organic Framework Series with Thieno[3,2b]thiophene-2,5-dicarboxylate
https://scholar.archive.org/work/e52xy4zd4fct7f2jtfa5dlgzxy
Four new rare-earth metal–organic frameworks containing thieno[3,2b]thiophene-2,5-dicarboxylate (ttdc2−) with general formulae [M2(DMF)4(ttdc)3] (M3+ = Y3+ for 1, La3+ for 2, Tb3+ for 3) and [M2(H2O)2(ttdc)3] (M3+ = Lu3+ for 4) were synthesized. Their crystal structures were determined by performing a single-crystal X-ray diffraction analysis. Coordination polymers 1–3 are based on the binuclear metal-carboxylate building units with the formulae {M2(DMF)4(OOCR)6}. The six-connected blocks in 1–3 form a three-dimensional network with the primitive cubic (pcu) topology. Coordination framework 4 is based on chains comprised by stretched pseudo-binuclear metal-carboxylate building units. The chains are interconnected in four directions with ttdc2− linkers forming the 3D framework. The luminescent properties were studied for the synthesized frameworks in the solid state. All the coordination frameworks show a broad blue emission band (λex = 380 nm) typical for intra-ligand electron transitions. The sensing properties of 3 dispersions in solutions were investigated in detail and the luminescent response (quenching) was discovered in the presence of cinnamaldehyde and quinoline in diluted solutions at concentrations of as low as 4 × 10−1 vol.% and 4 × 10−2 vol.% (~3 × 10−3 M), respectively.Yuliya A. Yudina, Pavel A. Demakov, Alexey A. Ryadun, Vladimir P. Fedin, Danil N. Dybtsevwork_e52xy4zd4fct7f2jtfa5dlgzxyWed, 28 Sep 2022 00:00:00 GMTClustered Graph Coloring and Layered Treewidth
https://scholar.archive.org/work/sm6mm2npancd5ifzaspy5kb27i
A graph coloring has bounded clustering if each monochromatic component has bounded size. This paper studies such a coloring, where the number of colors depends on an excluded complete bipartite subgraph. This is a much weaker assumption than previous works, where typically the number of colors depends on an excluded minor. This paper focuses on graph classes with bounded layered treewidth, which include planar graphs, graphs of bounded Euler genus, graphs embeddable on a fixed surface with a bounded number of crossings per edge, amongst other examples. Our main theorem says that for fixed integers s,t,k, every graph with layered treewidth at most k and with no K_s,t subgraph is (s+2)-colorable with bounded clustering. The s=3 case implies that every graph with a drawing on a fixed surface with a bounded number of crossings per edge is 5-colorable with bounded clustering. Our main theorem is also a critical component in two companion papers that study clustered coloring of graphs with no K_s,t subgraph and excluding a fixed minor, odd minor or topological minor.Chun-Hung Liu, David R. Woodwork_sm6mm2npancd5ifzaspy5kb27iWed, 28 Sep 2022 00:00:00 GMTTropical computations for toric intersection theory in Macaulay2
https://scholar.archive.org/work/ugomipi2mbaqfmhh35iyhi6sly
We present the Macaulay2 package TropicalToric.m2 for toric intersection theory computations using tropical geometry.Alessio Borzìwork_ugomipi2mbaqfmhh35iyhi6slyTue, 27 Sep 2022 00:00:00 GMTGraph theoretic and algorithmic aspect of the equitable coloring problem in block graphs
https://scholar.archive.org/work/vqsfhsyt5nd5ff43hm6nlroij4
An equitable coloring of a graph G=(V,E) is a (proper) vertex-coloring of G, such that the sizes of any two color classes differ by at most one. In this paper, we consider the equitable coloring problem in block graphs. Recall that the latter are graphs in which each 2-connected component is a complete graph. The problem remains hard in the class of block graphs. In this paper, we present some graph theoretic results relating various parameters. Then we use them in order to trace some algorithmic implications, mainly dealing with the fixed-parameter tractability of the problem.Hanna Furmańczyk, Vahan Mkrtchyanwork_vqsfhsyt5nd5ff43hm6nlroij4Tue, 27 Sep 2022 00:00:00 GMTThe Development of Energy-Recovery Linacs
https://scholar.archive.org/work/dlfbcw3oynbprcxiawscte6s5i
Energy-recovery linacs (ERLs) have been emphasised by the recent (2020) update of the European Strategy for Particle Physics as one of the most promising technologies for the accelerator base of future high-energy physics. The current paper has been written as a base document to support and specify details of the recently published European roadmap for the development of energy-recovery linacs. The paper summarises the previous achievements on ERLs and the status of the field and its basic technology items. The main possible future contributions and applications of ERLs to particle and nuclear physics as well as industrial developments are presented. The paper includes a vision for the further future, beyond 2030, as well as a comparative data base for the main existing and forthcoming ERL facilities. A series of continuous innovations, such as on intense electron sources or high-quality superconducting cavity technology, will massively contribute to the development of accelerator physics at large. Industrial applications are potentially revolutionary and may carry the development of ERLs much further, establishing another shining example of the impact of particle physics on society and its technical foundation with a special view on sustaining nature.Chris Adolphsenwork_dlfbcw3oynbprcxiawscte6s5iTue, 27 Sep 2022 00:00:00 GMTBounds on the Twin-Width of Product Graphs
https://scholar.archive.org/work/hdqz4n4sczfvdfnh3lo62ikviu
Twin-width is a graph width parameter recently introduced by Bonnet, Kim, Thomassé Watrigant. Given two graphs G and H and a graph product ⋆, we address the question: is the twin-width of G⋆ H bounded by a function of the twin-widths of G and H and their maximum degrees? It is known that a bound of this type holds for strong products (Bonnet, Geniet, Kim, Thomassé Watrigant; SODA 2021). We show that bounds of the same form hold for Cartesian, tensor/direct, corona, rooted, replacement, and zig-zag products. For the lexicographical product it is known that the twin-width of the product of two graphs is exactly the maximum of the twin-widths of the individual graphs (Bonnet, Kim, Reinald, Thomassé Watrigant; IPEC 2021). In contrast, for the modular product we show that no bound can hold. In addition, we provide examples showing many of our bounds are tight, and give improved bounds for certain classes of graphs.William Pettersson, John Sylvesterwork_hdqz4n4sczfvdfnh3lo62ikviuTue, 27 Sep 2022 00:00:00 GMTArtificial Intelligence Models for Cell Type and Subtype Identification Based on Single-Cell RNA Sequencing Data in Vision Science
https://scholar.archive.org/work/erstnyexffcn7bmbajajzibqxa
Single-cell RNA sequencing (scRNA-seq) provides a high throughput, quantitative and unbiased framework for scientists in many research fields to identify and characterize cell types within heterogeneous cell populations from various tissues. However, scRNA-seq based identification of discrete cell-types is still labor intensive and depends on prior molecular knowledge. Artificial intelligence has provided faster, more accurate, and user-friendly approaches for cell-type identification. In this review, we discuss recent advances in cell-type identification methods using artificial intelligence techniques based on single-cell and single-nucleus RNA sequencing data in vision science.Yeganeh Madadi, Aboozar Monavarfeshani, Hao Chen, W. Daniel Stamer, Robert W. Williams, Siamak Yousefiwork_erstnyexffcn7bmbajajzibqxaMon, 26 Sep 2022 00:00:00 GMTQuantum-Inspired Perfect Matching under Vertex-Color Constraints
https://scholar.archive.org/work/mjy4fof2bffz7c7c6vblcytyey
We propose and study the graph-theoretical problem PM-VC: perfect matching under vertex-color constraints on graphs with bi-colored edges. PM-VC is of special interest because of its motivation from quantum-state identification and quantum-experiment design, as well as its rich expressiveness, i.e., PM-VC subsumes many constrained matching problems naturally, such as exact perfect matching. We give complexity and algorithmic results for PM-VC under two types of vertex color constraints: 1) symmetric constraints (PM-VC-Sym) and 2) decision-diagram constraints (PM-VC-DD). We prove that PM-VC-Sym is in RNC via a symbolic determinant algorithm, which can be derandomized on planar graphs. Moreover, PM-VC-Sym can be expressed in extended MSO, which encourages our design of an efficient dynamic programming algorithm for PM-VC-Sym on bounded-treewidth graphs. For PM-VC-DD, we reveal its NP-hardness by a graph-gadget technique. Our novel results for PM-VC provide insights to both constrained matching and scalable quantum experiment design.Moshe Y. Vardi, Zhiwei Zhangwork_mjy4fof2bffz7c7c6vblcytyeyMon, 26 Sep 2022 00:00:00 GMTObstructions to faster diameter computation: Asteroidal sets
https://scholar.archive.org/work/t7krlf4h5fahlgfhe5ygabpy44
An extremity is a vertex such that the removal of its closed neighbourhood does not increase the number of connected components. Let Ext_α be the class of all connected graphs whose quotient graph obtained from modular decomposition contains no more than α pairwise nonadjacent extremities. Our main contributions are as follows. First, we prove that the diameter of every m-edge graph in Ext_α can be computed in deterministic O(α^3 m^3/2) time. We then improve the runtime to linear for all graphs with bounded clique-number. Furthermore, we can compute an additive +1-approximation of all vertex eccentricities in deterministic O(α^2 m) time. This is in sharp contrast with general m-edge graphs for which, under the Strong Exponential Time Hypothesis (SETH), one cannot compute the diameter in O(m^2-ϵ) time for any ϵ > 0. As important special cases of our main result, we derive an O(m^3/2)-time algorithm for exact diameter computation within dominating pair graphs of diameter at least six, and an O(k^3m^3/2)-time algorithm for this problem on graphs of asteroidal number at most k. We end up presenting an improved algorithm for chordal graphs of bounded asteroidal number, and a partial extension of our results to the larger class of all graphs with a dominating target of bounded cardinality. Our time upper bounds in the paper are shown to be essentially optimal under plausible complexity assumptions.Guillaume Ducoffework_t7krlf4h5fahlgfhe5ygabpy44Mon, 26 Sep 2022 00:00:00 GMTConceptual basis of probability and quantum information theory
https://scholar.archive.org/work/i6rfek2r7vablenevi4xyztebm
These notes present a probabilistic framework that enables a formulation of classical probability theory, thermodynamics, and quantum probability with a common set of four principles or axioms. It explains everything that usual quantum mechanics and classical probability theory does. We emphasize that this framework is not an interpretation of quantum mechanics, such as "many worlds", "Kopenhagen interpretation", or others. It is a probability algorithm that computes probabilities of future events and additionally enables a reconstruction of quantum theory, thermodynamics, diffusion, and Wiener processes. We distinguish strictly between possibilities and outcomes. Moreover, we use a time concept based on the classification of future, present, and past. Well-known paradoxes are resolved. The superposition principle obtains a new meaning. The inclusion-exclusion principle, well-known in probability theory and number theory, is generalized to complex numbers. Our probabilistic framework is not based on the Hilbert space formalism. It requires only simple set theory and complex numbers. Thus, this theory can be taught in schools. Our framework may be viewed as an axiomatic approach to probability in the sense of Hilbert, who asked for an axiomatic probability theory in his sixth of the twenty-three open problems presented to the International Congress of Mathematicians in Paris in 1900. We have applied our probabilistic algorithm to several problems, including classical problems, statistical mechanics and thermodynamics, diffraction at multiple slits, light reflection, interferometer, delayed-choice experiments, and Hardy's Paradox.Christian Jansson, TUHH Universitätsbibliothekwork_i6rfek2r7vablenevi4xyztebmMon, 26 Sep 2022 00:00:00 GMTClustered Coloring of Graphs with Bounded Layered Treewidth and Bounded Degree
https://scholar.archive.org/work/cck7j7ml3razvkxkmlnro6gz6i
The clustering of a graph coloring is the maximum size of monochromatic components. This paper studies colorings with bounded clustering in graph classes with bounded layered treewidth, which include planar graphs, graphs of bounded Euler genus, graphs embeddable on a fixed surface with a bounded number of crossings per edge, map graphs, amongst other examples. Our main theorem says that every graph with layered treewidth at most k and with maximum degree at most Δ is 3-colorable with clustering O(k^19Δ^37). This is the first known polynomial bound on the clustering. This greatly improves upon a corresponding result of Esperet and Joret for graphs of bounded genus.Chun-Hung Liu, David R. Woodwork_cck7j7ml3razvkxkmlnro6gz6iSun, 25 Sep 2022 00:00:00 GMTApproximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width
https://scholar.archive.org/work/5cng63n2f5b3pkf7zifaqzx45y
For any ε > 0, we give a polynomial-time n^ε-approximation algorithm for Max Independent Set in graphs of bounded twin-width given with an O(1)-sequence. This result is derived from the following time-approximation trade-off: We establish an O(1)^2^q-1-approximation algorithm running in time exp(O_q(n^2^-q)), for every integer q ⩾ 0. Guided by the same framework, we obtain similar approximation algorithms for Min Coloring and Max Induced Matching. In general graphs, all these problems are known to be highly inapproximable: for any ε > 0, a polynomial-time n^1-ε-approximation for any of them would imply that P=NP [Hastad, FOCS '96; Zuckerman, ToC '07; Chalermsook et al., SODA '13]. We generalize the algorithms for Max Independent Set and Max Induced Matching to the independent (induced) packing of any fixed connected graph H. In contrast, we show that such approximation guarantees on graphs of bounded twin-width given with an O(1)-sequence are very unlikely for Min Independent Dominating Set, and somewhat unlikely for Longest Path and Longest Induced Path. Regarding the existence of better approximation algorithms, there is a (very) light evidence that the obtained approximation factor of n^ε for Max Independent Set may be best possible. This is the first in-depth study of the approximability of problems in graphs of bounded twin-width. Prior to this paper, essentially the only such result was a polynomial-time O(1)-approximation algorithm for Min Dominating Set [Bonnet et al., ICALP '21].Pierre Bergé, Édouard Bonnet, Hugues Déprés, Rémi Watrigantwork_5cng63n2f5b3pkf7zifaqzx45ySun, 25 Sep 2022 00:00:00 GMTTree decompositions with bounded independence number: beyond independent sets
https://scholar.archive.org/work/jag2dkw3svfxzlxnnh3dx34udy
We continue the study of graph classes in which the treewidth can only be large due to the presence of a large clique, and, more specifically, of graph classes with bounded tree-independence number. In [Dallard, Milanič, and Štorgel, Treewidth versus clique number. II. Tree-independence number, 2022], it was shown that the Maximum Weight Independent Packing problem, which is a common generalization of the Independent Set and Induced Matching problems, can be solved in polynomial time provided that the input graph is given along with a tree decomposition with bounded independence number. We provide further examples of algorithmic problems that can be solved in polynomial time under this assumption. This includes, for all even positive integers d, the problem of packing subgraphs at distance at least d (generalizing the Maximum Weight Independent Packing problem) and the problem of finding a large induced sparse subgraph satisfying an arbitrary but fixed property expressible in counting monadic second-order logic. As part of our approach, we generalize some classical results on powers of chordal graphs to the context of general graphs and their tree-independence numbers.Martin Milanič, Paweł Rzążewskiwork_jag2dkw3svfxzlxnnh3dx34udySun, 25 Sep 2022 00:00:00 GMTDiscriminative feature encoding for intrinsic image decomposition
https://scholar.archive.org/work/oyz6wc5t5jdqxegcjtkmjdtz2e
Intrinsic image decomposition is an important and long-standing computer vision problem. Given an input image, recovering the physical scene properties is ill-posed. Several physically motivated priors have been used to restrict the solution space of the optimization problem for intrinsic image decomposition. This work takes advantage of deep learning, and shows that it can solve this challenging computer vision problem with high efficiency. The focus lies in the feature encoding phase to extract discriminative features for different intrinsic layers from an input image. To achieve this goal, we explore the distinctive characteristics of different intrinsic components in the high dimensional feature embedding space. We define feature distribution divergence to efficiently separate the feature vectors of different intrinsic components. The feature distributions are also constrained to fit the real ones through a feature distribution consistency. In addition, a data refinement approach is provided to remove data inconsistency from the Sintel dataset, making it more suitable for intrinsic image decomposition. Our method is also extended to intrinsic video decomposition based on pixel-wise correspondences between adjacent frames. Experimental results indicate that our proposed network structure can outperform the existing state-of-the-art.Zongji Wang, Yunfei Liu, Feng Luwork_oyz6wc5t5jdqxegcjtkmjdtz2eSun, 25 Sep 2022 00:00:00 GMTTelomere-Associated Changes in Nuclear Architecture of Cancer-Associated Macrophage-like Cells in Liquid Biopsies from Melanoma Patients
https://scholar.archive.org/work/hm7brwuf7reyroemgqae7as2iu
During phagocytosis, tumor-associated macrophages (TAMs) can incorporate genetic material from tumor cells. The incorporation of extra genetic material may be responsible for advanced malignant behavior observed in some TAMs, making TAMs potentially important players in cancer progression. More recently, similar cells were described in the blood as cancer-associated macrophage-like cells (CAMLs). CAMLs may be equivalent to TAMs cells in the blood, and they express macrophage markers. However, their origin is still unclear. In a previous study, we showed for the first time the distinct telomere 3D structure of circulating tumor cells (CTCs) in melanoma and other cancers. In the present pilot study, we investigated, comparatively, the 3D telomere structure of CAMLs, CTCs and leucocytes from nine melanoma patients with metastatic cutaneous melanoma stage IV. CTC capture was performed by size-based filtration followed by cytological and immunocytological evaluation. Three-dimensional Quantitative Fluorescent in situ Hybridization was performed to measure differences in five 3D telomere parameters. Telomere parameters, such as number, length, telomere aggregates, nuclear volume, and a/c ratio, were compared among different cellular types (CTCs, CAMLs, and normal leucocytes). Three telomere parameters were significantly different between CAMLs and leucocytes. The combination of two telomere parameters (telomere length against the number of telomeres) resulted in the identification of two CAMLs subpopulations with different levels of genomic instability. Those populations were classified as profile 1 and 2. Profile 2, characterized by a high number of short telomeres, was observed in four of the nine melanoma patients. To our knowledge, this is the first pilot study to investigate 3D telomere parameters as hallmarks of nuclear architecture in CAMLs' population in comparison to leucocytes from the same patient. Further studies involving a larger patient sample size are necessary to validate these findings and explore their potential prognostic value.Aline Rangel-Pozzo, Janine Wechsler, Jessica Groult, Laetitia Da Meda, Celeste Lebbe, Sabine Maiwork_hm7brwuf7reyroemgqae7as2iuSun, 25 Sep 2022 00:00:00 GMT