Journal: Theory Comput. Syst.

Volume 68, Issue 6

1487 -- 1511Arseny M. Shur. Non-Constructive Upper Bounds for Repetition Thresholds
1512 -- 1536Valérie Berthé, Herman Goulet-Ouellet. Obstructions to Return Preservation for Episturmian Morphisms
1537 -- 1555L'ubomíra Dvoráková, Zuzana Masáková, Edita Pelantová. 2-Balanced Sequences Coding Rectangle Exchange Transformation
1556 -- 1571Aleksi Saarela. On the Solution Sets of Three-Variable Word Equations
1572 -- 1600Shaull Almagor, Omer Yizhaq. Jumping Automata over Infinite Words
1601 -- 1621France Gheeraert, Giuseppe Romana, Manon Stipulanti. String Attractors of Some Simple-Parry Automatic Sequences
1622 -- 1639Michel Rigo, Manon Stipulanti, Markus A. Whiteland. Automatic Abelian Complexities of Parikh-Collinear Fixed Points
1640 -- 1682Sam M. Thompson, Dominik D. Freydenberger. Languages Generated by Conjunctive Query Fragments of FC[REG]
1683 -- 1708Philip Janicki. Reordered Computable Numbers

Volume 68, Issue 5

1109 -- 1123Anna Gál, Ridwan Syed. Upper Bounds on Communication in Terms of Approximate Rank
1124 -- 1137Alexey Milovanov. Prediction and MDL for infinite sequences
1138 -- 1159Aris Filos-Ratsikas, Alexandros A. Voudouris. Revisiting the Distortion of Distributed Voting
1160 -- 1179Sabrina C. L. Ammann, Sebastian Stiller. Near-Optimal Auctions on Independence Systems
1180 -- 1206Ioannis Caragiannis, Nidhi Rathi. Optimizing Over Serial Dictatorships
1207 -- 1238Sándor P. Fekete, Dominik Krupke. What Goes Around Comes Around: Covering Tours and Cycle Covers with Turn Costs
1239 -- 1290Jiehua Chen 0001, Hendrik Molter, Manuel Sorge, Ondrej Suchý. Cluster Editing for Multi-Layer and Temporal Graphs
1291 -- 1311Gregory Emdin, Alexander S. Kulikov, Ivan Mihajlin, Nikita Slezkin. CNF Encodings of Symmetric Functions
1312 -- 1338Till Fluschnik, Leon Kellerhals. Placing Green Bridges Optimally, with a Multivariate Analysis
1339 -- 1352Jingnan Xie, Harry B. Hunt III, Richard Edwin Stearns. Pumping Lemmas Can be "Harmful"
1353 -- 1371Fei Gao, Cui Yu, Yawen Chen 0001, Boyong Gao. Routing and Wavelength Assignment Algorithm for Mesh-based Multiple Multicasts in Optical Network-on-chip
1372 -- 1426Hagit Attiya, Arie Fouren, Jeremy Ko. Lower Bounds on the Amortized Time Complexity of Shared Objects
1427 -- 1441Kensuke Kitai, Yuki Nishida 0001, Yoshihide Watanabe. Max-plus Algebraic Description of Evolutions of Weighted Timed Event Graphs
1442 -- 1467Giulia Bernardini 0001, Estéban Gabory, Solon P. Pissis, Leen Stougie, Michelle Sweering, Wiktor Zuba. Elastic-Degenerate String Matching with 1 Error or Mismatch
1468 -- 1485Zeev Nutov. Approximation algorithms for node and element connectivity augmentation problems

Volume 68, Issue 4

591 -- 592Anuj Dawar. International Colloquium on Automata, Languages and Programming (ICALP 2020)
593 -- 614Michaël Cadilhac, Filip Mazowiecki, Charles Paperman, Michal Pilipczuk, Géraud Sénizergues. On Polynomial Recursive Sequences
615 -- 661Erik Paul. Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata
662 -- 739Joel D. Day, Florin Manea. On the structure of solution-sets to regular word equations
740 -- 757Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski, Armin Weiß. Equation Satisfiability in Solvable Groups
758 -- 772Aaron Bernstein. Improved Bounds for Matching in Random-Order Streams
773 -- 813Uriel Feige, Vadim Grinberg. How to Hide a Clique?
814 -- 834Pawel Gawrychowski, Shay Mozes, Oren Weimann. 2 n) Time
835 -- 837Markus Bläser, Benjamin Monmege. Preface of STACS 2021 Special Issue
838 -- 867Silvia Butti, Víctor Dalmau. The Complexity of the Distributed Constraint Satisfaction Problem
868 -- 899Mahdi Cheraghchi, Shuichi Hirahara, Dimitrios Myrisiotis, Yuichi Yoshida. One-Tape Turing Machine and Branching Program Lower Bounds for MCSP
900 -- 985Stefan Göller, Mathieu Hilaire. Reachability in Two-Parametric Timed Automata with one Parameter is EXPSPACE-Complete
986 -- 1013Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos. Digraph Coloring and Distance to Acyclicity
1014 -- 1048Jacob Holm, Eva Rotenberg. Good r-divisions Imply Optimal Amortized Decremental Biconnectivity
1049 -- 1081Lars Jaffke, Paloma T. Lima, Daniel Lokshtanov. b-Coloring Parameterized by Clique-Width
1082 -- 1107Markus Lohrey. Subgroup Membership in GL(2,Z)

Volume 68, Issue 3

299 -- 300Volker Diekert, Mikhail Volkov 0001. Preface of the Special Issue Dedicated to Selected Papers from DLT 2022
301 -- 321Hyunjoon Cheon, Joonghyuk Hahn, Yo-Sub Han. On the Decidability of Infix Inclusion Problem
322 -- 379Joel D. Day, Vijay Ganesh 0001, Nathan Grewal, Matthew Konefal, Florin Manea. A Closer Look at the Expressive Power of Logics Based on Word Equations
380 -- 402Ondrej Klíma 0001, Jonatan Kolegar. Characterization of Ordered Semigroups Generating Well Quasi-Orders of Words
403 -- 464Markus Lohrey, Florian Stober, Armin Weiß. The Power Word Problem in Graph Products
465 -- 486Giovanni Pighizzini, Luca Prigioniero, Simon Sádovský. Performing Regular Operations with 1-Limited Automata
487 -- 511Ekaterina N. Shemetova, Alexander Okhotin, Semyon V. Grigorev. Rational Index of Languages Defined by Grammars with Bounded Dimension of Parse Trees
512 -- 528Pankaj Kumar Das, Subodh Kumar 0002. Linear Codes Correcting Repeated Bursts Equipped with Homogeneous Distance
529 -- 570Cornelis A. Middelburg. Imperative Process Algebra and Models of Parallel Computation
571 -- 590Lehilton L. C. Pedrosa, Mauro R. C. da Silva, Rafael C. S. Schouery. Approximation Algorithms for the MAXSPACE Advertisement Problem

Volume 68, Issue 2

195 -- 226Marcus Schaefer 0001, Daniel Stefankovic. Beyond the Existential Theory of the Reals
227 -- 249K. Subramani 0001, Piotr Wojciechowki, Alvaro Velasquez. Farkas Bounds on Horn Constraint Systems
250 -- 270Hoàng-Oanh Le, Van Bang Le. Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs
271 -- 282Marat Kh. Faizrahmanov. On Non-principal Arithmetical Numberings and Families
283 -- 298Yijie Chen, Kewei Lv. New Results on the Remote Set Problem and Its Applications in Complexity Study

Volume 68, Issue 1

1 -- 28Andreas Maletti, Andreea-Teodora Nász. Weighted Tree Automata with Constraints
29 -- 74Qisheng Wang, Mingsheng Ying. Quantum Algorithm for Lexicographically Minimal String Rotation
75 -- 102Frank Gurski, Jörg Rothe, Robin Weishaupt. Stability, Vertex Stability, and Unfrozenness for Special Graph Classes
103 -- 121Vincent Froese, Pascal Kunz, Philipp Zschoche. Disentangling the Computational Complexity of Network Untangling
122 -- 143Vahan Mkrtchyan, Garik Petrosyan, K. Subramani 0001, Piotr Wojciechowski 0002. On the Partial Vertex Cover Problem in Bipartite Graphs - a Parameterized Perspective
144 -- 193Pierre Bergé, Guillaume Ducoffe , Michel Habib. Subquadratic-time Algorithm for the Diameter and all Eccentricities on Median Graphs