GALaC team at LRI, Paris-Sud

GALaC is a research group at LRI, Paris-Sud University. We are focused on graph theory, combinatorics and network distributed systems algorithmic.

A global presentation of research activities in GALaC was made in 2013 for the AERES evaluation: Slides AERES 2013 and projet.

Recent Posts

Efficient generation of rectangulations and elimination trees via permutation languages

-- Arturo Merino (Technische Universität Berlin)

In this talk we apply the Hartung-Hoang-Mütze-Williams permutation language framework to derive exhaustive generation algorithms for two further classes of combinatorial objects, as well as Hamilton paths and cycles on the corresponding polytopes: (3) different classes of rectangulations, which are subdivisions of a rectangle into smaller rectangles (see www.combos ...


-- Sylvie Corteel (CNRS et IRIF, Université Paris Diderot)


(Reported to unkwown date) Programming computing media

-- Frédéric Gruau (LRI)

summary: We consider computing media consisting of billions of small identical Processing Elements (PE) communicating locally in space, and with an homogeneous and isotropic distribution. Computing media can scale arbitrary in size. Thus, they represent parallel architectures whose power can grow without limit. However, programming computing media is difficult.

In ...

Combinatorial generation via permutation languages

-- Torsten Mütze (University of Warwick)

In this talk we present a versatile algorithmic framework for exhaustively generating a large variety of different combinatorial objects, based on encoding them as permutations. This framework provides a unified view on many known Gray code results and allows us to prove many new ones, and it yields efficient algorithms ...

Enumération des cartes planaires à trois bords par découpage en tranches

-- Emmanuel Guitter (Institut de Physique Théorique IPhT)

Parmi toutes les techniques d’énumération des cartes planaires (graphes plongés sur la sphère à deux dimensions), une des approches conceptuellement les plus simples et directes consiste à découper la carte en tranches: si on dispose d’une règle canonique de découpage et que les tranches ainsi obtenues sont faciles ...

Self-Stabilization and Byzantine Tolerance for Maximal Independent Set

-- Jonas Sénizergues (LISN, Galac)

summary: We analyze the impact of transient and Byzantine faults on the construction of a maximal independent set in a general network. We adapt the self-stabilizing algorithm presented by Turau for computing such a vertex set. Our algorithm is self-stabilizing, and also works under the more difficult context of arbitrary ...

See all

Translations: fr