OOIR: Observatory of International Research

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-10-01 to 2025-10-01.)

Article	Citations
Etherless Ethereum tokens: Simulating native tokens in Ethereum	26
The maximal coordination principle in regulatory Boolean networks	21
A constant-factor approximation for weighted bond cover	15
Solving problems on generalized convex graphs via mim-width	13
Deterministic non-adaptive contention resolution on a shared channel	12
The 2CNF Boolean formula satisfiability problem and the linear space hypothesis	10
Editorial Board	10
Approximating the existential theory of the reals	10
Editorial Board	9
Performance modeling and analysis for randomly walking mobile users with Markov chains	9
Galactic token sliding	9
Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs	8
The impact of state merging on predictive accuracy in probabilistic tree automata: Dietze's conjecture revisited	8
Polynomial anonymous dynamic distributed computing without a unique leader	8
Complexity of fixed point counting problems in Boolean networks	8
Editorial Board	7
Parameterized complexity of dominating set variants in almost cluster and split graphs	7
Parameterized complexity of multi-node hubs	7
Succinct representation for (non)deterministic finite automata	7
Polynomial time approximation schemes for clustering in low highway dimension graphs	7
Arithmetical complexity of the language of generic limit sets of cellular automata	7
Perpetual maintenance of machines with different urgency requirements	6
On the threshold of intractability	6
Dual domination problems in graphs	6
A constant-factor approximation for directed latency in quasi-polynomial time	6

Monitoring the edges of a graph using distances with given girth	6
Editorial Board	6
Editorial Board	5
The parameterized complexity of the survivable network design problem	5
Refined notions of parameterized enumeration kernels with applications to matching cut enumeration	5
Backdoor DNFs	5
Cutting corners	5
Faster Winner Determination Algorithms for (Colored) Arc Kayles	5
Many-visits TSP revisited	5
Temporal reachability minimization: Delaying vs. deleting	5
Editorial Board	4
Editorial Board	4
Modular SAT-based techniques for reasoning tasks in team semantics	4
Dense graph partitioning on sparse and dense graphs	4
Time-sharing scheduling with tolerance capacities	4
Parameterised temporal exploration problems	4
Polynomially ambiguous probabilistic automata on restricted languages	4
A linear delay algorithm in SD set system and its application to subgraph enumeration	4
A maximum clique based approximation algorithm for wireless link scheduling under SINR model	4
The satisfiability problem for a quantitative fragment of PCTL	4
On the parameterized complexity of Grid Contraction	4
Space characterizations of complexity measures and size-space trade-offs in propositional proof systems	4
On the parameterized complexity of clustering problems for incomplete data	3
Mengerian graphs: Characterization and recognition	3
Efficiently enumerating hitting sets of hypergraphs arising in data profiling	3
Medians in median graphs and their cube complexes in linear time	3
Approximate realizations for outerplanaric degree sequences	3
Algorithms and Turing kernels for detecting and counting small patterns in unit disk graphs	3
The possible winner with uncertain weights problem	3
Packing arc-disjoint cycles in oriented graphs	3
Editorial Board	3
Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures	3
Intersection joins under updates	3
Absolute convergence and error thresholds in non-active adaptive sampling	3