Abstract is missing.
- Computational Complexity of Multi-player Evolutionarily Stable StrategiesManon Blanc, Kristoffer Arnsfelt Hansen. 1-17 [doi]
- Injective Colouring for H-Free GraphsJan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, Siani Smith. 18-30 [doi]
- Variants of the Determinant Polynomial and the sf VP-CompletenessPrasad Chaugule, Nutan Limaye, Shourya Pandey. 31-55 [doi]
- Dynamic Complexity of ExpansionSamir Datta, Anuj Tawari, Yadu Vasudev. 56-77 [doi]
- Real τ-Conjecture for Sum-of-Squares: A Unified Approach to Lower Bound and DerandomizationPranjal Dutta. 78-101 [doi]
- Dichotomy Result on 3-Regular Bipartite Non-negative FunctionsAusten Z. Fan, Jin-yi Cai. 102-115 [doi]
- Upper Bounds on Communication in Terms of Approximate RankAnna Gál, Ridwan Syed. 116-130 [doi]
- Approximation Schemes for Multiperiod Binary Knapsack ProblemsZuguang Gao, John R. Birge, Varun Gupta. 131-146 [doi]
- Limitations of Sums of Bounded Read Formulas and ABPsPurnata Ghosal, B. V. Raghavendra Rao. 147-169 [doi]
- On the Computational Complexity of Reaction Systems, RevisitedMarkus Holzer 0001, Christian Rauch. 170-185 [doi]
- Average-Case Rigidity Lower BoundsXuangui Huang, Emanuele Viola. 186-205 [doi]
- Analysis of an Efficient Reduction Algorithm for Random Regular Expressions Based on Universality DetectionFlorent Koechlin, Pablo Rotondo. 206-222 [doi]
- Bit-Complexity of Solving Systems of Linear Evolutionary Partial Differential EquationsIvan Koswara, Gleb Pogudin, Svetlana Selivanova, Martin Ziegler 0001. 223-241 [doi]
- A Secure Three-Input AND Protocol with a Standard Deck of Minimal CardsHiroto Koyama, Daiki Miyahara, Takaaki Mizuki, Hideaki Sone. 242-256 [doi]
- Upper Bound for Torus PolynomialsVaibhav Krishan. 257-263 [doi]
- A PCP of Proximity for Real Algebraic PolynomialsKlaus Meer. 264-282 [doi]
- Predictions and Algorithmic Statistics for Infinite SequencesAlexey Milovanov. 283-295 [doi]
- Lower Bounds and Hardness Magnification for Sublinear-Time Shrinking Cellular AutomataAugusto Modanese. 296-320 [doi]
- Approximation Algorithms for Connectivity Augmentation ProblemsZeev Nutov. 321-338 [doi]
- On Rooted k-Connectivity Problems in Quasi-bipartite DigraphsZeev Nutov. 339-348 [doi]
- Input-Driven Pushdown Automata on Well-Nested Infinite StringsAlexander Okhotin, Victor L. Selivanov. 349-360 [doi]
- Large Clique is Hard on Average for ResolutionShuo Pang. 361-380 [doi]
- On Closed-Rich WordsOlga Parshina, Svetlana Puzynina. 381-394 [doi]
- Shelah-Stupp's and Muchnik's Iterations RevisitedPawel Parys. 395-405 [doi]
- On Separation Between the Degree of a Boolean Function and the Block SensitivityNikolay V. Proskurin. 406-421 [doi]
- Approximation and Complexity of the Capacitated Geometric Median ProblemVladimir Shenmaier. 422-434 [doi]
- A Generic Convolution Algorithm for Join Operations on Tree DecompositionsJohan M. M. van Rooij. 435-459 [doi]
- A Generalization of a Theorem of Rothschild and van LintNing Xie, Shuai Xu, Yekun Xu. 460-483 [doi]