Michaël Rao

Recherche exhaustive des pentagones convexes pavant le plan

Salle de séminaire (4B05R) - Bâtiment Copernic

Abstract: Quand on cherche à caractériser les formes convexes pouvant paver le plan (en s’autorisant les rotations et miroirs), seul le cas des pentagones restait ouvert. De 1918...[details]

5-déc.-2017

Nicolas Trotignon

Graphs classes defined by excluding Truemper Configurations

Salle de séminaire (4B05R) - Bâtiment Copernic

Abstract: Truemper configurations are simple structures : prisms, thetas, pyramids and wheel. A prism is a graph made of two disjoint triangle that are matched by three dis...[details]

28-nov.-2017

Vincent Cohen-Addad

On the Local Structure of Stable Clustering Instances

Salle de séminaire (4B05R) - Bâtiment Copernic

Abstract: On the Local Structure of Stable Clustering Instances We study the classic k-median and k-means clustering objectives in the beyond-worst-case scenario. We consider t...[details]

21-nov.-2017

Eric Fusy

Combinatorics and applications of Schnyder woods

Salle de séminaire (4B05R) - Bâtiment Copernic

Schnyder woods are combinatorial structures on planar triangulations (maximal planar graphs embedded on the sphere) that can be formulated as a certain partition of the edges into 3 spanning ...[details]

14-nov.-2017

Arnau Padrol

On the extension complexity of polytopes

Salle de séminaire (4B05R) - Bâtiment Copernic

Abstract: The extension complexity of a polytope is the minimal number of facets of a polytope that can be linearly projected onto it. This apparently simple combinatorial geometry problem has bee...[details]

7-nov.-2017

Solon Pissis

Searching in Uncertain Texts

Salle de séminaire (4B05R) - Bâtiment Copernic

Pattern matching is a fundamental problem in theoretical computer science. Apart from its theoretical interest, it has many applications in other areas where textual data representations are used: computation...[details]

24-oct.-2017

Patricia Bouyer-Decitre

Average-energy games

Salle de séminaire (4B05R) - Bâtiment Copernic

Two-player quantitative zero-sum games provide a natural framework to synthesize controllers with performance guarantees for reactive systems within an uncontrollable environment. Classical settings includ...[details]

17-oct.-2017

Xavier Goaoc

Fonctions de pulvérisation d'hypergraphes (géométriques) / Shatter functions of (geometric) hypergraphs

Salle de séminaire (4B05R) - Bâtiment Copernic

En géométrie discrète et algorithmique, la complexité d'une famille d'ensemble est souvent étudiée au travers de sa fonction de pulvé...[details]

10-oct.-2017

Vincent Jugé

Courcelle's theorem made dynamic

Salle de séminaire (4B05R) - Bâtiment Copernic

Dynamic complexity is concerned with the complexity of updating a solution to a problem when its input changes. A typical example is as follows: given an directed graph G and two pointed vertices s and t,...[details]

3-oct.-2017

Rémi Forax

On implementing data structures pattern matching in Java

Salle de séminaire (4B05R) - Bâtiment Copernic

In the magic wonderland of the unicorns, implementing the pattern matching in a language like Java that already provides a mechanism to check the class of a value at runtime (instanc...[details]

26-sept.-2017