Abstract is missing.
- Complexity of GenerationVladimir Gurvich. 1-14 [doi]
- Lower Bounds for Unrestricted Boolean Circuits: Open ProblemsAlexander S. Kulikov. 15-22 [doi]
- Online Labeling: Algorithms, Lower Bounds and Open QuestionsMichael Saks. 23-28 [doi]
- Maintaining Chordal Graphs Dynamically: Improved Upper and Lower BoundsNiranka Banerjee, Venkatesh Raman 0001, Srinivasa Rao Satti. 29-40 [doi]
- Distributed Symmetry-Breaking Algorithms for Congested CliquesLeonid Barenboim, Victor Khazanov. 41-52 [doi]
- The Clever Shopper ProblemLaurent Bulteau, Danny Hermelin, Anthony Labarre, Stéphane Vialette. 53-64 [doi]
- A Tight Lower Bound for Steiner OrientationRajesh Chitnis, Andreas Emil Feldmann. 65-77 [doi]
- Can We Create Large k-Cores by Adding Few Edges?Rajesh Chitnis, Nimrod Talmon. 78-89 [doi]
- Periodicity in Data Streams with WildcardsFunda Ergün, Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou. 90-105 [doi]
- Maximum Colorful Cycles in Vertex-Colored GraphsGiuseppe F. Italiano, Yannis Manoussakis, Nguyen Kim Thang, Hong Phong Pham. 106-117 [doi]
- Grammar-Based Compression of Unranked TreesAdrià Gascón, Markus Lohrey, Sebastian Maneth, Carl Philipp Reh, Kurt Sieber. 118-131 [doi]
- Complement for Two-Way Alternating AutomataViliam Geffert. 132-144 [doi]
- Closure Under Reversal of Languages over Infinite AlphabetsDaniel Genkin, Michael Kaminski, Liat Peterfreund. 145-156 [doi]
- Structural Parameterizations of Dominating Set VariantsDishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman 0001. 157-168 [doi]
- Complexity and Inapproximability Results for Parallel Task Scheduling and Strip PackingSören Henning, Klaus Jansen, Malin Rau, Lars Schmarje. 169-180 [doi]
- Operations on Boolean and Alternating Finite AutomataMichal Hospodár, Galina Jirásková, Ivana Krajnáková. 181-193 [doi]
- Conflict Free Version of Covering Problems on Graphs: Classical and ParameterizedPallavi Jain, Lawqueen Kanesh, Pranabendu Misra. 194-206 [doi]
- Quadratically Tight Relations for Randomized Query ComplexityRahul Jain 0001, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs. 207-219 [doi]
- On Vertex Coloring Without Monochromatic TrianglesMichal Karpinski, Krzysztof Piecuch. 220-231 [doi]
- Recognizing Read-Once Functions from Depth-Three FormulasAlexander Kozachinskiy. 232-243 [doi]
- Max-Cut Above Spanning Tree is Fixed-Parameter TractableJayakrishnan Madathil, Saket Saurabh 0001, Meirav Zehavi. 244-256 [doi]
- Slopes of 3-Dimensional Subshifts of Finite TypeEtienne Moutot, Pascal Vanier. 257-268 [doi]
- Facility Location on Planar Graphs with Unreliable LinksN. S. Narayanaswamy, Meghana Nasre, R. Vijayaragunathan. 269-281 [doi]
- On the Decision Trees with SymmetriesArtur Riazanov. 282-294 [doi]
- On Emptiness and Membership Problems for Set AutomataAlexander A. Rubtsov, Mikhail N. Vyalyi. 295-307 [doi]
- On Strong NP-Completeness of Rational ProblemsDominik Wojtczak. 308-320 [doi]
- A New Algorithm for Finding Closest Pair of Vectors (Extended Abstract)Ning Xie, Shuai Xu, Yekun Xu. 321-333 [doi]