Theoretical Computer Science

Article	Citations
Editorial Board	46
Untangling temporal graphs of bounded degree	36
On Conflict-Free Spanning Tree: Mapping tractable and hard instances through the lenses of graph classes	34
Oracle separations for non-adaptive collapse-free quantum computing	31
Finding a minimum spanning tree with a small non-terminal set	30
How to avoid the commuting conversions of IPC	28
Shell sort with expected complexity of O(nlog2n)	26
A linkable ring signature scheme with unconditional anonymity in the standard model	26
Editorial Board	24
Network control games played on graphs	23
Privacy-preserving file sharing on cloud storage with certificateless signcryption	18
Reliability evaluation of complete graph-based recursive networks	17
Factorisation in the semiring of finite dynamical systems	16
Uncertainty representation in dynamical systems using rough set theory	16
Improved FPT approximation scheme and approximate kernel for biclique-free max k-weight SAT: Greedy strikes back	15
Editorial Board	15
A secure hierarchical deterministic wallet with stealth address from lattices	14
Towards a general methodology for formal verification on spiking neural P systems	14
The diameter of rectangular twisted torus	14
A generalization of properly colored paths and cycles in edge-colored graphs	14
A process calculus approach to detection and mitigation of PLC malware	14
Not all strangers are the same: The impact of tolerance in Schelling games	14
Rational power series in several noncommuting variables and the Skolem–Mahler–Lech theorem	13
Editorial Board	13
First-order logic axiomatization of metric graph theory	13

How real is incomputability in physics?	13
Wildcarded identity-based encryption from lattices	13
Improvements in the computing efficiency of the probabilities of the LIL test for the PRNG evaluation	13
Ordered scheduling in control-flow distributed transactional memory	13
On efficiency of notations for natural numbers	12
A Petri net view of covalent bonds	12
Molecular pattern formation on grids in the Moblot model	12
Editorial Board	12
Weighted 2-sections and hypergraph reconstruction	12
A data structure for substring-substring LCS length queries	12
Categorical specification and implementation of Replicated Data Types	12
Editorial Board	11
Approximation algorithms for fair k-median problem without fairness violation	11
Editorial Board	11
Approximation by lexicographically maximal solutions in matching and matroid intersection problems	11
On geometric shape construction via growth operations	11
Behavioural logics for configuration structures	11
Editorial Board	11
Massively parallel and streaming algorithms for balanced clustering	10
A skin microbiome model with AMP interactions and analysis of quasi-stability vs stability in population dynamics	10
Editorial Board	10
Revisiting maximum satisfiability and related problems in data streams	10
Editorial	10
On doubly symmetric Dyck words	10
On ordering of β-description trees	10
Maximal degenerate palindromes with gaps and mismatches	10
Improved upper bound for sorting permutations by prefix transpositions	10
Query-based selection of optimal candidates under the Mallows model	9
Editorial Board	9
Computing a metric basis of a bipartite distance-hereditary graph	9
Kindergarden quantum mechanics graduates ...or how I learned to stop gluing LEGO together and love the ZX-calculus	9
PPAD-complete approximate pure Nash equilibria in Lipschitz games	9
Editorial Board	9
The intersection of 3-maximal submonoids	9
Online learning of smooth functions	9
On prefix palindromic length of automatic words	9
Finding dominating induced matchings in P10-free graphs in polynomial time	9
Editorial Board	9
On the parameterized complexity of the synthesis of Boolean nets with restricted place environments	8
Editorial Board	8
Monotone k-submodular secretary problems: Cardinality and knapsack constraints	8
Syntactic view of sigma-tau generation of permutations	8
Editorial Board	8
CCA-security from adaptive all-but-one lossy trapdoor functions	8
Complexity issues for timeline-based planning over dense time under future and minimal semantics	8
Editorial Board	8
Call admission problems on grids with advice	8
State complexity of finite partial languages	8
A relaxed condition for avoiding the occur-check	8
Editorial Board	8

Editorial Board	8
Editorial Board	8
Abstract geometrical computation 11: Slanted firing squad synchronisation on signal machines	8
An array P system based on a new variant of pure 2D context-free grammars	8
Variety of mutual-visibility problems in graphs	8
Editorial Board	8
Editorial Board	8
Editorial Board	7
Frontiers of Computability, Randomness, and Complexity (dedicated to the 70th birthday of Professor Cristian Calude)	7
Distributed coloring and the local structure of unit-disk graphs	7
The family of generalized variational network of cube-connected cycles	7
The partial diagnosability of interconnection networks under the Hybrid PMC model	7
From semantics to types: The case of the imperative λ-calculus	7
Sublinear P system solutions to NP-complete problems	7
Guest editorial: Structural Information and Communication Complexity 2021	7
Recoloring subgraphs of K2 for sports scheduling	7
Editorial Board	7
Streaming adaptive submodular maximization	7
Editorial	7
Parameterized complexity of perfectly matched sets	7
Structural parameterizations of budgeted graph coloring	7
Sorting by prefix block-interchanges	7
Computational complexity aspects of super domination	7
Degree-anonymization using edge rotations	7
Nonuniform SINR+Voronoi diagrams are effectively uniform	7
Cellular automata and bootstrap percolation	7
The influence of maximum (s,t)-cuts on the competitiveness of deterministic strategies for the Canadian Traveller Problem	7
Editorial	7
Editorial Board	7
Editorial Board	7
Extricating web pages from deep web using deaima architecture	6
Gaussian downlink user selection subject to access limit, power budget, and rate demands	6
Transformations of probability distributions	6
Web of things based social media fake news classification with feature extraction using pre-trained convoluted recurrent network with deep fuzzy learning	6
Synthesising elementary net systems with localities	6
Editorial Board	6
Information disclosure in the framework of Kolmogorov complexity	6
On the average-case complexity of pattern matching with wildcards	6
The diagnosability of wheel networks with the condition: 2-extra	6
Editorial Board	6
Taming randomness and complexity – Essays in honour of Professor Péter Gács	6
The structural complexity landscape of finding balance-fair shortest paths	6
Monotonic self-stabilization and its application to robust and adaptive pattern formation	6
Complexity of paired domination in AT-free and planar graphs	6
On balanced and abelian properties of circular words over a ternary alphabet	6
An algorithmic construction of union-intersection-bounded families	6
Editorial Board	6
Authentication of fragments with short tags	6
A linear time algorithm for connected p-centdian problem on block graphs	6
Hardness and approximation for the star p-Hub Routing Cost Problem in metric graphs	6
Clustering with respect to the information distance	6
On the binary digits of n and n2	6
Editorial	6
Performance analysis of distance-1 distributed algorithms for admission control under the 2-hop interference model	6
Editorial Board	6
Editorial	6
Computing the longest common almost-increasing subsequence	6
Editorial Board	6
Complexity and bounds for disjunctive total bondage	6
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	6
Dynamic path finding for multi-load agent pickup and delivery problem	6
Self-assembly of and optimal encoding within thin rectangles at temperature-1 in 3D	6
A parametric worst-case approach to fairness in cooperative games with transferable utility	6
Editorial Board	6
Password generation using array generating interval timed colored Petri net (AGITCPN) for effective security	6
Discovering and certifying lower bounds for the online bin stretching problem	6
Certificate complexity of elementary symmetric Boolean functions	6
Polymorphic higher-order context-free session types	6
Grid exploration by a swarm of autonomous robots with minimum repetitions	6
Editorial: Special issue on Algorithms and Computation	6
Physical ZKP protocols for Nurimisaki and Kurodoko	5
Sequentialization and procedural complexity in automata networks	5
On the power of threshold-based algorithms for detecting cycles in the CONGEST model	5
Algorithm and hardness results in double Roman domination of graphs	5
Editorial Board	5
The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems	5
Nonexistence of uniformly most reliable two-terminal graphs	5
On distributability	5
A theory of L-shaped floor-plans	5
Reconstructing parameterized strings from parameterized suffix and LCP arrays	5

Preface	5
Simple algorithms for partial and simultaneous rectangular duals with given contact orientations	5
Improved exploration of unknown polygons	5
On the complexity of recognizing Stick, BipHook and Max Point-Tolerance graphs	5
Truncating abstraction of bit-vector operations for BDD-based SMT solvers	5
Optimally integrating ad auction into e-commerce platforms	5
Non-maximal sensitivity to synchronism in elementary cellular automata: Exact asymptotic measures	5
Quantitative estimates for the size of an intersection of sparse automatic sets	5
Two-disjoint-cycle-cover vertex bipancyclicity of bipartite hypercube-like networks	5
Finite and infinite closed-rich words	5
A characterization of 2-threshold functions via pairs of prime segments	5
Towards composable computations by RNA co-transcriptional folding: A proof-of-concept demonstration of nested loops in oritatami	5
Complexity and algorithms for neighbor-sum-2-distinguishing {1,3}-edge-weighting of graphs	5
Editorial Board	5
Partial sums on the ultra-wide word RAM	5
Editorial Board	5
Algorithms for energy conservation in heterogeneous data centers	5
Bi-immunity over different size alphabets	5
Deterministic rendezvous in infinite trees	5
Further construction of even-variable balanced rotation symmetric Boolean functions with optimal algebraic immunity	5
Hyper star fault tolerance of bubble sort networks	5
Polynomial time multiplication and normal forms in free bands	5
Agreement forests of caterpillar trees: Complexity, kernelization and branching	5
Bipartite instances of INFLUENCE	5
APX-hardness and approximation for the k-burning number problem	5
Inductive definitions in logic versus programs of real-time cellular automata	5
Which is the fairest allocation in the max-min fairness-based coalitional game?	5
Checked corecursive streams: Expressivity and completeness	5
Approximation algorithms for sorting by bounded singleton moves	5
Cops and Robber on some families of oriented graphs	5
Deciding atomicity of subword-closed languages	5
Optimizing incremental SDN upgrades for load balancing in ISP networks	5
Nimber-preserving reduction: Game secrets and homomorphic Sprague-Grundy theorem	5
Editorial Board	5
Reliability measure of the n-th cartesian product of complete graph K4 on h-extra edge-connectivity	5
Editorial Board	5
Three remarks on W graphs	5
The cardinality constrained inverse center location problems on tree networks with edge length augmentation	5
Joint realizability of monotone Boolean functions	5
Machines that perform measurements	5
Finer-grained reductions in fine-grained hardness of approximation	5
Edge open packing: Complexity, algorithmic aspects, and bounds	5
On shuffled-square-free words	5
Constructing red-black spanners for mixed-charging vehicular networks	4
Sample complexity of hidden subgroup problem	4
Attractor separation and signed cycles in asynchronous Boolean networks	4
Computational power of sequential dendrite P systems	4
An improved lower bound for competitive graph exploration	4
Power, positive closure, and quotients on convex languages	4
The assignment problem	4
Decidability and k-regular sequences	4
Observation routes and external watchman routes	4
Distance problems within Helly graphs and k-Helly graphs	4
Towards zero knowledge argument for double discrete logarithm with constant cost	4
Sampling polynomial trajectories for LTL verification	4
Decision problems and projection languages for restricted variants of two-dimensional automata	4
Towards strong regret minimization sets: Balancing freshness and diversity in data selection	4
Dispersing and grouping points on planar segments	4
On knot-free vertex deletion: Fine-grained parameterized complexity analysis of a deadlock resolution graph problem	4
Complexity of some arc-partition problems for digraphs	4
Complexity of modification problems for best match graphs	4
The Small Set Vertex Expansion Problem	4
The Steiner k-eccentricity on trees	4
Envy-free relaxations for goods, chores, and mixed items	4
On the solution bound of two-sided scaffold filling	4
Fault-tolerant distance labeling for planar graphs	4
Enabling high reliability via matroidal connectivity and conditional matroidal connectivity on arrangement graph networks	4
Hybrid fault-tolerant prescribed hyper-hamiltonian laceability of hypercubes	4
Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models	4
Automata for solid codes	4
Counting vanishing matrix-vector products	4
Overlapping edge unfoldings for convex regular-faced polyhedra	4
Reliability analysis of the generalized balanced hypercube	4
Parameterised approximation of the fixation probability of the dominant mutation in the multi-type Moran process	4
Path partitions of phylogenetic networks	4
Hamiltonian cycles of balanced hypercube with more faulty edges	4
The road problem and homomorphisms of directed graphs	4
Time optimal gathering of myopic robots on an infinite triangular grid	4
Algorithms for gerrymandering over graphs	4
CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN	4
User-driven competitive influence maximization in social networks	4
Twin-distance-hereditary digraphs	4
On the parametrized complexity of read-once refutations in UTVPI+ constraint systems	4
Monochromatic arithmetic progressions in binary Thue–Morse-like words	4
Computable subcontinua of semicomputable chainable Hausdorff continua	4
On the effects of hierarchical self-assembly for reducing program-size complexity	4
Graph realization of distance sets	4
On coresets for support vector machines	4
From decidability to undecidability by considering regular sets of instances	4
The longest almost increasing subsequence problem with sliding windows	4
A new dynamic programming algorithm for the simplified partial digest problem	4
Colourful components in k-caterpillars and planar graphs	4
The parameterized complexity of welfare guarantees in Schelling segregation	4
Payment scheduling in the Interval Debt Model	4
Enumeration of irredundant forests	4