447 citations
- Conservatoire National des Arts et MétiersFR56 papers
- Sorbonne UniversitéFR16 papers
- École Nationale Supérieure d’Informatique pour l’Industrie et l’EntrepriseFR12 papers
- Centre National de la Recherche ScientifiqueFR10 papers
- LIP6FR8 papers
- Center for New American MediaUS6 papers
- Institut national de l’information géographique et forestièreFR6 papers
- Institut national de recherche en sciences et technologies du numériqueFR6 papers
- Practical ActionKE6 papers
- Institut Systèmes Intelligents et de RobotiqueFR5 papers
- École Nationale Supérieure de Techniques AvancéesFR4 papers
- École PolytechniqueFR4 papers
9 papers · 1 filter
Fast SDP certification of neural networks : towards large multi-class datasets
Margot Boyer, Clément Rambour, Zacharie Alès +1
We present a new quadratic model for the certification problem in adversarial robustness, which simultaneously accounts for all possible target classes. Building on this model, we…
The Complexity of 2-Intersection Graphs of 3-Hypergraphs Recognition for Claw-free Graphs and triangulated Claw-free Graphs
Niccolò Di Marco, Andrea Frosini, Christophe Picouleau
Given a 3-uniform hypergraph H, its 2-intersection graph G has for vertex set the hyperedges of H and ee' is an edge of G whenever e and e' have exactly two common vertices in H. D…
Submodular functions in additive combinatorics problems for group actions and representations
Vincent Beck, Cédric Lecouvey
We establish analogues in the context of group actions or group representations of some classical problems and results in additive combinatorics of groups. We also study the notion…
The complexity of the bondage problem in planar graphs
Valentin Bouquet
A set of a graph is a dominating set if each vertex has a neighbor in or belongs to . Let be the cardinality of a minimum dominating set in .…
On Minimum Dominating Sets in cubic and (claw,H)-free graphs
Valentin Bouquet, François Delbot, Christophe Picouleau +1
Given a graph , is a dominating set if every is adjacent to an element of . The Minimum Dominating Set problem asks for a dominating…
The Minimum Dominating Set problem is polynomial for (claw, P8)-free graphs
Valentin Bouquet, Christophe Picouleau
We prove that the Minimum Dominating Set problem is polynomial for the class of (claw, P8)-free graphs.