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

Article	Citations
On temporal graph exploration	24
Deleting edges to restrict the size of an epidemic in temporal networks	21
Counting and enumerating tree-child networks and their subclasses	20
On Weisfeiler-Leman invariance: Subgraph counts and related graph properties	20
A secure searchable encryption scheme for cloud using hash-based indexing	19
Unique end of potential line	17
Temporal cliques admit sparse spanners	16
The Hairy Ball problem is PPAD-complete	13
Sliding window temporal graph coloring	13
Orthogonal planarity testing of bounded treewidth graphs	12
Assigning times to minimise reachability in temporal graphs	12
Computing exact solutions of consensus halving and the Borsuk-Ulam theorem	12
Block trees	11
How fast can we reach a target vertex in stochastic temporal graphs?	11
The complexity of reachability in parametric Markov decision processes	11
Grammar-compressed indexes with logarithmic search time	10
The temporal explorer who returns to the base	9
Lattice-based unidirectional infinite-use proxy re-signatures with private re-signature key	8
TCEP: Transitions in operator placement to adapt to dynamic network environments	8
An efficiently computable characterization of stability and instability for linear cellular automata	7
Minimizing the operation cost of distributed green data centers with energy storage under carbon capping	7
Refined notions of parameterized enumeration kernels with applications to matching cut enumeration	7
An improved algorithm for the Steiner tree problem with bounded edge-length	7
Unlabeled sample compression schemes and corner peelings for ample and maximum classes	6
The possible winner with uncertain weights problem	6

Renaissance: A self-stabilizing distributed SDN control plane using in-band communications	6
Coloring temporal graphs	6
Complexity of fixed point counting problems in Boolean networks	6
Subexponential algorithm for d-cluster edge deletion: Exception or rule?	6
Improved distance sensitivity oracles with subcubic preprocessing time	6
When are emptiness and containment decidable for probabilistic automata?	5
Additive approximation algorithms for modularity maximization	5
Preimage problems for deterministic finite automata	5
More on change-making and related problems	5
Induced Disjoint Paths in AT-free graphs	5
Medians in median graphs and their cube complexes in linear time	5
Word equations in non-deterministic linear space	5
On the profits of competing cloud service providers: A game theoretic approach	5
Secure-channel free searchable encryption with multiple keywords: A generic construction, an instantiation, and its implementation	5
Scheduling lower bounds via AND subset sum	4
Graph reconstruction in the congested clique	4
A modeling approach for estimating performance and energy consumption of storage systems	4
Disconnected cuts in claw-free graphs	4
Approximate CVP in time 20.802	4
Speeding-up verification of digital signatures	4
Understanding PPA-completeness	4
Equivalence checking of quantum finite-state machines	4
Incompressibility of H-free edge modification problems: Towards a dichotomy	4
Polynomial anonymous dynamic distributed computing without a unique leader	4
Approximating the existential theory of the reals	4
Exploration of dynamic networks: Tight bounds on the number of agents	4
Beyond operator-precedence grammars and languages	4
Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures	4
Succinct representation for (non)deterministic finite automata	4
Intersection joins under updates	4
Uniform parsing for hyperedge replacement grammars	4
Measuring what matters: A hybrid approach to dynamic programming with treewidth	4
Finding connected secluded subgraphs	4
Multistage knapsack	3
Complexity of stability	3
Counting subset repairs with functional dependencies	3
A Turing kernelization dichotomy for structural parameterizations of F-Minor-	3
The Projection Games Conjecture and the hardness of approximation of super-SAT and related problems	3
Quantum random access stored-program machines	3
A 43-approximati	3
A 1.375-approximation algorithm for unsigned translocation sorting	3
The complexity of the parity argument with potential	3
Many-visits TSP revisited	3
Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs	3
On the fast delivery problem with one or two packages	3
Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic	3
Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem	3
A maximum clique based approximation algorithm for wireless link scheduling under SINR model	3
Computing maximum matchings in temporal graphs	3
Maximum parsimony distance on phylogenetic trees: A linear kernel and constant factor approximation algorithm	3

Parameterized k-Clustering: Tractability island	3
Perpetual maintenance of machines with different urgency requirements	3
Automatic Kolmogorov complexity, normality, and finite-state dimension revisited	3
Bisection of bounded treewidth graphs by convolutions	3
O is an n-MCFL	3