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 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
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
Orthogonal planarity testing of bounded treewidth graphs	11
Online bin packing with cardinality constraints resolved	10
Grammar-compressed indexes with logarithmic search time	10
How fast can we reach a target vertex in stochastic temporal graphs?	10
Graphs are not universal for online computability	9
The temporal explorer who returns to the base	9
Subquadratic non-adaptive threshold group testing	8
An improved algorithm for the Steiner tree problem with bounded edge-length	7
TCEP: Transitions in operator placement to adapt to dynamic network environments	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
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
Word equations in non-deterministic linear space	4
Graph reconstruction in the congested clique	4
Succinct representation for (non)deterministic finite automata	4
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
Speeding-up verification of digital signatures	3
The complexity of the parity argument with potential	3
On the threshold of intractability	2
Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems	2
Complexity of the multilevel critical node problem	2
An improved algorithm for the minmax regret path center problem on trees	2
Reducing graph transversals via edge contractions	2
Computing Weighted Subset Odd Cycle Transversals in H-free graphs	2
Reachability relations of timed pushdown automata	2
On finding separators in temporal split and permutation graphs	2
A maximum clique based approximation algorithm for wireless link scheduling under SINR model	2
Measuring what matters: A hybrid approach to dynamic programming with treewidth	2
A 1.375-approximation algorithm for unsigned translocation sorting	2
Beyond operator-precedence grammars and languages	2
On approximate pure Nash equilibria in weighted congestion games with polynomial latencies	2
An almost optimal approximation algorithm for monotone submodular multiple knapsack	2
A counterexample to Thiagarajan's conjecture on regular event structures	2
Regularizing conjunctive features for classification	2
Addition machines, automatic functions and open problems of Floyd and Knuth	2
Bidding mechanisms in graph games	2
Space efficient representations of finite groups	2
O is an n-MCFL	2
Bivariate B-splines from convex configurations	2
Equivalence of pushdown automata via first-order grammars	2
Discriminantal subset convolution: Refining exterior-algebraic methods for parameterized algorithms	2
Equivalence checking of quantum finite-state machines	2
The tree-generative capacity of combinatory categorial grammars	2
Automatic Kolmogorov complexity, normality, and finite-state dimension revisited	2
Universal stability in multi-hop radio networks	2
An extension of the Moran process using type-specific connection graphs	2
Greedy routing and the algorithmic small-world phenomenon	2
The 2CNF Boolean formula satisfiability problem and the linear space hypothesis	2
A dichotomy for bounded degree graph homomorphisms with nonnegative weights	2
Multi-round cooperative search games with multiple players	2
A 4 + ϵ approximation for k-connected subgraphs	2
Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem	2
Attack and defense in the layered cyber-security model and their (1 ± ϵ)-approximation schemes	2
Deterministic protocols in the SINR model without knowledge of coordinates	1
Parameterized complexity of multi-node hubs	1
Polynomial time approximation schemes for clustering in low highway dimension graphs	1
Descriptive complexity of #P functions: A new perspective	1
Faster compressed quadtrees	1
Parameterized complexity of graph planarity with restricted cyclic orders	1
Analytic methods for reachability problems	1
On convergence and threshold properties of discrete Lotka-Volterra population protocols	1
Deciding probabilistic bisimilarity distance one for probabilistic automata	1
Computing maximum matchings in temporal graphs	1
Improved prophet inequalities for combinatorial welfare maximization with (approximately) subadditive agents	1
On injectivity of quantum finite automata	1
The satisfiability problem for a quantitative fragment of PCTL	1
Fast and succinct population protocols for Presburger arithmetic	1
(In)approximability of maximum minimal FVS	1
Dual domination problems in graphs	1
Your rugby mates don't need to know your colleagues: Triadic closure with edge colors	1
Fine-grained complexity of rainbow coloring and its variants	1
Absolute convergence and error thresholds in non-active adaptive sampling	1
How heavy independent sets help to find arborescences with many leaves in DAGs	1
Deciding the point-to-fixed-point problem for skew tent maps on an interval	1
Preprocessing vertex-deletion problems: Characterizing graph properties by low-rank adjacencies	1
Multistage knapsack	1
Polynomially ambiguous probabilistic automata on restricted languages	1
Markov chains and unambiguous automata	1
SAT backdoors: Depth beats size	1
Cutting corners	1
Wireless IoT sensors data collection reward maximization by leveraging multiple energy- and storage-constrained UAVs	1
A physically universal Turing machine	1
Length-bounded cuts: Proper interval graphs and structural parameters	1
Descriptive complexity of deterministic polylogarithmic time and space	1
Deep kernelization for the Tree Bisection and Reconnection (TBR) distance in phylogenetics	1
Almost optimal query algorithm for hitting set using a subset query	1
Single-source shortest paths and strong connectivity in dynamic planar graphs	1
Circular pattern matching with k mismatches	1
Building squares with optimal state complexity in restricted active self-assembly	1
Linear-time 2-party secure merge from additively homomorphic encryption	1
Online bin covering with limited migration	1
Optimal channel utilization with limited feedback	1
Solving problems on generalized convex graphs via mim-width	1
Non-essential arcs in phylogenetic networks	1