Abstract is missing.
- Approximability and Inapproximability for Maximum k-Edge-Colored Clustering ProblemYousef M. Alhamdan, Alexander Kononov. 1-12 [doi]
- The Non-hardness of Approximating Circuit SizeEric Allender, Rahul Ilango, Neekon Vafa. 13-24 [doi]
- Reconstructing a Convex Polygon from Its \omega ω -cloudElena Arseneva, Prosenjit Bose, Jean-Lou De Carufel, Sander Verdonschot. 25-37 [doi]
- A Space-Efficient Parameterized Algorithm for the Hamiltonian Cycle Problem by Dynamic AlgebraizationMahdi Belbasi, Martin Fürer. 38-49 [doi]
- Quantum Algorithm for Distribution-Free Junta TestingAleksandrs Belovs. 50-59 [doi]
- On Induced Online Ramsey Number of Paths, Cycles, and TreesVáclav Blazej, Pavel Dvorák, Tomás Valla. 60-69 [doi]
- Approximations of Schatten Norms via Taylor ExpansionsVladimir Braverman. 70-79 [doi]
- Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group ClassesBireswar Das, Shivdutt Sharma. 80-92 [doi]
- Belga B-TreesErik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman. 93-105 [doi]
- Eventually Dendric ShiftsFrancesco Dolce, Dominique Perrin. 106-118 [doi]
- On Decidability of Regular Languages TheoriesSergey Dudakov, Boris Karlov. 119-130 [doi]
- Minimizing Branching Vertices in Distance-Preserving SubgraphsKshitij Gajjar, Jaikumar Radhakrishnan. 131-142 [doi]
- On Tseitin Formulas, Read-Once Branching Programs and TreewidthLudmila Glinskih, Dmitry Itsykson. 143-155 [doi]
- Matched Instances of Quantum Satisfiability (QSat) - Product State Solutions of RestrictionsAndreas Goerdt. 156-167 [doi]
- Notes on Resolution over Linear EquationsSvyatoslav Gryaznov. 168-179 [doi]
- Undecidable Word Problem in Subshift Automorphism GroupsPierre Guillon 0001, Emmanuel Jeandel, Jarkko Kari, Pascal Vanier. 180-190 [doi]
- Parameterized Complexity of Conflict-Free Set CoverAshwin Jacob, Diptapriyo Majumdar, Venkatesh Raman 0001. 191-202 [doi]
- Forward Looking Huffman CodingShmuel Tomi Klein, Shoham Saadia, Dana Shapira. 203-214 [doi]
- Computational Complexity of Real Powering and Improved Solving Linear Differential EquationsIvan Koswara, Svetlana Selivanova, Martin Ziegler 0001. 215-227 [doi]
- On the Quantum and Classical Complexity of Solving Subtraction GamesDmitry Kravchenko, Kamil Khadiev, Danil Serov. 228-236 [doi]
- Derandomization for Sliding Window Algorithms with Strict CorrectnessMoses Ganardi, Danny Hucke, Markus Lohrey. 237-249 [doi]
- On the Complexity of RestartingJan-Hendrik Lorenz. 250-261 [doi]
- On the Complexity of Mixed Dominating SetJayakrishnan Madathil, Fahad Panolan, Abhishek Sahu, Saket Saurabh 0001. 262-274 [doi]
- Uniform CSP Parameterized by Solution Size is in W[1]Ruhollah Majdoddin. 275-285 [doi]
- On the Parameterized Complexity of Edge-Linked PathsNeeldhara Misra, Fahad Panolan, Saket Saurabh 0001. 286-298 [doi]
- The Parameterized Complexity of Dominating Set and Friends Revisited for Structured GraphsNeeldhara Misra, Piyush Rathi. 299-310 [doi]
- Transition Property for Cube-Free WordsElena A. Petrova, Arseny M. Shur. 311-324 [doi]
- A Polynomial Time Delta-Decomposition Algorithm for Positive DNFsDenis K. Ponomaryov. 325-336 [doi]
- Unpopularity Factor in the Marriage and Roommates ProblemsSuthee Ruangwises, Toshiya Itoh. 337-348 [doi]
- AND Protocols Using only Uniform ShufflesSuthee Ruangwises, Toshiya Itoh. 349-358 [doi]
- Sybil-Resilient Conductance-Based Community GrowthOuri Poupko, Gal Shahaf, Ehud Shapiro, Nimrod Talmon. 359-371 [doi]