Journal of Computer and System Sciences

(The median citation count of Journal of Computer and System Sciences is 1. 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.)
Deleting edges to restrict the size of an epidemic in temporal networks18
On Weisfeiler-Leman invariance: Subgraph counts and related graph properties17
On temporal graph exploration17
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 Hairy Ball problem is PPAD-complete11
The complexity of reachability in parametric Markov decision processes11
Orthogonal planarity testing of bounded treewidth graphs10
Online bin packing with cardinality constraints resolved10
Grammar-compressed indexes with logarithmic search time10
Sliding window temporal graph coloring9
Graphs are not universal for online computability9
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
How fast can we reach a target vertex in stochastic temporal graphs?8
TCEP: Transitions in operator placement to adapt to dynamic network environments7
The temporal explorer who returns to the base7
An improved algorithm for the Steiner tree problem with bounded edge-length7
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
Lattice-based unidirectional infinite-use proxy re-signatures with private re-signature key6
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
Minimizing the operation cost of distributed green data centers with energy storage under carbon capping5
Preimage problems for deterministic finite automata5
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
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
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
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
Measuring what matters: A hybrid approach to dynamic programming with treewidth2
Attack and defense in the layered cyber-security model and their (1 ± ϵ)-approximation schemes2
Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems2
On the threshold of intractability2
An almost optimal approximation algorithm for monotone submodular multiple knapsack2
Coloring temporal graphs2
Reducing graph transversals via edge contractions2
Universal stability in multi-hop radio networks2
Approximate CVP in time 20.8022
O is an n-MCFL2
A 1.375-approximation algorithm for unsigned translocation sorting2
Equivalence of pushdown automata via first-order grammars2
Equivalence checking of quantum finite-state machines2
When are emptiness and containment decidable for probabilistic automata?2
Automatic Kolmogorov complexity, normality, and finite-state dimension revisited2
Complete simulation of automata networks2
On approximate pure Nash equilibria in weighted congestion games with polynomial latencies2
Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic2
A dichotomy for bounded degree graph homomorphisms with nonnegative weights2
Reachability relations of timed pushdown automata2
Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem2
The complexity of the parity argument with potential2
Beyond operator-precedence grammars and languages2
Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin2
A counterexample to Thiagarajan's conjecture on regular event structures2
Complexity of the multilevel critical node problem2
Regularizing conjunctive features for classification2
The tree-generative capacity of combinatory categorial grammars2
An extension of the Moran process using type-specific connection graphs2
Greedy routing and the algorithmic small-world phenomenon2
Multi-round cooperative search games with multiple players2
Perpetual maintenance of machines with different urgency requirements1
A 4 + ϵ approximation for k-connected subgraphs1
Length-bounded cuts: Proper interval graphs and structural parameters1
A maximum clique based approximation algorithm for wireless link scheduling under SINR model1
Deterministic protocols in the SINR model without knowledge of coordinates1
A physically universal Turing machine1
Descriptive complexity of deterministic polylogarithmic time and space1
Faster compressed quadtrees1
Absolute convergence and error thresholds in non-active adaptive sampling1
Deciding the point-to-fixed-point problem for skew tent maps on an interval1
Preprocessing vertex-deletion problems: Characterizing graph properties by low-rank adjacencies1
More on change-making and related problems1
On finding separators in temporal split and permutation graphs1
Cutting corners1
Complexity of verification in self-assembly with prebuilt assemblies1
Wireless IoT sensors data collection reward maximization by leveraging multiple energy- and storage-constrained UAVs1
Online bin covering with limited migration1
Dual domination problems in graphs1
Using decomposition-parameters for QBF: Mind the prefix!1
(In)approximability of maximum minimal FVS1
When are epsilon-nets small?1
Faster Graph bipartization1
Fine-grained complexity of rainbow coloring and its variants1
Addition machines, automatic functions and open problems of Floyd and Knuth1
Orienting undirected phylogenetic networks1
Computing Weighted Subset Odd Cycle Transversals in H-free graphs1
Deletion to scattered graph classes II - improved FPT algorithms for deletion to pairs of graph classes1
Single-source shortest paths and strong connectivity in dynamic planar graphs1
Balanced allocation on hypergraphs1
Quantum random access stored-program machines1
Discriminantal subset convolution: Refining exterior-algebraic methods for parameterized algorithms1
Efficiently enumerating hitting sets of hypergraphs arising in data profiling1
On injectivity of quantum finite automata1
Deciding probabilistic bisimilarity distance one for probabilistic automata1
Your rugby mates don't need to know your colleagues: Triadic closure with edge colors1
Space efficient representations of finite groups1
Parameterized complexity of multi-node hubs1
An improved algorithm for the minmax regret path center problem on trees1
Polynomial time approximation schemes for clustering in low highway dimension graphs1
Descriptive complexity of #P functions: A new perspective1
Parameterized complexity of graph planarity with restricted cyclic orders1
Optimal channel utilization with limited feedback1
The complexity of synthesizing elementary net systems relative to natural parameters1
Multistage knapsack1
Analytic methods for reachability problems1
Non-essential arcs in phylogenetic networks1
Bidding mechanisms in graph games1
Learning the truth vector in high dimensions1
Improved prophet inequalities for combinatorial welfare maximization with (approximately) subadditive agents1