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

Article	Citations
A constant-factor approximation for weighted bond cover	28
Solving problems on generalized convex graphs via mim-width	13
The maximal coordination principle in regulatory Boolean networks	13
Deterministic non-adaptive contention resolution on a shared channel	12
Etherless Ethereum tokens: Simulating native tokens in Ethereum	11
Complexity framework for forbidden subgraphs IV: The Steiner Forest problem	9
Editorial Board	9
The 2CNF Boolean formula satisfiability problem and the linear space hypothesis	9
Performance modeling and analysis for randomly walking mobile users with Markov chains	8
Editorial Board	8
Parameterized complexity of dominating set variants in almost cluster and split graphs	8
Approximating the existential theory of the reals	8
The impact of state merging on predictive accuracy in probabilistic tree automata: Dietze's conjecture revisited	7
Complexity of fixed point counting problems in Boolean networks	7
Arithmetical complexity of the language of generic limit sets of cellular automata	7
Polynomial anonymous dynamic distributed computing without a unique leader	7
Succinct representation for (non)deterministic finite automata	7
Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs	7
Galactic token sliding	7
Temporal reachability minimization: Delaying vs. deleting	6
Parameterized complexity of multi-node hubs	6
Monitoring the edges of a graph using distances with given girth	6
Dual domination problems in graphs	6
The parameterized complexity of the survivable network design problem	6
Perpetual maintenance of machines with different urgency requirements	6

Editorial Board	6
Many-visits TSP revisited	5
Backdoor DNFs	5
Time-sharing scheduling with tolerance capacities	5
The satisfiability problem for a quantitative fragment of PCTL	5
Cutting corners	5
Refined notions of parameterized enumeration kernels with applications to matching cut enumeration	5
Editorial Board	5
Editorial Board	5
Editorial Board	5
On the threshold of intractability	5
A constant-factor approximation for directed latency in quasi-polynomial time	5
Polynomially ambiguous probabilistic automata on restricted languages	5
Editorial Board	4
Modular SAT-based techniques for reasoning tasks in team semantics	4
The possible winner with uncertain weights problem	4
Parameterised temporal exploration problems	4
Dense graph partitioning on sparse and dense graphs	4
On the parameterized complexity of Grid Contraction	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
Efficiently enumerating hitting sets of hypergraphs arising in data profiling	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
Approximate realizations for outerplanaric degree sequences	3
Packing arc-disjoint cycles in oriented graphs	3
Algorithms and Turing kernels for detecting and counting small patterns in unit disk graphs	3
On the parameterized complexity of interval scheduling with eligible machine sets	3
Towards declarative comparabilities: Application to functional dependencies	3
Forbidden patterns in temporal graphs resulting from encounters in a corridor	3
Absolute convergence and error thresholds in non-active adaptive sampling	3
Medians in median graphs and their cube complexes in linear time	3
Editorial Board	3
Editorial Board	3
Scheduling lower bounds via AND subset sum	3
Relating description complexity to entropy	3
Mengerian graphs: Characterization and recognition	3
Intersection joins under updates	3
A near-linear kernel for bounded-state parsimony distance	3
On minimum vertex bisection of random d-regular graphs	3
Grid recognition: Classical and parameterized computational perspectives	3