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

Article	Citations
About blockchain interoperability	46
Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost	19
Threshold changeable secret sharing with secure secret reconstruction	18
Tight binding number bound for P≥3-factor uniform graphs	12
Instability results for Euclidean distance, nearest neighbor search on high dimensional Gaussian data	11
Complexity and algorithms for injective edge-coloring in graphs	10
Mutual exclusion in fully anonymous shared memory systems	8
Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game	7
On the correctness of Egalitarian Paxos	7
Quantum attacks on Sum of Even-Mansour pseudorandom functions	7
Lengths of words accepted by nondeterministic finite automata	7
Maximum-area triangle in a convex polygon, revisited	7
On computing Pareto optimal paths in weighted time-dependent networks	7
The first Zagreb index, reciprocal degree distance and Hamiltonian-connectedness of graphs	6
Representations of stably continuous semi-lattices by information systems and abstract bases	6
Online leasing strategy for depreciable equipment considering opportunity cost	6
A lower bound for the coverability problem in acyclic pushdown VAS	5
Small cycles, generalized prisms and Hamiltonian cycles in the Bubble-sort graph	5
Optimal-size problem kernels for d-Hitting Set in linear time and space	5
Embedded edge connectivity of k-ary n-cubes	5
List k-colouring P-free graphs: A Mim-width perspective	5
Recognizing and realizing cactus metrics	5
Security analysis of a dynamic threshold secret sharing scheme using linear subspace method	5
Longest common subsequence in sublinear space	4
A note on the concrete hardness of the shortest independent vector in lattices	4

An answer to an open problem of Mesnager on bent functions	4
An A⁎ search algorithm for the constrained longest common subsequence problem	4
A polylogarithmic approximation algorithm for 2-edge-connected dominating set	4
Tight bounds for reachability problems on one-counter and pushdown systems	4
Lot scheduling on a single machine to minimize the (weighted) number of tardy orders	4
Signed coloring of 2-dimensional grids	4
A refined approximation for Euclidean k-means	4
A non-clausal tableau calculus for MinSat	3
Minimum projective linearizations of trees in linear time	3
On the computational complexity of length- and neighborhood-constrained path problems	3
Cluster deletion revisited	3
Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee	3
“The simplest protocol for oblivious transfer” revisited	3
Catalan and Schröder permutations sortable by two restricted stacks	3
On the probability of overlap of random subsequences of pseudorandom number generators	3
Remark on subcodes of linear complementary dual codes	3
Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes	3
Modified quadratic residue constructions and new extremal binary self-dual codes of lengths 64, 66 and 68	3
A queueing network-based distributed Laplacian solver for directed graphs	3
On complementing unambiguous automata and graphs with many cliques and cocliques	3
An improved exact algorithm for minimum dominating set in chordal graphs	3
Faster parameterized algorithm for Bicluster Editing	3
A note on matching-cut in P-free graphs	3
Testing gap k-planarity is NP-complete	3
Palindromic trees for a sliding window and its applications	3
An asymptotically tight online algorithm for m-Steiner Traveling Salesman Problem	3
An Algorithm for the Sequence Alignment with Gap Penalty Problem using Multiway Divide-and-Conquer and Matrix Transposition	3
A faster parameterized algorithm for temporal matching	3
The upper and lower bounds of R-conditional diagnosability of networks	3
Super spanning connectivity of split-star networks	3
Fast primal-dual update against local weight update in linear assignment problem and its application	3
A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands	3
Differentiators and detectors	3
Independent domination versus weighted independent domination	2
An algorithm for reconstructing level-2 phylogenetic networks from trinets	2
Faster algorithms for cograph edge modification problems	2
Geometric separability using orthogonal objects	2
Longest distance of a non-uniform dispersion process on the infinite line	2
Sorting can exponentially speed up pure dynamic programming	2
On the chromatic numbers of signed triangular and hexagonal grids	2
Runtime analysis of evolutionary algorithms via symmetry arguments	2
Online single-machine scheduling to minimize the linear combination of makespans of two agents	2
Connectivity, super connectivity and generalized 3-connectivity of folded divide-and-swap cubes	2
Kernel for K-free Edge Deletion	2
A real polynomial for bipartite graph minimum weight perfect matchings	2
End vertices of graph searches on bipartite graphs	2
Hardness and tractability of the γ-Complete Subgraph problem	2
On the k-means/median cost function	2
NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times	2
Space-efficient Huffman codes revisited	2

A generalization of the Blind Rotating Table game	2
Hard problems that quickly become very easy	2
Online search for a hyperplane in high-dimensional Euclidean space	2
Strategies for generating tree spanners: Algorithms, heuristics and optimal graph classes	2
Raiders of the lost equivalence: Probabilistic branching bisimilarity	2
Cryptanalysis and improvements of an efficient certificate-based proxy signature scheme for IIoT environments	2
Computing the k densest subgraphs of a graph	2
Probabilistic weak bisimulation and axiomatization for probabilistic models	2
Robbins and Ardila meet Berstel	2
On the (im)possibility of improving the round diffusion of generalized Feistel structures	2
A competitive analysis for the Start-Gap algorithm for online memory wear leveling	2
Packing batches of items into a single bin	2
Distinguisher on full-round compression function of GOST R	2
Surveying global verifiability	2
The complexity of the vertex-minor problem	2
A note on VNP-completeness and border complexity	2
Extending de Bruijn sequences to larger alphabets	2
Approximation algorithms for a virtual machine allocation problem with finite types	2
Correct proof of the main result in “The number of spanning trees of a class of self-similar fractal models” by Ma and Yao	2
Simpler FM-index for parameterized string matching	2