PROGRAM
| Time | Talk | Speaker |
|---|---|---|
| SUNDAY, JUNE 30 | ||
| 18:00-20:00 | Welcome Reception, Registration. See the university map for location | |
| MONDAY, JULY 1 | ||
| 08:30-09:30 | Registration. See the university map | |
| 09:30-10:30 | Invited talk: Two Heresies | Michael Fellows |
| 10:30-11:00 | Coffee break | |
| 11:00-11:30 | On the Parameterized Complexity of Edge-Linked Paths | Neeldhara Misra, Fahad Panolan, and Saket Saurabh |
| 11:30-12:00 | Parameterized Complexity of Conflict-Free Set Cover | Ashwin Jacob, Diptapriyo Majumdar, and Venkatesh Raman |
| 12:00-12:30 | Uniform CSP Parameterized by Solution Size is in W[1] | Ruhollah Majdoddin |
| 12:30-13:00 | The Parameterized Complexity of Dominating Set and Friends Revisited | Neeldhara Misra and Piyush Rathi |
| 13:00-14:30 | Lunch | |
| 14:30-15:00 | On the Complexity of Mixed Dominating Set | Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu, and Saket Saurabh |
| 15:00-15:30 | A Space-efficient Parametrized Algorithm for the Hamiltonian Cycle Problem by Dynamic Algebraziation | Mahdi Belbasi and Martin Fürer |
| 15:30-16:00 | Coffee break | |
| 16:00-16:30 | Minimizing Branching Vertices in Distance-preserving Subgraphs | Kshitij Gajjar and Jaikumar Radhakrishnan |
| 16:30-17:00 | Sybil-Resilient Conductance-Based Community Expansion | Nimrod Talmon, Ehud Shapiro, Gal Shahaf, and Ouri Poupko |
| 17:00-17:30 | On Induced Online Ramsey Number of Paths, Cycles, and Trees | Václav Blažej, Tomáš Valla, and Pavel Dvořák |
| TUESDAY, JULY 2 | ||
| 09:00-9:30 | Joint PSI + CSR session. Welcome speech. | |
| 09:30-10:30 | Joint PSI + CSR session. Invited talk. Automated-Reasoning Revolution: From Theory to Practice and Back | Moshe Vardi |
| 10:30-11:00 | Coffee break | |
| 11:00-12:00 | Joint PSI + CSR session. Invited talk. Fintech and Its Scientific Drivers | Andrew Yao |
| 12:00-13:30 | Lunch | |
| 13:30-14:30 | Invited talk: QBF Proof Complexity: an Overview | Meena Mahajan |
| 14:30-15:00 | Coffee break | |
| 15:00-15:30 | On Tseitin formulas, read-once branching programs and treewidth | Ludmila Glinskih and Dmitry Itsykson |
| 15:30-16:00 | Notes on resolution over linear equations | Svyatoslav Gryaznov |
| 16:00-16:30 | On Decidability of Regular Languages Theories | Sergey Dudakov and Boris Karlov |
| 16:30-17:00 | A Polynomial Time Delta-Decomposition Algorithm for Positive DNFs | Denis Ponomaryov |
| WEDNESDAY, JULY 3 | ||
| 09:30-10:30 | Invited Talk: Schnyder woods and the combinatorics of triangulations in genus 0 and 1 | Eric Fusy |
| 10:30-11:00 | Coffee break | |
| 11:00-11:30 | Transition property for cube-free words | Elena Petrova and Arseny Shur |
| 11:30-12:00 | Forward Looking Huffman Coding | Shmuel Tomi Klein, Shoham Saadia and Dana Shapira |
| 12:00-12:30 | Eventually dendric shifts | Francesco Dolce and Dominique Perrin |
| 12:30-13:00 | AND Protocols Using Only Uniform Shuffles | Suthee Ruangwises and Toshiya Itoh |
| 13:00-14:30 | Lunch | |
| 14:30-16:00 | Business meeting | |
| 16:00-18:30 | Excursion | |
| 18:30-21:00 | Conference Dinner | |
| THURSDAY, JULY 4 | ||
| 09:30-10:30 | Invited Talk: 2-Connectivity in Directed Graphs | Giuseppe Italiano |
| 10:30-11:00 | Coffee break | |
| 11:00-11:30 | Unpopularity Factor in the Marriage and Roommates Problems | Suthee Ruangwises and Toshiya Itoh |
| 11:30-12:00 | Belga B-trees | Erik D. Demaine, John Iacono, Grigorios Koumoutsos, and Stefan Langerman |
| 12:00-12:30 | Reconstructing a convex polygon from its omega-cloud | Elena Arseneva, Prosenjit Bose, Jean-Lou De Carufel, and Sander Verdonschot |
| 12:30-14:00 | Lunch | |
| 14:00-15:00 | Invited Talk: Sketching as a Tool for Numerical Linear Algebra | David Woodruff |
| 15:00-15:30 | Coffee break | |
| 15:30-16:00 | Derandomization for sliding window algorithms with strict correctness | Markus Lohrey, Moses Ganardi and Danny Hucke |
| 16:00-16:30 | Approximations of Schatten Norms via Taylor Expansions | Vladimir Braverman |
| 16:30-17:00 | Quantum Algorithm for Distribution-Free Junta Testing | Aleksandrs Belovs |
| 17:00-17:30 | Matched instances of Quantum Sat (QSat) -- Product state solutions of restrictions | Andreas Goerdt |
| 17:30-18:00 | On the Quantum and Classical Complexity of Solving Subtraction Games | Dmitry Kravchenko, Kamil Khadiev, and Danil Serov |
| FRIDAY, JULY 5 | ||
| 09:30-10:30 | Invited Talk: Interval Edge-Colorings of Graphs: Variations and Generalizations | Petros Petrosyan |
| 10:30-11:00 | Coffee break | |
| 11:00-11:30 | On the Complexity of Restarting | Jan-Hendrik Lorenz |
| 11:30-12:00 | Approximability and Inapproximability for Maximum k-Edge-Colored Clustering Problem | Yousef Alhamdan and Alexander Kononov |
| 12:00-12:30 | The Non-Hardness of Approximating Circuit Size | Eric Allender, Rahul Ilango and Neekon Vafa |
| 12:30-14:00 | Lunch | |
| 14:00-15:00 | Invited Talk: A proof of CSP Dichotomy Conjecture | Dmitriy Zhuk |
| 15:00-15:30 | Coffee break | |
| 15:30-16:00 | Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes | Bireswar Das and Shivdutt Sharma |
| 16:00-16:30 | Undecidable word problem in subshift automorphism groups | Pierre Guillon, Emmanuel Jeandel, Jarkko Kari, and Pascal Vanier |
| 16:30-17:00 | Computational Complexity of Real Powering and Solving Linear Differential Equations | Ivan Adrian Koswara, Svetlana Selivanova, and Martin Ziegler |
