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 2021-04-01 to 2025-04-01.)
ArticleCitations
Bounded incentives in manipulating the probabilistic serial rule31
Solving problems on generalized convex graphs via mim-width28
A 43-approximati23
Editorial Board19
A 4 + ϵ approximation for k-connected subgraphs15
Special issue on Algorithmic Theory of Dynamic Networks and Its Applications – Preface13
Editorial Board13
Etherless Ethereum tokens: Simulating native tokens in Ethereum12
Online bin covering with limited migration12
Reducing the vertex cover number via edge contractions12
Latency, capacity, and distributed minimum spanning trees11
Polynomially ambiguous probabilistic automata on restricted languages11
O is an n-MCFL10
Bounding the number of reticulation events for displaying multiple trees in a phylogenetic network9
Bivariate B-splines from convex configurations8
Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem8
Deterministic non-adaptive contention resolution on a shared channel7
Covering metric spaces by few trees7
Measuring what matters: A hybrid approach to dynamic programming with treewidth7
SAT backdoors: Depth beats size6
The satisfiability problem for a quantitative fragment of PCTL6
Clocked population protocols6
Time-sharing scheduling with tolerance capacities6
Parameterised temporal exploration problems6
Selective monitoring6
Labeled sample compression schemes for complexes of oriented matroids6
Exploration of dynamic networks: Tight bounds on the number of agents6
A new temporal interpretation of cluster editing5
Parameterized complexity of categorical clustering with size constraints5
Exact and parameterized algorithms for the independent cutset problem5
Improved prophet inequalities for combinatorial welfare maximization with (approximately) subadditive agents5
The maximal coordination principle in regulatory Boolean networks5
Single-exponential FPT algorithms for enumerating secluded F-free subgraphs a5
Minimum separator reconfiguration5
Corrigendum to “Prediction, learning, uniform convergence, and scale-sensitive dimensions” [J. Comput. Syst. Sci. 56 (2) (1998) 174–190]5
On the parameterized complexity of Grid Contraction4
Uniform parsing for hyperedge replacement grammars4
The temporal explorer who returns to the base4
Special Issue on the 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)4
Editorial Board4
Bisection of bounded treewidth graphs by convolutions4
Editorial Board4
A maximum clique based approximation algorithm for wireless link scheduling under SINR model4
PAC learning halfspaces in non-interactive local differential privacy model with public unlabeled data4
Editorial Board4
46th International Colloquium on Automata, Languages and Programming (ICALP 2019) - Track C: Foundations of networks and multi-agent systems4
Space characterizations of complexity measures and size-space trade-offs in propositional proof systems4
Approximate CVP in time 20.8024
Lifting query complexity to time-space complexity for two-way finite automata4
On finding separators in temporal split and permutation graphs3
Analytic methods for reachability problems3
Greedy routing and the algorithmic small-world phenomenon3
The complexity of binary matrix completion under diameter constraints3
On kernels for d-path vertex cover3
Priority Promotion with Parysian flair3
Bidding mechanisms in graph games3
Editorial – Special issue on Concurrency Theory (CONCUR 2018)3
Single-source shortest paths and strong connectivity in dynamic planar graphs3
Complexity of verification in self-assembly with prebuilt assemblies3
A dichotomy for bounded degree graph homomorphisms with nonnegative weights3
Modular SAT-based techniques for reasoning tasks in team semantics3
Efficiently enumerating hitting sets of hypergraphs arising in data profiling3
Undecidability of the speed positiveness problem in reversible and complete Turing machines3
Detours in directed graphs3
Closure and nonclosure properties of the classes of compressible and rankable sets3
Quantum random access stored-program machines3
Reachability relations of timed pushdown automata3
0.13090705871582