Abstract is missing.
- Algebraic Theory of Promise Constraint Satisfaction Problems, First StepsLibor Barto. 3-17 [doi]
- Some Observations on Dynamic Random Walks and Network RenormalizationBernard Chazelle. 18-28 [doi]
- Highly Succinct Dynamic Data StructuresTorben Hagerup. 29-45 [doi]
- Winning Strategies for Streaming Rewriting GamesChristian Coester, Thomas Schwentick, Martin Schuster. 49-63 [doi]
- Nominal Syntax with Atom Substitutions: Matching, Unification, RewritingJesús Domínguez, Maribel Fernández. 64-79 [doi]
- Two Characterizations of Finite-State DimensionAlexander Kozachinskiy, Alexander Shen. 80-94 [doi]
- Largest Common Prefix of a Regular Tree LanguageMarkus Lohrey, Sebastian Maneth. 95-108 [doi]
- On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph PropertiesVikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky. 111-125 [doi]
- Deterministic Preparation of Dicke StatesAndreas Bärtschi, Stephan Eidenbenz. 126-139 [doi]
- Optimal Channel Utilization with Limited FeedbackGianluca De Marco, Tomasz Jurdzinski, Dariusz R. Kowalski. 140-152 [doi]
- Complete Disjoint CoNP-Pairs but No Complete Total Polynomial Search Problems Relative to an OracleTitus Dose. 153-167 [doi]
- An Efficient Algorithm for the Fast Delivery ProblemIago A. Carvalho, Thomas Erlebach, Kleitos Papadopoulos. 171-184 [doi]
- Extension of Some Edge Graph Problems: Standard and Parameterized ComplexityKatrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora. 185-200 [doi]
- Space Efficient Algorithms for Breadth-Depth SearchSankardeep Chakraborty, Anish Mukherjee 0001, Srinivasa Rao Satti. 201-212 [doi]
- Circular Pattern Matching with k MismatchesPanagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba. 213-228 [doi]
- Succinct Representations of Finite GroupsBireswar Das, Shivdutt Sharma, P. R. Vaidyanathan. 229-242 [doi]
- On the Tractability of Covering a Graph with 2-ClubsRiccardo Dondi, Manuel Lafond. 243-257 [doi]
- On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear ForestCarl Feghali, Matthew Johnson 0002, Giacomo Paesani, Daniël Paulusma. 258-273 [doi]
- Maximum Rectilinear Convex SubsetsHernán González-Aguilar, David Orden, Pablo Pérez-Lantero, David Rappaport, Carlos Seara, Javier Tejel, Jorge Urrutia. 274-291 [doi]
- Computing Digraph Width Measures on Directed Co-graphs - (Extended Abstract)Frank Gurski, Dominique Komander, Carolin Rehs. 292-305 [doi]
- Fault-Tolerant Parallel Scheduling of Arbitrary Length Jobs on a Shared ChannelMarek Klonowski, Dariusz R. Kowalski, Jaroslaw Mirek, Prudence W. H. Wong. 306-321 [doi]
- Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern GraphsMiroslaw Kowaluk, Andrzej Lingas. 322-334 [doi]
- Bivariate B-Splines from Convex Pseudo-circle ConfigurationsDominique Schmitt. 335-349 [doi]
- The Fault-Tolerant Metric Dimension of CographsDuygu Vietz, Egon Wanke. 350-364 [doi]