moteur de recherche

Séminaires

Séances de séminaire

Séminaire Algo - Olivier Bodini

Olivier Bodini

Quelques générateurs d'objets combinatoires optimaux en bit aléatoire et efficaces en temps et en espace

Seminar room (Copernic building)

Abstract: Nous illustrerons sur trois exemples la problématique du tirage des objets combinatoires quand on essaie d'optimiser l'efficacité et l...[details]


4-déc.-2018
Séminaire Algo - Sergio Cabello

Sergio Cabello

Interactions between geometry, graphs and algorithms

Room 27 (building Lavoisier)

Abstract: I will describe some of the interactions between graphs and geometry, many of them with an algorithmic slant. In particular, we will discuss the properties of different classes of graphs def...[details]


13-nov.-2018
“Machine learning and optimization” working group meeting

The first session of the working group will be on November 6th, 2018, in the seminar room of CERMICS (2nd floor of Coriolis building, left wing, see here for instructions to reach the building).

There will be two lectures:

10h-11h, Alexandre d’Aspremont, Restarting Frank-Wolfe Conditional Gradient...[details]


6-nov.-2018
Séminaire Algo - Sylvie Hamel

Sylvie Hamel

Médiane de permutations: réduction d’espace et lien avec le 3-Hitting Set Problem

Salle 27 - Bâtiment Lavoisier

Le problème de la médiane d’un ensemble de permutations est un problème d’optimisation combinatoire qui consiste à trouver une permutation, appelée médiane, qui minimise la...[details]


23-oct.-2018
Séminaire Algo - Lama Tarsissi

Lama Tarsissi

First Steps in the Algorithmic Reconstruction of Digital Convex Sets

Bâtiment Lavoisier, salle 27? (à confirmer)

A quite remarkable family of discrete sets which has recently attracted the attention of the discrete geometry community is the family of (digitally) convex polyominoes, ...[details]


16-oct.-2018
Séminaire Algo - Julien Baste

Julien Baste

Hitting minors on bounded treewidth graphs

Bâtiment Lavoisier, salle 27

For a fixed collection of graphs F, the F-DELETION problem consists in, given a graph G and an integer k, decide whether there exists S, subset of V(G), with |S| <= k such that G-S does not contain any of the ...[details]


9-oct.-2018
Séminaire Algo - Shakhar Smorodinsky

Shakhar Smorodinsky

Conflict-Free colorings

Bâtiment Rabelais, salle 34

There are few generalizations of the classical graph coloring notion to arbitrary hypergraphs. One such generalization is the notion of conflict-free coloring. This notion originated in the context of frequency assignmen...[details]


5-oct.-2018
Dernière mise à jour : 08/04/2015