OOIR: Observatory of International Research

Papers

(The TQCC of Information Processing Letters is 2. 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 2022-08-01 to 2026-08-01.)

Article	Citations
Tighter bound for generalized multiple discrete logarithm problem via MDS matrix method	23
Polynomial invariants for cactuses	12
A note on the satisfactory partition problem: Constant size requirement	12
A note on the network coloring game: A randomized distributed (Δ + 1)-coloring algorithm	9
Density of distinct squares in non-primitive words	9
Embedded edge connectivity of k-ary n-cubes	8
A note on the method of equal shares	8
On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees	8
On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions	8
Recognizing well-dominated graphs is coNP-complete	7
Metric distortion of obnoxious distributed voting	6
Faster deterministic algorithm for Cactus Vertex Deletion	6
The longest common subsequence problem for small alphabets in the word RAM model	6
Bounds and algorithms for generalized superimposed codes	6
Tight inapproximability of Nash equilibria in public goods games	5
Recursion-free modular arithmetic in the lambda-calculus	5
Logical characterization of branching bisimilarity over random processes	5
Exact PPS sampling with bounded sample size	5
Notes about the linear complexity of quaternary cyclotomic sequences of order four	5
Editorial Board	4
A short note on “A note on single-machine scheduling with job-dependent learning effects”	4
Smoothness of Schatten norms and sliding-window matrix streams	4
Online delay management on a single train line with predictions	4
Heavy and light paths and Hamilton cycles	4
Instability results for cosine-dissimilarity-based nearest neighbor search on high dimensional Gaussian data	4

Simplicity in Eulerian circuits: Uniqueness and safety	4
Editorial Board	4
Editorial Board	4
A simple 4-approximation algorithm for maximum agreement forests on multiple unrooted binary trees	4
Analyzing Residual Random Greedy for monotone submodular maximization	3
Strong edge-colorings of sparse graphs with 3Δ − 1 colors	3
The facility location problem with maximum distance constraint	3
Relating planar graph drawings to planar satisfiability problems	3
Security weakness of a certificate-based proxy signature scheme for IIoT environments	3
Friends-and-strangers is PSPACE-complete	3
On the parameterized complexity of the Maximum Exposure Problem	3
String searching with mismatches using AVX2 and AVX-512 instructions	3
On public-coin zero-error randomized communication complexity	3
On size-independent sample complexity of ReLU networks	3
Inapproximability of counting independent sets in linear hypergraphs	3
Weighted fair division of indivisible items: A review	3
Order-preserving pattern matching with scaling	3
The group factorization problem in finite groups of Lie type	3
An algorithm for reconstructing level-2 phylogenetic networks from trinets	3
On conflict-free cuts: Algorithms and complexity	3
Editorial Board	3
A 22k-approximation	3
On-line exploration of rectangular cellular environments with a rectangular hole	3
Thou shalt covet the average of thy neighbors' cakes	3
A real polynomial for bipartite graph minimum weight perfect matchings	3
The complexity of HyperQPTL	3
Long directed detours: Reduction to 2-Disjoint Paths	3
Luby's MIS algorithms made self-stabilizing	3
A new class of generalized almost perfect nonlinear monomial functions	3
Bowties and hourglasses: Intersections of double-wedges or: Stabbing and avoiding line segments	3
Robust scheduling for minimizing maximum lateness on a serial-batch processing machine	3
Packing batches of cubes into a single bin	3
Exploring the optimality of byte-wise permutations of a piccolo-type block cipher	3
Public-key encryption scheme with optimal continuous leakage resilience	3
Long paths in heterogeneous random subgraphs of graphs with large minimum degree	3
On Voronoi visibility maps of 1.5D terrains with multiple viewpoints	3
Tight FPT Approximation for Socially Fair Clustering	2
A note on matching-cut in P-free graphs	2
A universal bound on the space complexity of directed acyclic graph computations	2
On the security of TrCBC	2
Smaller kernels for two vertex deletion problems	2
Fair and truthful allocations under leveled valuations	2
LR parsing for strings with placeholders	2
Escaping Braess's paradox through approximate Caratheodory's theorem	2
Improved kernels for tracking paths	2
Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance	2
On some decidability questions concerning supports of rational series	2
An improved uniform convergence bound with fat-shattering dimension	2
Algorithmic results in Roman dominating functions on graphs	2
Static type checking without downcast operator	2

Lower bound proof for the size of BDDs representing a shifted addition	2
On approximate reconfigurability of label cover	2
Comparing approximate and probabilistic differential privacy parameters	2
Determining rate monotonic schedulability of real-time periodic tasks using continued fractions	2
Finding partite hypergraphs efficiently	2
Corrigendum to “On the complexity of co-secure dominating set problem” [Inf. Process. Lett. 185 (2024) 106463]	2
On optimization problems in acyclic hypergraphs	2
A nearly tight lower bound for the d-dimensional cow-path problem	2
Synchronizing words under LTL constraints	2
Efficient linear-time ranking and unranking of derangements	2
Anti Tai mapping for unordered labeled trees	2
Reducing the space used by the sieve of Eratosthenes when factoring	2
Monochromatic partitioning of colored points by lines	2
A weakness in OCB3 used with short nonces allowing for a break of authenticity and confidentiality	2
Domain-oriented masked bit-parallel finite-field multiplier against side-channel attacks	2
The loss of serving in the dark	2
On some families of binary codes	2
Computing the k densest subgraphs of a graph	2