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
7 papers · 1 filter
Nutation Wave as a Platform for Ultrafast Spin Dynamics in Ferromagnets
Imam Makhfudz, Enrick Olive, Stam Nicolis
At short time scales the inertia term becomes relevant for the magnetization dynamics of ferromagnets and leads to nutation for the magnetization vector. For the case of spatially…
Domination and location in twin-free digraphs
Florent Foucaud, Shahrzad Heydarshahi, Aline Parreau
A dominating set in a digraph is a set of vertices such that every vertex is either in or has an in-neighbour in . A dominating set of a digraph is locating-dominati…
Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity
Florent Foucaud, Hervé Hocquard, Dimitri Lajou +2
We study the complexity of graph modification problems with respect to homomorphism-based colouring properties of edge-coloured graphs. A homomorphism from edge-coloured graph …
Toward a Dempster-Shafer theory of concepts
Sabine Frittella, Krishna Manoorkar, Alessandra Palmigiano +2
In this paper, we generalize the basic notions and results of Dempster-Shafer theory from predicates to formal concepts. Results include the representation of conceptual belief fun…
Complexity of planar signed graph homomorphisms to cycles
François Dross, Florent Foucaud, Valia Mitsou +2
We study homomorphism problems of signed graphs. A signed graph is an undirected graph where each edge is given a sign, positive or negative. An important concept for signed graphs…
Rough concepts
Willem Conradie, Sabine Frittella, Krishna Manoorkar +4
The present paper proposes a novel way to unify Rough Set Theory and Formal Concept Analysis. Our method stems from results and insights developed in the algebraic theory of modal…