136 citations
- Aix-Marseille UniversitéFR68 papers
- Centre National de la Recherche ScientifiqueFR68 papers
- Laboratoire d'Informatique Fondamentale d'Orléans14 papers
- Laboratoire d’Informatique et SystèmesFR10 papers
- Institut national de recherche en sciences et technologies du numériqueFR8 papers
- Institut de Mathématiques de MarseilleFR7 papers
- King's College LondonGB7 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR6 papers
- Laboratoire d'Informatique, de Modélisation et d'Optimisation des SystèmesFR6 papers
- École Normale Supérieure Paris-SaclayFR5 papers
- Fafo FoundationNO5 papers
- Technische Universität BerlinDE5 papers
225 papers
Failures and Successes to Learn a Core Conceptual Distinction from the Statistics of Language
Zhimin Hu, Jeroen van Paridon, Gary Lupyan
Generic statements like "tigers are striped" and "cars have radios" communicate information that is, in general, true. However, while the first statement is true in principle, the…
Isometric path complexity of graphs
Dibyayan Chakraborty, Jérémie Chalopin, Florent Foucaud +1
A set of isometric paths of a graph is ``-rooted'', where is a vertex of , if is one of the endpoints of all the isometric paths in . The isometric path co…
About block-parallel Boolean networks: a position paper
Jacques Demongeot, Sylvain Sené
In automata networks, it is well known that the way entities update their states over time has a major impact on their dynamics. In particular, depending on the chosen update sched…
Querying Linked Data: how to ensure user's quality requirements
Jacques Chabin, Mirian Halfeld-Ferrari, Béatrice Markhoff +1
In the distributed and dynamic framework of the Web, data quality is a big challenge. The Linked Open Data (LOD) provides an enormous amount of data, the quality of which is diffic…
A cubic vertex-kernel for Trivially Perfect Editing
Maël Dumas, Anthony Perez, Ioan Todinca
We consider the Trivially Perfect Editing problem, where one is given an undirected graph and a parameter and seeks to edit (add or delete) at most $…
Complexity and algorithms for injective edge-coloring in graphs
Florent Foucaud, Hervé Hocquard, Dimitri Lajou
An injective -edge-coloring of a graph is an assignment of colors, i.e. integers in , to the edges of such that any two edges each incident with one d…