Thematic team Distributed computing

Thematic team Theory and algorithmics of graphs

## Graphs and distributed computing

#### Day, hour and place

Tuesday at 2pm, room 3052 or online

The calendar of events (iCal format).

In order to add the event calendar to your favorite agenda, subscribe to the calendar by using this link.

#### Contact(s)

### Previous talks

#### Year 2024

Distributed algorithms and graphs

Tuesday April 30, 2024, 3:15PM, 3052 Sophie Germain

**Gianlorenzo D'Angelo** (GSSI) *Sparse Temporal Spanners with Low Stretch*

Distributed algorithms and graphs

Tuesday April 30, 2024, 11AM, 1016 Sophie Germain

**Alexis Baudin** (LIP6) *Faster maximal clique enumeration in large real-world link streams*

Distributed algorithms and graphs

Friday April 26, 2024, 2PM, 1020

**Dimitri Watel** (ENSIIE) *Edit distance to a linegraph, application to network reconstruction*

Distributed algorithms and graphs

Tuesday April 23, 2024, 2PM, 3052 Sophie Germain

**Cléophée Robin** (G-Scop) *Covering some vertices with paths and a Hamiltonian degree condition for tough graphs*

In 1973, Chvàtal conjecture the following : There exists a constant t such that every t-tough graphs is Hamiltonian.

Let t be a positive integer. A graph G with degree sequence d_1,d_2,…,d_n is P(t) (t being a positive integer) If for all i, t ≤ i <n/2, d_i ≤ i ⇒ d_{n−i+t} ≥ n−i. In 1995, Hoàng conjecture the following : If G is t-tough and P(t) then G is Hamiltonian. Hoàng prove that it is true for t ≤ 3. In 2023, Hoang and Robin proved that it is also true for t ≤ 4 by extending the Closure Lemma due to Bondy and Chvàtal into a version for tough graphs.

We prove that it is true for t≤7 for n large enough. To do so, we prove a lemma about covering some vertices of a graph with a bounded number of paths.

This is joint work with Chình T. Hoàng and Paul Dorbec.

Distributed algorithms and graphs

Tuesday March 26, 2024, 2PM, 3052

**Ambroise Baril** (Université de Lorraine) *On the parameterized complexity of the non-hereditary relaxations of Clique*

Distributed algorithms and graphs

Tuesday March 19, 2024, 3:15PM, Room 3052

**Michel Habib** *On some recursive linear time algorithms on graphs*

We present a general scheme to design linear time recursive algorithm on graphs. As an application I will detail an algorithm that computes the modular decomposition tree of an undirected graph in linear time. This algorithm was presented at Icalp 08 (12 pages) and the full is version (42 pages) is now available at https://arxiv.org/abs/0710.3901

To this aim I will present the combinatorial structures needed. In particular the linear time behavior heavily relies on the recursive structure of a nice graph search : Lexicographic Breadth First Search (LexBFS).

Distributed algorithms and graphs

Tuesday January 30, 2024, 2PM, Room 3052

**Giannos Stamoulis** (Institute of Informatics, University of Warsaw, Poland) *Descriptive and structural conditions towards optimal algorithms*

Distributed algorithms and graphs

Friday January 26, 2024, 2:15PM, 3058 SG

**Daniel Vaz** (LAMSADE, Université Paris Dauphine–PSL) *Good and Efficient Approximation for the Sparsest Cut Problem in Bounded-Treewidth Graphs*

In this talk, we focus on the simpler setting of bounded-treewidth graphs, and present new constant-factor approximation algorithms. Known algorithms in this setting are either inefficient or have large approximation factors. We will see that these algorithms can be framed as specific cases of a general algorithm with uses beyond sparsest cut, and then show how to combine the best of both approaches to obtain efficient and good approximations to the problem. As a result, we give the first constant-factor approximation algorithm running in FPT time.

Distributed algorithms and graphs

Tuesday January 23, 2024, 2PM, 1003 Sophie Germain

**Thomas Suzan** (G-SCOP laboratory, UGA) *Graph homomorphisms, reconfiguration and topology*

We consider graph homomorphisms from the point of view of reconfiguration: Given two graphs G and H, we study a reconfiguration graph Col(G,H) whose vertices are graph homomorphisms, where two graph homomorphisms are adjacent if they differ on a single vertex. For a fixed graph H, we consider the computation complexity of 1) Deciding if there is a path between two homomorphisms in Col(G,H); and 2) Deciding if Col(G,H) is connected.

We show how topological methods can be used in both settings to obtain polynomial algorithms for 1) and hardness results for 2). 1) is joint work with Moritz Mühlenthaler (G-SCOP, UGA) and Benjamin Lévêque (G-SCOP, CNRS). 2) is joint work with Moritz Mühlenthaler and Mark Siggers (KNU, Korea).

#### Year 2023

Distributed algorithms and graphs

Friday December 8, 2023, 3PM, 1007

**Pierre Aboulker** (ENS-Paris) *Clique number of tournaments*

Distributed algorithms and graphs

Friday November 10, 2023, 3PM, 1007

**Pournajafi Pegah** (College de France) *Scott's conjecture for complete graphs*

Distributed algorithms and graphs

Friday October 20, 2023, 3PM, 1007

**Allen Ibiapina** *Menger's Theorem and Related Problems in Temporal Graph*

Distributed algorithms and graphs

Tuesday September 26, 2023, 3:30PM, 3052 Sophie Germain

**Binh-Minh Bui-Xuan** (CNRS, LIP6, UPMC) *Efficient algorithms using temporality and geometry on graphs.*

Without the consideration of temporality, a good number of width parameters has been introduced in the effort to better understand what lies between cliquewidth (number of different neighbourhoods) and treewidth (total size of neighbourhoods). We can cite rankwidth, bimodule-width, booleanwidth, and matching-width for the first category; and minor-based parameters such as Hajos/Hadwiger number and twinwidth for the second one. However, attempts in extending those parameters to temporal graphs are still scarce in the literature.

Twins in a temporal context would refer to vertices which are substitutes for each other in the solution of a number of classical graph problems, e.g. matching, epidemic spreading, journeys of optimal (temporal) length, and so on. Although most of these problems become NP-hard to optimise on an arbitrary input, we present in this talk an example where reducing a spatiotemporal input into a timeless graph and using both geometric and decomposition properties help in obtaining a PTAS solution. We hope this kind of technique could help in solving problems beyond first order logic when exploiting the conformist nature of twins.

Distributed algorithms and graphs

Tuesday September 19, 2023, 4PM, 3052

**Feodor Dragan And Guillaume Ducoffe** *alpha_i-Metric Graphs: Radius, Diameter and all Eccentricities*

Distributed algorithms and graphs

Tuesday September 12, 2023, 3PM, 147 Olympe de Gouges

**Éric Colin De Verdière** (CNRS, LIGM, Marne-la-Vallée) *Embedding graphs into 2-dimensional simplicial complexes*

In this talk, we consider an even more general case, in which the target space is a 2-dimensional simplicial complex (a topological space obtained from a graph by attaching a solid triangle to some of its 3-cycles). It turns out that this generalization encompasses some other well known problems, such as the crossing number problem and the planarity number problem (and their generalizations to surfaces). We give an algorithm that is quadratic in the size of the input graph (and exponential in the size of the input complex), independent from the previous algorithms to embed graphs into surfaces. The techniques mix graph theory (branchwidth, excluded grid theorem, dynamic programming) with topology (combinatorial maps of graphs on surfaces).

This is joint work with Thomas Magnard.

Distributed algorithms and graphs

Tuesday July 11, 2023, 3PM, 146 Olympe de Gouge

**Andrea Jimenez** (University of Valparaiso, Chile) *UPPER BOUND FOR THE CONFLICT-FREE CHROMATIC NUMBER ON CLAW-FREE GRAPHS*

Distributed algorithms and graphs

Tuesday June 13, 2023, 3PM, 147 Olympe de Gouges

**Anna Gujgiczer** (Budapest University of Technology and Economics, Hungary) *Circular chromatic number of generalised Mycielski graphs on odd cycles and other quadrangulations of the projective plane*

In this talk we present a new, relatively short direct proof for the circular chromatic number, using only a basic notion of algebraic topology, namely the winding number. Then we present another graph family with high odd girth and circular chromatic number 4. This construction is very similar to the generalized Mycielski, but on its first two layers it forms a M$\ddot{o}$bius ladder. We prove the statement about their circular chromatic number with similar techniques. Moreover we present a similar result for a family of signed graphs.

This talk is based on a joint work with Reza Naserasr (Universit´e de Paris, IRIF, CNRS, F-75006, Paris, France), S Rohini (Indian Institute of Technology Madras, India) and S Taruni (Indian Institute of Technology Dharwad, India).

Distributed algorithms and graphs

Tuesday May 16, 2023, 2PM, 147 Olympe de Gouges

**Frédéric Meunier** (CERMICS) *Coloring complements of line graphs.*

Distributed algorithms and graphs

Tuesday May 9, 2023, 3PM, 147, Salles Olympe de Gouge

**Sebastiano Vigna** (Università degli Studi di Milano) *Monotonicity on undirected networks.*

Distributed algorithms and graphs

Tuesday May 2, 2023, 3:30PM, ZOOM

**Cléophée Robin** (Wilfrid Laurier University Waterloo, Canada) *A Closure Lemma for tough graphs and Hamiltonian degree conditions*

Distributed algorithms and graphs

Wednesday April 26, 2023, 3PM, 147, Salles Olympe de Gouge zoom

**Monika Csikos** (IRIF) *An introduction to VC-dimension*

While for simple geometric set systems (e.g. ones induced by half-spaces), one can bound the VC-dimension using elementary arguments, many applications require more complex set systems. A long standing central open problem since 1989 was bounding the VC-dimension of unions and intersections of half-spaces in high dimensions. In collaboration with A. Kupavskii and N. Mustafa, we resolved this problem by providing a tight lower bound in dimensions at least 4.

In this talk, I give an introduction to the notion of VC-dimension, present our bounds on the VC-dimension of unions and intersections of half-spaces, then discuss some results on graphs with bounded VC-dimension.

No prior knowledge of computational geometry or learning theory is required.

A part of the talk is based on the paper M. Csikós, A. Kupavskii, N. H. Mustafa — Tight Lower Bounds on the VC-dimension of Geometric Set Systems (Journal of Machine Learning Research, 2019)

The talk will also be available on zoom.

Distributed algorithms and graphs

Tuesday April 25, 2023, 3PM, 147, Salles Olympe de Gouge

**Sagar Sawant** (IIT Madras, Chennai, India) *Digraph analogue of Stanley's Tree Conjecture,*

Distributed algorithms and graphs

Tuesday April 11, 2023, 3PM, 1007

**Maud Szusterman** (IMJ-PRG) *Extended formulations of spanning tree polytopes*

Distributed algorithms and graphs

Wednesday March 29, 2023, 2PM, 3052

**Valentin Bartier** (LIRIS) *Independent set reconfiguration in sparse graphs*

Distributed algorithms and graphs

Tuesday March 14, 2023, 3PM, 1007

**Antoine Dailly** (LIMOS Clermont Auvergne) *Algorithms for the Metric Dimension problem on directed graphs*

Distributed algorithms and graphs

Tuesday January 10, 2023, 3PM, Salle 1007

**Nacim Oijid** (LIRIS) *On the complexity of Avoidance positionnal games*

#### Year 2022

Distributed algorithms and graphs

Tuesday November 22, 2022, 3PM, 1007

**Ambroise Baril** (LORIA) *Component twinwidth: linear bounds with cliquewidth, algorithmic applications and approximations*

Following the same principle, Bonnet et al. have very recently introduced the notion of contraction sequence of a graph: the high-level idea is to gain time by treating similarily vertices with a similar neighborhood, generalizing naturally the algorithms on cographs.

The quality of a contraction sequence can be mesured by two (among other) non-functionally equivalent parameters called twin-width and component twin-width. It is clear that the primary focus of Bonnet et al. was twin-width, leaving component twin-width almost unexplored in the whole literature.

It is known that cliquewidth and component twinwidth are functionnaly equivalent: Bonnet et al. proved this result through functional equivalence with booleanwidth (which is known to be functionnaly equivalent with cliquewidth), which leads to an exponential bound on component twin-width by cliquewidth; and a double-exponential bound on cliquewidth by component twin-width.

In this presentation, I will prove that these two bounds can be drastically improved: we will obtain very simple linear bounds. Then, I will give an example of a concrete application of component twin-width (using dynamic programming) that always beats the best known upper bounds of the complexity of a counting version of several graph coloring problems. Finally, I will discuss how the linear bounds obtained can be used to extend the results known on the approximations of cliquewidth to approximations of component twinwidth.

Distributed algorithms and graphs

Tuesday November 8, 2022, 2PM, 1007

**Zahraa Mohsen** (IMJ-PRG) *On Coloring Digraphs and Certain Types of Paths and Cycles*

During this talk we are going to present how the existence of certain types of paths and cycles in a digraph affects its chromatic number.

Distributed algorithms and graphs

Monday October 10, 2022, 11AM, Salle 3058

**Santiago Gúzman Pro** (UNAM) *Circular orderings of graphs*

Distributed algorithms and graphs

Friday July 22, 2022, 2:30PM, Salle 1007

**Rong Luo** (West Virginia University) *Modulo flows and Integer flows of signed graphs*

Distributed algorithms and graphs

Tuesday April 5, 2022, 2PM, Salle 1007

**Yelena Yuditsky** (Université libre de Bruxelles) *Weak Coloring Numbers of Intersection Graphs*

In this paper, we prove upper and lower bounds for the $k$-th weak coloring numbers of these classes of intersection graphs. As a consequence, we describe a natural graph class whose strong coloring numbers are polynomial in $k$, but the weak coloring numbers are exponential. We also observe a surprising difference in terms of the dependence of the weak coloring numbers on the dimension between touching graphs of balls (single-exponential) and hypercubes (double-exponential).

This is joint work with Zden\v{e}k Dvo\v{r}\'{a}k, Jakub Pek\'arek and Torsten Ueckerdt.

Distributed algorithms and graphs

Tuesday March 22, 2022, 2PM, Salle 1007

**Arthur Da Cunha** (COATI Team, Inria Sophia Antipolis, I3S) *Proving the Strong Lottery Ticket Hypothesis for Convolutional Neural Networks*

Distributed algorithms and graphs

Tuesday February 15, 2022, 2PM, salle 1007

**Pierluigi Crescenzi** (GSSI, L'Aquila, Italy) *Planning with Biological Neurons and Synapses*

#### Year 2021

Distributed algorithms and graphs

Tuesday December 14, 2021, 3PM, Salle 1007

**Laurent Beaudou** (HSE) *Of points and lines*

Distributed algorithms and graphs

Tuesday November 30, 2021, 2PM, Salle 1007

**Marco Caoduro** (G-Scop) *Hitting and packing squares*

Clearly, $\tau(\mathcal{S})$ is at least $\nu(\mathcal{S})$. We prove that $\tau(\mathcal{S}) \leq 10 \nu(\mathcal{S})$ and present a family where $\tau(\mathcal{S}) = 3\nu(\mathcal{S})$.

During the talk, we will sketch the proof of the main result and remark how to extend our approach to families of rectangles with \emph{bounded aspect ratios}.

This is joint work with András Sebő.

Distributed algorithms and graphs

Tuesday November 9, 2021, 2PM, Salle 1007

**Subir Kumar Ghosh** (RKMVERI) *Chromatic art gallery problems for point and vertex guards*

Chromatic art gallery problems arise from applications in areas like landmark-based robot navigation and wireless networks. One such problem is the weak-conflict free guarding of polygons, where the objective is to colour a chosen guard set S for P using the minimum number of colours such that each point within P sees at least one guard from S with a unique colour. Note that the objective here is to minimize the number of colors rather than the number of guards in S. We present an algorithm for weak conflict-free guarding of P (without holes) where the point guard set is coloured using only O(log n) colours. If the guards are allowed to place only on vertices of P, the corresponding algorithm for weak conflict-free vertex guarding problem uses O(log^2 n) colours. This algorithm uses funnel structures of weak visibility polygons for placing coloured guards.

Finally, we discuss a few open problems on weak conflict-free guarding of P for both point and vertex guards.

Distributed algorithms and graphs

Tuesday October 26, 2021, 2PM, Salle 1007

**Sagnik Sen** (IIT Dharwad, India) *On homomorphisms of simple signed graphs of some families*

Homomorphisms of signed graphs have been attracting growing attention in the last decades, especially due to their strong connections to the theories of graph coloring and graph minors. These homomorphisms have been particularly studied through the scope of the chromatic number. In this work, we provide new results and bounds on the chromatic number of several families of signed graphs (planar graphs, triangle-free planar graphs, $K_n$-minor-free graphs, and bounded-degree graphs).

Joint work with: Bensmail, Das, Nandi, Pierron, Sopena

Distributed algorithms and graphs

Tuesday October 19, 2021, 2PM, Salle 1007 and via ZOOM

**Mirna Džamonja** (IRIF) *On limits-from the finite to the countable and very much uncountable graphs*

Distributed algorithms and graphs

Tuesday October 5, 2021, 2PM, ZOOM

**Daniel Gonçalves** (CNRS, Université de Montpellier) *Segment representation of planar graphs*

In his PhD Thesis E.R. Scheinerman conjectured that every planar graph has a segment intersection representation, and he also conjectured that in the case of 3-colorable planar graphs, such a representation exists where only 3 slopes appear, one for each color class. We proved both of these conjectures, and we also proved that such a representation with 4 slopes, one per color class, does not always exist. This last proof relies on the fact that planar signed graphs are not always four colorable, for some signed version of colorings. During the talk we will provide the general idea of these proofs.

These works were joint works with J. Chalopin, L. Isenmann, and C. Pennarun

Distributed algorithms and graphs

Thursday June 24, 2021, 10AM, 3052 and ZOOM

**David Roberson** (Department of Applied Mathematics and Computer Science, Technical University ofDenmark) *Quantum isomorphism and counting homomorphisms from planar graphs*

This is joint work with Laura Mančinska.

Distributed algorithms and graphs

Tuesday May 25, 2021, 2PM, ZOOM

**Adrian Pastine** (Universidad Nacional de San Luis) *Null Decomposition of Graphs*

In this talk, we study the null decomposition of bipartite graphs without cycles of length $0$ modulo $4$. We show that $C_S(G)$ contains a unique maximum independent set and that $C_N(G)$ contains a unique maximum matching. We use the decomposition to show that $\Supp{G}$ is the intersection of all maximum independent sets of $G$, and the union of the unmatched vertices over all maximum matchings. As an application, we present an algorithm that finds a sparse basis for the null space of adjacency matrix of forests in optimal time.

This talk is based on joint work with Daniel Jaume and Gonzalo Molina, from Universidad Nacional de San Luis, and Martin Safe, from Universidad Nacional del Sur.

Distributed algorithms and graphs

Tuesday May 11, 2021, 2PM, ZOOM

**Bérénice Delcroix-Oger** *Parking trees*

This is a joint work with Matthieu Josuat-Vergès and Lucas Randazzo.

This would be a joint (Combi-Graph) seminar.

Distributed algorithms and graphs

Tuesday April 27, 2021, 3PM, ZOOM

**Daniel Adolfo Quiroz** *Colouring with conditions on distances*

Distributed algorithms and graphs

Tuesday April 13, 2021, 3PM, ZOOM

**Adrian Pastine** (Universidad Nacional de San Luis) *Null Decomposition of Graphs*

In this talk, we study the null decomposition of bipartite graphs without cycles of length $0$ modulo $4$. We show that $C_S(G)$ contains a unique maximum independent set and that $C_N(G)$ contains a unique maximum matching. We use the decomposition to show that $\Supp{G}$ is the intersection of all maximum independent sets of $G$, and the union of the unmatched vertices over all maximum matchings. As an application, we present an algorithm that finds a sparse basis for the null space of adjacency matrix of forests in optimal time.

This talk is based on joint work with Daniel Jaume and Gonzalo Molina, from Universidad Nacional de San Luis, and Martin Safe, from Universidad Nacional del Sur.

Distributed algorithms and graphs

Tuesday March 16, 2021, 2PM, ZOOM

**Filippo Brunelli** (IRIF) *On Computing Pareto Optimal Paths in Weighted Time-Dependent Networks*

Meeting ID: 894 0889 8417 Passcode: 005585

Distributed algorithms and graphs

Tuesday March 2, 2021, 2PM, Online Via ZOOM

**Stephane Devismes** (VERIMAG U. Grenoble Alpes) *Self-stabilizing Systems in Spite of High Dynamics*

In this talk, we will consider self-stabilization in highly dynamic networks, i.e., networks suffering from unexpected and frequent topological changes. Precisely, assuming that nodes are uniquely identified, we study the self-stabilizing leader election problem in three important classes of dynamic networks to obtain solutions tolerating both transient faults (such as memory corruption) and frequent topological changes.

We first study conditions under which our problem can be solved and then propose several algorithms. Our results reveal that the assumption on the knowledge of the number N of processes is central. Indeed, we show that, as soon as there is no strong guarantees on the temporal connectivity in the network, the knowledge of the exact value of N is required. Finally, the convergence time of self-stabilizing leader election cannot be bounded in some important cases. In those cases, we show that our solutions are speculative since their convergence time can be still bounded in a subset of more probable executions.

Distributed algorithms and graphs

Thursday February 25, 2021, 2PM, Online, via Zoom

**Matej Stehlik** (G-SCOP) *Critical subgraphs of Kneser graphs*

Joint work with Tomas Kaiser.

Distributed algorithms and graphs

Tuesday February 23, 2021, 2PM, Online, via Zoom

**Arnau Padrol** (Institut de Mathématiques de Jussieu) *Sweeps, polytopes, oriented matroids, and allowable graphs of permutations*

This is based on joint work with Eva Philippe.

https://u-paris.zoom.us/j/89408898417?pwd=bTNpVXJXc085MzJabWZ6YVJFRFUwZz09

Distributed algorithms and graphs

Tuesday February 2, 2021, 2PM, Salle 3052 and ZOOM

**Zhouningxin Wang** (IRIF) *Density of C_{-4}-critical signed graphs*

Zoom link: https://u-paris.zoom.us/j/89408898417?pwd=bTNpVXJXc085MzJabWZ6YVJFRFUwZz09

Meeting ID: 894 0889 8417 Passcode: 005585

Distributed algorithms and graphs

Tuesday January 12, 2021, 3PM, Online

**Benjamin R. Moore** (University of Waterloo) *The Pseudoforest Nine Dragon Tree conjecture is true*

#### Year 2020

Distributed algorithms and graphs

Tuesday November 24, 2020, 2PM, Online

**Laurent Feuilloley** (IRIF) *Graph classes and forbidden patterns on three and four vertices*

A popular way to characterize a graph class is to list a minimal set of forbidden induced subgraphs. Unfortunately, this strategy hardly ever leads to a very efficient recognition algorithm. On the other hand, many graph classes can be efficiently recognized by techniques that use some ordering of the nodes, such as the one given by a traversal.

We study specifically graphs that have an ordering avoiding some ordered structures that we call *patterns*. Several well-known classes such as chordal, bipartite, interval, and comparability graphs have a characterization in terms of forbidden patterns. It is also known that any class defined by a set of forbidden patterns on three nodes can be recognized in polynomial time. In a recent paper, we've characterized systematically all the classes defined by sets of forbidden patterns (on three nodes). Surprisingly there is a relatively small number of them, and they are all well-known. Also, almost all of them can actually be recognized in linear time. I will talk about these results and about the rich structure of the classes defined by patterns. I will also talk about on-going work in building bridges between intersection graphs and patterns on four vertices.

https://bbb-front.math.univ-paris-diderot.fr/recherche/zho-14p-vqa-bic

Distributed algorithms and graphs

Tuesday October 20, 2020, 2PM, Salle 3052

**Pierre Fraigniaud** (IRIF) *Distributed Certification of Graph Classes*

Distributed algorithms and graphs

Tuesday October 6, 2020, 2PM, Salle 3052

**Marthe Bonamy** (CNRS, LaBRI) *On Vizing's edge colouring question*

Distributed algorithms and graphs

Tuesday September 22, 2020, 3PM, Salle 3052

**Rongxing Xu** *Multiple list colouring of $3$-choice critical graphs*

Distributed algorithms and graphs

Tuesday June 2, 2020, 3:30PM, Online

**Julien Baste** (Universität Ulm) *Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory*

Distributed algorithms and graphs

Friday May 29, 2020, 2PM, Online

**Guillaume Ducoffe** *Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension*

• Our first main result is a Monte Carlo algorithm that on graphs of distance VC-dimension at most d, for any fixed k, either computes the diameter or concludes that it is larger than k in time O(k · mn^{1−εd}), where εd ∈ (0; 1) only depends on d. We thus obtain a truly subquadratic-time parameterized algorithm for computing the diameter on such graphs. • Then as a byproduct of our approach, we get a truly subquadratic-time randomized algorithm for constant diameter computation on all the nowhere dense graph classes. The latter classes include all proper minor-closed graph classes, bounded-degree graphs and graphs of bounded expansion. • Finally, we show how to remove the dependency on k for any graph class that excludes a fixed graph H as a minor. More generally, our techniques apply to any graph with constant distance VC-dimension and polynomial expansion (or equivalently having strongly sublinear balanced separators). As a result for all such graphs one obtains a truly subquadratictime randomized algorithm for computing their diameter.

We note that all our results also hold for radius computation. Our approach is based on the work of Chazelle and Welzl who proved the existence of spanning paths with strongly sublinear stabbing number for every hypergraph of constant VC-dimension. We show how to compute such paths efficiently by combining known algorithms for the stabbing number problem with a clever use of ε-nets, region decomposition and other partition techniques.

If time allows, I will also mention recent improvements of the above results, to eccentricity and distance oracle computations.

This is joint work with Michel Habib and Laurent Viennot.

Distributed algorithms and graphs

Tuesday April 14, 2020, 3:30PM, Online

**Pierluigi Crescenzi** (IRIF) *Temporal Closeness in Temporal Networks*

Distributed algorithms and graphs

Tuesday April 7, 2020, 3:30PM, Online

**Pierre Berge** *Fixed-parameter algorithms for finding small separators in graphs*

Distributed algorithms and graphs

Tuesday January 28, 2020, 2PM, Salle 3052

**Ana Silva** (Departamento de Matemática - Universidade Federal do Ceará) *Time for coloring*

In this talk, I will present the results, obtained in collaboration with Andrea Marino, in which we focus on temporal graphs whose edges remain active for at least $t$ timestamps (these are called $t$-persistent temporal graphs). Among other things, we: 1) give some upper bounds for the minimum number of colors needed in terms of $t$ and of the chromatic number of the underlying static graph $G$; 2) prove that $k$ colors are always sufficient when $t$ is at least $\log_k n$, and that if $t$ is smaller, then it is NP-complete to decide whether $k$ colors are enough; 3) prove that the problem is NP-complete even when $G$ has bounded treewidth, and each snapshot is planar and has constant size; and 4) give an FPT algorithm with parameters the treewidth of $G$ and $T$.

Our results also imply many interesting facts: for instance, we know that if $G$ is planar and 2-persistent, then 2 colors are always sufficient

#### Year 2019

Distributed algorithms and graphs

Tuesday December 3, 2019, 2PM, Salle 1007

**Marc Heinrich** *Counting independent sets in strongly orderable graphs*

Distributed algorithms and graphs

Tuesday November 26, 2019, 2PM, Salle 1007

**Denis Cornaz** (Université Paris Dauphine) *Flows in signed graphs*

Distributed algorithms and graphs

Tuesday November 12, 2019, 3:30PM, Salle 3052

**Suchismita Mishra** (IITM) *Strong chromatic index of unitary Cayley graphs*

Distributed algorithms and graphs

Wednesday November 6, 2019, 11AM, Salle 3052

**Laurent Viennot** *Distance labeling, Ruzsa-Szemeredi graphs and SumIndex communication complexity problem*

Joint work with Adrian Kosowski and Przemyslaw Uznanski.

Distributed algorithms and graphs

Tuesday October 22, 2019, 2PM, Salle 3052

**Michael Lampis** (Universite Paris Dauphine) *Finer Tight Bounds for Coloring on Clique-Width*

Distributed algorithms and graphs

Tuesday October 8, 2019, 2PM, Salle 3052

**Fabien De Montgolfier** (IRIF) *Algorithms for generalized modular decomposition*

Distributed algorithms and graphs

Monday June 24, 2019, 11AM, Salle 3052

**Carola Doerr** (CNRS, LIP6 Sorbonne University) *Evolutionary Algorithms – From Theory to Practice and Back*

In the last 15 years, the theory of randomized black-box optimization has advanced considerably, and has contributed to efficient optimization by providing insights into the working principles of black-box optimization which are hard or impossible to obtain by empirical means. On the other hand, empirically-guided benchmarking has opened up new research directions for theoretical investigations.

In this presentation we will discuss the state of the art in the theory of randomized black-box optimization algorithms. As part of this critical survey we will also mention a number of open questions and connections to other fields of Computer Science.

Distributed algorithms and graphs

Tuesday May 28, 2019, 3PM, Salle 1007

**Jean-Florent Raymond** (TU Berlin) *Enumerating minimal dominating sets in $K_t$-free graphs*

Link to the article: https://arxiv.org/abs/1810.00789

Distributed algorithms and graphs

Tuesday May 21, 2019, 2PM, Salle 3052

**Ben Seamone** (Université de Montréal and Dawson College) *Eternal domination in graphs*

Distributed algorithms and graphs

Thursday May 9, 2019, 3PM, Salle 1007

**Amélie Gheerbrant** (IRIF) *Graph query languages*

Distributed algorithms and graphs

Tuesday April 9, 2019, 2PM, Salle 3052

**Binh-Minh Bui-Xuan** (LIP6) *Temporal matching*

In contrast to classical graph theory, we show that the problem of computing a temporal matching of maximum size in a link stream is in general NP-hard. We then depict a kernelization algorithm parameterized by the solution size for the problem, producing quadratic kernels. As a byproduct we also give a 2-approximation algorithm. Both algorithms are implemented and confronted to link streams collected from real world graph data:

https://github.com/antoinedimitriroux/Temporal-Matching-in-Link-Streams

We observe from the experiments that the kernelization algorithm can perform very well in practice, reducing the instance size downto 10-20% on realistic mining parameters. In contrast, the 2-approximation gives rather mixed results. We conjecture that the approximation factor can be improved.

Distributed algorithms and graphs

Friday March 22, 2019, 2PM, Salle 1007

**Julien Baste** (Universität Ulm, Ulm, Germany) *Hitting minors on bounded treewidth graphs*

The presented results are joint work with Ignasi Sau and Dimitrios Thilikos and can be found in <https://arxiv.org/abs/1704.07284>.

Distributed algorithms and graphs

Tuesday March 12, 2019, 2PM, Salle 3052

**Rémy Belmonte** *Token Sliding on Split Graphs*

Joint work with Eun-Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi and Florian Sikora.

Distributed algorithms and graphs

Wednesday March 6, 2019, 11AM, Salle 3052

**Marc Lelarge** (Inria & ENS Paris) *Spectral embedding for graph classification*

Although our SGE is handcrafted, we also show how our generic embedding technique can be learned and built in a data-driven manner opening the way to new learning algorithms and deep learning architectures with some invariant constraints built-in.

Distributed algorithms and graphs

Tuesday February 19, 2019, 2PM, Salle 1007

**Marthe Bonamy** (CNRS - LABRI) *Around Brooks' theorem*

Distributed algorithms and graphs

Tuesday February 19, 2019, 11AM, Salle 3052

**Danupon Nanongkai** (KTH) *Distributed Shortest Paths, Exactly*

Distributed algorithms and graphs

Tuesday January 22, 2019, 2PM, Salle 3052

**Guillaume Ducoffe** (ICI Roumanie) *Computing Giant Diameters with Breadth-First Search and Range Queries*

#### Year 2018

Distributed algorithms and graphs

Tuesday December 18, 2018, 3:30PM, Salle 3052

**Bergougnoux Benjamin** (IRIF) *Rank Based Approach on Graphs with Structured Neighborhood*

The $d$-neighbor equivalence is a tools introduced by Bui-Xuan et al. in 2013 to obtained efficient parameterized algorithms for many width measures (clique-width, rank-width, mim-width,…) and for many problems with a locally checkable constraint (Dominating Set, Independent Set,…).

By combining these two notions, we obtain efficient algorithms for several connectivity problems such as Connected Dominating Set, Node Weighted Steiner Tree, Maximum Induced Tree, Longest Induced Path, and Feedback Vertex Set. For all these problems, we obtain $2^{O(k)}\cdot n^{O(1)}$, $2^{O(k \log(k))}\cdot n^{O(1)}$, $2^{O(k^2)}\cdot n^{O(1)}$ and $n^{O(k)}$ time algorithms parameterized respectively by clique-width, $\mathbb{Q}$-rank-width, rank-width and maximum induced matching width. Our approach simplifies and unifies the known algorithms for each of the parameters and match asymptotically also the best time complexity for Vertex Cover and Dominating Set.

Paper available on HAL : https://hal.archives-ouvertes.fr/hal-01799573v2/document

Distributed algorithms and graphs

Tuesday December 11, 2018, 2PM, Salle 3052

**Riste Škrekovski** (University of Ljubljana) *Some results and problems on unique-maximum colorings of plane graphs*

We first show that the conjecture holds for various subclasses of planar graphs but then we disprove it for planar graphs in general. So, we conclude that the facial unique-maximum chromatic number of the sphere is not four but five.

Additionally, we will consider a facial edge-coloring analogue of the aforementioned coloring, and we will conclude the talk with various open problems.

(Joint work with Vesna Andova, Bernard Lidick\'y, Borut Lu\v{z}ar, and Kacy Messerschmidt)

Distributed algorithms and graphs

Thursday November 29, 2018, 2PM, Salle 3014

**Carenne Ludeña** (Universidad Jose Tadeo Lozano) *A random graph model based on the Modular decomposition of graphs*

Distributed algorithms and graphs

Tuesday November 27, 2018, 2PM, Salle 3052

**Miguel Mendez** *Set operads and decomposition theory*

Distributed algorithms and graphs

Tuesday October 23, 2018, 2PM, Salle 3052

**Yllka Velaj** (CWI Amsterdam) *Stable Outcomes in Modified Fractional Hedonic Games*

We are interested in the scenario in which agents, individually or jointly, choose to form a new coalition or to join an existing one, until a stable outcome is reached. To this aim, we consider common stability notions, leading to strong Nash stable outcomes, Nash stable outcomes or core stable outcomes: we study their existence, complexity and performance, both in the case of general weights and in the case of 0-1 weights.

Distributed algorithms and graphs

Tuesday May 22, 2018, 2PM, Salle 1007

**François Pirot** (Université de Strasbourg) *Fractional chromatic number of small degree graphs and girth.*

Distributed algorithms and graphs

Friday April 6, 2018, 10AM, Salle 3052

**Cédric Bentz** *Steiner trees with edge capacities.*

Distributed algorithms and graphs

Tuesday April 3, 2018, 2PM, Salle 1007

**Marcin Kaminski** *Induced minors and well-quasi-ordering*

We show that the class of H-free graphs is well-quasi-ordered by induced minors if and only if H is an induced minor of the gem (=the path on 4 vertices plus a dominating vertex) or the graph obtained by adding a vertex of degree 2 to the K4 (= the complete graph on 4 vertices).

This generalizes a a result of Robin Thomas who proved that K4-free graphs are well-quasi-ordered by induced minors and complements similar dichotomy theorems proved by Guoli Ding for subgraphs and Peter Damaschke for induced subgraphs.

This is joint work with Jarosław Błasiok, Jean-Florent Raymond, and Théophile Trunck.

Distributed algorithms and graphs

Tuesday March 27, 2018, 2PM, Salle 1007

**Matej Stehlik** (Université Grenoble Alpes - GSCOP) *Nombre chromatique et la méthode topologique*

Distributed algorithms and graphs

Tuesday March 20, 2018, 2PM, Salle 1007

**Pierluigi Crescenzi** (Universite de Pise) *Computing node centrality in large graphs: from theory to practice and back*

Distributed algorithms and graphs

Tuesday March 13, 2018, 2PM, Salle 1007

**Mamadou Kante** (ISIMA) *Obstructions pour certaines classes de matroides linéaires*

Distributed algorithms and graphs

Tuesday February 27, 2018, 2PM, Salle 1007

**Dieter Mitsche** (Université Nice) *Aspects des Graphes Aléatoires*

Distributed algorithms and graphs

Tuesday February 20, 2018, 2PM, Salle 1007

**Jan Arne Telle** (University of Bergen) *Width parameters of graphs and structured graph classes*

Parts of the talk are based on joint work with O.Kwon and L.Jaffke, to appear at STACS 2018.

Distributed algorithms and graphs

Monday February 12, 2018, 2PM, Salle 3052

**Nabil Mustafa** (ESIEE) *Local Search for Geometric Optimization Problems.*

#### Year 2017

Distributed algorithms and graphs

Tuesday December 12, 2017, 2PM, Salle 3052

**Jean Krivine** (IRIF) *Incremental Update for Graph Rewriting*

Reference: Boutillier P., Ehrhard T., Krivine J. (2017) Incremental Update for Graph Rewriting. In: Yang H. (eds) Programming Languages and Systems. ESOP 2017. Lecture Notes in Computer Science, vol 10201. Springer, Berlin, Heidelberg

Séminaire commun du pole Algorihtmes et Structures Discrètes.

Distributed algorithms and graphs

Tuesday October 17, 2017, 2PM, Salle 3052

**Claire Mathieu** (DI - ENS) *Online k-compaction*

This is joint work with Carl Staelin, Neal E. Young, and Arman Yousefi.

Distributed algorithms and graphs

Tuesday September 26, 2017, 2PM, Salle 1007

**Jara Uitto** (ETH Zurich) *Tight Lower Bounds for the Cops and Robbers Game*

Distributed algorithms and graphs

Tuesday September 12, 2017, 2PM, Salle 1007

**Mor Perry** *Aspects of Distributed Verification*

1. Space-time tradeoffs for distributed verification, joint work with Rafail Ostrovsky and Will Rosenbaum. In this work, we introduce the notion of a t-PLS, which allows the verification procedure to run for super-constant time. Our work analyzes the tradeoffs of t-PLS between time, label size, message length, and computation space. We construct a universal t-PLS and prove that it uses the same amount of total communication as a known one-round universal PLS, and t factor smaller labels. In addition, we provide a general technique to prove lower bounds for space-time tradeoffs of t-PLS. We use this technique to show an optimal tradeoff for testing that a network is acyclic (cycle free). Our optimal t-PLS for acyclicity uses proof size, message size and computation space O( ( log n)/t).

2. Approximate proof-labeling schemes, joint work with Keren Censor-Hillel and Ami Paz. In this work we extend the PLS model by defining the approximate PLS (APLS) model. In this new model, the predicates for verification are of the form f(G)\le f'(G), where f, f': F → N for a family of configurations F and the set of natural numbers N. Informally, the predicates considered in this model are a comparison between two values of the configuration. As in the PLS model, nodes exchange labels in order to locally verify the predicate, and all must accept if the network satisfies the predicate. The soundness condition is relaxed with an approximation ration alpha, so that only if f(G) > alpha*f'(G) some node must reject. We show that in the APLS model, the proof size can be much smaller than the proof size of the same predicate in the PLS model. Moreover, we prove that there is a tradeoff between the approximation ratio and the proof size.

Distributed algorithms and graphs

Tuesday June 20, 2017, 2PM, Salle 1007

**Siddarth Gupta** *A Topological Algorithm for Determining How Road Networks Evolve Over Time*

Can you tell me how long should be the talk?

Distributed algorithms and graphs

Tuesday June 13, 2017, 2PM, Salle 1007

**Afshin Behmaram** *Matching and covering in cubic graphs*

Distributed algorithms and graphs

Tuesday May 2, 2017, 2PM, Salle 1007

**Pierre Aboulker** (ULB) *From chromatic number to dichromatic number*

We first give some properties related to the dichromatic number in order to show why and how it generalizes the chromatic number of non-oriented graphs. Then we investigate the following questions: What can we say about subgraphs, induced subgraphs and topological minors of a digraph with large dichromatic number?

Distributed algorithms and graphs

Tuesday April 25, 2017, 2PM, Salle 1007

**Mike Molloy** (University of Toronto and Ecole Normale Superieure Paris) *Entropy Compression and the Lovasz Local Lemma*

Distributed algorithms and graphs

Tuesday April 18, 2017, 2PM, Salle 1007

**Mikael Rabie** (LIX) *Time and Homonyms Considerations over Community Protocols*

Distributed algorithms and graphs

Tuesday April 4, 2017, 2PM, Salle 1007

**Valentin Garnero** (INRIA Sophia Antipolis) *(Méta)-noyaux constructifs et linéaires dans les graphes peu denses*

La méthode de décomposition en régions [Alber, Fellows, Niedermeier] est un résultat majeur dans le domaine des noyaux. Elle a permis de construire de nombreux noyaux linaires pour des variantes de la Domination dans les graphes planaires. J'illustrerai cette méthode avec le cas de la Domination Rouge Bleu, qui consiste à trouver, dans un graphe bicoloré, un ensemble de sommets bleus tel que tous les sommets rouges sont à distance au plus 1 de la solution.

Cette méthode a ensuite été généralisée par des méta-résultats [ex: Bodlaender, Fomin, Lokshtanov, Penninkx, Saurabh, Thilikos], qui prouve l'existence de noyaux (dans des graphes peu denses) pour tout problème vérifiant certaines conditions génériques. Je présenterai un de ses méta-résultats, qui se base sur la programmation dynamique et sur la décomposition en protrusion, et qui a le mérite d’être constructif.

Distributed algorithms and graphs

Tuesday March 28, 2017, 2PM, Salle 1007

**Juho Hirvonen** (IRIF) *Recent developments in the theory of distributed graph algorithms*

I will discuss two recent papers in this field. First, we gave a lower bound showing that there exist LCL problems of ”intermediate” complexity, that is, complexity strictly between known complexity classes (Brandt et al., STOC 2016). The proof is by a new kind of simulation argument. Second, Chang et al. (FOCS 2016) showed that this lower bound implies an exponential separation between the randomized and deterministic LOCAL models. Chang et al. also show further connections between the randomized and deterministic models, and establish a useful speed-up simulation for the deterministic LOCAL model.

Distributed algorithms and graphs

Tuesday March 21, 2017, 2PM, Salle 1007

**Evangelos Bampas** (LIF - Université Aix Marseille) *Linear search by a pair of distinct-speed robots*

Distributed algorithms and graphs

Tuesday February 28, 2017, 2PM, Salle 1007

**Laurent Viennot** (INRIA - IRIF) *Beyond Highway Dimension: Small Distance Labels Using Tree Skeletons*

The goal of a hub-based distance labeling scheme for a network $G = (V, E)$ is to assign a small subset $S(u) \subseteq V$ to each node $u \in V$, in such a way that for any pair of nodes $u, v$, the intersection of hub sets $S(u) \cap S(v)$ contains a node on the shortest $uv$-path. The existence of small hub sets, and consequently efficient shortest path processing algorithms, for road networks is an empirical observation. A theoretical explanation for this phenomenon was proposed by Abraham et al. (SODA 2010) through a network parameter they called highway dimension, which captures the size of a hitting set for a collection of shortest paths of length at least $r$ intersecting a given ball of radius $2r$. In this talk, we revisit this explanation, introducing a more tractable (and directly comparable) parameter based solely on the structure of shortest-path spanning trees, which we call skeleton dimension. We show that skeleton dimension admits an intuitive definition for both directed and undirected graphs, provides a way of computing labels more efficiently than by using highway dimension, and leads to comparable or stronger theoretical bounds on hub set size.

Distributed algorithms and graphs

Tuesday February 7, 2017, 2PM, Salle 1007

**Edouard Bonnet** (Middlesex University, London) *Fine-grained complexity of coloring geometric intersection graphs.*

The guideline and motivation of the talk is to go beyond the NP-hardness of coloring those geometric graphs, and precise what is the best (hopefully subexponential) running time that we can get.

This is based on a joint work with Csaba Biró, Dániel Marx, Tillmann Miltzow, and Paweł Rzążewski, and an ongoing project with Stéphan Thomassé and a subset of the aforementioned authors.

Distributed algorithms and graphs

Tuesday January 24, 2017, 2PM, Salle 1007

**Maximilien Danisch** (Telecom Paris Tech) *Towards real-world graph algorithmics*

Distributed algorithms and graphs

Tuesday January 10, 2017, 2PM, Salle 1007

**Carl Feghali** (IRIF) *Problems and Results in Kempe Equivalence of Colorings*

Distributed algorithms and graphs

Tuesday January 3, 2017, 2PM, Salle 1007

**Marthe Bonamy** (Labri - CNRS) *Reed's conjecture and strong edge coloring*

This is joint work with Thomas Perrett (Technical University of Denmark) and Luke Postle (University of Waterloo).

#### Year 2016

Distributed algorithms and graphs

Tuesday December 13, 2016, 2PM, Salle 1007

**Hang Zhou** (Max Planck Institute for Informatics) *Graph Reconstruction and Verification*

In this talk, I will introduce the problems of graph reconstruction and verification via oracles. I will investigate randomized algorithms based on a Voronoi cell decomposition. I will also analyze greedy algorithms, and prove that they are near-optimal.

The talk is based on joint work with Claire Mathieu and Sampath Kannan.

Distributed algorithms and graphs

Tuesday November 29, 2016, 2PM, Salle 1007

**Michel Habib** (IRIF) *Cocomparability graphs and greedy algorithms*

A cocomparability graph is a graph whose complement admits a transitive orientation. An interval graph is the intersection graph of a family of intervals on the real line. In this paper we investigate the relationships between interval and cocomparability graphs. I will first present some recent algorithms we obtained on cocomparability graphs. They show that for some problems, the algorithm used on interval graphs can also be used with small modifications on cocomparability graphs. Many of these algorithms are based on graph searches that preserve cocomparability orderings.

Then I will propose a characterization of cocomparability graphs via a lattice structure on the set of their maximal cliques. Using this characterization we can prove that every maximal interval subgraph of a cocomparability graph $G$ is also a maximal chordal subgraph of $G$.

This characterization also has interesting algorithmic consequences and we show that a new graph search, namely Local Maximal Neighborhood Search (LocalMNS) leads to an $O(n+mlogn)$ time algorithm to find a maximal interval subgraph of a cocomparability graph. Similarly I propose a linear time algorithm to compute all simplicial vertices in a cocomparability graph. In both cases we improve on the current state of knowledge.

Distributed algorithms and graphs

Tuesday October 25, 2016, 2PM, Salle 1007

**Jonas Lefevre** (IRIF) *Self-stabilizing Metric Graphs*

Distributed algorithms and graphs

Tuesday September 27, 2016, 2PM, Salle 1007

**Ha Duong Phan** (Institute of Mathematics, VAST, Vietnam.) *Algorithms for computing the rank of divisors on some classes of graphs.*

Distributed algorithms and graphs

Thursday July 7, 2016, 10AM, Salle 1016

**Eli Gafni** (UCLA) *The Role of Mantras in (Distributed-Computing) Research*

In this talk I'll present some Mantras I followed during the years starting with one that says that Distributed-Computing Theory (DCT) is the Mathematical Study of Interleaving. Consequently, DCT researchers should have Mathematical sensibilities rather than Engineering ones. Thus, DCT should poses the beauty of Mathematics, and should not be be “hacked” as an Engineering Domain. In particular any paper that points to “anomalies” or “paradoxes” does not point to faults in the domain but to faults in the thinking of the authors. I'll show some Mantras I use and where they led, and I'll end up with the ramification of recent Mantra that holds that deterministic state-machines capture interleaving as well as message-passing interleaving.

(Attention jour horaire et salle inhabituels)

Distributed algorithms and graphs

Tuesday June 28, 2016, 2PM, Salle 1007

**Janna Burman** (LRI - Université Paris Sud) *Space-Optimal Counting in Population Protocols*

Distributed algorithms and graphs

Tuesday June 21, 2016, 2PM, Salle 1007

**Qiang Sun** (LRI) *Locating any two vertices on Hamiltonian cycles*

The main tools of our proof are Regularity Lemma of Szemeredi and Blow-up Lemma of Koml os et al..

This is a joint work with Weihua He and Hao Li.

Distributed algorithms and graphs

Thursday June 9, 2016, 2PM, Salle 2015

**Feodor Dragan** (Kent State University) *Tree-Like Structures in Graphs: A Metric Point of View*

Distributed algorithms and graphs

Tuesday May 24, 2016, 2PM, Salle 1007

**Eujung Kim** *To be announced.*

Distributed algorithms and graphs

Tuesday May 17, 2016, 2PM, Salle 1007

**Edita Rollova** (University of West Bohemia, Pilsen, Czech republic) *New proof of Seymour's 6-flow theorem*

Distributed algorithms and graphs

Tuesday April 12, 2016, 2PM, Salle 1007

**Nicolas Schabanel** *Folding Turing is hard but feasible*

We introduce and study the computational power of Oritatami, a theoretical model to explore greedy molecular folding, by which the molecule begins to fold before waiting the end of its production. This model is inspired by our recent experimental work demonstrating the construction of shapes at the nanoscale by folding an RNA molecule during its transcription from an engineered sequence of synthetic DNA. While predicting the most likely conformation is known to be NP-complete in other models, Oritatami sequences fold optimally in linear time. Although our model uses only a small subset of the mechanisms known to be involved in molecular folding, we show that it is capable of efficient universal computation, implying that any extension of this model will have this property as well.

We introduce general design techniques for programming these molecules. Our main result in this direction is an algorithm in time linear in the sequence length, that finds a rule for folding the sequence deterministically into a prescribed set of shapes depending of its environment. This shows the corresponding problem is fixed-parameter tractable although we proved it is NP-complete in the number of possible environments. This algorithm was used effectively to design several key steps of our constructions.

Distributed algorithms and graphs

Tuesday April 5, 2016, 2PM, Salle 1007

**Matteo Seminaroti** *Similarity-First Search: a new algorithm with application to Robinsonian matrix recognition*

Distributed algorithms and graphs

Tuesday March 29, 2016, 2PM, Salle 1007

**Benjmain Momege** *Autour de la connexité dans les graphes avec conflits*

Distributed algorithms and graphs

Tuesday February 9, 2016, 2PM, Salle 1007

**Thomas Perrett** (Technical University of Denmark) *Roots of the chromatic polynomial, spanning trees and minors*

Distributed algorithms and graphs

Tuesday January 19, 2016, 2PM, Salle 1007

**Sang-il Oum** (KAIST) *Variants of Hadwiger's conjecture*

We also prove variants of the odd Hadwiger's conjecture as follows: Every graph with no odd K_t minor admits a partition of its vertex set into 7t-10 sets, each inducing a subgraph of bounded maximum degree. As a corollary, we prove that every graph with no odd K_t minor admits a partition of its vertex set into 16t-19 sets, each inducing a subgraph with no large components. The last result improves the result of Kawarabayashi, who showed it with 496t sets.

This talk is a combination of three works; first with K. Edwards, D. Kang, J. Kim, and P. Seymour, second with C. Liu, and third with D. Kang.