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 2021-08-01 to 2025-08-01.)

Article	Citations
Rank and select operations on a word	20
A note on the network coloring game: A randomized distributed (Δ + 1)-coloring algorithm	18
Tighter bound for generalized multiple discrete logarithm problem via MDS matrix method	15
Polynomial invariants for cactuses	14
On matrices potentially useful for tree codes	11
Waypoint routing on bounded treewidth graphs	11
Editorial Board	11
Geometric separability using orthogonal objects	8
Density of distinct squares in non-primitive words	7
A note on the satisfactory partition problem: Constant size requirement	7
On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees	7
On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions	7
A note on the method of equal shares	6
Local linear set on graphs with bounded twin cover number	6
Embedded edge connectivity of k-ary n-cubes	6
Recognizing well-dominated graphs is coNP-complete	6
Metric distortion of obnoxious distributed voting	6
Grid straight-line embeddings of trees with a minimum number of bends per path	6
Editorial Board	5
The longest common subsequence problem for small alphabets in the word RAM model	5
Tight inapproximability of Nash equilibria in public goods games	5
Bounds and algorithms for generalized superimposed codes	5
Recursion-free modular arithmetic in the lambda-calculus	5
Faster deterministic algorithm for Cactus Vertex Deletion	5
Catalan and Schröder permutations sortable by two restricted stacks	4

Editorial Board	4
Simplicity in Eulerian circuits: Uniqueness and safety	4
Editorial Board	4
A constant-time sampling algorithm for binary Gaussian distribution over the integers	4
Long directed detours: Reduction to 2-Disjoint Paths	4
Fault-tolerant Hamiltonicity of hypercubes with faulty subcubes	4
A short note on “A note on single-machine scheduling with job-dependent learning effects”	4
Heavy and light paths and Hamilton cycles	4
The first Zagreb index, reciprocal degree distance and Hamiltonian-connectedness of graphs	4
Instability results for cosine-dissimilarity-based nearest neighbor search on high dimensional Gaussian data	4
Online delay management on a single train line with predictions	4
Exact PPS sampling with bounded sample size	4
Editorial Board	4
Editorial Board	4
Editorial Board	4
Smoothness of Schatten norms and sliding-window matrix streams	4
Editorial Board	3
Transforming plane triangulations by simultaneous diagonal flips	3
Long paths in heterogeneous random subgraphs of graphs with large minimum degree	3
On-line exploration of rectangular cellular environments with a rectangular hole	3
Linear discrepancy is Π2-hard to approximate	3
On Voronoi visibility maps of 1.5D terrains with multiple viewpoints	3
A new class of generalized almost perfect nonlinear monomial functions	3
Order-preserving pattern matching with scaling	3
A real polynomial for bipartite graph minimum weight perfect matchings	3
The group factorization problem in finite groups of Lie type	3
Robust scheduling for minimizing maximum lateness on a serial-batch processing machine	3
On public-coin zero-error randomized communication complexity	3
Inapproximability of counting independent sets in linear hypergraphs	3
Weighted well-covered graphs without cycles of lengths 5, 6 and 7	3
Weighted fair division of indivisible items: A review	3
Luby's MIS algorithms made self-stabilizing	3
Thou shalt covet the average of thy neighbors' cakes	3
On size-independent sample complexity of ReLU networks	3
Strong edge-colorings of sparse graphs with 3Δ − 1 colors	3
Hamiltonian cycles and paths in hypercubes with disjoint faulty edges	3
Public-key encryption scheme with optimal continuous leakage resilience	3
A simple 4-approximation algorithm for maximum agreement forests on multiple unrooted binary trees	3
Discrete load balancing on complete bipartite graphs	3
Analyzing Residual Random Greedy for monotone submodular maximization	3
Exploring the optimality of byte-wise permutations of a piccolo-type block cipher	2
String searching with mismatches using AVX2 and AVX-512 instructions	2
On some decidability questions concerning supports of rational series	2
Improved kernels for tracking paths	2
A note on matching-cut in P-free graphs	2
Algorithmic results in Roman dominating functions on graphs	2
An improved uniform convergence bound with fat-shattering dimension	2
Entailment is Undecidable for Symbolic Heap Separation Logic Formulæ with Non-Established Inductive Rules	2
Friends-and-strangers is PSPACE-complete	2
Packing batches of items into a single bin	2

Palindromic trees for a sliding window and its applications	2
Editorial Board	2
Packing batches of cubes into a single bin	2
On optimization problems in acyclic hypergraphs	2
Relating planar graph drawings to planar satisfiability problems	2
Results and conjectures on the role of the uniform distribution in the coupon collector's problem with group drawings	2
Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance	2
A nearly tight lower bound for the d-dimensional cow-path problem	2
Testing gap k-planarity is NP-complete	2
Two-level hub Steiner trees	2
An algorithm for reconstructing level-2 phylogenetic networks from trinets	2
A 22k-approximation	2
Synchronizing words under LTL constraints	2
A refined approximation for Euclidean k-means	2
On conflict-free cuts: Algorithms and complexity	2
Online single-machine scheduling to minimize the linear combination of makespans of two agents	2
On regularity of Max-CSPs and Min-CSPs	2
Editorial Board	2
Tight FPT Approximation for Socially Fair Clustering	2
Computing the k densest subgraphs of a graph	2
Security weakness of a certificate-based proxy signature scheme for IIoT environments	2
On the parameterized complexity of the Maximum Exposure Problem	2
The facility location problem with maximum distance constraint	2