Information Processing Letters

Article	Citations
The odd chromatic number of a toroidal graph is at most 9	20
Packing batches of cubes into a single bin	17
Packing batches of items into a single bin	15
A polylogarithmic approximation algorithm for 2-edge-connected dominating set	11
String searching with mismatches using AVX2 and AVX-512 instructions	11
On conflict-free cuts: Algorithms and complexity	10
A note on the satisfactory partition problem: Constant size requirement	9
There is no APTAS for 2-dimensional vector bin packing: Revisited	8
On matrices potentially useful for tree codes	7
Editorial Board	6
Algorithms for deletion problems on split graphs	6
Spectral independence, coupling, and the spectral gap of the Glauber dynamics	6
Computability by monadic second-order logic	6
Faster deterministic algorithm for Co-Path Set	5
Embedded edge connectivity of k-ary n-cubes	5
On product decomposition	5
Comment on “An enhanced and secured RSA public cryptosystem algorithm using Chinese remainder theorem (ESRPKC)”	5
On the parameterized complexity of the Maximum Exposure Problem	5
Quantitative controller synthesis for consumption Markov decision processes	5
Polynomial recognition of vulnerable multi-commodities	5
Editorial Board	5
On the security of TrCBC	5
Computing minimal solutions to the ring loading problem	4
A note on the fine-grained complexity of MIS on regular graphs	4
On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions	4

Editorial Board	4
Expressive completeness by separation for discrete time interval temporal logic with expanding modalities	4
The autocorrelation of a class of quaternary sequences of length pq with high complexity	4
Unbiased estimation of inner product via higher order count sketch	4
Exploring the optimality of byte-wise permutations of a piccolo-type block cipher	4
Sparsifying Count Sketch	4
Tight bounds for reachability problems on one-counter and pushdown systems	4
Smaller kernels for two vertex deletion problems	4
Density of distinct squares in non-primitive words	4
Space-efficient Huffman codes revisited	3
Finding (s,d)-hypernetworks in F-hypergraphs is NP-hard	3
On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees	3
Transforming plane triangulations by simultaneous diagonal flips	3
On parallel time in population protocols	3
Further results on the second relative greedy weight of 3-dimensional codes	3
The envy-free matching problem with pairwise preferences	3
Vertex degrees and 2-cuts in graphs with many hamiltonian vertex-deleted subgraphs	3
A note on the concrete hardness of the shortest independent vector in lattices	3
Polynomial invariants for cactuses	3
Kruskal with embedded C-semirings to solve MST problems with partially-ordered costs	3
Minimum projective linearizations of trees in linear time	3
Faster counting empty convex polygons in a planar point set	3
Regular resolution effectively simulates resolution	3
Skolem and positivity completeness of ergodic Markov chains	3
Rank and select operations on a word	3
Waypoint routing on bounded treewidth graphs	3
Distributivity and residuation for lexicographic orders	3
The maximum linear arrangement problem for trees under projectivity and planarity	3
The group factorization problem in finite groups of Lie type	3
An efficient algorithm for identifying rainbow ortho-convex 4-sets in k-colored point sets	2
Robbins and Ardila meet Berstel	2
A lower bound for the Quickhull convex hull algorithm that disproves the Quickhull precision conjecture	2
A 22k-approximation	2
Recognizing well-dominated graphs is coNP-complete	2
Optimal randomized algorithms of weakly-balanced multi-branching AND-OR trees	2
A non-clausal tableau calculus for MinSat	2
NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times	2
Robust scheduling for minimizing maximum lateness on a serial-batch processing machine	2
An asymptotically tight online algorithm for m-Steiner Traveling Salesman Problem	2
Editorial Board	2
Surveying definitions of election verifiability	2
The facility location problem with maximum distance constraint	2
End vertices of graph searches on bipartite graphs	2
Deterministic treasure hunt and rendezvous in arbitrary connected graphs	2
Faster deterministic algorithm for Cactus Vertex Deletion	2
The complexity of finding temporal separators under waiting time constraints	2
Reducing the space used by the sieve of Eratosthenes when factoring	2
Corrigendum to “Revisiting reachability in polynomial interrupt timed automata” [Information Processing Letters 174 (2022) 106208]	2
A refined approximation for Euclidean k-means	2
Geometric separability using orthogonal objects	2

Algorithms with improved delay for enumerating connected induced subgraphs of a large cardinality	2
A diameter-revealing proof of the Bondy-Lovász lemma	2
Defying gravity and gadget numerosity: The complexity of the Hanano Puzzle and beyond	2
Ranking and unranking bordered and unbordered words	2
Leveraging parameterized Chernoff bounds for simplified algorithm analyses	2
The complexity of comparing optimal solutions	2
Tight lower bound for average number of terms in optimal double-base number system using information-theoretic tools	2
Hardness and tractability of the γ-Complete Subgraph problem	2
Erasure and error correcting ability of Parikh matrices	2
Tighter bound for generalized multiple discrete logarithm problem via MDS matrix method	2
Guided blocks WOM codes	2
On computing Pareto optimal paths in weighted time-dependent networks	2
A note on the network coloring game: A randomized distributed (Δ + 1)-coloring algorithm	2
Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost	2
On the k-means/median cost function	2
Satisfying the restricted isometry property with the optimal number of rows and slightly less randomness	2
Local linear set on graphs with bounded twin cover number	2
Vertex-connectivity for node failure identification in Boolean Network Tomography	1
Metric distortion of obnoxious distributed voting	1
Recursion-free modular arithmetic in the lambda-calculus	1
Small cycles, generalized prisms and Hamiltonian cycles in the Bubble-sort graph	1
Editorial Board	1
Modifying an instance of the super-stable matching problem	1
Grid straight-line embeddings of trees with a minimum number of bends per path	1
On the Tractability Landscape of the Conditional Minisum Approval Voting Rule	1
A note on integral generalized flows in directed partial 2-trees	1
Connected equitable cake division via Sperner's lemma	1
Learning-augmented maximum flow	1
Editorial Board	1
Relating planar graph drawings to planar satisfiability problems	1
Exact PPS sampling with bounded sample size	1
On optimization problems in acyclic hypergraphs	1
Editorial Board	1
Synchronizing words under LTL constraints	1
Fault-tolerant Hamiltonicity of hypercubes with faulty subcubes	1
On the (im)possibility of improving the round diffusion of generalized Feistel structures	1
Splitting NP-complete sets infinitely	1
A simple division-free algorithm for computing Pfaffians	1
A note on algebraic techniques for subgraph detection	1
Palindromic trees for a sliding window and its applications	1
Editorial Board	1
Security weakness of a certificate-based proxy signature scheme for IIoT environments	1
A nearly tight lower bound for the d-dimensional cow-path problem	1
Editorial Board	1
On the effectiveness of the genetic paradigm for polygonization	1
On the complexity of finding a Caristi's fixed point	1
FPT approximation and subexponential algorithms for covering few or many edges	1
Editorial Board	1
Tight inapproximability of Nash equilibria in public goods games	1
Bounds and algorithms for generalized superimposed codes	1
Deciding origin equivalence of weakly self-nesting macro tree transducers	1
Maximal elements with minimal logic	1
An algorithm for reconstructing level-2 phylogenetic networks from trinets	1
Editorial Board	1
Lower and upper bounds on graph communicabilities	1
Editorial Board	1
4/3 rectangle tiling lower bound	1
New network entropy: The domination entropy of graphs	1
Counter abstraction for regular open teams	1
Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes	1
Recognizing LBFS trees of bipartite graphs	1
Two-level hub Steiner trees	1
Entailment is Undecidable for Symbolic Heap Separation Logic Formulæ with Non-Established Inductive Rules	1
Hamiltonian cycles of balanced hypercube with disjoint faulty edges	1
Kernel for K-free Edge Deletion	1
On some decidability questions concerning supports of rational series	1
Strong hardness of approximation for tree transversals	1
A sharper lower bound on Rankin's constant	1
Tight FPT Approximation for Socially Fair Clustering	1
Weakest preconditioned goto axiom	1
Non-uniform birthday problem revisited: Refined analysis and applications to discrete logarithms	1
Algorithmic results in Roman dominating functions on graphs	1
Instability results for Euclidean distance, nearest neighbor search on high dimensional Gaussian data	0
Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game	0
Branching bisimulation semantics for quantum processes	0
Discrete load balancing on complete bipartite graphs	0
An Algorithm for the Sequence Alignment with Gap Penalty Problem using Multiway Divide-and-Conquer and Matrix Transposition	0
Linear threshold functions in decision lists, decision trees, and depth-2 circuits	0
On the non-efficient PAC learnability of conjunctive queries	0
On d-distance m-tuple (ℓ,r)-domination in graphs	0

Editorial Board	0
Extending de Bruijn sequences to larger alphabets	0
Improved bounds for rectangular monotone Min-Plus Product and applications	0
Probabilistic weak bisimulation and axiomatization for probabilistic models	0
A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs - via half-edges	0
Online search for a hyperplane in high-dimensional Euclidean space	0
Prenex universal first-order safety properties	0
A constant-time sampling algorithm for binary Gaussian distribution over the integers	0
On size-independent sample complexity of ReLU networks	0
An improved kernel for the flip distance problem on simple convex polygons	0
Approximating the minimal lookahead needed to win infinite games	0
A new key recovery attack on a code-based signature from the Lyubashevsky framework	0
Editorial Board	0
Long paths in heterogeneous random subgraphs of graphs with large minimum degree	0
On the hull number on cycle convexity of graphs	0
Cryptanalysis and improvements of an efficient certificate-based proxy signature scheme for IIoT environments	0
Approximation error of single hidden layer neural networks with fixed weights	0
All-pairs suffix/prefix in optimal time using Aho-Corasick space	0
New bounds for the number of lightest cycles in undirected graphs	0
The final nail in the coffin of statistically-secure obfuscator	0
A polynomial time algorithm for the 2-Poset Cover Problem	0
Correct proof of the main result in “The number of spanning trees of a class of self-similar fractal models” by Ma and Yao	0
Editorial Board	0
Kinetic collision detection for balls	0
Instability results for cosine-dissimilarity-based nearest neighbor search on high dimensional Gaussian data	0
On public-coin zero-error randomized communication complexity	0
Inapproximability of counting independent sets in linear hypergraphs	0
Cluster deletion revisited	0
Editorial Board	0
Airports and railways with unsplittable demand	0
Weighted automata are compact and actively learnable	0
Weighted fair division of indivisible items: A review	0
Linear discrepancy is Π2-hard to approximate	0
Connectivity, super connectivity and generalized 3-connectivity of folded divide-and-swap cubes	0
Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee	0
Weighted well-covered graphs without cycles of lengths 5, 6 and 7	0
Public-key encryption scheme with optimal continuous leakage resilience	0
Thou shalt covet the average of thy neighbors' cakes	0
On complementing unambiguous automata and graphs with many cliques and cocliques	0
A real polynomial for bipartite graph minimum weight perfect matchings	0
Verification and generation of unrefinable partitions	0
Insertion depth in power-weight trees	0
Longest bordered and periodic subsequences	0
Order-preserving pattern matching with scaling	0
A new class of generalized almost perfect nonlinear monomial functions	0
Determining asynchronous test equivalence for probabilistic processes	0
A generalization of the Blind Rotating Table game	0
A weakness in OCB3 used with short nonces allowing for a break of authenticity and confidentiality	0
On reversing arcs to improve arc-connectivity	0
Comparing approximate and probabilistic differential privacy parameters	0
Domain-oriented masked bit-parallel finite-field multiplier against side-channel attacks	0
On approximate reconfigurability of label cover	0
New results on pairwise compatibility graphs	0
On the preferred extensions of argumentation frameworks: Bijections with naive sets	0
New sharp lower bound for the quorum coloring number of trees	0
Complexity of solving a system of difference constraints with variables restricted to a finite set	0
An improved exact algorithm for minimum dominating set in chordal graphs	0
Optimal circle search despite the presence of faulty robots	0
The upper and lower bounds of R-conditional diagnosability of networks	0
Zone theorem for arrangements in dimension three	0
Optimizing the evaluation of ℓ-isogenous curve for isogeny-based cryptography	0
Tight binding number bound for P≥3-factor uniform graphs	0
Hard problems that quickly become very easy	0
Static type checking without downcast operator	0
Checking in polynomial time whether or not a regular tree language is deterministic top-down	0
An improved spectral lower bound of treewidth	0
Long directed detours: Reduction to 2-Disjoint Paths	0
Revisiting reachability in Polynomial Interrupt Timed Automata	0
Hamiltonian cycles and paths in hypercubes with disjoint faulty edges	0
On-line exploration of rectangular cellular environments with a rectangular hole	0
Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints	0
Strong edge-colorings of sparse graphs with 3Δ − 1 colors	0
Representing point sets on the plane as permutations	0
On the chromatic numbers of signed triangular and hexagonal grids	0
A simple proof of QBF hardness	0
A faster parameterized algorithm for temporal matching	0
Red Blue Set Cover problem on axis-parallel hyperplanes and other objects	0
Escaping Braess's paradox through approximate Caratheodory's theorem	0
Worst-case analysis of LPT scheduling on a small number of non-identical processors	0
A note on hardness of computing recursive teaching dimension	0
Analyzing Residual Random Greedy for monotone submodular maximization	0
Online graph exploration on trees, unicyclic graphs and cactus graphs	0
Monochromatic partitioning of colored points by lines	0
Word automatic groups of nilpotency class 2	0
A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph	0
Luby's MIS algorithms made self-stabilizing	0
Quantum attacks on Sum of Even-Mansour pseudorandom functions	0
Efficiently recognizing graphs with equal independence and annihilation numbers	0
List k-colouring P-free graphs: A Mim-width perspective	0
On the complexity of co-secure dominating set problem	0
On Voronoi visibility maps of 1.5D terrains with multiple viewpoints	0
Improved lower bound for differentially private facility location	0
Spanners under the Hausdorff and Fréchet distances	0
Minimal 2-connected graphs satisfying the even cut condition	0
Anti Tai mapping for unordered labeled trees	0