search

Lunches

Almost all string graphs are intersection graphs of plane convex sets Wed, Oct 10, 2018 12:30 CEST

Speakers: Yelena Yuditsky

Designing efficient algorithms for modern GPU architectures Wed, Oct 3, 2018 12:30 CEST

Speakers: Ben Karsin

Sparse Kneser graphs are hamiltonian Wed, Aug 29, 2018 12:30 CEST

Speakers: Bartosz Walczak

Data Structures Lower Bounds Tue, Jul 24, 2018 12:30 CEST

Speakers: Aurélien Ooms

Dynamic Trees with Almost-Optimal Access Cost Wed, Jul 11, 2018 12:30 CEST

Speakers: John Iacono

Orthogonal Point Location and Rectangle Stabbing Queries in 3-d Wed, Jul 4, 2018 12:30 CEST

Speakers: Konstantinos A Tsakalidis

Sorting in the Asymmetric External Memory Model Wed, Jun 27, 2018 12:30 CEST

Speakers: Nodari Sitchinava

Dimension of posets whose cover graphs exclude some minor Wed, May 30, 2018 12:30 CEST

Speakers: Michal Seweryn

Homomorphism bounds for K4-minor-free graphs Tue, May 8, 2018 12:30 CEST

Speakers: Laurent Beaudou

Crossing Numbers Wed, Apr 25, 2018 12:30 CEST

Speakers: Torsten Ueckerdt