Information Processing Letters

Article	Citations
A note on the satisfactory partition problem: Constant size requirement	20
On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees	17
Rank and select operations on a word	15
A note on the network coloring game: A randomized distributed (Δ + 1)-coloring algorithm	14
Tighter bound for generalized multiple discrete logarithm problem via MDS matrix method	12
Polynomial invariants for cactuses	10
Waypoint routing on bounded treewidth graphs	10
Geometric separability using orthogonal objects	8
On matrices potentially useful for tree codes	7
Editorial Board	7
Embedded edge connectivity of k-ary n-cubes	6
Metric distortion of obnoxious distributed voting	6
Density of distinct squares in non-primitive words	6
Faster deterministic algorithm for Cactus Vertex Deletion	6
On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions	6
Grid straight-line embeddings of trees with a minimum number of bends per path	6
Editorial Board	5
Local linear set on graphs with bounded twin cover number	5
Exact PPS sampling with bounded sample size	5
Tight inapproximability of Nash equilibria in public goods games	5
Bounds and algorithms for generalized superimposed codes	5
Recognizing well-dominated graphs is coNP-complete	5
Editorial Board	4
A short note on “A note on single-machine scheduling with job-dependent learning effects”	4
Catalan and Schröder permutations sortable by two restricted stacks	4

Editorial Board	4
Heavy and light paths and Hamilton cycles	4
Fault-tolerant Hamiltonicity of hypercubes with faulty subcubes	4
The first Zagreb index, reciprocal degree distance and Hamiltonian-connectedness of graphs	4
Recursion-free modular arithmetic in the lambda-calculus	4
Editorial Board	4
Simplicity in Eulerian circuits: Uniqueness and safety	4
Order-preserving pattern matching with scaling	4
A new class of generalized almost perfect nonlinear monomial functions	3
Thou shalt covet the average of thy neighbors' cakes	3
On public-coin zero-error randomized communication complexity	3
Long directed detours: Reduction to 2-Disjoint Paths	3
Longest previous overlapping factor array	3
Discrete load balancing on complete bipartite graphs	3
Weighted well-covered graphs without cycles of lengths 5, 6 and 7	3
Public-key encryption scheme with optimal continuous leakage resilience	3
On size-independent sample complexity of ReLU networks	3
On-line exploration of rectangular cellular environments with a rectangular hole	3
Linear discrepancy is Π2-hard to approximate	3
Inapproximability of counting independent sets in linear hypergraphs	3
On Voronoi visibility maps of 1.5D terrains with multiple viewpoints	3
Weighted fair division of indivisible items: A review	3
A constant-time sampling algorithm for binary Gaussian distribution over the integers	3
Long paths in heterogeneous random subgraphs of graphs with large minimum degree	3
Luby's MIS algorithms made self-stabilizing	3
A real polynomial for bipartite graph minimum weight perfect matchings	3
Analyzing Residual Random Greedy for monotone submodular maximization	3
Smoothness of Schatten norms and sliding-window matrix streams	3
Editorial Board	3
Instability results for cosine-dissimilarity-based nearest neighbor search on high dimensional Gaussian data	3
Strong edge-colorings of sparse graphs with 3Δ − 1 colors	3
An improved uniform convergence bound with fat-shattering dimension	2
Results and conjectures on the role of the uniform distribution in the coupon collector's problem with group drawings	2
Testing gap k-planarity is NP-complete	2
Editorial Board	2
A nearly tight lower bound for the d-dimensional cow-path problem	2
On computing Pareto optimal paths in weighted time-dependent networks	2
On some decidability questions concerning supports of rational series	2
Exploring the optimality of byte-wise permutations of a piccolo-type block cipher	2
Packing batches of items into a single bin	2
Robust scheduling for minimizing maximum lateness on a serial-batch processing machine	2
Hamiltonian cycles and paths in hypercubes with disjoint faulty edges	2
Security weakness of a certificate-based proxy signature scheme for IIoT environments	2
The facility location problem with maximum distance constraint	2
On optimization problems in acyclic hypergraphs	2
Online single-machine scheduling to minimize the linear combination of makespans of two agents	2
Entailment is Undecidable for Symbolic Heap Separation Logic Formulæ with Non-Established Inductive Rules	2
Packing batches of cubes into a single bin	2
Synchronizing words under LTL constraints	2
Algorithmic results in Roman dominating functions on graphs	2

String searching with mismatches using AVX2 and AVX-512 instructions	2
The group factorization problem in finite groups of Lie type	2
A refined approximation for Euclidean k-means	2
Palindromic trees for a sliding window and its applications	2
Transforming plane triangulations by simultaneous diagonal flips	2
Faster parameterized algorithm for Bicluster Editing	2
Computing the k densest subgraphs of a graph	2
Relating planar graph drawings to planar satisfiability problems	2
Editorial Board	2
An algorithm for reconstructing level-2 phylogenetic networks from trinets	2
Tight FPT Approximation for Socially Fair Clustering	2
A 22k-approximation	2
Two-level hub Steiner trees	2
On the parameterized complexity of the Maximum Exposure Problem	2
On conflict-free cuts: Algorithms and complexity	2
Editorial Board	2
Comparing approximate and probabilistic differential privacy parameters	1
Tight lower bound for average number of terms in optimal double-base number system using information-theoretic tools	1
Efficient linear-time ranking and unranking of derangements	1
New network entropy: The domination entropy of graphs	1
Anti Tai mapping for unordered labeled trees	1
On the effectiveness of the genetic paradigm for polygonization	1
Effective data reduction for strongly stable matching in very sparse graphs	1
The complexity of the vertex-minor problem	1
A note on the fine-grained complexity of MIS on regular graphs	1
Smaller kernels for two vertex deletion problems	1
Instability results for Euclidean distance, nearest neighbor search on high dimensional Gaussian data	1
Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees	1
Faster counting empty convex polygons in a planar point set	1
Revisiting lower dimension lattice attacks on NTRU	1
Spectral independence, coupling, and the spectral gap of the Glauber dynamics	1
On the intractability of preemptive single-machine job scheduling with release times, deadlines, and family setup times	1
A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs - via half-edges	1
Discrete and mixed two-center problems for line segments	1
Improved kernels for tracking paths	1
An efficient algorithm for identifying rainbow ortho-convex 4-sets in k-colored point sets	1
On approximate reconfigurability of label cover	1
The complexity of finding temporal separators under waiting time constraints	1
Domain-oriented masked bit-parallel finite-field multiplier against side-channel attacks	1
On the k-means/median cost function	1
The loss of serving in the dark	1
Editorial Board	1
Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance	1
A polylogarithmic approximation algorithm for 2-edge-connected dominating set	1
There is no APTAS for 2-dimensional vector bin packing: Revisited	1
Learning from positive and negative examples: New proof for binary alphabets	1
Insertion depth in power-weight trees	1
Improved hardness of approximation for Geometric Bin Packing	1
On regularity of Max-CSPs and Min-CSPs	1
Steiner connectivity problems in hypergraphs	1
On the security of TrCBC	1
Modular termination of prefix-constrained term rewrite systems	1
NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times	1
On radio k-labeling of the power of the infinite path	1
Monochromatic partitioning of colored points by lines	1
Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions	1
Determining rate monotonic schedulability of real-time periodic tasks using continued fractions	1
The effect of iterativity on adversarial opinion forming	1
Static type checking without downcast operator	1
Editorial Board	1
A note on distance-preserving graph sparsification	1
A note on matching-cut in P-free graphs	1
Escaping Braess's paradox through approximate Caratheodory's theorem	1
Tight bounds for reachability problems on one-counter and pushdown systems	1
A weakness in OCB3 used with short nonces allowing for a break of authenticity and confidentiality	1
Improved entropy bounds for parity filtered self-timed ring based random number generators	1
Reducing the space used by the sieve of Eratosthenes when factoring	1
Simplified Chernoff bounds with powers-of-two probabilities	1
Comment on “An enhanced and secured RSA public cryptosystem algorithm using Chinese remainder theorem (ESRPKC)”	1
A note for approximating the submodular cover problem over integer lattice with low adaptive and query complexities	1
On product decomposition	1
A polynomial time algorithm for the 2-Poset Cover Problem	1
Extending de Bruijn sequences to larger alphabets	1
Longest common subsequence in sublinear space	1
Mesosome avoidance	0
Prenex universal first-order safety properties	0
Quantitative controller synthesis for consumption Markov decision processes	0
Semantic flowers for good-for-games and deterministic automata	0
Determining asynchronous test equivalence for probabilistic processes	0
A note on VNP-completeness and border complexity	0

Online graph exploration on trees, unicyclic graphs and cactus graphs	0
Distributivity and residuation for lexicographic orders	0
Cluster deletion revisited	0
A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph	0
Regular D-length: A tool for improved prefix-stable forward Ramsey factorisat	0
A simple division-free algorithm for computing Pfaffians	0
On the hull number on cycle convexity of graphs	0
Is this network proper forest-based?	0
A note on integral generalized flows in directed partial 2-trees	0
Algorithms for subgraph complementation to some classes of graphs	0
Non-uniform packings	0
Approximation error of single hidden layer neural networks with fixed weights	0
Deciding origin equivalence of weakly self-nesting macro tree transducers	0
An Algorithm for the Sequence Alignment with Gap Penalty Problem using Multiway Divide-and-Conquer and Matrix Transposition	0
A faster parameterized algorithm for temporal matching	0
Improved lower bound for differentially private facility location	0
Total variation distance for product distributions is #	0
Non-uniform birthday problem revisited: Refined analysis and applications to discrete logarithms	0
Satisfying the restricted isometry property with the optimal number of rows and slightly less randomness	0
Computing inductive vertex orderings	0
A generalization of the Blind Rotating Table game	0
End vertices of graph searches on bipartite graphs	0
Geometric systems of unbiased representatives	0
A non-clausal tableau calculus for MinSat	0
Counter abstraction for regular open teams	0
An improved exact algorithm for minimum dominating set in chordal graphs	0
Corrigendum to “Revisiting reachability in polynomial interrupt timed automata” [Information Processing Letters 174 (2022) 106208]	0
Cryptanalysis of multivariate threshold ring signature schemes	0
Linear threshold functions in decision lists, decision trees, and depth-2 circuits	0
Fast primal-dual update against local weight update in linear assignment problem and its application	0
An improved spectral lower bound of treewidth	0
The complexity of comparing optimal solutions	0
Improved cube-attack-like cryptanalysis of reduced-round Ketje-Jr and Keccak-MAC	0
Cryptanalysis and improvements of an efficient certificate-based proxy signature scheme for IIoT environments	0
Editorial Board	0
Learning-augmented maximum flow	0
Vertex degrees and 2-cuts in graphs with many hamiltonian vertex-deleted subgraphs	0
New bounds for the number of lightest cycles in undirected graphs	0
List k-colouring P-free graphs: A Mim-width perspective	0
On the complexity of finding a Caristi's fixed point	0
A simple combinatorial proof for the small model property of two-variable logic	0
Kinetic collision detection for balls	0
On semi-transitive orientability of split graphs	0
A sharper lower bound on Rankin's constant	0
On the non-efficient PAC learnability of conjunctive queries	0
The upper and lower bounds of R-conditional diagnosability of networks	0
Weakest preconditioned goto axiom	0
Editorial Board	0
An undecidability result for Separation Logic with theory reasoning	0
Lower and upper bounds on graph communicabilities	0
Globally minimal defensive alliances	0
A note on approximations of directed edge dominating set	0
FPT approximation and subexponential algorithms for covering few or many edges	0
Editorial Board	0
Strategies for generating tree spanners: Algorithms, heuristics and optimal graph classes	0
4/3 rectangle tiling lower bound	0
Editorial Board	0
On the (im)possibility of improving the round diffusion of generalized Feistel structures	0
Space-efficient Huffman codes revisited	0
The maximum linear arrangement problem for trees under projectivity and planarity	0
The autocorrelation of a class of quaternary sequences of length pq with high complexity	0
Randomized consensus with regular registers	0
A simple proof of QBF hardness	0
Horton-Strahler number, rooted pathwidth and upward drawings of trees	0
A new key recovery attack on a code-based signature from the Lyubashevsky framework	0
Faster deterministic algorithm for Co-Path Set	0
Generalized cuckoo hashing with a stash, revisited	0
Unbiased estimation of inner product via higher order count sketch	0
Editorial Board	0
All-pairs suffix/prefix in optimal time using Aho-Corasick space	0
Minimum projective linearizations of trees in linear time	0
Further results on the second relative greedy weight of 3-dimensional codes	0
Word automatic groups of nilpotency class 2	0
Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints	0
Vertex-connectivity for node failure identification in Boolean Network Tomography	0
On parallel time in population protocols	0
Zone theorem for arrangements in dimension three	0
On reversing arcs to improve arc-connectivity	0
Splitting NP-complete sets infinitely	0
On the chromatic numbers of signed triangular and hexagonal grids	0
The computational complexity of some explainable clustering problems	0
Editorial Board	0
Improving compressed matrix multiplication using control variate method	0
On the hardness of inclusion-wise minimal separators enumeration	0
Approximation algorithms for a virtual machine allocation problem with finite types	0
Dispersion problem on a convex polygon	0
A simple and improved parameterized algorithm for bicluster editing	0
Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes	0
A note on improved results for one round distributed clique listing	0
Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game	0
Algorithms with improved delay for enumerating connected induced subgraphs of a large cardinality	0
Polynomial recognition of vulnerable multi-commodities	0
A lower bound for the Quickhull convex hull algorithm that disproves the Quickhull precision conjecture	0
Improved bounds for rectangular monotone Min-Plus Product and applications	0
Airports and railways with unsplittable demand	0