Monday (May 27) |
Tuesday (May 28) |
Wednesday (May 29) |
Thursday (May 30) |
Friday (May 30) |
9:05 Opening remarks 9:15 Amir Abboud Some Connections Between the Conjectures in Fine-Grained Complexity Vincent Cohen-Addad New Hardness Results for Planar Graph Problems in P and an Algorithm for Sparsest Cut 10:30 Coffee break 11:00 Elazar Goldenberg Hardness Amplification of Optimization Problems 11:35 Open problems collaboration |
9:15 Debarati Das Truly Sub-quadratic Time Constant Factor Approximation of Edit Distance Michal Kouckı Constant factor approximations to edit distance on far input pairs in nearly linear time 10:30 Coffee Break 11:00 Elazar Goldenberg Sublinear Algorithms for Gap Edit Distance 11:35 Open problems collaboration |
9:15 Aviad Rubinstein Karthik C.S. Inapproximability of Clustering: Inspired from Fine-Grained Complexity 10:30 Coffee break 11:00 Ohad Trabelsi New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs 11:35 Open problems collaboration |
9:15 Richard Peng Batch-Dynamic Graph Algorithms Euiwoong Lee An FPT-approximation Algorithm for k-cut 10:30 Coffee break 11:00 Nicole Wein Time/accuracy trade-off lower bounds from k-OV 11:35 Open problems collaboration |
9:15 Rasmus Kyng As hard as linear equations or two-commodity flow Arturs Backurs Efficient Density Evaluation for Smooth Kernels 10:30 Coffee break 11:00 Open problems collaboration |
13:00 Lunch |
13:00 Lunch |
13:00 Lunch |
13:00 Lunch |
13:00 Lunch |
15:00 Liam Roditty Approximating the Diameter 15:35 Open problems collaboration 16:00 Coffee break 16:30 Open problems collaboration |
15:00 Marvin Künnemann Approximating APSP without Scaling 15:35 Open problems collaboration 16:00 Coffee break 16:30 Open problems collaboration |
15:00 Excursion to Ravenna |
15:00 Divesh Aggarwal (Gap/S)-ETH Hardness of SVP 15:35 Open problems collaboration 16:00 Coffee break 16:30 Open problems collaboration |
Workshop adjourns |
19:30 Dinner |
19:30 Dinner |
19:30 Dinner |
19:30 Dinner |