Schedule
CSR proceedings are available at link.springer.com/book/10.1007/978-3-031-09574-0 (LNCS 13296) in free access till July 25th.
| Time (UTC/GMT) | Talk |
|---|---|
| 1:55–2:00PMsee in other timezones | Opening remarks and announcement of the Best Paper Award |
| June 29 (Wed) | Opening lecture (chaired by Adam Smith) |
| 2:00–3:00PMsee in other timezones | Umesh Vazirani. Testing quantum computers and quantum mechanics (video) |
| Algorithms and Complexity, Distributed Algorithms (chaired by Alexander Shen) | |
| 3:30–3:40PMsee in other timezones | Lorenzo Balzotti and Paolo G. Franciosa. Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time* (video) |
| 3:40–3:50PMsee in other timezones | Kamil Khadiev and Maxim Yagafarov. The Fast Algorithm for Online k-server Problem on Trees (video) |
| 3:50–4:00PMsee in other timezones | Yifen Li, Xiaohui Bei, Youming Qiao, Dacheng Tao and Zhiya Chen. Heterogeneous Multi-Commodity Network Flows Over Time* (video) |
| 4:00–4:10PMsee in other timezones | Alexander Kozachinskiy. New Bounds for the Flock-of-Birds Problem (video) |
| Automata (chaired by Ramyaa) | |
| 4:40–4:50PMsee in other timezones | Peter Kostolányi. Finite Ambiguity and Finite Sequentiality in Weighted Automata over Fields (video) |
| 4:50–5:00PMsee in other timezones | Elena Petrova and Arseny Shur. Abelian Repetition Threshold Revisited (video) |
| Invited lecture (chaired by Sofya Raskhodnikova) | |
| 5:30–6:30PMsee in other timezones | Jelani Nelson. Private Frequency Estimation via Projective Geometry (video) |
| June 30 (Thu) | Invited lecture (chaired by Prahladh Harsha) |
| 2:00–3:00PMsee in other timezones | Irit Dinur. Expanders in Higher Dimensions (video) | Fixed-parameter Algorithms (chaired by Daniel Lokshtanov) |
| 3:30–3:40PMsee in other timezones | Niranka Banerjee, Manoj Gupta, Venkatesh Raman and Saket Saurabh. Output Sensitive Fault Tolerant Maximum Matching (video) |
| 3:40–3:50PMsee in other timezones | Fahad Panolan and Hannane Yaghoubizade. Partial Vertex Cover on Graphs of Bounded Degeneracy* (video) |
| 3:50–4:00PMsee in other timezones | V P Abidha, Pradeesha Ashok, Avi Tomar and Dolly Yadav. Coloring a Dominating Set without Conflicts: q-Subset Square Coloring* (video) — Winner of the Best Student Presentation Award |
| 4:00–4:10PMsee in other timezones | Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik and Saket Saurabh. Parameterized Algorithms for Finding Highly Connected Solution* (video) |
| Complexity (chaired by Vladimir Podolskii) | |
| 4:30–4:40PMsee in other timezones | Nikolay Vereshchagin. How much randomness is needed to convert MA protocols to AM protocols? (video) |
| 4:40–4:50PMsee in other timezones | Pavel Alaev. Quotient structures and groups computable in polynomial time (video) |
| 4:50–5:00PMsee in other timezones | Alexander Grishutin and Daniil Musatov. Discrete versions of KKM lemma and their PPAD-completeness (video) |
| Invited lecture (chaired by Sofya Raskhodnikova) | |
| 5:30–6:30PMsee in other timezones | Mary Wootters. Low-bandwidth Computation on Reed-Solomon-Encoded Data (video) |
| July 1 (Fri) | Parameterized Complexity (chaired by Pierre Ohlmann) |
| 3:30–3:40PMsee in other timezones | Petr Golovach, Fahad Panolan, Ashutosh Rai and Saket Saurabh. Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs (video) |
| 3:40–3:50PMsee in other timezones | Bardiya Aryanfard and Fahad Panolan. Parameterized Complexity of List Coloring and Max Coloring* (video) |
| 3:50–4:00PMsee in other timezones | Jasine Babu, Neeldhara Misra and Saraswati Nanoti. Eternal Vertex Cover on Bipartite and Co-Bipartite Graphs* (video) |
| 4:00–4:10PMsee in other timezones | Sayan Bandyapadhyay, Fedor Fomin, Petr Golovach, Nidhi Purohit and Kirill Simonov. Lossy Kernelization of Same-Size Clustering* (video) |
| Logic and Automata (chaired by Nathanaël Fijalkow) | |
| 4:20–4:30PMsee in other timezones | Mizuhito Ogawa and Alexander Okhotin. On the determinization of event-clock input-driven pushdown automata |
| 4:30–4:40PMsee in other timezones | Laurent Doyen and Marie Van Den Bogaard. Bounds for Synchronizing Markov Decision Processes (video) |
| 4:40–4:50PMsee in other timezones | Thomas Place and Marc Zeitoun. Characterizing level one in group-based concatenation hierarchies |
| 4:50–5:00PMsee in other timezones | Pierre Ohlmann. The GKK Algorithm is the Fastest over Simple Mean-Payoff Games (video) — Winner of the Best Paper Award |
| Closing lecture (chaired by Edith Elkind) | |
| 5:30–6:30PMsee in other timezones | Mark Braverman. Optimization-friendly generic mechanisms without money (video) |
* Talks eligible for the Best Student Presentation Award.