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

Article	Citations
Etherless Ethereum tokens: Simulating native tokens in Ethereum	31
Solving problems on generalized convex graphs via mim-width	30
The temporal explorer who returns to the base	23
The maximal coordination principle in regulatory Boolean networks	19
A constant-factor approximation for weighted bond cover	15
Deterministic non-adaptive contention resolution on a shared channel	15
Editorial Board	14
Approximating the existential theory of the reals	13
The 2CNF Boolean formula satisfiability problem and the linear space hypothesis	13
Succinct representation for (non)deterministic finite automata	12
Performance modeling and analysis for randomly walking mobile users with Markov chains	12
Arithmetical complexity of the language of generic limit sets of cellular automata	11
Editorial Board	10
Polynomial anonymous dynamic distributed computing without a unique leader	9
Complexity of fixed point counting problems in Boolean networks	8
Regularizing conjunctive features for classification	8
Galactic token sliding	8
Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs	8
Editorial Board	7
Perpetual maintenance of machines with different urgency requirements	7
Foreword: Selected papers from the 22nd International Symposium on Fundamentals of Computation Theory (FCT 2019)	7
The impact of state merging on predictive accuracy in probabilistic tree automata: Dietze's conjecture revisited	7
Cutting corners	6
Dual domination problems in graphs	6
Editorial Board	6

Monitoring the edges of a graph using distances with given girth	6
Parameterized complexity of multi-node hubs	6
Representation of ordered trees with a given degree distribution	6
Polynomial time approximation schemes for clustering in low highway dimension graphs	6
Temporal reachability minimization: Delaying vs. deleting	5
Refined notions of parameterized enumeration kernels with applications to matching cut enumeration	5
Backdoor DNFs	5
A constant-factor approximation for directed latency in quasi-polynomial time	5
On the threshold of intractability	5
Optimal channel utilization with limited feedback	5
Counting subset repairs with functional dependencies	5
The parameterized complexity of the survivable network design problem	5
Many-visits TSP revisited	5
Space characterizations of complexity measures and size-space trade-offs in propositional proof systems	4
Polynomially ambiguous probabilistic automata on restricted languages	4
Time-sharing scheduling with tolerance capacities	4
Efficiently enumerating hitting sets of hypergraphs arising in data profiling	4
The possible winner with uncertain weights problem	4
Maximum parsimony distance on phylogenetic trees: A linear kernel and constant factor approximation algorithm	4
Parameterised temporal exploration problems	4
A maximum clique based approximation algorithm for wireless link scheduling under SINR model	4
Modular SAT-based techniques for reasoning tasks in team semantics	4
Packing arc-disjoint cycles in oriented graphs	4
Editorial Board	4
The satisfiability problem for a quantitative fragment of PCTL	4
On the parameterized complexity of Grid Contraction	4
Intersection joins under updates	4
Algorithms and Turing kernels for detecting and counting small patterns in unit disk graphs	3
Approximate realizations for outerplanaric degree sequences	3
On the parameterized complexity of interval scheduling with eligible machine sets	3
Scheduling lower bounds via AND subset sum	3
Towards declarative comparabilities: Application to functional dependencies	3
A near-linear kernel for bounded-state parsimony distance	3
Mengerian graphs: Characterization and recognition	3
Editorial Board	3
Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures	3
Grid recognition: Classical and parameterized computational perspectives	3
On minimum vertex bisection of random d-regular graphs	3
Absolute convergence and error thresholds in non-active adaptive sampling	3
On the parameterized complexity of clustering problems for incomplete data	3
Medians in median graphs and their cube complexes in linear time	3
Editorial Board	3
Relating description complexity to entropy	3