OOIR: Observatory of International Research

Papers

(The TQCC of Journal of Computer and System Sciences is 2. 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 2022-05-01 to 2026-05-01.)

Article	Citations
A constant-factor approximation for weighted bond cover	29
The maximal coordination principle in regulatory Boolean networks	14
Etherless Ethereum tokens: Simulating native tokens in Ethereum	14
Deterministic non-adaptive contention resolution on a shared channel	13
Maximizing the number of integer pairs summing to powers of 2 via graph labeling and solving restricted systems of linear (in)equations	13
Solving problems on generalized convex graphs via mim-width	12
Editorial Board	11
Temporal Reachability Dominating Sets: Contagion in temporal graphs	11
Complexity framework for forbidden subgraphs IV: The Steiner Forest problem	10
Approximating the existential theory of the reals	10
The 2CNF Boolean formula satisfiability problem and the linear space hypothesis	9
Complexity of fixed point counting problems in Boolean networks	8
Editorial Board	8
The impact of state merging on predictive accuracy in probabilistic tree automata: Dietze's conjecture revisited	7
Succinct representation for (non)deterministic finite automata	7
Arithmetical complexity of the language of generic limit sets of cellular automata	7
Parameterized complexity of dominating set variants in almost cluster and split graphs	7
Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs	7
Galactic token sliding	7
Editorial Board	6
Performance modeling and analysis for randomly walking mobile users with Markov chains	6
Parameterized complexity of multi-node hubs	6
Global reliable diagnosis of networks based on self-comparative diagnosis model and g-good-neighbor property	6
Editorial Board	6
Corrections to “On the data complexity of consistent query answering over graph databases [Journal of Computer and System Sciences 88 (2017) 164–194]”	6

Monitoring the edges of a graph using distances with given girth	5
Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs	5
Gap preserving reductions between reconfiguration problems	5
Dual domination problems in graphs	5
Routing few robots in a crowded network	5
Decomposing finite-valued two-way finite transducers	4
Temporal reachability minimization: Delaying vs. deleting	4
Editorial Board	4
Backdoor DNFs	4
Perpetual maintenance of machines with different urgency requirements	4
A constant-factor approximation for directed latency in quasi-polynomial time	4
A divide and conquer algorithm for deciding group cellular automata dynamics	4
A comparative study of the smallest probability intervals for which a binary sequence is random	4
Cutting corners	4
The parameterized complexity of the survivable network design problem	4
On the parameterized complexity of computing good edge-labelings	4
A maximum clique based approximation algorithm for wireless link scheduling under SINR model	3
Polynomially ambiguous probabilistic automata on restricted languages	3
Editorial Board	3
Time-sharing scheduling with tolerance capacities	3
A linear delay algorithm in SD set system and its application to subgraph enumeration	3
Packing arc-disjoint cycles in oriented graphs	3
Mengerian graphs: Characterization and recognition	3
On the parameterized complexity of Grid Contraction	3
The satisfiability problem for a quantitative fragment of PCTL	3
Editorial Board	3
Computational complexity of covering multigraphs with semi-edges: Small cases	3
Editorial Board	3
Dense graph partitioning on sparse and dense graphs	3
Approximate realizations for outerplanaric degree sequences	3
On the parallel complexity of group isomorphism via Weisfeiler–Leman	3
Space characterizations of complexity measures and size-space trade-offs in propositional proof systems	3
Parameterised temporal exploration problems	3
Faster winner determination algorithms for (Colored) Arc Kayles	3
The power of knowledge in linear search for an escaping target	3
Redundancy of information: Lowering effective dimension	3
Absolute convergence and error thresholds in non-active adaptive sampling	3
Finding and counting patterns in sparse graphs	3
Modular SAT-based techniques for reasoning tasks in team semantics	3
On minimum vertex bisection of random d-regular graphs	2
Decomposing permutation automata	2
Lower bounds for Boolean circuits of bounded negation width	2
On the parameterized complexity of clustering problems for incomplete data	2
Editorial Board	2
Approximate selection with unreliable comparisons in sublinear time	2
Exploring wedges of an oriented grid by an automaton with pebbles	2
Scheduling lower bounds via AND subset sum	2
Forbidden patterns in temporal graphs resulting from encounters in a corridor	2
Weighted group search on the disk & improved lower bounds for priority evacuation	2
On the parameterized complexity of interval scheduling with eligible machine sets	2

Medians in median graphs and their cube complexes in linear time	2
Participatory budgeting with project groups	2
Towards declarative comparabilities: Application to functional dependencies	2
Grid recognition: Classical and parameterized computational perspectives	2
Relating description complexity to entropy	2
Editorial Board	2
A near-linear kernel for bounded-state parsimony distance	2
The possible winner with uncertain weights problem	2
Algorithms and Turing kernels for detecting and counting small patterns in unit disk graphs	2