Abstract is missing.
- Finding All Solutions of Equations in Free Groups and Monoids with InvolutionVolker Diekert, Artur Jez, Wojciech Plandowski. 1-15 [doi]
- Algorithmic Meta Theorems for Sparse Graph ClassesMartin Grohe. 16-22 [doi]
- The Lattice of Definability. Origins, Recent Developments, and Further DirectionsAlexei L. Semenov, Sergey Soprunov, Vladimir A. Uspensky. 23-38 [doi]
- Counting Popular Matchings in House Allocation ProblemsRupam Acharyya, Sourav Chakraborty, Nitesh Jha. 39-51 [doi]
- Vertex Disjoint Paths in Upward Planar GraphsSaeed Akhoondian Amiri, Ali Golshani, Stephan Kreutzer, Sebastian Siebertz. 52-64 [doi]
- On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative DomainsVikraman Arvind, S. Raja, A. V. Sreejith. 65-76 [doi]
- Testing Low Degree Trigonometric PolynomialsMartijn Baartse, Klaus Meer. 77-96 [doi]
- Property Testing Bounds for Linear and Quadratic Functions via Parity Decision TreesAbhishek Bhrushundi, Sourav Chakraborty, Raghav Kulkarni. 97-110 [doi]
- A Fast Branching Algorithm for Cluster Vertex DeletionAnudhyan Boral, Marek Cygan, Tomasz Kociumaka, Marcin Pilipczuk. 111-124 [doi]
- Separation Logic with One Quantified VariableStéphane Demri, Didier Galmiche, Dominique Larchey-Wendling, Daniel Méry. 125-138 [doi]
- QuickXsort: Efficient Sorting with n logn - 1.399n + o(n) Comparisons on AverageStefan Edelkamp, Armin Weiß. 139-152 [doi]
- Notions of Metric Dimension of Corona Products: Combinatorial and Computational ResultsHenning Fernau, Juan Alberto Rodríguez-Velazquez. 153-166 [doi]
- On the Complexity of Computing Two Nonlinearity MeasuresMagnus Gausdal Find. 167-175 [doi]
- Block Products and Nesting Negations in FO2Lukas Fleischer, Manfred Kufleitner, Alexander Lauser. 176-189 [doi]
- Model Checking for String ProblemsMilka Hutagalung, Martin Lange. 190-203 [doi]
- Semiautomatic StructuresSanjay Jain, Bakhadyr Khoussainov, Frank Stephan, Dan Teng, Siyuan Zou. 204-217 [doi]
- The Query Complexity of Witness FindingAkinori Kawachi, Benjamin Rossman, Osamu Watanabe. 218-231 [doi]
- Primal Implication as EncryptionVladimir N. Krupski. 232-244 [doi]
- Processing Succinct Matrices and VectorsMarkus Lohrey, Manfred Schmidt-Schauß. 245-258 [doi]
- Constraint Satisfaction with Counting Quantifiers 2Barnaby Martin, Juraj Stacho. 259-272 [doi]
- Dynamic Complexity of Planar 3-Connected Graph IsomorphismJenish C. Mehta. 273-286 [doi]
- Fast Approximate Computations with Cauchy Matrices, Polynomials and Rational FunctionsVictor Y. Pan. 287-299 [doi]
- First-Order Logic on CPDA GraphsPawel Parys. 300-313 [doi]
- Recognizing Two-Sided Contexts in Cubic TimeMax Rabkin. 314-324 [doi]
- A Parameterized Algorithm for Packing Overlapping SubgraphsJazmín Romero, Alejandro López-Ortiz. 325-336 [doi]
- Crossing-Free Spanning Trees in Visibility Graphs of Points between Monotone Polygonal ObstaclesJulia Schüler, Andreas Spillner. 337-350 [doi]
- The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and CircuitsKonrad W. Schwerdtfeger. 351-364 [doi]
- Randomized Communication Complexity of Approximating Kolmogorov ComplexityNikolay K. Vereshchagin. 365-374 [doi]
- Space Saving by Dynamic AlgebraizationMartin Fürer, Huiwen Yu. 375-388 [doi]