External Links

    Journal: Theory Comput. Syst.

    Volume 67, Issue 6

    1133 -- 1155Andreas Darmann. Stability and Welfare in (Dichotomous) Hedonic Diversity Games
    1156 -- 1196Vladan Gloncak, Jarl Emil Erla Munkstrup, Jakob Grue Simonsen. Implicit Representation of Relations
    1197 -- 1208Vadim E. Levit, David Tankus. Well-Covered Graphs With Constraints On Δ And δ
    1209 -- 1240Léo Gayral, Mathieu Sablik. Arithmetical Hierarchy of the Besicovitch-Stability of Noisy Tilings
    1241 -- 1267Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh 0001. Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams
    1268 -- 1306Abdolhamid Ghodselahi, Fabian Kuhn. Toward Online Mobile Facility Location on General Metrics
    1307 -- 1332David E. Brown, David Skidmore. Representing the Integer Factorization Problem Using Ordered Binary Decision Diagrams

    Volume 67, Issue 5

    901 -- 955Rodolfo Conde, Sergio Rajsbaum. The Solvability of Consensus in Iterated Models Extended with Safe-Consensus
    956 -- 975Jozef Jirásek 0002, Ian McQuillan. Visit-Bounded Stack Automata
    976 -- 994Jarkko Kari. Expansivity and Periodicity in Algebraic Subshifts
    995 -- 1025Boaz Patt-Shamir, Evyatar Yadai. Non-Linear Ski Rental
    1026 -- 1049Henning Fernau, Kshitij Gajjar. The Space Complexity of Sum Labelling
    1050 -- 1081Jaroslav Garvardt, Christian Komusiewicz, Frank Sommer. The Parameterized Complexity of s-Club with Triangle and Seed Constraints
    1082 -- 1130David Furcy, Scott M. Summers, Logan Withers. Improved Lower and Upper Bounds on the Tile Complexity of Uniquely Self-Assembling a Thin Rectangle Non-Cooperatively in 3D
    1131 -- 0Dariusz R. Kowalski, Miguel A. Mosteiro, Kevin Zaki. Correction to: Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance Model

    Volume 67, Issue 4

    671 -- 693Christian Glazik, Jan Schiemann, Anand Srivastav. A One Pass Streaming Algorithm for Finding Euler Tours
    694 -- 713Philip Bille, Inge Li Gørtz. Random Access in Persistent Strings and Segment Selection
    714 -- 731Kaoru Fujioka. On the Hierarchy of Swarm-automaton for the Number of Agents
    732 -- 759Pyry Herva, Jarkko Kari. On Forced Periodicity of Perfect Colorings
    760 -- 784Rustem Takhanov. Computing a Partition Function of a Generalized Pattern-Based Energy over a Semiring
    785 -- 824Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov. Lossy Kernelization of Same-Size Clustering
    825 -- 854Dariusz R. Kowalski, Miguel A. Mosteiro, Kevin Zaki. Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance Model
    855 -- 876Yiannis Giannakopoulos, Diogo Poças. A Unifying Approximate Potential for Weighted Congestion Games
    877 -- 899K. Subramani, Piotr Wojciechowski 0002. Unit Read-once Refutations for Systems of Difference Constraints

    Volume 67, Issue 3

    415 -- 416Elvira Mayordomo, Mitsunori Ogihara, Atri Rudra. Foreword: a Commemorative Issue for Alan L. Selman
    417 -- 436Zhiguo Fu, Jin-yi Cai. Holographic Algorithms on Domains of General Size
    437 -- 472Siddharth Bhaskar, Cynthia Kop, Jakob Grue Simonsen. Subclasses of Ptime Interpreted by Programming Languages
    473 -- 490Jack H. Lutz, Neil Lutz, Elvira Mayordomo. Dimension and the Structure of Complexity Classes
    491 -- 520Satyadev Nandakumar, Subin Pulari. Ergodic Theorems and Converses for PSPACE Functions
    521 -- 547Daniel Apon, William Gasarch, Kevin Lawler. The Complexity of Grid Coloring
    548 -- 568András Z. Salamon, Michael Wehar. Effective Guessing Has Unlikely Consequences
    569 -- 591Mitsunori Ogiwara, Kei Uchizawa. Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions
    627 -- 669Joshua A. Grochow. Polynomial-Time Axioms of Choice and Polynomial-Time Cardinality

    Volume 67, Issue 2

    219 -- 220Henning Fernau, Mikhail V. Volkov. Preface of the Special Issue Dedicated to Selected Papers from CSR 2020
    221 -- 233Abhishek Sahu, Saket Saurabh 0001. Kernelization of Arc Disjoint Cycle Packing in α-Bounded Digraphs
    234 -- 262Ilya Olkhovsky, Alexander Okhotin. On the Transformation of LL(k)-linear to LL(1)-linear Grammars
    263 -- 0Ilya Olkhovsky, Alexander Okhotin. Correction to: On the Transformation of LL(k)-linear to LL(1)-linear Grammars
    264 -- 289Onur Çagirici. On Embeddability of Unit Disk Graphs Onto Straight Lines
    290 -- 0Yaokun Wu, Yinfeng Zhu. Correction to: Submodular Functions and Rooted Trees
    291 -- 309Peter Kostolányi. Polynomially Ambiguous Unary Weighted Automata over Fields
    310 -- 347Frank Gurski, Carolin Rehs, Jochen Rethmann. Characterizations and Directed Path-Width of Sequence Digraphs
    348 -- 382Yefim Dinitz, Shlomi Dolev, Manish Kumar 0011. Local Deal-Agreement Algorithms for Load Balancing in Dynamic General Graphs
    383 -- 412Soumik Ghosh, John Watrous. Complexity Limitations on One-turn Quantum Refereed Games

    Volume 67, Issue 1

    1 -- 3Christophe Paul, Markus Bläser. Preface of STACS 2020 Special Issue
    4 -- 27Dietmar Berwanger, Laurent Doyen 0001. Observation and Distinction: Representing Information in Infinite Games
    28 -- 51Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich 0001, Maximilian Katzmann. Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs
    52 -- 88Hans L. Bodlaender, Lars Jaffke, Jan Arne Telle. Typical Sequences Revisited - Computing Width Parameters of Graphs
    89 -- 124Andrés Cristi, Mathieu Mari, Andreas Wiese. Fixed-Parameter Algorithms for Unsplittable Flow Cover
    125 -- 148Jarkko Kari, Etienne Moutot. Decidability and Periodicity of Low Complexity Tilings
    149 -- 177Nikhil Vyas 0001, R. Ryan Williams. Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms
    178 -- 218Jan Philipp Wächter, Armin Weiß. An Automaton Group with PSPACE-Complete Word Problem
    runs on