Media Summary: We consider the fine-grained complexity of counting the number of list q-colourings modulo a prime p. We show that there is an ... C&O Tutte Colloquium Series on Friday, July 26, 2024 Speaker: Round the World Relay in Combinatorics, Tuesday June 8, 2021 12pm (UTC) Bordeaux Seminar, France (organized by Jonathan ...

Carla Groenland Graph Reconstruction From Small Cards Mocca 20 - Detailed Analysis & Overview

We consider the fine-grained complexity of counting the number of list q-colourings modulo a prime p. We show that there is an ... C&O Tutte Colloquium Series on Friday, July 26, 2024 Speaker: Round the World Relay in Combinatorics, Tuesday June 8, 2021 12pm (UTC) Bordeaux Seminar, France (organized by Jonathan ... A subspace of $F_2^n$ is called cyclically covering if every vector in $F_2^n$ has a cyclic shift which is inside the subspace. Carla Groenland—Asymptotic dimension of graph classes so if i look at g sub i the vertex deleted sub

SiGMa is a workshop bringing together researchers from Abstract: Clustering algorithms are at the core of unsupervised machine learning and data analysis techniques. Given a set of ... Plenary talk given by Doug West during MIGHTY LVIII at Grand Valley State University on Oct. 7, 2017. RECORDED 05/23/26 Watch how easy it is to create a pop up easel! You will be making them for all kinds of occasions.

Photo Gallery

Carla Groenland - "Graph reconstruction from small cards" | MoCCA'20
Carla Groenland: Tight bounds for counting colourings parameterised by cutwidth via matrixranks
Tutte Colloquium - Carla Groenland - 07/26/2024
Carla Groenland (Utrecht University), Universal graphs and labelling schemes
Graphs and Matroids Seminar - Carla Groenland
Carla Groenland (Oxford): Cyclically covering subspaces
Carla Groenland—Asymptotic dimension of graph classes
Basic Recognition and Reconstruction
SiGMa 2017 Joshua Erde, A counterexample to the reconstruction conjecture for locally finite trees
Algorithmic advances on metric and graph clustering (Part 1) Vincent Cohen-Addad  (Google, Zurich)
MIGHTY LVIII Doug West - Reconstruction from the deck of k-vertex induced subgraphs
Scallop Circle Easel Card
Sponsored
View Detailed Profile
Carla Groenland - "Graph reconstruction from small cards" | MoCCA'20

Carla Groenland - "Graph reconstruction from small cards" | MoCCA'20

The talk "

Carla Groenland: Tight bounds for counting colourings parameterised by cutwidth via matrixranks

Carla Groenland: Tight bounds for counting colourings parameterised by cutwidth via matrixranks

We consider the fine-grained complexity of counting the number of list q-colourings modulo a prime p. We show that there is an ...

Tutte Colloquium - Carla Groenland - 07/26/2024

Tutte Colloquium - Carla Groenland - 07/26/2024

C&O Tutte Colloquium Series on Friday, July 26, 2024 Speaker:

Carla Groenland (Utrecht University), Universal graphs and labelling schemes

Carla Groenland (Utrecht University), Universal graphs and labelling schemes

Round the World Relay in Combinatorics, Tuesday June 8, 2021 12pm (UTC) Bordeaux Seminar, France (organized by Jonathan ...

Graphs and Matroids Seminar - Carla Groenland

Graphs and Matroids Seminar - Carla Groenland

Universal

Sponsored
Carla Groenland (Oxford): Cyclically covering subspaces

Carla Groenland (Oxford): Cyclically covering subspaces

A subspace of $F_2^n$ is called cyclically covering if every vector in $F_2^n$ has a cyclic shift which is inside the subspace.

Carla Groenland—Asymptotic dimension of graph classes

Carla Groenland—Asymptotic dimension of graph classes

Carla Groenland—Asymptotic dimension of graph classes

Basic Recognition and Reconstruction

Basic Recognition and Reconstruction

so if i look at g sub i the vertex deleted sub

SiGMa 2017 Joshua Erde, A counterexample to the reconstruction conjecture for locally finite trees

SiGMa 2017 Joshua Erde, A counterexample to the reconstruction conjecture for locally finite trees

SiGMa is a workshop bringing together researchers from

Algorithmic advances on metric and graph clustering (Part 1) Vincent Cohen-Addad  (Google, Zurich)

Algorithmic advances on metric and graph clustering (Part 1) Vincent Cohen-Addad (Google, Zurich)

Abstract: Clustering algorithms are at the core of unsupervised machine learning and data analysis techniques. Given a set of ...

MIGHTY LVIII Doug West - Reconstruction from the deck of k-vertex induced subgraphs

MIGHTY LVIII Doug West - Reconstruction from the deck of k-vertex induced subgraphs

Plenary talk given by Doug West during MIGHTY LVIII at Grand Valley State University on Oct. 7, 2017.

Scallop Circle Easel Card

Scallop Circle Easel Card

RECORDED 05/23/26 Watch how easy it is to create a pop up easel! You will be making them for all kinds of occasions.

The Reconstruction Problem on the Tree

The Reconstruction Problem on the Tree

The