Accepted Papers
Markus Lohrey, Moses Ganardi and Danny Hucke
Derandomization for sliding window algorithms with strict correctness
Jan-Hendrik Lorenz
On the Complexity of Restarting
Vladimir Braverman
Approximations of Schatten Norms via Taylor Expansions
Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu, and Saket Saurabh
On the Complexity of Mixed Dominating Set
Aleksandrs Belovs
Quantum Algorithm for Distribution-Free Junta Testing
Neeldhara Misra, Fahad Panolan, and Saket Saurabh
On the Parameterized Complexity of Edge-Linked Paths
Suthee Ruangwises and Toshiya Itoh
Unpopularity Factor in the Marriage and Roommates Problems
Sergey Dudakov and Boris Karlov
On Decidability of Regular Languages Theories
Eric Allender, Rahul Ilango and Neekon Vafa
The Non-Hardness of Approximating Circuit Size
Elena Petrova and Arseny Shur
Transition property for cube-free words
Nimrod Talmon, Ehud Shapiro, Gal Shahaf, and Ouri Poupko
Sybil-Resilient Conductance-Based Community Expansion
Francesco Dolce and Dominique Perrin
Eventually dendric shifts
Ludmila Glinskih and Dmitry Itsykson
On Tseitin formulas, read-once branching programs and treewidth
Ivan Adrian Koswara, Svetlana Selivanova, and Martin Ziegler
Improved Bit-Cost Solutions to Systems of Linear ODEs and PDEs
Elena Arseneva, Prosenjit Bose, Jean-Lou De Carufel, and Sander Verdonschot
Reconstructing a convex polygon from its omega-cloud
Erik D. Demaine, John Iacono, Grigorios Koumoutsos, and Stefan Langerman
Belga B-trees
Neeldhara Misra and Piyush Rathi
The Parameterized Complexity of Dominating Set and Friends Revisited
Denis Ponomaryov
A Polynomial Time Delta-Decomposition Algorithm for Positive DNFs
Ruhollah Majdoddin
Uniform CSP Parameterized by Solution Size is in W[1]
Svyatoslav Gryaznov
Notes on resolution over linear equations
Andreas Goerdt
Matched instances of Quantum Sat (QSat) -- Product state solutions of restrictions
Bireswar Das and Shivdutt Sharma
Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes
Shmuel Tomi Klein, Shoham Saadia and Dana Shapira
Forward Looking Huffman Coding
Václav Blažej, Tomáš Valla, and Pavel Dvořák
On Induced Online Ramsey Number of Paths, Cycles, and Trees
Pierre Guillon, Emmanuel Jeandel, Jarkko Kari, and Pascal Vanier
Undecidable word problem in subshift automorphism groups
Yousef Alhamdan and Alexander Kononov
Approximability and Inapproximability for Maximum k-Edge-Colored Clustering Problem
Kshitij Gajjar and Jaikumar Radhakrishnan
Minimizing Branching Vertices in Distance-preserving Subgraphs
Dmitry Kravchenko, Kamil Khadiev, and Danil Serov
On the Quantum and Classical Complexity of Solving Subtraction Games
Ashwin Jacob, Diptapriyo Majumdar, and Venkatesh Raman
Parameterized Complexity of Conflict-Free Set Cover
Suthee Ruangwises and Toshiya Itoh
AND Protocols Using Only Uniform Shuffles
Mahdi Belbasi and Martin Fürer
A Space-efficient Parametrized Algorithm for the Hamiltonian Cycle Problem by Dynamic Algebraziation