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

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

The parameterized complexity of the survivable network design problem	6
Perpetual maintenance of machines with different urgency requirements	6
Editorial Board	6
Monitoring the edges of a graph using distances with given girth	6
Many-visits TSP revisited	5
A constant-factor approximation for directed latency in quasi-polynomial time	5
Editorial Board	5
Cutting corners	5
Backdoor DNFs	5
Representation of ordered trees with a given degree distribution	5
On the threshold of intractability	5
Temporal reachability minimization: Delaying vs. deleting	5
Optimal channel utilization with limited feedback	5
Parameterised temporal exploration problems	4
A maximum clique based approximation algorithm for wireless link scheduling under SINR model	4
Dense graph partitioning on sparse and dense graphs	4
On the parameterized complexity of Grid Contraction	4
Approximate realizations for outerplanaric degree sequences	4
The satisfiability problem for a quantitative fragment of PCTL	4
Polynomially ambiguous probabilistic automata on restricted languages	4
Modular SAT-based techniques for reasoning tasks in team semantics	4
The possible winner with uncertain weights problem	4
Mengerian graphs: Characterization and recognition	4
Refined notions of parameterized enumeration kernels with applications to matching cut enumeration	4
Time-sharing scheduling with tolerance capacities	4
Space characterizations of complexity measures and size-space trade-offs in propositional proof systems	4
Efficiently enumerating hitting sets of hypergraphs arising in data profiling	4
Intersection joins under updates	4
Algorithms and Turing kernels for detecting and counting small patterns in unit disk graphs	3
A near-linear kernel for bounded-state parsimony distance	3
On minimum vertex bisection of random d-regular graphs	3
Editorial Board	3
Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures	3
Editorial Board	3
On the parameterized complexity of interval scheduling with eligible machine sets	3
Packing arc-disjoint cycles in oriented graphs	3
Medians in median graphs and their cube complexes in linear time	3
On the parameterized complexity of clustering problems for incomplete data	3
Towards declarative comparabilities: Application to functional dependencies	3
Absolute convergence and error thresholds in non-active adaptive sampling	3
A 4 + ϵ approximation for k-connected subgraphs	2
A new temporal interpretation of cluster editing	2
Normalized information distance and the oscillation hierarchy	2
Lower bounds for Boolean circuits of bounded negation width	2
Scheduling lower bounds via AND subset sum	2
Exploration of dynamic networks: Tight bounds on the number of agents	2
An almost optimal approximation algorithm for monotone submodular multiple knapsack	2
A modeling approach for estimating performance and energy consumption of storage systems	2
On coresets for fair clustering in metric and Euclidean spaces and their applications	2
Editorial Board	2

Priority Promotion with Parysian flair	2
Reducing the vertex cover number via edge contractions	2
Bivariate B-splines from convex configurations	2
Forbidden patterns in temporal graphs resulting from encounters in a corridor	2
Single-exponential FPT algorithms for enumerating secluded F-free subgraphs a	2
Resource-bounded Kolmogorov complexity provides an obstacle to soficness of multidimensional shifts	2
Decentralized deadlock-free enforcement of message orderings in message-based systems	2
A 43-approximati	2
Reducing graph transversals via edge contractions	2
PAC learning halfspaces in non-interactive local differential privacy model with public unlabeled data	2
Improved prophet inequalities for combinatorial welfare maximization with (approximately) subadditive agents	2
Online computation with untrusted advice	2
Relating description complexity to entropy	2
Grid recognition: Classical and parameterized computational perspectives	2
More on change-making and related problems	2
The complexity of binary matrix completion under diameter constraints	2
Fine-grained complexity of rainbow coloring and its variants	2
Addition machines, automatic functions and open problems of Floyd and Knuth	2
The complexity of transitively orienting temporal graphs	2
Quantum random access stored-program machines	2