Wersja kontrastowa en English (United Kingdom)

Seminaria - Instytut Informatyki Analitycznej

Seminaria

Colorings of Plane Graphs: A Survey

23.04.2026

Maja Giglok

Linear neighborhood complexity and the dense analogue of bounded expansion

22.04.2026

Julien Duron, University of Warsaw

Hypergraph Extension of the Alon–Tarsi List Coloring Theorem

16.04.2026

Kernel Magic, Brooks’ Theorem and Painting Triangle-Free Graphs

16.04.2026

Artur Salawa

A small universal poset

15.04.2026

Paul Bastide, University of Oxford

Effective On-Line Coloring of P5-Free Graphs

09.04.2026

Mateusz Milewski

Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-Colorability

09.04.2026

Robust algorithms for path and cycle problems in geometric intersection graphs

08.04.2026

Malory Marin, ÉNS Lyon

Constraint Satisfaction Problems with an infinite number of values

01.04.2026

Michael Pinsker, TU Wien

A Note on the Sharp Concentration of the Chromatic Number of Random Graphs

26.03.2026

Jakub Binięda