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 2020-07-01 to 2024-07-01.)

Article	Citations
On temporal graph exploration	22
Counting and enumerating tree-child networks and their subclasses	20
Deleting edges to restrict the size of an epidemic in temporal networks	19
On Weisfeiler-Leman invariance: Subgraph counts and related graph properties	17
Unique end of potential line	17
A secure searchable encryption scheme for cloud using hash-based indexing	15
Temporal cliques admit sparse spanners	14
The Hairy Ball problem is PPAD-complete	12
Computing exact solutions of consensus halving and the Borsuk-Ulam theorem	12
Orthogonal planarity testing of bounded treewidth graphs	11
Sliding window temporal graph coloring	11
Block trees	11
The complexity of reachability in parametric Markov decision processes	11
Assigning times to minimise reachability in temporal graphs	11
How fast can we reach a target vertex in stochastic temporal graphs?	10
Online bin packing with cardinality constraints resolved	10
Grammar-compressed indexes with logarithmic search time	10
The temporal explorer who returns to the base	9
Graphs are not universal for online computability	9
Subquadratic non-adaptive threshold group testing	8
TCEP: Transitions in operator placement to adapt to dynamic network environments	7
An improved algorithm for the Steiner tree problem with bounded edge-length	7
Refined notions of parameterized enumeration kernels with applications to matching cut enumeration	6
Minimizing the operation cost of distributed green data centers with energy storage under carbon capping	6
Complexity of fixed point counting problems in Boolean networks	6

Lattice-based unidirectional infinite-use proxy re-signatures with private re-signature key	6
Improved distance sensitivity oracles with subcubic preprocessing time	6
Renaissance: A self-stabilizing distributed SDN control plane using in-band communications	6
Subexponential algorithm for d-cluster edge deletion: Exception or rule?	6
The possible winner with uncertain weights problem	6
Unlabeled sample compression schemes and corner peelings for ample and maximum classes	5
Additive approximation algorithms for modularity maximization	5
Secure-channel free searchable encryption with multiple keywords: A generic construction, an instantiation, and its implementation	5
Induced Disjoint Paths in AT-free graphs	5
Coloring temporal graphs	5
Preimage problems for deterministic finite automata	5
The computational power of parsing expression grammars	5
Eccentricity terrain of δ-hyperbolic graphs	5
Word equations in non-deterministic linear space	4
Graph reconstruction in the congested clique	4
Succinct representation for (non)deterministic finite automata	4
Uniform parsing for hyperedge replacement grammars	4
Understanding PPA-completeness	4
An efficiently computable characterization of stability and instability for linear cellular automata	4
Incompressibility of H-free edge modification problems: Towards a dichotomy	4
A modeling approach for estimating performance and energy consumption of storage systems	4
Disconnected cuts in claw-free graphs	4
More on change-making and related problems	4
Scheduling lower bounds via AND subset sum	4
Intersection joins under updates	4
Approximating the existential theory of the reals	4
Exploration of dynamic networks: Tight bounds on the number of agents	4
Speeding-up verification of digital signatures	3
The complexity of the parity argument with potential	3
When are emptiness and containment decidable for probabilistic automata?	3
Counting subset repairs with functional dependencies	3
On the profits of competing cloud service providers: A game theoretic approach	3
Perpetual maintenance of machines with different urgency requirements	3
Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic	3
Approximate CVP in time 20.802	3
Quantum random access stored-program machines	3
Finding connected secluded subgraphs	3
Maximum parsimony distance on phylogenetic trees: A linear kernel and constant factor approximation algorithm	3
Many-visits TSP revisited	3
Parameterized k-Clustering: Tractability island	3
On the fast delivery problem with one or two packages	3
Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures	3
Polynomial anonymous dynamic distributed computing without a unique leader	3
Bisection of bounded treewidth graphs by convolutions	3
A 43-approximati	3
Distributed reconfiguration of maximal independent sets	3
Complexity of stability	3
A multivariate analysis of the strict terminal connection problem	3
Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs	3
The Projection Games Conjecture and the hardness of approximation of super-SAT and related problems	3

A Turing kernelization dichotomy for structural parameterizations of F-Minor-	3
Medians in median graphs and their cube complexes in linear time	3
Complexity of control in judgment aggregation for uniform premise-based quota rules	3