Abstract is missing.
- Convergence of Distributions on PathsSamy Abbes. 1-15 [doi]
- Subhedge Projection for Stepwise Hedge AutomataAntonio Al Serhali, Joachim Niehren. 16-31 [doi]
- The Rectilinear Convex Hull of Line SegmentsCarlos Alegría, Justin Dallant, Pablo Pérez-Lantero, Carlos Seara. 32-45 [doi]
- Domino Snake Problems on GroupsNathalie Aubrun, Nicolas Bitar. 46-59 [doi]
- Parsing Unranked Tree Languages, Folded OnceMartin Berglund, Henrik Björklund, Johanna Björklund. 60-73 [doi]
- The Impact of State Merging on Predictive Accuracy in Probabilistic Tree Automata: Dietze's Conjecture RevisitedJohanna Björklund. 74-87 [doi]
- Computing Subset Vertex Covers in H-Free GraphsNick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen. 88-102 [doi]
- On Computing Optimal Temporal BranchingsDaniela Bubboloni, Costanza Catalano, Andrea Marino 0001, Ana Silva. 103-117 [doi]
- Contracting Edges to Destroy a Pattern: A Complexity StudyDipayan Chakraborty, R. B. Sandeep. 118-131 [doi]
- Distance-Based Covering Problems for Graphs of Given Cyclomatic NumberDibyayan Chakraborty, Florent Foucaud, Anni Hakanen. 132-146 [doi]
- An Efficient Computation of the Rank Function of a PositroidLamar Chidiac, Santiago Guzmán-Pro, Winfried Hochstättler, Anthony Youssef. 147-161 [doi]
- Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target TimeWilliam S. Evans, David G. Kirkpatrick. 162-175 [doi]
- Complexity of Conformant Election ManipulationZack Fitzsimmons, Edith Hemaspaandra. 176-189 [doi]
- α-β-Factorization and the Binary Case of Simon's CongruencePamela Fleischmann, Jonas Höfer, Annika Huch, Dirk Nowotka. 190-204 [doi]
- Bounds for c-Ideal HashingFabian Frei, David Wehner. 205-220 [doi]
- h+1-Free Edge Deletion ProblemAjinkya Gaikwad, Soumen Maity. 221-233 [doi]
- On the Parallel Complexity of Group Isomorphism via Weisfeiler-LemanJoshua A. Grochow, Michael Levet. 234-247 [doi]
- ℓ )-ArrowingZohair Raza Hassan, Edith Hemaspaandra, Stanislaw P. Radziszowski. 248-261 [doi]
- On Computing a Center Persistence DiagramYuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu. 262-275 [doi]
- Robust Identification in the Limit from Incomplete Positive DataPhilip Kaelbling, Dakotah Lambert, Jeffrey Heinz. 276-290 [doi]
- Cordial ForestsFeston Kastrati, Wendy J. Myrvold, Lucas D. Panjer, Aaron Williams. 291-303 [doi]
- Vertex Ordering with Precedence ConstraintsJeff Kinne, Akbar Rafiey, Arash Rafiey, Mohammad Sorkhpar. 304-317 [doi]
- Forwards- and Backwards-Reachability for Cooperating Multi-pushdown SystemsChris Köcher, Dietrich Kuske. 318-332 [doi]
- Shortest Dominating Set Reconfiguration Under Token SlidingJan Matyás Kristan, Jakub Svoboda. 333-347 [doi]
- Computing Optimal Leaf Roots of Chordal Cographs in Linear TimeVan Bang Le, Christian Rosenke. 348-362 [doi]
- Verified Exact Real Computation with Nondeterministic Functions and LimitsSewon Park 0001. 363-377 [doi]
- Exact and Parameterized Algorithms for the Independent Cutset ProblemJohannes Rauch, Dieter Rautenbach, Uéverton S. Souza. 378-391 [doi]
- Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few LeavesEmmanuel Sam, Benjamin Bergougnoux, Petr A. Golovach, Nello Blaser. 392-405 [doi]
- Two UNO Decks Efficiently Perform Zero-Knowledge Proof for SudokuKodai Tanaka, Takaaki Mizuki. 406-420 [doi]
- Power of Counting by Nonuniform Families of Polynomial-Size Finite AutomataTomoyuki Yamakami. 421-435 [doi]