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

Article	Citations
The odd chromatic number of a toroidal graph is at most 9	20
Packing batches of cubes into a single bin	17
Packing batches of items into a single bin	15
String searching with mismatches using AVX2 and AVX-512 instructions	11
A polylogarithmic approximation algorithm for 2-edge-connected dominating set	11
On conflict-free cuts: Algorithms and complexity	10
A note on the satisfactory partition problem: Constant size requirement	9
There is no APTAS for 2-dimensional vector bin packing: Revisited	8
On matrices potentially useful for tree codes	7
Spectral independence, coupling, and the spectral gap of the Glauber dynamics	6
Computability by monadic second-order logic	6
Editorial Board	6
Algorithms for deletion problems on split graphs	6
Comment on “An enhanced and secured RSA public cryptosystem algorithm using Chinese remainder theorem (ESRPKC)”	5
On the parameterized complexity of the Maximum Exposure Problem	5
Quantitative controller synthesis for consumption Markov decision processes	5
Polynomial recognition of vulnerable multi-commodities	5
Editorial Board	5
On the security of TrCBC	5
Faster deterministic algorithm for Co-Path Set	5
Embedded edge connectivity of k-ary n-cubes	5
On product decomposition	5
The autocorrelation of a class of quaternary sequences of length pq with high complexity	4
Unbiased estimation of inner product via higher order count sketch	4
Exploring the optimality of byte-wise permutations of a piccolo-type block cipher	4

Sparsifying Count Sketch	4
Tight bounds for reachability problems on one-counter and pushdown systems	4
Smaller kernels for two vertex deletion problems	4
Density of distinct squares in non-primitive words	4
Computing minimal solutions to the ring loading problem	4
A note on the fine-grained complexity of MIS on regular graphs	4
On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions	4
Editorial Board	4
Expressive completeness by separation for discrete time interval temporal logic with expanding modalities	4
Vertex degrees and 2-cuts in graphs with many hamiltonian vertex-deleted subgraphs	3
A note on the concrete hardness of the shortest independent vector in lattices	3
Polynomial invariants for cactuses	3
Kruskal with embedded C-semirings to solve MST problems with partially-ordered costs	3
Minimum projective linearizations of trees in linear time	3
Faster counting empty convex polygons in a planar point set	3
Regular resolution effectively simulates resolution	3
Skolem and positivity completeness of ergodic Markov chains	3
Rank and select operations on a word	3
Waypoint routing on bounded treewidth graphs	3
Distributivity and residuation for lexicographic orders	3
The maximum linear arrangement problem for trees under projectivity and planarity	3
The group factorization problem in finite groups of Lie type	3
Space-efficient Huffman codes revisited	3
Finding (s,d)-hypernetworks in F-hypergraphs is NP-hard	3
On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees	3
Transforming plane triangulations by simultaneous diagonal flips	3
On parallel time in population protocols	3
Further results on the second relative greedy weight of 3-dimensional codes	3
The envy-free matching problem with pairwise preferences	3
Deterministic treasure hunt and rendezvous in arbitrary connected graphs	2
Faster deterministic algorithm for Cactus Vertex Deletion	2
The complexity of finding temporal separators under waiting time constraints	2
Reducing the space used by the sieve of Eratosthenes when factoring	2
A refined approximation for Euclidean k-means	2
Geometric separability using orthogonal objects	2
Algorithms with improved delay for enumerating connected induced subgraphs of a large cardinality	2
A diameter-revealing proof of the Bondy-Lovász lemma	2
Defying gravity and gadget numerosity: The complexity of the Hanano Puzzle and beyond	2
Ranking and unranking bordered and unbordered words	2
Corrigendum to “Revisiting reachability in polynomial interrupt timed automata” [Information Processing Letters 174 (2022) 106208]	2
Leveraging parameterized Chernoff bounds for simplified algorithm analyses	2
The complexity of comparing optimal solutions	2
Tight lower bound for average number of terms in optimal double-base number system using information-theoretic tools	2
Hardness and tractability of the γ-Complete Subgraph problem	2
Erasure and error correcting ability of Parikh matrices	2
Tighter bound for generalized multiple discrete logarithm problem via MDS matrix method	2
On computing Pareto optimal paths in weighted time-dependent networks	2
A note on the network coloring game: A randomized distributed (Δ + 1)-coloring algorithm	2
Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost	2
On the k-means/median cost function	2

Satisfying the restricted isometry property with the optimal number of rows and slightly less randomness	2
Local linear set on graphs with bounded twin cover number	2
Guided blocks WOM codes	2
An efficient algorithm for identifying rainbow ortho-convex 4-sets in k-colored point sets	2
Robbins and Ardila meet Berstel	2
A lower bound for the Quickhull convex hull algorithm that disproves the Quickhull precision conjecture	2
A 22k-approximation	2
Optimal randomized algorithms of weakly-balanced multi-branching AND-OR trees	2
NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times	2
Robust scheduling for minimizing maximum lateness on a serial-batch processing machine	2
An asymptotically tight online algorithm for m-Steiner Traveling Salesman Problem	2
Editorial Board	2
Surveying definitions of election verifiability	2
Recognizing well-dominated graphs is coNP-complete	2
The facility location problem with maximum distance constraint	2
A non-clausal tableau calculus for MinSat	2
End vertices of graph searches on bipartite graphs	2