233 citations
- Université d'OrléansFR47 papers
- Services déconcentrés d'appui à la recherche Val de LoireFR39 papers
- Centre National de la Recherche ScientifiqueFR29 papers
- Université de ToursFR16 papers
- Laboratoire d'Informatique Fondamentale d'Orléans13 papers
- GREMAN, Matériaux, Microélectronique, Acoustique, NanotechnologiesFR11 papers
- Institut Polytechnique de BordeauxFR9 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR9 papers
- Université de BordeauxFR9 papers
- Laboratoire d'Informatique, de Modélisation et d'Optimisation des SystèmesFR8 papers
- Czech Academy of SciencesCZ7 papers
- Czech Academy of Sciences, Institute of Computer ScienceCZ7 papers
4 papers · 1 filter
Smallest -critical graphs of odd-girth
Laurent Beaudou, Florent Foucaud, Reza Naserasr
Given a graph , a graph is called -critical if does not admit a homomorphism to , but any proper subgraph of does. Observe that -critical graphs are t…
Fixing improper colorings of graphs
Valentin Garnero, Konstanty Junosza-Szaniawski, Mathieu Liedloff +2
In this paper we consider a variation of a recoloring problem, called the Color-Fixing. Let us have some non-proper -coloring of a graph . We investigate the problem of f…
A method to decrease the harmonic distortion in Mn-Zn ferrite/PZT and Ni-Zn ferrite/PZT layered composite rings exhibiting high magnetoelectric effects
V. Loyau, V. Morin, J. Fortineau +2
We have investigated the magnetoelectric (ME) effect in layered composite rings subjected to circumferential AC magnetic fields and DC magnetic fields in radial, axial or circumfer…
Deterministic graph connectivity in the broadcast congested clique
Pedro Montealegre, Ioan Todinca
We present deterministic constant-round protocols for the graph connectivity problem in the model where each of the nodes of a graph receives a row of the adjacency matrix, and…