OOIR: Observatory of International Research

Papers

(The median citation count of Journal of Computer and System Sciences is 1. 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
The maximal coordination principle in regulatory Boolean networks	13
Solving problems on generalized convex graphs via mim-width	13
Deterministic non-adaptive contention resolution on a shared channel	12
Etherless Ethereum tokens: Simulating native tokens in Ethereum	11
The 2CNF Boolean formula satisfiability problem and the linear space hypothesis	9
Complexity framework for forbidden subgraphs IV: The Steiner Forest problem	9
Editorial Board	9
Parameterized complexity of dominating set variants in almost cluster and split graphs	8
Approximating the existential theory of the reals	8
Performance modeling and analysis for randomly walking mobile users with Markov chains	8
Editorial Board	8
Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs	7
Galactic token sliding	7
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
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
Temporal reachability minimization: Delaying vs. deleting	6

Parameterized complexity of multi-node hubs	6
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
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
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
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
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
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
More on change-making and related problems	2
Normalized information distance and the oscillation hierarchy	2
Single-exponential FPT algorithms for enumerating secluded F-free subgraphs a	2
The complexity of binary matrix completion under diameter constraints	2
The complexity of online bribery in sequential elections	2
Instability of backoff protocols with arbitrary arrival rates	2
Improved prophet inequalities for combinatorial welfare maximization with (approximately) subadditive agents	2
Fine-grained complexity of rainbow coloring and its variants	2
Reducing the vertex cover number via edge contractions	2

On coresets for fair clustering in metric and Euclidean spaces and their applications	2
A new temporal interpretation of cluster editing	2
Weighted group search on the disk & improved lower bounds for priority evacuation	2
Priority Promotion with Parysian flair	2
Decentralized deadlock-free enforcement of message orderings in message-based systems	2
An almost optimal approximation algorithm for monotone submodular multiple knapsack	2
Reconstructing semi-directed level-1 networks using few quarnets	2
The Projection Games Conjecture and the hardness of approximation of super-SAT and related problems	2
Lower bounds for Boolean circuits of bounded negation width	2
The complexity of transitively orienting temporal graphs	2
Online computation with untrusted advice	2
Quantum random access stored-program machines	2
Resource-bounded Kolmogorov complexity provides an obstacle to soficness of multidimensional shifts	2
PAC learning halfspaces in non-interactive local differential privacy model with public unlabeled data	2
A modeling approach for estimating performance and energy consumption of storage systems	2
A 4 + ϵ approximation for k-connected subgraphs	2
Addition machines, automatic functions and open problems of Floyd and Knuth	2
Bounding the number of reticulation events for displaying multiple trees in a phylogenetic network	2
Editorial Board	2
The complexity of growing a graph	1
Faster compressed quadtrees	1
Editorial Board	1
A dichotomy for bounded degree graph homomorphisms with nonnegative weights	1
From symmetry to asymmetry: Generalizing TSP approximations by parametrization	1
Editorial Board	1
An FPT algorithm for timeline cover	1
The edit distance to k-subsequence universality	1
Weighted online search	1
Bankrupting Sybil despite churn	1
Monitoring the edges of product networks using distances	1
Editorial Board	1
The weighted HOM-problem over fields	1
Editorial Board	1
Synchronizing Boolean networks asynchronously	1
Computing Weighted Subset Odd Cycle Transversals in H-free graphs	1
Acyclic, star and injective colouring: A complexity picture for H-free graphs	1
Editorial Board	1
Parameterized results on acyclic matchings with implications for related problems	1
Approximate CVP in time 20.802	1
Induced Disjoint Paths in AT-free graphs	1
Corrigendum to “Prediction, learning, uniform convergence, and scale-sensitive dimensions” [J. Comput. Syst. Sci. 56 (2) (1998) 174–190]	1
Preprocessing to reduce the search space: Antler structures for feedback vertex set	1
Induced tree covering and the generalized Yutsis property	1
The tree-child network inference problem for line trees and the shortest common supersequence problem for permutation strings	1
Bipartite 3-regular counting problems with mixed signs	1
Orienting undirected phylogenetic networks	1
An extension of the Moran process using type-specific connection graphs	1
Approximation algorithms for clustering with dynamic points	1
Building squares with optimal state complexity in restricted active self-assembly	1
Restrained medium access control on adversarial shared channels	1
Special Issue on the 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)	1
Controlling entity integrity with key sets	1
Editorial Board	1
Unlabeled sample compression schemes and corner peelings for ample and maximum classes	1
Latency, capacity, and distributed minimum spanning trees	1
Editorial Board	1
Improved IP lookup technology for trie-based data structures	1
Editorial Board	1
Fast and succinct population protocols for Presburger arithmetic	1