# Tag: Team seminar

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

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

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 ...

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

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 ...

## Optimal curing policy for epidemic spreading over a community network with heterogeneous population

summary: The design of an efficient curing policy, able to stem an epidemic process at an affordable cost, has to account for the structure of the population contact network supporting the contagious process. Thus, we tackle the problem of allocating recovery resources among the population, at the lowest cost possible ...

## Overcoming interference in the beeping communication model

summary: Small inexpensive inter-communicating electronic devices have become widely available. Although the individual device has severely limited capabilities (e.g., basic communication, constant-size memory or limited mobility), multitudes of such weak devices communicating together are able to form low-cost, easily deployable, yet highly performant networks. Such distributed systems present significant ...

## Scalable Load Balancing - Distributed Algorithms and the Packing Model

summary: Load imbalance is a recurring problem in High Performance Computing (HPC), which leads to suboptimal performance via the under-use of available resources. As computing systems grow larger, resource management and load balancing become a costly process, especially for dynamic applications that demand periodical workload balance. With this in mind ...

## graph algorithms to help molecular construction

**Summary:**
In organic chemistry, when a new molecule is designed, it is necessary to determine chemical reactions that can be used to synthesize this target molecule from available compounds. Finding such chemical reactions consists usually in searching in a reaction database (such as REAXYS or ChEBI) for a molecule that ...

## Sur le nombre des (d,k)-polytopes

**Résumé :**

Un polytope est l'enveloppe convexe d'un ensemble fini de points dans un espace euclidien. On dénotera par (d,k)-polytope un polytope entier de dimension d de R^d et contenu dans l'hypercube [0,k]^d. Ce sont des objets faciles à décrire mais dont la ...

## Economics of Age of Information (AoI) Management: Pricing and Competition

**Summary:**
Fueled by the rapid development of communication networks and sensors in portable devices, today
many mobile users are invited by content providers to sense and send back real-time useful
information (e.g., traffic observations and sensor data) to keep the freshness of the online platforms’
content updates. However, due ...

## Expérimentations sur le calcul hautes performances en combinatoire énumérative et algébrique.

**Summary :**

In this talk, I will report on several experiments around large scale enumerations in enumerative and algebraic combinatorics.

I'll describe a methodology used to achieve large speedups in several enumeration problems. Indeed, in many combinatorial structures (permutations, partitions, monomials, young tableaux), the data can be encoded as a ...

Page 1 / 4 »