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-04-01 to 2024-04-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	17
Counting and enumerating tree-child networks and their subclasses	16
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	12
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
Grammar-compressed indexes with logarithmic search time	10
Block trees	9
Assigning times to minimise reachability in temporal graphs	9
Sliding window temporal graph coloring	9
Graphs are not universal for online computability	9
Subexponential algorithms for variants of the homomorphism problem in string graphs	9
Subquadratic non-adaptive threshold group testing	9
How fast can we reach a target vertex in stochastic temporal graphs?	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
The temporal explorer who returns to the base	7
The possible winner with uncertain weights problem	6
Subexponential algorithm for d-cluster edge deletion: Exception or rule?	6

Improved distance sensitivity oracles with subcubic preprocessing time	6
Lattice-based unidirectional infinite-use proxy re-signatures with private re-signature key	6
Induced Disjoint Paths in AT-free graphs	5
Eccentricity terrain of δ-hyperbolic graphs	5
Hitting minors on bounded treewidth graphs. III. Lower bounds	5
The computational power of parsing expression grammars	5
Secure-channel free searchable encryption with multiple keywords: A generic construction, an instantiation, and its implementation	5
Minimizing the operation cost of distributed green data centers with energy storage under carbon capping	5
Preimage problems for deterministic finite automata	5
Maximum parsimony distance on phylogenetic trees: A linear kernel and constant factor approximation algorithm	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
Word equations in non-deterministic linear space	4
An efficiently computable characterization of stability and instability for linear cellular automata	4
Graph reconstruction in the congested clique	4
Approximating the existential theory of the reals	4
Renaissance: A self-stabilizing distributed SDN control plane using in-band communications	4
Unlabeled sample compression schemes and corner peelings for ample and maximum classes	4
Complexity of fixed point counting problems in Boolean networks	4
Exploration of dynamic networks: Tight bounds on the number of agents	4
Polynomial anonymous dynamic distributed computing without a unique leader	3
Bisection of bounded treewidth graphs by convolutions	3
Bivariate B-splines from convex configurations	3
Finding connected secluded subgraphs	3
Many-visits TSP revisited	3
Scheduling lower bounds via AND subset sum	3
On the fast delivery problem with one or two packages	3
The Projection Games Conjecture and the hardness of approximation of super-SAT and related problems	3
Medians in median graphs and their cube complexes in linear time	3
Incompressibility of H-free edge modification problems: Towards a dichotomy	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
Complexity of stability	3
Counting subset repairs with functional dependencies	3
Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs	3
On the profits of competing cloud service providers: A game theoretic approach	3
Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence	3
Succinct representation for (non)deterministic finite automata	3
A modeling approach for estimating performance and energy consumption of storage systems	3
Disconnected cuts in claw-free graphs	3
A 43-approximati	3
Distributed reconfiguration of maximal independent sets	3
Parameterized k-Clustering: Tractability island	3
A multivariate analysis of the strict terminal connection problem	3
A Turing kernelization dichotomy for structural parameterizations of F-Minor-	3
Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures	3
Intersection joins under updates	3
Regularizing conjunctive features for classification	2

An extension of the Moran process using type-specific connection graphs	2
Attack and defense in the layered cyber-security model and their (1 ± ϵ)-approximation schemes	2
Greedy routing and the algorithmic small-world phenomenon	2
Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems	2
Multi-round cooperative search games with multiple players	2
On the threshold of intractability	2
Measuring what matters: A hybrid approach to dynamic programming with treewidth	2
An almost optimal approximation algorithm for monotone submodular multiple knapsack	2
Coloring temporal graphs	2
Reducing graph transversals via edge contractions	2
A 1.375-approximation algorithm for unsigned translocation sorting	2
Universal stability in multi-hop radio networks	2
Equivalence of pushdown automata via first-order grammars	2
Approximate CVP in time 20.802	2
Equivalence checking of quantum finite-state machines	2
O is an n-MCFL	2
When are emptiness and containment decidable for probabilistic automata?	2
Automatic Kolmogorov complexity, normality, and finite-state dimension revisited	2
On approximate pure Nash equilibria in weighted congestion games with polynomial latencies	2
Complete simulation of automata networks	2
Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic	2
The complexity of the parity argument with potential	2
A dichotomy for bounded degree graph homomorphisms with nonnegative weights	2
Beyond operator-precedence grammars and languages	2
Reachability relations of timed pushdown automata	2
Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin	2
Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem	2
A counterexample to Thiagarajan's conjecture on regular event structures	2
Complexity of the multilevel critical node problem	2
The tree-generative capacity of combinatory categorial grammars	2
Perpetual maintenance of machines with different urgency requirements	1
A 4 + ϵ approximation for k-connected subgraphs	1
Length-bounded cuts: Proper interval graphs and structural parameters	1
A maximum clique based approximation algorithm for wireless link scheduling under SINR model	1
Deterministic protocols in the SINR model without knowledge of coordinates	1
A physically universal Turing machine	1
Descriptive complexity of deterministic polylogarithmic time and space	1
Faster compressed quadtrees	1
Absolute convergence and error thresholds in non-active adaptive sampling	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
More on change-making and related problems	1
On finding separators in temporal split and permutation graphs	1
Cutting corners	1
Complexity of verification in self-assembly with prebuilt assemblies	1
Wireless IoT sensors data collection reward maximization by leveraging multiple energy- and storage-constrained UAVs	1
Online bin covering with limited migration	1
Dual domination problems in graphs	1
Using decomposition-parameters for QBF: Mind the prefix!	1
(In)approximability of maximum minimal FVS	1
When are epsilon-nets small?	1
Faster Graph bipartization	1
Fine-grained complexity of rainbow coloring and its variants	1
Addition machines, automatic functions and open problems of Floyd and Knuth	1
Orienting undirected phylogenetic networks	1
Computing Weighted Subset Odd Cycle Transversals in H-free graphs	1
Deletion to scattered graph classes II - improved FPT algorithms for deletion to pairs of graph classes	1
Single-source shortest paths and strong connectivity in dynamic planar graphs	1
Balanced allocation on hypergraphs	1
Quantum random access stored-program machines	1
Discriminantal subset convolution: Refining exterior-algebraic methods for parameterized algorithms	1
Efficiently enumerating hitting sets of hypergraphs arising in data profiling	1
On injectivity of quantum finite automata	1
Deciding probabilistic bisimilarity distance one for probabilistic automata	1
Your rugby mates don't need to know your colleagues: Triadic closure with edge colors	1
Space efficient representations of finite groups	1
Parameterized complexity of multi-node hubs	1
An improved algorithm for the minmax regret path center problem on trees	1
Polynomial time approximation schemes for clustering in low highway dimension graphs	1
Descriptive complexity of #P functions: A new perspective	1
Parameterized complexity of graph planarity with restricted cyclic orders	1
Optimal channel utilization with limited feedback	1
The complexity of synthesizing elementary net systems relative to natural parameters	1
Multistage knapsack	1
Analytic methods for reachability problems	1
Non-essential arcs in phylogenetic networks	1
Bidding mechanisms in graph games	1
Learning the truth vector in high dimensions	1
Improved prophet inequalities for combinatorial welfare maximization with (approximately) subadditive agents	1