Theoretical Computer Science

Article	Citations
Deterministic rendezvous in infinite trees	47
An optimal algorithm for 2-bounded delay buffer management with lookahead	42
Algorithms for energy conservation in heterogeneous data centers	37
The parameterized complexity of welfare guarantees in Schelling segregation	33
A 5k-vertex kernel for 3-path vertex cover	33
Closed subsets in Bishop topological groups	31
On the power of threshold-based algorithms for detecting cycles in the CONGEST model	29
A new dynamic programming algorithm for the simplified partial digest problem	27
Parameterised approximation of the fixation probability of the dominant mutation in the multi-type Moran process	25
On the solution bound of two-sided scaffold filling	21
An algorithm for the secure total domination problem in proper interval graphs	19
CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN	18
New (k,l,m)-verifiable multi-secret sharing schemes based on XTR public key system	18
Partial key exposure attacks on Prime Power RSA with non-consecutive blocks	18
Finer-grained reductions in fine-grained hardness of approximation	16
Editorial Board	16
A generalization of a theorem of Rothschild and van Lint	16
Editorial Board	16
A data structure for substring-substring LCS length queries	15
Editorial Board	15
Editorial Board	15
Editorial Board	14
An array P system based on a new variant of pure 2D context-free grammars	14
A parametric worst-case approach to fairness in cooperative games with transferable utility	14
Editorial	14

Improved upper bound for sorting permutations by prefix transpositions	14
Complexity issues for timeline-based planning over dense time under future and minimal semantics	14
Editorial Board	14
Preface	13
An algorithmic construction of union-intersection-bounded families	13
Towards a general methodology for formal verification on spiking neural P systems	13
Editorial Board	13
Oracle separations for non-adaptive collapse-free quantum computing	13
Editorial Board	13
Network control games played on graphs	13
Complexity and algorithms for neighbor-sum-2-distinguishing {1,3}-edge-weighting of graphs	12
On 1-planar graphs with bounded cop-number	12
Reliability evaluation of complete graph-based recursive networks	12
Physical ZKP protocols for Nurimisaki and Kurodoko	12
Integer k-matching preclusion of some interconnection networks	12
Notes on Smyth-completes and local Yoneda-completes	12
On the binary digits of n and n2	12
Factorisation in the semiring of finite dynamical systems	11
Sublinear P system solutions to NP-complete problems	11
A linear time algorithm for connected p-centdian problem on block graphs	11
Distributed coloring and the local structure of unit-disk graphs	11
How real is incomputability in physics?	11
Cellular automata and bootstrap percolation	11
A linkable ring signature scheme with unconditional anonymity in the standard model	11
Maximal degenerate palindromes with gaps and mismatches	11
A tighter proof for CCA secure inner product functional encryption: Genericity meets efficiency	11
Improvements in the computing efficiency of the probabilities of the LIL test for the PRNG evaluation	11
Call admission problems on grids with advice	11
Wildcarded identity-based encryption from lattices	11
Updatable searchable symmetric encryption: Definitions and constructions	10
Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints	10
Powers of low rank sparse matrices	10
Three remarks on W graphs	10
Beyond pointwise submodularity: Non-monotone adaptive submodular maximization subject to knapsack and k-system constraints	10
Linear Programming complementation	10
Identity-based matchmaking encryption with stronger security and instantiation on lattices	10
Reliability measure of the n-th cartesian product of complete graph K4 on h-extra edge-connectivity	10
On some FPT problems without polynomial Turing compressions	10
A strongly polynomial time approximation algorithm for the min-max clustered cycle cover problem	10
Fast and simple (1 + ε)Δ-edge-coloring of dense graphs	9
NP-hardness of m-dimensional weighted matching problems	9
Editorial Board	9
Editorial Board	9
Dormancy-aware timed branching bisimilarity with an application to communication protocol analysis	9
Gacs – Kucera theorem	9
Editorial Board	9
Editorial Board	9
The computational complexity of forced capture Hnefatafl	9
Editorial Board	9
Complexity of Scorpion Solitaire and applications to Klondike	9

Polynomial kernels for paw-free edge modification problems	9
On additive approximate submodularity	8
Robustly reusable fuzzy extractor from isogeny	8
Generative abstraction of Markov population processes	8
Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements	8
On computable numbers, with an application to the Druckproblem	8
Enumeration of subtrees and BC-subtrees with maximum degree no more than k in trees	8
Upper powerdomains of quasicontinuous dcpos	8
New approximation algorithms for RNA secondary structures prediction problems by local search	8
Embedding algorithm of spined cube into grid structure and its wirelength computation	8
On the complexity of nucleolus computation for bipartite b-matching games	8
The balanced connected subgraph problem for geometric intersection graphs	8
Near-optimal clustering in the k-machine model	8
A Myhill-Nerode theorem for register automata and symbolic trace languages	8
Local fairness in hedonic games via individual threshold coalitions	8
Computational complexity of normalizing constants for the product of determinantal point processes	8
Disjoint paths and connected subgraphs for H-free graphs	8
A substructure based lower bound for eternal vertex cover number	8
Generating Java code pairing with ChatGPT	8
Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints	8
Algorithmic results in secure total dominating sets on graphs	8
The impact of core constraints on truthful bidding in combinatorial auctions	8
Connectivity and diagnosability of the complete Josephus cube networks under h-extra fault-tolerant model	8
Grouped domination parameterized by vertex cover, twin cover, and beyond	8
Investigation of E-voting system using face recognition using convolutional neural network (CNN)	7
Encoding Boolean networks into reaction systems for investigating causal dependencies in gene regulation	7
On minimal critical exponent of balanced sequences	7
Editorial Board	7
Differential logical relations, part II increments and derivatives	7
Boundary sketching with asymptotically optimal distance and rotation	7
Cascade products and Wheeler automata	7
(k,p)-planarity: A relaxation of hybrid planarity	7
Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity	7
Bisimilarity on Basic Parallel Processes	7
Algebraic properties and transformations of monographs	7
The classes PPA-k: Existence from arguments modulo k	7
Relating randomized right-hand sides to communicating rewriting rules	7
The g-component connectivity of graphs	7
Computational task offloading algorithm based on deep reinforcement learning and multi-task dependency	7
An accelerated deterministic algorithm for maximizing monotone submodular minus modular function with cardinality constraint	7
Verifiable Crowd Computing: Coping with bounded rationality	7
Editorial Board	7
Modelling of DNA mismatch repair with a reversible process calculus	7
Parallel Contextual Array Insertion Deletion Grammars, Pure 2D Context-Free Grammars and Associated P Systems	7
The existence and efficiency of PMMS allocations	7
Building bridges – Honoring Nataša Jonoska on the occasion of her 60th birthday	7
Exhaustive generation of some lattice paths and their prefixes	7
Editorial Board	7
An approximate cost recovery scheme for the k-product facility location game with penalties	7
Online coloring of disk graphs	7
A categorial approach to reaction systems: First steps	7
Eliciting truthful reports with partial signals in repeated games	7
Nearly k-universal words – Investigating a part of Simon's congruence	7
Role colouring graphs in hereditary classes	7
On the complexity of local-equitable coloring of graphs	6
Self-stabilizing spanner topology control solutions in wireless ad hoc networks	6
A new fast root-finder for black box polynomials	6
Component conditional fault tolerance of hierarchical folded cubic networks	6
Optimization on the smallest eigenvalue of grounded Laplacian matrix via edge addition	6
Greedy+Singleton: An efficient approximation algorithm for k-submodular knapsack maximization	6
Order based algorithms for the core maintenance problem on edge-weighted graphs	6
Extensional proofs in a propositional logic modulo isomorphisms	6
Diagonal of pseudoinverse of graph Laplacian: Fast estimation and exact results	6
Certification of an exact worst-case self-stabilization time	6
On a vertex-capturing game	6
Approximation algorithm for prize-collecting sweep cover with base stations	6
Asynchronous fully-decentralized SGD in the cluster-based model	6
Taming the knight's tour: Minimizing turns and crossings	6
Complexity results on register context-free grammars and related formalisms	6
Almost envy-freeness for groups: Improved bounds via discrepancy theory	6
Editorial Board	6
Fixed points and attractors of reactantless and inhibitorless reaction systems	6
Exploring the gap between treedepth and vertex cover through vertex integrity	6
Process-commutative distributed objects: From cryptocurrencies to Byzantine-Fault-Tolerant CRDTs	6
Capacity planning for dependable services	6
Threshold-based network structural dynamics	6
Enhancing fault tolerance of balanced hypercube networks by the edge partition method	6
How bad is the merger paradox?	6
A categorical model for organic chemistry	6
Disjunctive sums of quasi-nimbers	6

A simple rounding scheme for multistage optimization	6
Securing data in the cloud using pairing-free inner product functional encryption with unbounded vector size	6
Multi-stage Proof-of-Works: Properties and vulnerabilities	6
Unified graphical co-modeling, analysis and verification of cyber-physical systems by combining AADL and Simulink/Stateflow	6
Cutting bamboo down to size	6
On algorithmic applications of sim-width and mim-width of (H1,H2)-free graphs	6
Improved unbounded inner-product functional encryption	6
Decision algorithms for reversibility of 1D cellular automata under reflective boundary conditions	6
Mutual witness Gabriel drawings of complete bipartite graphs	6
Improved algorithms for bandit with graph feedback via regret decomposition	6
Protocols with constant local storage and unreliable communication	6
Range minimum queries in minimal space	6
Editorial Board	5
TCS special issue: Combinatorics on Words – WORDS 2021	5
Preface for the special issue of Theoretical Computer Science in honor of the 60th birthday of Yuxi Fu	5
Editorial Board	5
Computational power of autonomous robots: Transparency vs. opaqueness	5
Refined computational complexities of Hospitals/Residents problem with regional caps	5
Approximate ridesharing of personal vehicles problem	5
On the power of local graph expansion grammars with and without additional restrictions	5
Editorial Board	5
Corrigendum to “Complexity and approximability of the happy set problem” [Theor. Comput. Sci. 866 (2021) 123–144]	5
Theoretical design of decentralized auction framework under mobile crowdsourcing environment	5
MODRED: A code-based non-interactive key exchange protocol	5
How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys	5
Linear-space S-table algorithms for the longest common subsequence problem	5
Space efficient algorithm for solving reachability using tree decomposition and separators	5
Combinatorics of minimal absent words for a sliding window	5
A fault diagnosis method to defend scapegoating attack in network tomography	5
A certifying and dynamic algorithm for the recognition of proper circular-arc graphs	5
PSPACE-hardness of variants of the graph coloring game	5
Approximation of the Double Traveling Salesman Problem with Multiple Stacks	5
Editorial Board	5
Editorial Board	5
The complexity of bicriteria tree-depth	5
Kolmogorov-Loveland betting strategies lose the Betting game on open sets	5
Languages generated by numerical P systems with thresholds	5
Model checking differentially private properties	5
Algorithmic aspects of paired disjunctive domination in graphs	5
Using edge contractions to reduce the semitotal domination number	5
Connectivity and constructive algorithms of disjoint paths in dragonfly networks	5
Optimal L-algorithms for rendezvous of asynchronous mobile robots with extern	5
On finding maximum disjoint paths with different colors: Computational complexity and practical LP-based algorithms	5
Sorting via shuffles with a cut after the longest increasing prefix	5
Distributed transformations of Hamiltonian shapes based on line moves	5
Learning algebraic structures with the help of Borel equivalence relations	5
D_PSNI: Delimited persistent stochastic non-interference	5
Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost	5
Editorial	5
Editorial Board	5
Centralised connectivity-preserving transformations for programmable matter: A minimal seed approach	5
In memory of Jérôme Monnot	5
Constant amortized time enumeration of Eulerian trails	5
From multivalued to Boolean functions: Preservation of soft nested canalization	5
Transactions and contracts based on reaction systems	5
Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints	5
Self-similarity of communities of the ABCD model	5
Weighted forward looking adaptive coding	5
On the connectedness of arithmetic hyperplanes	5
An anomaly-based intrusion detection system using recursive feature elimination technique for improved attack detection	5
Mutual visibility of luminous robots despite angular inaccuracy	5
Undecidability of the universal support problem for weighted automata over zero-sum-free commutative semirings	5
On the complexity of fair coin flipping	5
Do additional target points speed up evolutionary algorithms?	5
The unpaired many-to-many k-disjoint paths in bipartite hypercube-like networks	5
Location functions for self-stabilizing byzantine tolerant swarms	5
The n-trigles, a new variant in the SameSum family	4
Rewriting systems, plain groups, and geodetic graphs	4
A decomposition theorem for number-conserving multi-state cellular automata on triangular grids	4
Decision on block size in blockchain systems by evolutionary equilibrium analysis	4
Stand up indulgent gathering	4
Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification	4
The t/k-diagnosability of m-ary n-cube networks	4
Quantum circuits with classical channels and the principle of deferred measurements	4
Optimal 2-traceability codes of length 4	4
Finding geometric representations of apex graphs is NP-hard	4
2-colored point-set embeddings of partial 2-trees	4
Query answering over inconsistent knowledge bases: A probabilistic approach	4
Feasibility assessments of a dynamical approach to compartmental modelling on graphs: Scaling limits and performance analysis	4
Revisiting RSA-polynomial problem and semiprime factorization	4
Physical zero-knowledge proof for Ripple Effect	4
Reducing the local alphabet size in tiling systems by means of 2D comma-free codes	4
The Exact Subset MultiCover problem	4
Doubly adaptive zero-knowledge proofs	4
On the linearity of the periods of subtraction games	4
Unpaired set-to-set disjoint path routings in recursive match networks	4
Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping	4
AbU: A calculus for distributed event-driven programming with attribute-based interaction	4
Chess is hard even for a single player	4
Flow shop scheduling problems with transportation constraints revisited	4
Deep learning and natural language processing in computation for offensive language detection in online social networks by feature selection and ensemble classification techniques	4
For rational numbers with Suppes-Ono division, equational validity is one-one equivalent with Diophantine unsolvability	4
Parking problem by oblivious mobile robots in infinite grids	4
Succinct navigational oracles for families of intersection graphs on a circle	4
Editorial Board	4