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

Article	Citations
Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost	20
Tight binding number bound for P≥3-factor uniform graphs	16
Complexity and algorithms for injective edge-coloring in graphs	13
Instability results for Euclidean distance, nearest neighbor search on high dimensional Gaussian data	11
On computing Pareto optimal paths in weighted time-dependent networks	10
Quantum attacks on Sum of Even-Mansour pseudorandom functions	9
Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game	8
The first Zagreb index, reciprocal degree distance and Hamiltonian-connectedness of graphs	8
Representations of stably continuous semi-lattices by information systems and abstract bases	8
A polylogarithmic approximation algorithm for 2-edge-connected dominating set	6
Lot scheduling on a single machine to minimize the (weighted) number of tardy orders	5
Longest common subsequence in sublinear space	5
Embedded edge connectivity of k-ary n-cubes	5
List k-colouring P-free graphs: A Mim-width perspective	5
A note on matching-cut in P-free graphs	5
A lower bound for the coverability problem in acyclic pushdown VAS	5
Security analysis of a dynamic threshold secret sharing scheme using linear subspace method	5
An improved exact algorithm for minimum dominating set in chordal graphs	5
Optimal-size problem kernels for d-Hitting Set in linear time and space	5
Hardness and tractability of the γ-Complete Subgraph problem	5
Differentiators and detectors	4
NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times	4
Tight bounds for reachability problems on one-counter and pushdown systems	4
Super spanning connectivity of split-star networks	4
Strategies for generating tree spanners: Algorithms, heuristics and optimal graph classes	4

Small cycles, generalized prisms and Hamiltonian cycles in the Bubble-sort graph	4
A refined approximation for Euclidean k-means	4
On complementing unambiguous automata and graphs with many cliques and cocliques	4
Catalan and Schröder permutations sortable by two restricted stacks	4
An A⁎ search algorithm for the constrained longest common subsequence problem	4
An asymptotically tight online algorithm for m-Steiner Traveling Salesman Problem	4
A note on the concrete hardness of the shortest independent vector in lattices	4
Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee	4
Faster parameterized algorithm for Bicluster Editing	4
Connectivity, super connectivity and generalized 3-connectivity of folded divide-and-swap cubes	3
A faster parameterized algorithm for temporal matching	3
Cluster deletion revisited	3
Fast primal-dual update against local weight update in linear assignment problem and its application	3
Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes	3
Minimum projective linearizations of trees in linear time	3
A real polynomial for bipartite graph minimum weight perfect matchings	3
A queueing network-based distributed Laplacian solver for directed graphs	3
Online graph exploration on trees, unicyclic graphs and cactus graphs	3
Runtime analysis of evolutionary algorithms via symmetry arguments	3
Simpler FM-index for parameterized string matching	3
Palindromic trees for a sliding window and its applications	3
An Algorithm for the Sequence Alignment with Gap Penalty Problem using Multiway Divide-and-Conquer and Matrix Transposition	3
Online search for a hyperplane in high-dimensional Euclidean space	3
The upper and lower bounds of R-conditional diagnosability of networks	3
Improved entropy bounds for parity filtered self-timed ring based random number generators	3
Tight FPT Approximation for Socially Fair Clustering	3
A non-clausal tableau calculus for MinSat	3
Space-efficient Huffman codes revisited	2
Polynomial kernels for tracking shortest paths	2
On the preferred extensions of argumentation frameworks: Bijections with naive sets	2
Longest distance of a non-uniform dispersion process on the infinite line	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
Order-preserving pattern matching with scaling	2
On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees	2
Approximation error of single hidden layer neural networks with fixed weights	2
On radio k-labeling of the power of the infinite path	2
On clustering with discounts	2
New network entropy: The domination entropy of graphs	2
Bounds and algorithms for generalized superimposed codes	2
On the k-means/median cost function	2
An algorithm for reconstructing level-2 phylogenetic networks from trinets	2
There is no APTAS for 2-dimensional vector bin packing: Revisited	2
Optimizing the evaluation of ℓ-isogenous curve for isogeny-based cryptography	2
Geometric separability using orthogonal objects	2
Cryptanalysis and improvements of an efficient certificate-based proxy signature scheme for IIoT environments	2
On semi-transitive orientability of split graphs	2
The envy-free matching problem with pairwise preferences	2
Extending de Bruijn sequences to larger alphabets	2
Hard problems that quickly become very easy	2
Simplified Chernoff bounds with powers-of-two probabilities	2

A note on VNP-completeness and border complexity	2
Computing the k densest subgraphs of a graph	2
Online single-machine scheduling to minimize the linear combination of makespans of two agents	2
Kernel for K-free Edge Deletion	2
On the (im)possibility of improving the round diffusion of generalized Feistel structures	2
End vertices of graph searches on bipartite graphs	2
A characterization of 3-γ-critical graphs which are not bicritical	2
Thou shalt covet the average of thy neighbors' cakes	2
A competitive analysis for the Start-Gap algorithm for online memory wear leveling	2
Probabilistic weak bisimulation and axiomatization for probabilistic models	2
Surveying global verifiability	2
Packing batches of items into a single bin	2
Weighted automata are compact and actively learnable	2
Linear threshold functions in decision lists, decision trees, and depth-2 circuits	2
The complexity of the vertex-minor problem	2
Testing gap k-planarity is NP-complete	2
Approximation algorithms for a virtual machine allocation problem with finite types	2
Fault-tolerant Hamiltonicity of hypercubes with faulty subcubes	2
Robbins and Ardila meet Berstel	2
The complexity of finding temporal separators under waiting time constraints	2
The odd chromatic number of a toroidal graph is at most 9	2