Log In
Online scheduling on uniform machines (part II). Recording 50 min, password 5.82-Competitive
Improved Upper Bounds for the Oriented Diameter of Graphs
The hat guessing number of a graph. Recording 33 min, password K3-can-do-3-colors
Routing in trees. Recording 34 min, password log^2n-BY-loglogn
On decentralizd (Delta+1)-Colorings (Part 2). Recording 41 min, Password n*log2Delta
Feedback vertex set in tournaments. Recording 36 min, password 2-Approximation
Complexity analysis for a labeled routing scheme
On two sibling problems of linear and bilinear maps. Recording 41 min, password BilinearMap2
A hypergraph model for the hat-guessing number of a graph. Transcript, recording 32 min, password 12512-Strategies
Dynamic Connectivity: Connecting to Networks and Geometry. Recording 39 min, password degrees5Delta
Three-coloring of triangle-free planar graphs
The neighborhood polynomial of chordal graphs. Recording 31 min, password Leafage2
Ausflug ins Grüne mit Bier und Schnaps
Intersecting families of triangles (offline, prerecorded presentation 28 min)
Testing graph planarity with a SAT solver, Recording 38 min, password 9-Circles
Long plane trees. Recording 39 min, password 0.6...-Approximation
Saturation for permutation matrices. Recording 41 min, password indecomposable-O(1)
The most-likely skyline problem for stochastic points, Part 2. Recording 39 min, password 2^n-Approximation
Improved approximation algorithms for Tverberg partitions. Recording 31 min, password 3-Approximation
Online story scheduling in web advertising. Recording 42 min, password 3-Competitive
Proof of existence of a solution in a P-LCP. Recording 30 min, password Linear-ComplementarITY-Problem-1
Fine-grained lower bounds for point pattern matching. Recording 36 min, password 9Nqw966P
Fine-grained complexity, part 2. Recording 34 min, password 3Sum--OV
Online routing in convex subdivisions. Recording 37 min, password Random-compass-probability1
Almost optimal deterministic treasure hunt. Recording 41 min, password O(2*e(d*)log(e(d*)))
Analysis of smooth heaps and slim heaps.
Geographic prominence - or: persistent homology for dummies. Transcript, recording 35 minutes, password Kleinglockner3770m
Liar's Domination in Unit Disk Graphs
Minimum Ply Covering of Points with Disks and Squares
Recognition of Unit Disk Graphs for Caterpillars, Embedded Trees, and Outerplanar Graphs
Approximating Rips with cubes
Flag Algebras
Triangles in Signotopes
Pizza Sharing is PPA-hard
Online story scheduling in web advertising II
Grid-USO as search problem with violations
Packing squares into a disk with optimal worst-case density
Edge Partitions of Complete Geometric Graphs
Dot Product Dimension
Slope statistics
A polynomial bound for the growth of bilinear maps, Video recording, 32 minutes
Multiplying pairs (complex numbers), triplets, and quadruples (quaternions)
APSP in unweighted graphs in o(mn) time
Shooting Stars in Simple Drawings of Km,n Part 2
quantitative steinitz theorem
Caterpillar associahedra
Topic: Synchronizing words in automata
Higher Dimensional Signotopes