edit
Edit
Algo Events
calendar_today
iCalendar
Output Formats
calendar_today
iCalendar
Meetups
21ièmes Journées Graphes et Algorithmes (JGA 2019)
Browse all (1)
Seminars
Location Information
The Cache Oblivious Model of Computation
Browse all (2)
Lunches
Packing and covering balls in graphs excluding a minor
Around the Petersen Colouring Conjecture
Bipartite Diameter and Other Measures Under Translation
Browse all (69)
Tags
Graphs (21)
Computation Models (8)
Algorithms (7)
Coloring (4)
Geometry (4)
Art Gallery Problem (3)
Data Structures (3)
Excluded Minors (3)
Existential Theory of the Reals (3)
Graph Embedding (3)
Browse all (59)
Speakers
Till Miltzow (7)
Jean Cardinal (3)
Aurélien Ooms (2)
Bartosz Walczak (2)
Carole Muller (2)
John Iacono (2)
Krystal Guo (2)
Samuel Fiorini (2)
Tony Huynh (2)
Ahmad Abdi (1)
Browse all (55)
menu
Home
Lunches
Item 9aaaeb840bf272698bda5f3a0e56a293
search
close
search
Incidence bounds and kernelization
Wed, Oct 18, 2017 12:30 CEST
Speakers:
Jean Cardinal