Theoretical Computer Science

Article	Citations
An algorithm for the secure total domination problem in proper interval graphs	70
An algorithmic construction of union-intersection-bounded families	55
Oracle separations for non-adaptive collapse-free quantum computing	54
Maximal degenerate palindromes with gaps and mismatches	41
Sublinear P system solutions to NP-complete problems	40
A linkable ring signature scheme with unconditional anonymity in the standard model	39
On CNF formulas irredundant with respect to unit clause propagation	35
How real is incomputability in physics?	33
Editorial Board	31
Editorial Board	30
Preface	26
Editorial Board	25
The 1-good-neighbour diagnosability of modified bubblesort graphs under the PMC and	25
The parameterized complexity of welfare guarantees in Schelling segregation	23
On 1-planar graphs with bounded cop-number	22
Axiomatising weak bisimulation congruences over CCS with left merge and communication merge	21
On the power of threshold-based algorithms for detecting cycles in the CONGEST model	20
A generalization of a theorem of Rothschild and van Lint	19
Closed subsets in Bishop topological groups	19
A parametric worst-case approach to fairness in cooperative games with transferable utility	19
Editorial Board	18
Integer k-matching preclusion of some interconnection networks	18
A new dynamic programming algorithm for the simplified partial digest problem	18
Editorial Board	17
Editorial Board	17

Editorial Board	17
Distributed coloring and the local structure of unit-disk graphs	16
Editorial Board	16
Editorial Board	15
Towards a general methodology for formal verification on spiking neural P systems	15
Reliability evaluation of complete graph-based recursive networks	15
On the binary digits of n and n2	15
The g-good-neighbor diagnosability of lexicographic product networks under the PMC model	14
A 5k-vertex kernel for 3-path vertex cover	14
Three remarks on W2 graphs	14
Partial key exposure attacks on Prime Power RSA with non-consecutive blocks	14
Notes on Smyth-completes and local Yoneda-completes	14
Weakly leveled planarity with bounded span	14
An array P system based on a new variant of pure 2D context-free grammars	14
On the Weisfeiler algorithm of depth-1 stabilization	14
Decreasing verification radius in local certification	14
Matching cut and variants on bipartite graphs of bounded radius and diameter	13
When does FTP become FPT?	13
Finer-grained reductions in fine-grained hardness of approximation	13
Physical ZKP protocols for Nurimisaki and Kurodoko	13
Factorisation in the semiring of finite dynamical systems	13
The game value of sequential compounds of integers and stars	13
Parameterised approximation of the fixation probability of the dominant mutation in the multi-type Moran process	13
Dynamic debt swapping in financial networks	13
Deterministic rendezvous in infinite trees	13
Generating Java code pairing with ChatGPT	12
Editorial Board	12
Network control games played on graphs	12
On the existence of EFX (and Pareto-optimal) allocations for binary chores	12
Editorial Board	12
Hypergraph burning, matchings, and zero forcing	12
Approximation algorithms for maximum weighted throughput on unrelated machines	12
Linear Programming complementation	12
Dormancy-aware timed branching bisimilarity with an application to communication protocol analysis	11
On the complexity of winner determination and strategic control in conditional approval voting	11
Computational complexity of normalizing constants for the product of determinantal point processes	11
The computational complexity of forced capture Hnefatafl	11
On the complexity of nucleolus computation for bipartite b-matching games	11
On the detection of local and global amoebas: Theoretical insights and practical algorithms	11
Powers of low rank sparse matrices	11
A strongly polynomial time approximation algorithm for the min-max clustered cycle cover problem	11
On approximability of propositional model counting	11
New approximation algorithms for RNA secondary structures prediction problems by local search	10
Editorial Board	10
The existence and efficiency of PMMS allocations	10
Updatable searchable symmetric encryption: Definitions and constructions	10
The balanced connected subgraph problem for geometric intersection graphs	10
Gacs – Kucera theorem	10
Generative abstraction of Markov population processes	10
The impact of core constraints on truthful bidding in combinatorial auctions	10

NP-hardness of m-dimensional weighted matching problems	10
Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements	9
On computable numbers, with an application to the Druckproblem	9
Beyond pointwise submodularity: Non-monotone adaptive submodular maximization subject to knapsack and k-system constraints	9
Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints	9
Grouped domination parameterized by vertex cover, twin cover, and beyond	9
Robustly reusable fuzzy extractor from isogeny	9
Upper powerdomains of quasicontinuous dcpos	9
Turing video-based cognitive tests to handle entangled concepts	9
Editorial Board	9
Investigation of E-voting system using face recognition using convolutional neural network (CNN)	9
Analysis of key reuse security for Aigis.KEM	9
Subtyping context-free session types	9
On the order of lazy cellular automata	9
A weak inverse of language neighborhoods and its properties	9
A categorical approach to reversible Turing machines and Brin-Thompson groups	9
On properties of languages accepted by deterministic pushdown automata with translucent input letters	9
Fast and simple (1 + ε)Δ-edge-coloring of dense graphs	9
Editorial Board	8
Connectivity and diagnosability of the complete Josephus cube networks under h-extra fault-tolerant model	8
Mutual witness Gabriel drawings of complete bipartite graphs	8
Computational task offloading algorithm based on deep reinforcement learning and multi-task dependency	8
Capacity planning for dependable services	8
Greedy+Singleton: An efficient approximation algorithm for k-submodular knapsack maximization	8
Lower bounds for the sum of small-size algebraic branching programs	8
Relating randomized right-hand sides to communicating rewriting rules	8
Certification of an exact worst-case self-stabilization time	8
How bad is the merger paradox?	8
Protocols with constant local storage and unreliable communication	8
Diagonal of pseudoinverse of graph Laplacian: Fast estimation and exact results	8
Multi-stage Proof-of-Works: Properties and vulnerabilities	8
Language membership problems for subregular classes	8
Improved algorithms for bandit with graph feedback via regret decomposition	8
Extensional proofs in a propositional logic modulo isomorphisms	8
Threshold-based network structural dynamics	8
Dirac-type condition for rainbow chorded pancyclicity	8
Cascade products and Wheeler automata	8
Eliciting truthful reports with partial signals in repeated games	8
Identity-based matchmaking encryption with stronger security and instantiation on lattices	8
Editorial Board	8
Renaming in distributed certification	7
Verifiable Crowd Computing: Coping with bounded rationality	7
Online coloring of disk graphs	7
A categorical model for organic chemistry	7
Fixed points and attractors of reactantless and inhibitorless reaction systems	7
Boundary sketching with asymptotically optimal distance and rotation	7
Approximation algorithm for prize-collecting sweep cover with base stations	7
Modelling of DNA mismatch repair with a reversible process calculus	7
Improved unbounded inner-product functional encryption	7
Editorial Board	7
Asynchronous fully-decentralized SGD in the cluster-based model	7
Enhancing fault tolerance of balanced hypercube networks by the edge partition method	7
(Definitely not) Boring interaction abstract machines	7
Disjunctive sums of quasi-nimbers	7
Optimization on the smallest eigenvalue of grounded Laplacian matrix via edge addition	7
Order based algorithms for the core maintenance problem on edge-weighted graphs	7
A new fast root-finder for black box polynomials	7
An approximate cost recovery scheme for the k-product facility location game with penalties	7
Process-commutative distributed objects: From cryptocurrencies to Byzantine-Fault-Tolerant CRDTs	7
Decision algorithms for reversibility of 1D cellular automata under reflective boundary conditions	7
An accelerated deterministic algorithm for maximizing monotone submodular minus modular function with cardinality constraint	7
On algorithmic applications of sim-width and mim-width of (H1,H2)-free graphs	7
Quantum collision search for ternary LWE keys	7
From multivalued to Boolean functions: Preservation of soft nested canalization	6
Undecidability of the universal support problem for weighted automata over zero-sum-free commutative semirings	6
Editorial Board	6
Parallel Contextual Array Insertion Deletion Grammars, Pure 2D Context-Free Grammars and Associated P Systems	6
Algebraic properties and transformations of monographs	6
Editorial Board	6
Editorial Board	6
The complexity of bicriteria tree-depth	6
Languages generated by numerical P systems with thresholds	6
Space efficient algorithm for solving reachability using tree decomposition and separators	6
Using edge contractions to reduce the semitotal domination number	6
Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost	6
On the connectedness of arithmetic hyperplanes	6
#P-Hardness proofs of matrix immanants evaluated on restricted matrices	6
MODRED: A code-based non-interactive key exchange protocol	6
Nearly k-universal words – Investigating a part of Simon's congruence	6
Almost envy-freeness for groups: Improved bounds via discrepancy theory	6

Constrained Distributed Heterogeneous Two-Facility Location Problems with Max-Variant Cost	6
Partial and constrained level planarity	6
Preface for the special issue of Theoretical Computer Science in honor of the 60th birthday of Yuxi Fu	6
Do additional target points speed up evolutionary algorithms?	6
Editorial Board	6
Editorial Board	6
Location functions for self-stabilizing byzantine tolerant swarms	6
Sorting via shuffles with a cut after the longest increasing prefix	6
A fault diagnosis method to defend scapegoating attack in network tomography	6
Editorial Board	6
Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity	6
Securing data in the cloud using pairing-free inner product functional encryption with unbounded vector size	6
Kolmogorov-Loveland betting strategies lose the Betting game on open sets	6
Approximate distance oracles with improved stretch for sparse graphs	6
Support preorder on finitely supported Cb	6
Refined computational complexities of Hospitals/Residents problem with regional caps	6
Editorial Board	6
Remarks on hyperspaces for Priestley spaces	5
Stand up indulgent gathering	5
Repeatedly matching items to agents fairly and efficiently	5
LL(k) cooperating distributed grammar systems	5
Hamiltonicity parameterized by mim-width is (indeed) para-NP-hard	5
Integer-valued martingales and cl-Turing reductions	5
Mutual visibility of luminous robots despite angular inaccuracy	5
On the complexity of distance-d independent set reconfiguration	5
Algorithmic aspects of paired disjunctive domination in graphs	5
Elastic founder graphs improved and enhanced	5
Weighted forward looking adaptive coding	5
Subnetwork reliability analysis about complete-transposition graph networks	5
TCS special issue: Combinatorics on Words – WORDS 2021	5
Chess is hard even for a single player	5
Clustering under a knapsack constraint: Parameterized approximation for the knapsack median problem	5
The Voting algorithm is robust to various noise models	5
Linear-space S-table algorithms for the longest common subsequence problem	5
Fast computations on ordered nominal sets	5
Asynchronous dynamics of isomorphic Boolean networks	5
Computational power of autonomous robots: Transparency vs. opaqueness	5
Editorial Board	5
On the traceability of group signatures: Uncorrupted user must exist	5
Polynomial-time checking of generalized Sahlqvist syntactic shape	5
A logarithmic-sized accountable ring signature scheme in the standard model	5
Distributed transformations of Hamiltonian shapes based on line moves	5
Move-optimal arbitrary pattern formation by mobile robots on rectangular grid using near-optimal spatial area	5
Learning algebraic structures with the help of Borel equivalence relations	5
Constrained flows in networks	5
How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys	5
Visibility extension via reflection	5
Theoretical design of decentralized auction framework under mobile crowdsourcing environment	5
Centralised connectivity-preserving transformations for programmable matter: A minimal seed approach	5
Covering and partitioning of split, chain and cographs with isometric paths	5
The non-inclusive diagnosability of a kind of networks	5
Approximating power node-deletion problems	5
Searching in trees with monotonic query times	5
Editorial	5
Pebble guided rendezvous despite fault	5
Sign-then-encrypt with security enhancement and compressed ciphertext	5
An operational quantum information framework for experimental studies on color perception	5
On the power of local graph expansion grammars with and without additional restrictions	5
Query answering over inconsistent knowledge bases: A probabilistic approach	5
Optimal L-algorithms for rendezvous of asynchronous mobile robots with extern	5
A cornering strategy for synchronizing a DFA	5
Perfectly matched sets in graphs: Parameterized and exact computation	5
Less is more revisited: Association with global protocols and multiparty sessions	5
Efficient and reliable post-quantum authentication	5
The Convex Set Forming Game	5
Revisiting RSA-polynomial problem and semiprime factorization	5
Model checking differentially private properties	5
An efficient PMC model-based local diagnosis structure and algorithm	5
Corrigendum to “Complexity and approximability of the happy set problem” [Theor. Comput. Sci. 866 (2021) 123–144]	5
Self-similarity of communities of the ABCD model	5
Resource efficient stabilization for local tasks despite unknown capacity links	5
Time and energy driven online scheduling problem in EV charging	5
Editorial Board	5
An anomaly-based intrusion detection system using recursive feature elimination technique for improved attack detection	5
Space limited linear-time graph algorithms on big data	5
Secret handshakes: Full dynamicity, deniability and lattice-based design	5
Combinatorics of minimal absent words for a sliding window	5
Feasibility assessments of a dynamical approach to compartmental modelling on graphs: Scaling limits and performance analysis	5
EPTAS for the dual of splittable bin packing with cardinality constraint	4
A characterisation of P by DLOGTIME-uniform families of polarizationless P systems using only dissolution rules	4
On the power of pushing or stationary moves for input-driven pushdown automata	4
An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion	4
Improved algorithms for non-submodular function maximization problem	4
An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth	4
The t/k-diagnosability of m-ary n-cube networks	4
Domains, information frames, and their logic	4
A new study on clustering of adaptive asymmetric graph regularized semi-nonnegative matrix factorization under orthogonal subspace with auxiliary variable	4
Doubly adaptive zero-knowledge proofs	4
On the linearity of the periods of subtraction games	4
Solving dependency quantified Boolean formulas using quantifier localization	4
Parameterized algorithms for locating-dominating sets	4
Insertion and removal lists gaining clustered subtrees	4
Editorial Board	4
Eccentricity queries and beyond using hub labels	4
Finding geometric representations of apex graphs is NP-hard	4