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

Three interacting families of Fuss-Catalan posets

-- Camille Combe (IRMA, Strasbourg)

We will introduce three families of posets depending on a nonnegative integer parameter \(m\), having underlying sets enumerated by the \(m\)-Fuss Catalan numbers. Among these, one is a generalization of Stanley lattices and another one is a generalization of Tamari lattices. We will see how these three families of ...

(Reported to unkwown date) The Bron-Kerbosch algorithm with vertex ordering is output sensitive.

-- George Manoussakis (University of Versailles)

summary: The Bron-Kerbosch algorithm is a well known maximal clique enumeration algorithm. So far it was unknown whether it was output sensitive or not. In this paper we partially answer this question by proving that the Bron-Kerbosch Algorithm with vertex ordering, first introduced and studied by Eppstein, Löffler and Strash ...

L-orientations of graphs

-- Kenta Ozeki (Yokohama National University)

summary: An orientation of an (undirected) graph G is an assignment of directions to each edge of G. In this talk, we consider an orientation such that the out-degree of each vertex is contained in a given list. We introduce several relations to graph theory topics and pose our main ...

Formes limites de permutations à motifs interdits

-- Adeline Pierrot (LRI, Université Paris Saclay)

On s'intéresse aux ensembles de permutations à motifs exclus, appelés classes de permutations, qui ont été beaucoup étudiés en combinatoire énumérative. Dans ce travail, à la frontière entre combinatoire et probabilités, on s'intéresse à la limite d'échelle d'une grande permutation aléatoire uniforme dans une classe de ...

PHD defense: A guide book for the traveller on graphs full of blockages

-- Pierre Bergé (LRI, University of Paris Saclay)

summary: We study NP-hard problems dealing with graphs containing blockages.

We analyze cut problems via the parameterized complexity framework. The size p of the cut is the parameter. Given a set of sources {s_1,...,s_k} and a target t, we propose an algorithm deciding whether a cut of size at ...

See all

Translations: fr