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

Article	Citations
The odd chromatic number of a toroidal graph is at most 9	20
Packing batches of cubes into a single bin	16
Packing batches of items into a single bin	13
A polylogarithmic approximation algorithm for 2-edge-connected dominating set	11
NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times	11
A characterization of 3-γ-critical graphs which are not bicritical	9
A note on the satisfactory partition problem: Constant size requirement	8
On conflict-free cuts: Algorithms and complexity	8
Optimal randomized algorithms of weakly-balanced multi-branching AND-OR trees	6
There is no APTAS for 2-dimensional vector bin packing: Revisited	5
Isomorphism for random k-uniform hypergraphs	5
A competitive analysis for the Start-Gap algorithm for online memory wear leveling	5
On matrices potentially useful for tree codes	5
Minimum projective linearizations of trees in linear time	5
A note on the concrete hardness of the shortest independent vector in lattices	5
Kruskal with embedded C-semirings to solve MST problems with partially-ordered costs	5
Algorithms for deletion problems on split graphs	5
Space-efficient Huffman codes revisited	4
Waypoint routing on bounded treewidth graphs	4
Computability by monadic second-order logic	4
Editorial Board	4
Geometric separability using orthogonal objects	4
Further results on the second relative greedy weight of 3-dimensional codes	4
Embedded edge connectivity of k-ary n-cubes	4
Vertex degrees and 2-cuts in graphs with many hamiltonian vertex-deleted subgraphs	4

Comment on “An enhanced and secured RSA public cryptosystem algorithm using Chinese remainder theorem (ESRPKC)”	4
Spectral independence, coupling, and the spectral gap of the Glauber dynamics	4
Rank and select operations on a word	4
Polynomial recognition of vulnerable multi-commodities	4
A diameter-revealing proof of the Bondy-Lovász lemma	4
Distributivity and residuation for lexicographic orders	4
Quantitative controller synthesis for consumption Markov decision processes	3
On the parameterized complexity of the Maximum Exposure Problem	3
Editorial Board	3
Finding (s,d)-hypernetworks in F-hypergraphs is NP-hard	3
Robust scheduling for minimizing maximum lateness on a serial-batch processing machine	3
On product decomposition	3
Density of distinct squares in non-primitive words	3
On parallel time in population protocols	3
Exploring the optimality of byte-wise permutations of a piccolo-type block cipher	3
Expressive completeness by separation for discrete time interval temporal logic with expanding modalities	3
Editorial Board	3
Faster deterministic algorithm for Co-Path Set	3
On the security of TrCBC	3
Polynomial invariants for cactuses	3
Computing minimal solutions to the ring loading problem	3
A note on the network coloring game: A randomized distributed (Δ + 1)-coloring algorithm	3
On computing Pareto optimal paths in weighted time-dependent networks	2
End vertices of graph searches on bipartite graphs	2
Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost	2
Leveraging parameterized Chernoff bounds for simplified algorithm analyses	2
On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions	2
Deterministic treasure hunt and rendezvous in arbitrary connected graphs	2
A note on the fine-grained complexity of MIS on regular graphs	2
Sparsifying Count Sketch	2
Skolem and positivity completeness of ergodic Markov chains	2
A 22k-approximation	2
Defying gravity and gadget numerosity: The complexity of the Hanano Puzzle and beyond	2
The complexity of finding temporal separators under waiting time constraints	2
Algorithms with improved delay for enumerating connected induced subgraphs of a large cardinality	2
The facility location problem with maximum distance constraint	2
A refined approximation for Euclidean k-means	2
A non-clausal tableau calculus for MinSat	2
On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees	2
Lower and upper bounds on graph communicabilities	2
The autocorrelation of a class of quaternary sequences of length pq with high complexity	2
Palindromic trees for a sliding window and its applications	2
Transforming plane triangulations by simultaneous diagonal flips	2
Regular resolution effectively simulates resolution	2
Reducing the space used by the sieve of Eratosthenes when factoring	2
Unbiased estimation of inner product via higher order count sketch	2
Two-level hub Steiner trees	2
An asymptotically tight online algorithm for m-Steiner Traveling Salesman Problem	2
Recognizing well-dominated graphs is coNP-complete	2
Corrigendum to “Revisiting reachability in polynomial interrupt timed automata” [Information Processing Letters 174 (2022) 106208]	2

Local linear set on graphs with bounded twin cover number	2
The envy-free matching problem with pairwise preferences	2
Robbins and Ardila meet Berstel	2
Faster counting empty convex polygons in a planar point set	2
Faster deterministic algorithm for Cactus Vertex Deletion	2
Tight bounds for reachability problems on one-counter and pushdown systems	2
Smaller kernels for two vertex deletion problems	2
The group factorization problem in finite groups of Lie type	2
The maximum linear arrangement problem for trees under projectivity and planarity	2
Tight lower bound for average number of terms in optimal double-base number system using information-theoretic tools	2
Editorial Board	2
Tighter bound for generalized multiple discrete logarithm problem via MDS matrix method	2
Ranking and unranking bordered and unbordered words	2
Security weakness of a certificate-based proxy signature scheme for IIoT environments	2