Abstract is missing.
- Quantum Hashing and Fingerprinting for Quantum Cryptography and ComputationsFarid M. Ablayev, Marat Ablayev, Alexander Vasiliev. 1-15 [doi]
- Parameterized Analysis of Art Gallery and Terrain GuardingAkanksha Agrawal, Meirav Zehavi. 16-29 [doi]
- Central Positions in Social NetworksUlrik Brandes. 30-45 [doi]
- Second-Order Finite AutomataAlexsander Andrade de Melo, Mateus de Oliveira Oliveira. 46-63 [doi]
- Isomorphic Distances Among ElectionsPiotr Faliszewski, Piotr Skowron, Arkadii Slinko, Stanislaw Szufa, Nimrod Talmon. 64-78 [doi]
- Tandem Duplications, Segmental Duplications and Deletions, and Their ApplicationsBinhai Zhu. 79-102 [doi]
- Faster 2-Disjoint-Shortest-Paths AlgorithmMaxim Akhmedov. 103-116 [doi]
- An Improvement to Chvátal and Thomassen's Upper Bound for Oriented DiameterJasine Babu, Deepu Benson, Deepak Rajendraprasad, Sai Nishant Vaka. 117-129 [doi]
- The Normalized Algorithmic Information Distance Can Not Be ApproximatedBruno Bauwens, Ilya Blinnikov. 130-141 [doi]
- Definable Subsets of Polynomial-Time Algebraic StructuresNikolay Bazhenov. 142-154 [doi]
- Families of Monotonic Trees: Combinatorial Enumeration and AsymptoticsOlivier Bodini, Antoine Genitrini, Mehdi Naima, Alexandros Singh. 155-168 [doi]
- Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word AutomataIovka Boneva, Joachim Niehren, Momar Sakho. 169-183 [doi]
- On Embeddability of Unit Disk Graphs onto Straight LinesOnur Çagirici. 184-197 [doi]
- On the Decision Tree Complexity of Threshold FunctionsAnastasiya Chistopolskaya, Vladimir V. Podolskii. 198-210 [doi]
- Randomized and Symmetric Catalytic ComputationSamir Datta, Chetan Gupta 0002, Rahul Jain 0015, Vimal Raj Sharma, Raghunath Tewari. 211-223 [doi]
- On the Parameterized Complexity of the Expected Coverage ProblemFedor V. Fomin, Vijayaragunathan Ramamoorthi. 224-236 [doi]
- Computational Hardness of Multidimensional Subtraction GamesVladimir Gurvich, Mikhail N. Vyalyi. 237-249 [doi]
- Parameterized Complexity of Fair Feedback Vertex Set ProblemLawqueen Kanesh, Soumen Maity, Komal Muluk, Saket Saurabh 0001. 250-262 [doi]
- The Power of Leibniz-Like Functions as OraclesJaeyoon Kim, Ilya Volkovich, Nelson Xuzhi Zhang. 263-275 [doi]
- Optimal Skeleton Huffman Trees RevisitedDmitry Kosolobov, Oleg Merkurev. 276-288 [doi]
- The Subtrace Order and Counting First-Order LogicDietrich Kuske. 289-302 [doi]
- Speedable Left-c.e. NumbersWolfgang Merkle, Ivan Titov. 303-313 [doi]
- The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or VotersMarc Neveling, Jörg Rothe, Roman Zorn. 314-327 [doi]
- On the Transformation of LL(k)-linear Grammars to LL(1)-linearAlexander Okhotin, Ilya Olkhovsky. 328-340 [doi]
- On Computing the Hamiltonian Index of GraphsGeevarghese Philip, M. R. Rani, R. Subashini. 341-353 [doi]
- A Lower Bound for the Query Phase of Contraction Hierarchies and Hub LabelsTobias Rupp, Stefan Funke. 354-366 [doi]
- Kernelization of Arc Disjoint Cycle Packing in α-Bounded DigraphsAbhishek Sahu, Saket Saurabh 0001. 367-378 [doi]
- On Subquadratic Derivational Complexity of Semi-Thue SystemsAlexey Talambutsa. 379-392 [doi]
- The Untold Story of SBPIlya Volkovich. 393-405 [doi]
- Weighted Rooted Trees: Fat or Tall?Yaokun Wu, Yinfeng Zhu. 406-418 [doi]
- Groupoid Action and Rearrangement Problem of Bicolor Arrays by Prefix ReversalsAkihiro Yamamura, Riki Kase, Tatiana Baginová Jajcayová. 419-431 [doi]