Information Processing Letters

Article	Citations
Tighter bound for generalized multiple discrete logarithm problem via MDS matrix method	23
Editorial Board	12
Polynomial invariants for cactuses	12
A note on the satisfactory partition problem: Constant size requirement	11
Density of distinct squares in non-primitive words	10
A note on the network coloring game: A randomized distributed (Δ + 1)-coloring algorithm	10
Geometric separability using orthogonal objects	10
On matrices potentially useful for tree codes	9
Embedded edge connectivity of k-ary n-cubes	7
On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions	7
Recognizing well-dominated graphs is coNP-complete	7
A note on the method of equal shares	7
On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees	7
Waypoint routing on bounded treewidth graphs	7
Metric distortion of obnoxious distributed voting	6
Faster deterministic algorithm for Cactus Vertex Deletion	6
The longest common subsequence problem for small alphabets in the word RAM model	6
Editorial Board	6
Grid straight-line embeddings of trees with a minimum number of bends per path	6
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
Logical characterization of branching bisimilarity over random processes	5
Exact PPS sampling with bounded sample size	5
Online delay management on a single train line with predictions	4

Editorial Board	4
Editorial Board	4
Weighted well-covered graphs without cycles of lengths 5, 6 and 7	4
A constant-time sampling algorithm for binary Gaussian distribution over the integers	4
Notes about the linear complexity of quaternary cyclotomic sequences of order four	4
Heavy and light paths and Hamilton cycles	4
Editorial Board	4
Smoothness of Schatten norms and sliding-window matrix streams	4
The first Zagreb index, reciprocal degree distance and Hamiltonian-connectedness of graphs	4
Simplicity in Eulerian circuits: Uniqueness and safety	4
A short note on “A note on single-machine scheduling with job-dependent learning effects”	4
A simple 4-approximation algorithm for maximum agreement forests on multiple unrooted binary trees	4
Analyzing Residual Random Greedy for monotone submodular maximization	4
On the parameterized complexity of the Maximum Exposure Problem	3
Packing batches of cubes into a single bin	3
The group factorization problem in finite groups of Lie type	3
Long paths in heterogeneous random subgraphs of graphs with large minimum degree	3
On public-coin zero-error randomized communication complexity	3
Discrete load balancing on complete bipartite graphs	3
Inapproximability of counting independent sets in linear hypergraphs	3
Thou shalt covet the average of thy neighbors' cakes	3
A new class of generalized almost perfect nonlinear monomial functions	3
A refined approximation for Euclidean k-means	3
Packing batches of items into a single bin	3
Luby's MIS algorithms made self-stabilizing	3
On size-independent sample complexity of ReLU networks	3
A real polynomial for bipartite graph minimum weight perfect matchings	3
Long directed detours: Reduction to 2-Disjoint Paths	3
Strong edge-colorings of sparse graphs with 3Δ − 1 colors	3
Weighted fair division of indivisible items: A review	3
Editorial Board	3
On conflict-free cuts: Algorithms and complexity	3
Robust scheduling for minimizing maximum lateness on a serial-batch processing machine	3
A 22k-approximation	3
On-line exploration of rectangular cellular environments with a rectangular hole	3
Order-preserving pattern matching with scaling	3
On Voronoi visibility maps of 1.5D terrains with multiple viewpoints	3
Instability results for cosine-dissimilarity-based nearest neighbor search on high dimensional Gaussian data	3
Public-key encryption scheme with optimal continuous leakage resilience	3
Monochromatic partitioning of colored points by lines	2
Algorithmic results in Roman dominating functions on graphs	2
Palindromic trees for a sliding window and its applications	2
Comparing approximate and probabilistic differential privacy parameters	2
Exploring the optimality of byte-wise permutations of a piccolo-type block cipher	2
Domain-oriented masked bit-parallel finite-field multiplier against side-channel attacks	2
Determining rate monotonic schedulability of real-time periodic tasks using continued fractions	2
Corrigendum to “On the complexity of co-secure dominating set problem” [Inf. Process. Lett. 185 (2024) 106463]	2
Online single-machine scheduling to minimize the linear combination of makespans of two agents	2
Relating planar graph drawings to planar satisfiability problems	2
On regularity of Max-CSPs and Min-CSPs	2

Synchronizing words under LTL constraints	2
Smaller kernels for two vertex deletion problems	2
Tight FPT Approximation for Socially Fair Clustering	2
Escaping Braess's paradox through approximate Caratheodory's theorem	2
An algorithm for reconstructing level-2 phylogenetic networks from trinets	2
Two-level hub Steiner trees	2
A weakness in OCB3 used with short nonces allowing for a break of authenticity and confidentiality	2
Static type checking without downcast operator	2
A note on matching-cut in P-free graphs	2
Efficient linear-time ranking and unranking of derangements	2
Computing the k densest subgraphs of a graph	2
An improved uniform convergence bound with fat-shattering dimension	2
Improved kernels for tracking paths	2
Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance	2
On optimization problems in acyclic hypergraphs	2
On approximate reconfigurability of label cover	2
String searching with mismatches using AVX2 and AVX-512 instructions	2
Insertion depth in power-weight trees	2
Security weakness of a certificate-based proxy signature scheme for IIoT environments	2
The facility location problem with maximum distance constraint	2
Fair and truthful allocations under leveled valuations	2
Anti Tai mapping for unordered labeled trees	2
The complexity of the vertex-minor problem	2
On some families of binary codes	2
On some decidability questions concerning supports of rational series	2
The loss of serving in the dark	2
Entailment is Undecidable for Symbolic Heap Separation Logic Formulæ with Non-Established Inductive Rules	2
Friends-and-strangers is PSPACE-complete	2
Reducing the space used by the sieve of Eratosthenes when factoring	2
A nearly tight lower bound for the d-dimensional cow-path problem	2
Efficient Implementations of Square-root Vélu's Formulas	1
An improved kernel for the flip distance problem on simple convex polygons	1
A note for approximating the submodular cover problem over integer lattice with low adaptive and query complexities	1
On the complexity of some restricted variants of Quotient Pigeon and a weak variant of Kőnig	1
Steiner connectivity problems in hypergraphs	1
New sharp lower bound for the quorum coloring number of trees	1
On the intractability of preemptive single-machine job scheduling with release times, deadlines, and family setup times	1
Quantum attacks on Sum of Even-Mansour pseudorandom functions	1
The complexity of finding temporal separators under waiting time constraints	1
Improved hardness of approximation for Geometric Bin Packing	1
Branching bisimulation semantics for quantum processes	1
A polylogarithmic approximation algorithm for 2-edge-connected dominating set	1
Worst-case analysis of LPT scheduling on a small number of non-identical processors	1
NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times	1
On d-distance m-tuple (ℓ,r)-domination in graphs	1
Faster counting empty convex polygons in a planar point set	1
Tight lower bound for average number of terms in optimal double-base number system using information-theoretic tools	1
On radio k-labeling of the power of the infinite path	1
The effect of iterativity on adversarial opinion forming	1
Spanners under the Hausdorff and Fréchet distances	1
A note on distance-preserving graph sparsification	1
Polynomial kernels for tracking shortest paths	1
A note on the complexity of one-sided crossing minimization of trees	1
Connectivity, super connectivity and generalized 3-connectivity of folded divide-and-swap cubes	1
New network entropy: The domination entropy of graphs	1
A simple supercritical tradeoff between size and height in resolution	1
Effective data reduction for strongly stable matching in very sparse graphs	1
Online search for a hyperplane in high-dimensional Euclidean space	1
An efficient algorithm for identifying rainbow ortho-convex 4-sets in k-colored point sets	1
On the preferred extensions of argumentation frameworks: Bijections with naive sets	1
Robust probabilistic temporal logics	1
There is no APTAS for 2-dimensional vector bin packing: Revisited	1
Approximating the minimal lookahead needed to win infinite games	1
On the security of TrCBC	1
On product decomposition	1
Improved entropy bounds for parity filtered self-timed ring based random number generators	1
Simplified Chernoff bounds with powers-of-two probabilities	1
Editorial Board	1
Red Blue Set Cover problem on axis-parallel hyperplanes and other objects	1
Tighter bounds on non-clairvoyant parallel machine scheduling with prediction to minimize makespan	1
Checking in polynomial time whether or not a regular tree language is deterministic top-down	1
Discrete and mixed two-center problems for line segments	1
New results on pairwise compatibility graphs	1
Modular termination of prefix-constrained term rewrite systems	1
Hard problems that quickly become very easy	1
Spectral independence, coupling, and the spectral gap of the Glauber dynamics	1
Learning from positive and negative examples: New proof for binary alphabets	1
Faster algorithms and a smaller kernel for Cliques or Trees Vertex Deletion	1
On the k-means/median cost function	1
Special issue on Economics and Computation	1

Comment on “An enhanced and secured RSA public cryptosystem algorithm using Chinese remainder theorem (ESRPKC)”	1
Editorial Board	1
Lower bound proof for the size of BDDs representing a shifted addition	1
Revisiting lower dimension lattice attacks on NTRU	1
Note on pancake sorting	1
Unbiased estimation of inner product via higher order count sketch	1