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

Article	Citations
Bounded incentives in manipulating the probabilistic serial rule	24
Solving problems on generalized convex graphs via mim-width	21
The maximal coordination principle in regulatory Boolean networks	19
SAT backdoors: Depth beats size	16
Selective monitoring	14
Editorial Board	13
A 43-approximati	13
The temporal explorer who returns to the base	12
Clocked population protocols	12
Exploration of dynamic networks: Tight bounds on the number of agents	12
A 4 + ϵ approximation for k-connected subgraphs	11
Special issue on Algorithmic Theory of Dynamic Networks and Its Applications – Preface	10
Improved prophet inequalities for combinatorial welfare maximization with (approximately) subadditive agents	9
Deterministic non-adaptive contention resolution on a shared channel	8
Editorial Board	8
Online bin covering with limited migration	7
Reducing the vertex cover number via edge contractions	7
Parameterised temporal exploration problems	7
Etherless Ethereum tokens: Simulating native tokens in Ethereum	7
Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem	6
Parameterized complexity of categorical clustering with size constraints	6
O is an n-MCFL	6
Searching by heterogeneous agents	6
Covering metric spaces by few trees	6
Latency, capacity, and distributed minimum spanning trees	6

Assigning times to minimise reachability in temporal graphs	5
Minimum separator reconfiguration	5
Labeled sample compression schemes for complexes of oriented matroids	5
A maximum clique based approximation algorithm for wireless link scheduling under SINR model	5
Bivariate B-splines from convex configurations	5
A new temporal interpretation of cluster editing	5
Polynomially ambiguous probabilistic automata on restricted languages	5
The satisfiability problem for a quantitative fragment of PCTL	5
Complexity of verification in self-assembly with prebuilt assemblies	4
Corrigendum to “Prediction, learning, uniform convergence, and scale-sensitive dimensions” [J. Comput. Syst. Sci. 56 (2) (1998) 174–190]	4
Bankrupting Sybil despite churn	4
Lifting query complexity to time-space complexity for two-way finite automata	4
The 2CNF Boolean formula satisfiability problem and the linear space hypothesis	4
PAC learning halfspaces in non-interactive local differential privacy model with public unlabeled data	4
Efficiently enumerating hitting sets of hypergraphs arising in data profiling	4
Measuring what matters: A hybrid approach to dynamic programming with treewidth	4
Special Issue on the 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)	4
On finding separators in temporal split and permutation graphs	4
Space characterizations of complexity measures and size-space trade-offs in propositional proof systems	4
Approximate CVP in time 20.802	4
Speeding-up verification of digital signatures	4
Building squares with optimal state complexity in restricted active self-assembly	4
The complexity of binary matrix completion under diameter constraints	4
Editorial Board	4
Detours in directed graphs	4
Editorial Board	3
On kernels for d-path vertex cover	3
Editorial Board	3
Editorial – Special issue on Concurrency Theory (CONCUR 2018)	3
Preprocessing vertex-deletion problems: Characterizing graph properties by low-rank adjacencies	3
Preimage problems for deterministic finite automata	3
Uniform parsing for hyperedge replacement grammars	3
Approximating the existential theory of the reals	3
Largest common prefix of a regular tree language	3
Closure and nonclosure properties of the classes of compressible and rankable sets	3
Quantum random access stored-program machines	3
Bisection of bounded treewidth graphs by convolutions	3
Undecidability of the speed positiveness problem in reversible and complete Turing machines	3
46th International Colloquium on Automata, Languages and Programming (ICALP 2019) - Track C: Foundations of networks and multi-agent systems	3
Single-source shortest paths and strong connectivity in dynamic planar graphs	3
Greedy routing and the algorithmic small-world phenomenon	3
On the parameterized complexity of Grid Contraction	3
A dichotomy for bounded degree graph homomorphisms with nonnegative weights	3
Bidding mechanisms in graph games	3
Analytic methods for reachability problems	3
Reachability relations of timed pushdown automata	3