Theoretical Computer Science

Article	Citations
Editorial Board	34
Untangling temporal graphs of bounded degree	31
Distributed approximation for f-matching	28
Greedy algorithm for maximization of semi-monotone non-submodular functions with applications	26
Privacy-preserving file sharing on cloud storage with certificateless signcryption	26
Factorisation in the semiring of finite dynamical systems	26
Complexity of modification problems for best match graphs	25
A generalization of properly colored paths and cycles in edge-colored graphs	23
A secure hierarchical deterministic wallet with stealth address from lattices	23
Checked corecursive streams: Expressivity and completeness	21
On coresets for support vector machines	18
The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems	17
The longest cycle problem is polynomial on interval graphs	17
A process calculus approach to detection and mitigation of PLC malware	16
Dynamic threshold P systems with delay on synapses for shortest path problems	16
Arbitrary pattern formation on infinite regular tessellation graphs	16
Polymorphic higher-order context-free session types	14
Multi-objective evolutionary algorithms are generally good: Maximizing monotone submodular functions over sequences	14
Two-machine open shop problem with a single server and set-up time considerations	13
Self-assembly of and optimal encoding within thin rectangles at temperature-1 in 3D	13
Rapid left expansivity, a commonality between Wolfram's Rule 30 and powers of p/q	13
The Steiner k-eccentricity on trees	12
Optimally integrating ad auction into e-commerce platforms	12
Exponential slowdown for larger populations: The (μ + 1)-EA on monotone functions	12
Biometric-based two-factor authentication scheme under database leakage	12

Overlapping edge unfoldings for convex regular-faced polyhedra	12
Authentication of fragments with short tags	12
Synthesising elementary net systems with localities	11
Small SNQ P Systems with multiple types of spikes	11
The diameter of rectangular twisted torus	11
On the parametrized complexity of read-once refutations in UTVPI+ constraint systems	11
Not all strangers are the same: The impact of tolerance in Schelling games	11
Temporal logic specification mining of programs	11
The parameterized complexity of welfare guarantees in Schelling segregation	11
Ordered scheduling in control-flow distributed transactional memory	10
Editorial Board	10
Integer k-matching preclusion of some interconnection networks	10
Editorial Board	10
How real is incomputability in physics?	10
Categorical specification and implementation of Replicated Data Types	10
First-order logic axiomatization of metric graph theory	10
Improvements in the computing efficiency of the probabilities of the LIL test for the PRNG evaluation	10
Rational power series in several noncommuting variables and the Skolem–Mahler–Lech theorem	10
Wildcarded identity-based encryption from lattices	10
Decidability and k-regular sequences	9
Molecular pattern formation on grids in the Moblot model	9
A tighter proof for CCA secure inner product functional encryption: Genericity meets efficiency	9
On the power of threshold-based algorithms for detecting cycles in the CONGEST model	9
New (k,l,m)-verifiable multi-secret sharing schemes based on XTR public key system	9
A data structure for substring-substring LCS length queries	9
Partial sums on the ultra-wide word RAM	9
Complexity and algorithms for neighbor-sum-2-distinguishing {1,3}-edge-weighting of graphs	9
A Petri net view of covalent bonds	9
Computing the hull and interval numbers in the weakly toll convexity	9
Approximation by lexicographically maximal solutions in matching and matroid intersection problems	8
On geometric shape construction via growth operations	8
Editorial Board	8
Inductive definitions in logic versus programs of real-time cellular automata	8
Computable subcontinua of semicomputable chainable Hausdorff continua	8
Approximation algorithms for sorting by bounded singleton moves	8
Editorial Board	8
Weighted 2-sections and hypergraph reconstruction	8
Finite and infinite closed-rich words	8
Finding the edges in optimal Hamiltonian cycles based on frequency quadrilaterals	8
Approximation algorithms for fair k-median problem without fairness violation	8
A unique extension of rich words	8
Editorial Board	8
On efficiency of notations for natural numbers	8
Deterministic rendezvous in infinite trees	8
Distributed distance domination in graphs with no K2,-minor	8
Colourful components in k-caterpillars and planar graphs	8
Editorial Board	8
An optimal algorithm for 2-bounded delay buffer management with lookahead	8
Behavioural logics for configuration structures	8
On knot-free vertex deletion: Fine-grained parameterized complexity analysis of a deadlock resolution graph problem	8

On the effects of hierarchical self-assembly for reducing program-size complexity	7
Bi-immunity over different size alphabets	7
Reconstructing parameterized strings from parameterized suffix and LCP arrays	7
Massively parallel and streaming algorithms for balanced clustering	7
Editorial	7
Improved algorithms for the general exact satisfiability problem	7
Improved upper bound for sorting permutations by prefix transpositions	7
A skin microbiome model with AMP interactions and analysis of quasi-stability vs stability in population dynamics	7
On ordering of β-description trees	7
Cops and Robber on some families of oriented graphs	7
Maximal degenerate palindromes with gaps and mismatches	7
Kindergarden quantum mechanics graduates ...or how I learned to stop gluing LEGO together and love the ZX-calculus	7
Revisiting maximum satisfiability and related problems in data streams	7
On doubly symmetric Dyck words	7
Algorithms for energy conservation in heterogeneous data centers	7
Bipartite instances of INFLUENCE	7
Hybrid fault-tolerant prescribed hyper-hamiltonian laceability of hypercubes	7
Homomorphisms and inverse homomorphisms on graph-walking automata	7
An approximation algorithm for diversity-aware fair k-supplier problem	7
Call admission problems on grids with advice	6
Editorial Board	6
Editorial Board	6
Finding dominating induced matchings in P10-free graphs in polynomial time	6
Which is the fairest allocation in the max-min fairness-based coalitional game?	6
Self-stabilizing indulgent zero-degrading binary consensus	6
Dispersing and grouping points on planar segments	6
Query-based selection of optimal candidates under the Mallows model	6
One-visibility cops and robber on trees	6
The intersection of 3-maximal submonoids	6
CCA-security from adaptive all-but-one lossy trapdoor functions	6
Editorial Board	6
On distributability	6
Monotone k-submodular secretary problems: Cardinality and knapsack constraints	6
Editorial Board	6
Editorial Board	6
Sequentialization and procedural complexity in automata networks	6
The Small Set Vertex Expansion Problem	6
Sampling polynomial trajectories for LTL verification	6
On prefix palindromic length of automatic words	6
Online learning of smooth functions	6
Computing a metric basis of a bipartite distance-hereditary graph	6
Fault-tolerant distance labeling for planar graphs	6
Fixed-parameter tractability for the Tree Assembly problem	6
Complexity issues for timeline-based planning over dense time under future and minimal semantics	6
A characterization of 2-threshold functions via pairs of prime segments	6
Editorial Board	6
From decidability to undecidability by considering regular sets of instances	6
On the parameterized complexity of the synthesis of Boolean nets with restricted place environments	6
Editorial Board	6
Graph clustering via generalized colorings	6
Diagnosability of multigraph composition networks	6
PPAD-complete approximate pure Nash equilibria in Lipschitz games	6
Generation matrix: An embeddable matrix representation for hierarchical trees	6
Deciding whether four perfect matchings can cover the edges of a snark is NP-complete	6
Editorial Board	6
Abstract geometrical computation 11: Slanted firing squad synchronisation on signal machines	6
Simple algorithms for partial and simultaneous rectangular duals with given contact orientations	6
Editorial Board	5
From semantics to types: The case of the imperative λ-calculus	5
A generalization of a theorem of Rothschild and van Lint	5
A relaxed condition for avoiding the occur-check	5
Twin-distance-hereditary digraphs	5
Editorial Board	5
Editorial Board	5
Reconfiguration of connected graph partitions via recombination	5
Secret sharing schemes for infinite sets of participants: A new design technique	5
Colouring graphs with no induced six-vertex path or diamond	5
Editorial Board	5
Improved exploration of unknown polygons	5
Computational complexity aspects of super domination	5
A new lattice-based online/offline signatures framework for low-power devices	5
An array P system based on a new variant of pure 2D context-free grammars	5
Degree-anonymization using edge rotations	5
Editorial Board	5
CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN	5
Editorial	5
Frontiers of Computability, Randomness, and Complexity (dedicated to the 70th birthday of Professor Cristian Calude)	5
Syntactic view of sigma-tau generation of permutations	5
The road problem and homomorphisms of directed graphs	5
The partial diagnosability of interconnection networks under the Hybrid PMC model	5

A 5k-vertex kernel for 3-path vertex cover	5
Machines that perform measurements	5
Online algorithms for BP functions maximization	5
The influence of maximum (s,t)-cuts on the competitiveness of deterministic strategies for the Canadian Traveller Problem	5
The assignment problem	5
Simultaneous FPQ-ordering and hybrid planarity testing	5
Sorting by prefix block-interchanges	5
Push-forward method for piecewise deterministic biochemical simulations	5
Editorial Board	5
Editorial Board	5
A new dynamic programming algorithm for the simplified partial digest problem	5
Variety of mutual-visibility problems in graphs	5
Quantitative estimates for the size of an intersection of sparse automatic sets	5
Recoloring subgraphs of K2 for sports scheduling	5
State complexity of finite partial languages	5
On the parameterized complexity of the acyclic matching problem	5
On the solution bound of two-sided scaffold filling	5
Cellular automata and bootstrap percolation	5
Enumeration of irredundant forests	5
Complexity and approximability of Minimum Path-Collection Exact Covers	5
Sublinear P system solutions to NP-complete problems	5
Structural parameterizations of budgeted graph coloring	5
Parameterized complexity of perfectly matched sets	5
Editorial	5
Guest editorial: Structural Information and Communication Complexity 2021	5
Nonuniform SINR+Voronoi diagrams are effectively uniform	5
The family of generalized variational network of cube-connected cycles	4
Joint realizability of monotone Boolean functions	4
Unique key Horn functions	4
The longest almost increasing subsequence problem with sliding windows	4
Finer-grained reductions in fine-grained hardness of approximation	4
Streaming adaptive submodular maximization	4
Preface	4
Adaptively code-correlation robustness functions and its applications to private set intersection	4
Web of things based social media fake news classification with feature extraction using pre-trained convoluted recurrent network with deep fuzzy learning	4
Extricating web pages from deep web using deaima architecture	4
Complexity and bounds for disjunctive total bondage	4
Editorial Board	4
A compositional view of derivations as interactive processes with applications to regulated and distributed rewriting	4
Discovering and certifying lower bounds for the online bin stretching problem	4
Decision problems and projection languages for restricted variants of two-dimensional automata	4
Information disclosure in the framework of Kolmogorov complexity	4
Approximation algorithms for fuzzy C-means problem based on seeding method	4
A hierarchy of local decision	4
Sample complexity of hidden subgroup problem	4
The cardinality constrained inverse center location problems on tree networks with edge length augmentation	4
A linear time algorithm for connected p-centdian problem on block graphs	4
The diagnosability of wheel networks with the condition: 2-extra	4
Hamiltonian cycles of balanced hypercube with more faulty edges	4
The structural complexity landscape of finding balance-fair shortest paths	4
New results on multi-level aggregation	4
On the advice complexity of the online dominating set problem	4
Truncating abstraction of bit-vector operations for BDD-based SMT solvers	4
Computational power of sequential dendrite P systems	4
Distributed coloring and the local structure of unit-disk graphs	4
Towards composable computations by RNA co-transcriptional folding: A proof-of-concept demonstration of nested loops in oritatami	4
Grid exploration by a swarm of autonomous robots with minimum repetitions	4
Digital misinformation and fake news detection using WoT integration with Asian social networks fusion based feature extraction with text and image classification by machine learning architectures	4
Computing the longest common almost-increasing subsequence	4
Attractor separation and signed cycles in asynchronous Boolean networks	4
Editorial: Special issue on Algorithms and Computation	4
Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity	4
Scheduling games with machine-dependent priority lists	4
Editorial Board	4
Performance analysis of distance-1 distributed algorithms for admission control under the 2-hop interference model	4
Reliability measure of the n-th cartesian product of complete graph K4 on h-extra edge-connectivity	4
Embedded connectivity of ternary n-cubes	4
A parametric worst-case approach to fairness in cooperative games with transferable utility	4
Editorial Board	4
An improved lower bound for competitive graph exploration	4
I/O-efficient data structures for non-overlapping indexing	4
Independent perfect dominating sets in semi-Cayley graphs	4
Automata for solid codes	4
Complexity of paired domination in AT-free and planar graphs	4
Nimber-preserving reduction: Game secrets and homomorphic Sprague-Grundy theorem	4
Towards strong regret minimization sets: Balancing freshness and diversity in data selection	4
On the approximability of robust network design	4
Editorial Board	4
Power, positive closure, and quotients on convex languages	4
Editorial Board	4
On recognising words that are squares for the shuffle product	4
Editorial Board	4
Monotonic self-stabilization and its application to robust and adaptive pattern formation	4
Editorial Board	4
Editorial	4
Gaussian downlink user selection subject to access limit, power budget, and rate demands	4
On the binary digits of n and n2	4
Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination	4
On balanced and abelian properties of circular words over a ternary alphabet	4
Hardness and approximation for the star p-Hub Routing Cost Problem in metric graphs	4
Algorithm and hardness results in double Roman domination of graphs	4
Remarks on external contextual grammars with selection	4
Palindromic length and reduction of powers	4
Further construction of even-variable balanced rotation symmetric Boolean functions with optimal algebraic immunity	4
Three remarks on W graphs	4