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

Article	Citations
Deleting edges to restrict the size of an epidemic in temporal networks	18
On Weisfeiler-Leman invariance: Subgraph counts and related graph properties	17
On temporal graph exploration	16
Counting and enumerating tree-child networks and their subclasses	15
A secure searchable encryption scheme for cloud using hash-based indexing	15
Unique end of potential line	14
Computing exact solutions of consensus halving and the Borsuk-Ulam theorem	12
Temporal cliques admit sparse spanners	11
The Hairy Ball problem is PPAD-complete	11
The complexity of reachability in parametric Markov decision processes	11
Orthogonal planarity testing of bounded treewidth graphs	10
Online bin packing with cardinality constraints resolved	10
Subexponential algorithms for variants of the homomorphism problem in string graphs	9
Graphs are not universal for online computability	9
2-D Tucker is PPA complete	9
Subquadratic non-adaptive threshold group testing	9
Block trees	9
Grammar-compressed indexes with logarithmic search time	8
Assigning times to minimise reachability in temporal graphs	8
TCEP: Transitions in operator placement to adapt to dynamic network environments	7
The temporal explorer who returns to the base	7
Clique-width and well-quasi-ordering of triangle-free graph classes	7
Vulnerability of super extra edge-connected graphs	7
Sliding window temporal graph coloring	7
How fast can we reach a target vertex in stochastic temporal graphs?	7

Subexponential algorithm for d-cluster edge deletion: Exception or rule?	6
The possible winner with uncertain weights problem	6
Lattice-based unidirectional infinite-use proxy re-signatures with private re-signature key	6
An improved algorithm for the Steiner tree problem with bounded edge-length	6
Improved distance sensitivity oracles with subcubic preprocessing time	6
Secure-channel free searchable encryption with multiple keywords: A generic construction, an instantiation, and its implementation	5
Hitting minors on bounded treewidth graphs. III. Lower bounds	5
Induced Disjoint Paths in AT-free graphs	5
A trichotomy for regular simple path queries on graphs	5
The computational power of parsing expression grammars	5
Preimage problems for deterministic finite automata	5
Renaissance: A self-stabilizing distributed SDN control plane using in-band communications	4
Minimizing the operation cost of distributed green data centers with energy storage under carbon capping	4
Graph reconstruction in the congested clique	4
Exploration of dynamic networks: Tight bounds on the number of agents	4
Word equations in non-deterministic linear space	4
Refined notions of parameterized enumeration kernels with applications to matching cut enumeration	4
Additive approximation algorithms for modularity maximization	4
Uniform parsing for hyperedge replacement grammars	4
Maximum parsimony distance on phylogenetic trees: A linear kernel and constant factor approximation algorithm	4
An efficiently computable characterization of stability and instability for linear cellular automata	4
Eccentricity terrain of δ-hyperbolic graphs	4
Approximating the existential theory of the reals	4
Succinct representation for (non)deterministic finite automata	3
Polynomial anonymous dynamic distributed computing without a unique leader	3
On the degrees of non-regularity and non-context-freeness	3
Bisection of bounded treewidth graphs by convolutions	3
A 43-approximati	3
Finding connected secluded subgraphs	3
Counting subset repairs with functional dependencies	3
Unlabeled sample compression schemes and corner peelings for ample and maximum classes	3
On the fast delivery problem with one or two packages	3
Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence	3
Incompressibility of H-free edge modification problems: Towards a dichotomy	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
Speeding-up verification of digital signatures	3
Understanding PPA-completeness	3
Parameterized k-Clustering: Tractability island	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
Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures	3
A modeling approach for estimating performance and energy consumption of storage systems	3
Intersection joins under updates	3
Complexity of fixed point counting problems in Boolean networks	3
Disconnected cuts in claw-free graphs	3
Bivariate B-splines from convex configurations	3
Distributed reconfiguration of maximal independent sets	3
Many-visits TSP revisited	3
Scheduling lower bounds via AND subset sum	3

On the profits of competing cloud service providers: A game theoretic approach	3
The Projection Games Conjecture and the hardness of approximation of super-SAT and related problems	3