Journal of Computer and System Sciences

Papers
(The TQCC of Journal of Computer and System Sciences is 3. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2020-04-01 to 2024-04-01.)
ArticleCitations
Deleting edges to restrict the size of an epidemic in temporal networks18
On temporal graph exploration17
On Weisfeiler-Leman invariance: Subgraph counts and related graph properties17
Counting and enumerating tree-child networks and their subclasses16
A secure searchable encryption scheme for cloud using hash-based indexing15
Unique end of potential line14
Computing exact solutions of consensus halving and the Borsuk-Ulam theorem12
Temporal cliques admit sparse spanners12
The complexity of reachability in parametric Markov decision processes11
The Hairy Ball problem is PPAD-complete11
Grammar-compressed indexes with logarithmic search time10
Orthogonal planarity testing of bounded treewidth graphs10
Online bin packing with cardinality constraints resolved10
Subexponential algorithms for variants of the homomorphism problem in string graphs9
Subquadratic non-adaptive threshold group testing9
Block trees9
Assigning times to minimise reachability in temporal graphs9
Sliding window temporal graph coloring9
Graphs are not universal for online computability9
How fast can we reach a target vertex in stochastic temporal graphs?8
The temporal explorer who returns to the base7
An improved algorithm for the Steiner tree problem with bounded edge-length7
TCEP: Transitions in operator placement to adapt to dynamic network environments7
Lattice-based unidirectional infinite-use proxy re-signatures with private re-signature key6
The possible winner with uncertain weights problem6
Subexponential algorithm for d-cluster edge deletion: Exception or rule?6
Improved distance sensitivity oracles with subcubic preprocessing time6
Minimizing the operation cost of distributed green data centers with energy storage under carbon capping5
Preimage problems for deterministic finite automata5
Induced Disjoint Paths in AT-free graphs5
Eccentricity terrain of δ-hyperbolic graphs5
Hitting minors on bounded treewidth graphs. III. Lower bounds5
The computational power of parsing expression grammars5
Secure-channel free searchable encryption with multiple keywords: A generic construction, an instantiation, and its implementation5
Renaissance: A self-stabilizing distributed SDN control plane using in-band communications4
Unlabeled sample compression schemes and corner peelings for ample and maximum classes4
Complexity of fixed point counting problems in Boolean networks4
Exploration of dynamic networks: Tight bounds on the number of agents4
Maximum parsimony distance on phylogenetic trees: A linear kernel and constant factor approximation algorithm4
Refined notions of parameterized enumeration kernels with applications to matching cut enumeration4
Additive approximation algorithms for modularity maximization4
Uniform parsing for hyperedge replacement grammars4
Word equations in non-deterministic linear space4
An efficiently computable characterization of stability and instability for linear cellular automata4
Graph reconstruction in the congested clique4
Approximating the existential theory of the reals4
A modeling approach for estimating performance and energy consumption of storage systems3
Disconnected cuts in claw-free graphs3
A 43-approximati3
Distributed reconfiguration of maximal independent sets3
Parameterized k-Clustering: Tractability island3
A multivariate analysis of the strict terminal connection problem3
A Turing kernelization dichotomy for structural parameterizations of F-Minor-3
Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures3
Intersection joins under updates3
Polynomial anonymous dynamic distributed computing without a unique leader3
Bisection of bounded treewidth graphs by convolutions3
Bivariate B-splines from convex configurations3
Finding connected secluded subgraphs3
Many-visits TSP revisited3
Scheduling lower bounds via AND subset sum3
On the fast delivery problem with one or two packages3
The Projection Games Conjecture and the hardness of approximation of super-SAT and related problems3
Medians in median graphs and their cube complexes in linear time3
Incompressibility of H-free edge modification problems: Towards a dichotomy3
Complexity of control in judgment aggregation for uniform premise-based quota rules3
Speeding-up verification of digital signatures3
Understanding PPA-completeness3
Complexity of stability3
Counting subset repairs with functional dependencies3
Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs3
On the profits of competing cloud service providers: A game theoretic approach3
Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence3
Succinct representation for (non)deterministic finite automata3
0.017339944839478