output
20092025
most citedHigh-resolution measurements of face-to-face contact patterns in a primary school

871 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing cs.CCShow all

5 papers · 1 filter

cs.CC2024

Complexity of the Swap Median and Swap Closest Problems

Luís Cunha, Thiago Lopes, Arnaud Mary

Genome rearrangement distances provide a combinatorial framework for comparing genomes represented as permutations. Although the swap distance between two permutations is polynomia…

cs.CC2017★ 5 cited

Token Jumping in minor-closed classes

Nicolas Bousquet, Arnaud Mary, Aline Parreau

Given two -independent sets and of a graph , one can ask if it is possible to transform the one into the other in such a way that, at any step, we replace one vertex…

cs.CC2015★ 10 cited

Efficient enumeration of solutions produced by closure operations

Arnaud Mary, Yann Strozecki

In this paper we address the problem of generating all elements obtained by the saturation of an initial set by some operations. More precisely, we prove that we can generate the c…

cs.CC2015

Incremental complexity of a bi-objective hypergraph transversal problem

Ricardo Andrade, Etienne Birmelé, Arnaud Mary +2

The hypergraph transversal problem has been intensively studied, from both a theoretical and a practical point of view. In particular , its incremental complexity is known to be qu…

cs.CC2014

Computing an Evolutionary Ordering is Hard

Laurent Bulteau, Gustavo Sacomoto, Blerina Sinaimeri

We prove that computing an evolutionary ordering of a family of sets, i.e. an ordering where each set intersects with --but is not included in-- the union earlier sets, is NP-hard.