9 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Université Clermont AuvergneFR10 papers
- Institut National Polytechnique de ToulouseFR8 papers
- Laboratoire d'Informatique, de Modélisation et d'Optimisation des SystèmesFR6 papers
- Centre National de la Recherche ScientifiqueFR5 papers
- Institut PascalFR4 papers
- Azienda Ospedaliera Ospedale MaggioreIT2 papers
- Czech Technical University in PragueCZ2 papers
- Laboratoire Plasma et Conversion d'EnergieFR2 papers
- University of MilanIT2 papers
- Centre de Biologie Intégrative de ToulouseFR1 paper
- Centre de Nanosciences et de NanotechnologiesFR1 paper
- Centre de Recherche d'Albi en génie des Procédés, des SOlides Divisés, de l'Énergie et de l'EnvironnementFR1 paper
10 papers
Time-resolved dynamics of GaN waveguide polaritons
Loïc Méchin, François Médard, Joël Leymarie +4
We implement a new experimental approach to directly measure the lifetime of guided polaritons arising from the strong-coupling of GaN excitons and the guided photonic modes of a s…
Nonlinear Drift in Feynman-Kac Theory: Preserving Early Probabilistic Insights
Daniel Yaacoub, Stéphane Blanco, Jean-François Cornet +3
In 1905, Einstein's theory of Brownian motion supported the molecular basis of the diffusion equation and introduced two complementary viewpoints: a deterministic field description…
Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions
Bogdan Alecu, Mamadou Moustapha Kanté, Vadim Lozin +1
Lettericity is a graph parameter responsible for many attractive structural properties. In particular, graphs of bounded lettericity have bounded linear clique-width and they are w…
Risk-Aware Navigation for Mobile Robots in Unknown 3D Environments
Elie Randriamiarintsoa, Johann Laconte, Benoit Thuilot +1
Autonomous navigation in unknown 3D environments is a key issue for intelligent transportation, while still being an open problem. Conventionally, navigation risk has been focused…
Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k
Mamadou Mostapha Kanté, Eun Jung Kim, O-joung Kwon +1
Every minor-closed class of matroids of bounded branch-width can be characterized by a list of excluded minors, but unlike graphs, this list may need to be infinite in general. How…
Generalisations of Matrix Partitions : Complexity and Obstructions
Alexey Barsukov, Mamadou Moustapha Kanté
A trigraph is a graph where each pair of vertices is labelled either 0 (a non-arc), 1 (an arc) or (both an arc and a non-arc). In a series of papers, Hell and co-authors pr…
Weight-Reducing Turing Machines
Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero +1
It is well-known that one-tape Turing machines working in linear time are no more powerful than finite automata, namely they recognize exactly the class of regular languages. We pr…
Converting Nondeterministic Two-Way Automata into Small Deterministic Linear-Time Machines
Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero +1
In 1978 Sakoda and Sipser raised the question of the cost, in terms of size of representations, of the transformation of two-way and one-way nondeterministic automata into equivale…
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 …
Addressing the gas kinetics Boltzmann equation with branching-path statistics
Guillaume Terrée, Mouna El Hafi, Stéphane Blanco +3
This article proposes a new statistical numerical method to address gas kinetics problems obeying the Boltzmann equation. This method is inspired from some Monte-Carlo algorithms u…