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-08-01 to 2026-08-01.)

Article	Citations
A constant-factor approximation for weighted bond cover	15
Maximizing the number of integer pairs summing to powers of 2 via graph labeling and solving restricted systems of linear (in)equations	15
Deterministic non-adaptive contention resolution on a shared channel	13
Rectilinear-upward planarity testing of digraphs	13
Solving problems on generalized convex graphs via mim-width	13
Etherless Ethereum tokens: Simulating native tokens in Ethereum	12
Editorial Board	11
The maximal coordination principle in regulatory Boolean networks	11
Complexity framework for forbidden subgraphs IV: The Steiner Forest problem	10
Editorial Board	9
Temporal Reachability Dominating Sets: Contagion in temporal graphs	8
The 2CNF Boolean formula satisfiability problem and the linear space hypothesis	8
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
Editorial Board	7
Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs	7
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
The impact of state merging on predictive accuracy in probabilistic tree automata: Dietze's conjecture revisited	6
Galactic token sliding	6
Performance modeling and analysis for randomly walking mobile users with Markov chains	6
Global reliable diagnosis of networks based on self-comparative diagnosis model and g-good-neighbor property	6
Succinct representation for (non)deterministic finite automata	6
Dual domination problems in graphs	5
Perpetual maintenance of machines with different urgency requirements	5

Editorial Board	5
Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs	5
Routing few robots in a crowded network	5
Parameterized complexity of multi-node hubs	5
Gap preserving reductions between reconfiguration problems	5
Monitoring the edges of a graph using distances with given girth	5
Decomposing finite-valued two-way finite transducers	4
A divide and conquer algorithm for deciding group cellular automata dynamics	4
Temporal reachability minimization: Delaying vs. deleting	4
On the parameterized complexity of computing good edge-labelings	4
The parameterized complexity of the survivable network design problem	4
Graph clustering problems under the lens of parameterized local search	4
Editorial Board	4
Cutting corners	4
A comparative study of the smallest probability intervals for which a binary sequence is random	4
Backdoor DNFs	4
Faster winner determination algorithms for (Colored) Arc Kayles	4
Finding and counting patterns in sparse graphs	3
The possible winner with uncertain weights problem	3
Computational complexity of covering multigraphs with semi-edges: Small cases	3
Time-sharing scheduling with tolerance capacities	3
Polynomially ambiguous probabilistic automata on restricted languages	3
Complexity of deciding the equality of matching numbers	3
Dense graph partitioning on sparse and dense graphs	3
A linear delay algorithm in SD set system and its application to subgraph enumeration	3
Modular SAT-based techniques for reasoning tasks in team semantics	3
Editorial Board	3
Near-optimal algorithm for supporting small and medium-sized enterprises in ad systems	3
The satisfiability problem for a quantitative fragment of PCTL	3
Parameterised temporal exploration problems	3
The power of knowledge in linear search for an escaping target	3
Space characterizations of complexity measures and size-space trade-offs in propositional proof systems	3
On the parallel complexity of group isomorphism via Weisfeiler–Leman	3
Approximate realizations for outerplanaric degree sequences	3
Editorial Board	3
Editorial Board	3
Redundancy of information: Lowering effective dimension	3
A maximum clique based approximation algorithm for wireless link scheduling under SINR model	3
On the parameterized complexity of Grid Contraction	3
Participatory budgeting with project groups	2
Mengerian graphs: Characterization and recognition	2
Algorithms and Turing kernels for detecting and counting small patterns in unit disk graphs	2
Forbidden patterns in temporal graphs resulting from encounters in a corridor	2
Towards declarative comparabilities: Application to functional dependencies	2
Approximate selection with unreliable comparisons in sublinear time	2
Editorial Board	2
A near-linear kernel for bounded-state parsimony distance	2
Deterministic performance guarantees for bidirectional BFS on real-world networks	2
Lower bounds for Boolean circuits of bounded negation width	2
Scheduling lower bounds via AND subset sum	2

Grid recognition: Classical and parameterized computational perspectives	2
Packing arc-disjoint cycles in oriented graphs	2
Exploring wedges of an oriented grid by an automaton with pebbles	2
On the parameterized complexity of clustering problems for incomplete data	2
Editorial Board	2
Relating description complexity to entropy	2
Decomposing permutation automata	2
On minimum vertex bisection of random d-regular graphs	2
On the parameterized complexity of interval scheduling with eligible machine sets	2
Absolute convergence and error thresholds in non-active adaptive sampling	2