Information Processing Letters

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
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
Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game	8
A polylogarithmic approximation algorithm for 2-edge-connected dominating set	6
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
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
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
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
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
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
There is no APTAS for 2-dimensional vector bin packing: Revisited	2
Geometric separability using orthogonal objects	2
The envy-free matching problem with pairwise preferences	2
On semi-transitive orientability of split graphs	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
Thou shalt covet the average of thy neighbors' cakes	2
Kernel for K-free Edge Deletion	2
Probabilistic weak bisimulation and axiomatization for probabilistic models	2
On the (im)possibility of improving the round diffusion of generalized Feistel structures	2
Linear threshold functions in decision lists, decision trees, and depth-2 circuits	2
End vertices of graph searches on bipartite graphs	2
A characterization of 3-γ-critical graphs which are not bicritical	2
A competitive analysis for the Start-Gap algorithm for online memory wear leveling	2
Packing batches of items into a single bin	2
Surveying global verifiability	2
Weighted automata are compact and actively learnable	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
Polynomial kernels for tracking shortest paths	2
Robbins and Ardila meet Berstel	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
The complexity of finding temporal separators under waiting time constraints	2
The odd chromatic number of a toroidal graph is at most 9	2
Space-efficient Huffman codes revisited	2
Longest distance of a non-uniform dispersion process on the infinite line	2
On the preferred extensions of argumentation frameworks: Bijections with naive sets	2
On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees	2
Order-preserving pattern matching with scaling	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
Optimizing the evaluation of ℓ-isogenous curve for isogeny-based cryptography	2
Bounds and algorithms for generalized superimposed codes	2
Cryptanalysis and improvements of an efficient certificate-based proxy signature scheme for IIoT environments	2
On the k-means/median cost function	2
Extending de Bruijn sequences to larger alphabets	2
An algorithm for reconstructing level-2 phylogenetic networks from trinets	2
Determining asynchronous test equivalence for probabilistic processes	1
Horton-Strahler number, rooted pathwidth and upward drawings of trees	1
Optimal circle search despite the presence of faulty robots	1
Discrete and mixed two-center problems for line segments	1
On the longest common subsequence of Thue-Morse words	1
Entailment is Undecidable for Symbolic Heap Separation Logic Formulæ with Non-Established Inductive Rules	1
Correcting matrix products over the ring of integers	1
Improved algorithms for left factorial residues	1
Strong security of linear ramp secret sharing schemes with general access structures	1
Local linear set on graphs with bounded twin cover number	1
Worst-case analysis of LPT scheduling on a small number of non-identical processors	1
Spectral independence, coupling, and the spectral gap of the Glauber dynamics	1
Approximating the minimal lookahead needed to win infinite games	1
Grundy coloring in some subclasses of bipartite graphs and their complements	1
A note on the satisfactory partition problem: Constant size requirement	1
Longest previous overlapping factor array	1
Revisiting lower dimension lattice attacks on NTRU	1
Hamiltonian cycles and paths in hypercubes with disjoint faulty edges	1
Improved cube-attack-like cryptanalysis of reduced-round Ketje-Jr and Keccak-MAC	1
Strong edge-colorings of sparse graphs with 3Δ − 1 colors	1
Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance	1
A new key recovery attack on a code-based signature from the Lyubashevsky framework	1
Results and conjectures on the role of the uniform distribution in the coupon collector's problem with group drawings	1
An improved kernel for the flip distance problem on simple convex polygons	1
A note on distance-preserving graph sparsification	1
Improved bounds for rectangular monotone Min-Plus Product and applications	1
Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions	1
On the non-efficient PAC learnability of conjunctive queries	1
Tight lower bound for average number of terms in optimal double-base number system using information-theoretic tools	1
A constant-time sampling algorithm for binary Gaussian distribution over the integers	1
Ranking and unranking bordered and unbordered words	1
Efficient linear-time ranking and unranking of derangements	1
On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions	1
A generalization of the Blind Rotating Table game	1
Kruskal with embedded C-semirings to solve MST problems with partially-ordered costs	1
Packing batches of cubes into a single bin	1
On d-distance m-tuple (ℓ,r)-domination in graphs	1
Randomized consensus with regular registers	1
A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs - via half-edges	1
Computing inductive vertex orderings	1
On public-coin zero-error randomized communication complexity	1
A polynomial algorithm for deciding the validity of an electrical distribution tree	1
A weakness in OCB3 used with short nonces allowing for a break of authenticity and confidentiality	1
Constrained existence of weak subgame perfect equilibria in multiplayer Büchi games	1
A simple proof of QBF hardness	1
A note on algebraic techniques for subgraph detection	1
Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints	1
Exact PPS sampling with bounded sample size	1
Verification and generation of unrefinable partitions	1
Borders, palindrome prefixes, and square prefixes	1
Determining rate monotonic schedulability of real-time periodic tasks using continued fractions	1
Faster counting empty convex polygons in a planar point set	1
New results on pairwise compatibility graphs	1
Polynomial invariants for cactuses	1
On the chromatic numbers of signed triangular and hexagonal grids	1
Isomorphism for random k-uniform hypergraphs	1
Generalized cuckoo hashing with a stash, revisited	1
Checking in polynomial time whether or not a regular tree language is deterministic top-down	1
Simplicity in Eulerian circuits: Uniqueness and safety	1

Public-key encryption scheme with optimal continuous leakage resilience	1
On the intractability of preemptive single-machine job scheduling with release times, deadlines, and family setup times	1
Recursion-free modular arithmetic in the lambda-calculus	0
Editorial Board	0
On the effectiveness of the genetic paradigm for polygonization	0
Comment on “An enhanced and secured RSA public cryptosystem algorithm using Chinese remainder theorem (ESRPKC)”	0
A nearly tight lower bound for the d-dimensional cow-path problem	0
Vertex degrees and 2-cuts in graphs with many hamiltonian vertex-deleted subgraphs	0
A sharper lower bound on Rankin's constant	0
Smaller kernels for two vertex deletion problems	0
Quantitative controller synthesis for consumption Markov decision processes	0
Unbiased estimation of inner product via higher order count sketch	0
On parallel time in population protocols	0
Editorial Board	0
The group factorization problem in finite groups of Lie type	0
Editorial Board	0
Further results on the second relative greedy weight of 3-dimensional codes	0
On the complexity of finding a Caristi's fixed point	0
Robust scheduling for minimizing maximum lateness on a serial-batch processing machine	0
Non-uniform birthday problem revisited: Refined analysis and applications to discrete logarithms	0
Algorithms for deletion problems on split graphs	0
The complexity of comparing optimal solutions	0
Finding (s,d)-hypernetworks in F-hypergraphs is NP-hard	0
Editorial Board	0
Waypoint routing on bounded treewidth graphs	0
Surveying definitions of election verifiability	0
Recognizing LBFS trees of bipartite graphs	0
Transforming plane triangulations by simultaneous diagonal flips	0
Algorithms with improved delay for enumerating connected induced subgraphs of a large cardinality	0
FPT approximation and subexponential algorithms for covering few or many edges	0
Guided blocks WOM codes	0
Relating planar graph drawings to planar satisfiability problems	0
The facility location problem with maximum distance constraint	0
Maximal elements with minimal logic	0
Corrigendum to “Revisiting reachability in polynomial interrupt timed automata” [Information Processing Letters 174 (2022) 106208]	0
Editorial Board	0
Editorial Board	0
Density of distinct squares in non-primitive words	0
Synchronizing words under LTL constraints	0
On matrices potentially useful for tree codes	0
Sparsifying Count Sketch	0
On product decomposition	0
Algorithmic results in Roman dominating functions on graphs	0
The maximum linear arrangement problem for trees under projectivity and planarity	0
A note on approximations of directed edge dominating set	0
On the parameterized complexity of the Maximum Exposure Problem	0
Editorial Board	0
Skolem and positivity completeness of ergodic Markov chains	0
On some decidability questions concerning supports of rational series	0
Polynomial recognition of vulnerable multi-commodities	0
Corrigendum to “Mutual exclusion in fully anonymous shared memory systems” [Inf. Process. Lett. 158 (2020) 105938]	0
Computing minimal solutions to the ring loading problem	0
A simple and improved parameterized algorithm for bicluster editing	0
The complexity of computing (almost) orthogonal matrices with ε-copies of the Fourier transform	0
Erasure and error correcting ability of Parikh matrices	0
Editorial Board	0
Learning-augmented maximum flow	0
Rank and select operations on a word	0
Two-level hub Steiner trees	0
Editorial Board	0
Computability by monadic second-order logic	0
Recognizing well-dominated graphs is coNP-complete	0
The effect of iterativity on adversarial opinion forming	0
Faster deterministic algorithm for Cactus Vertex Deletion	0
The computational complexity of some explainable clustering problems	0
Editorial Board	0
A note on integral generalized flows in directed partial 2-trees	0
Distributivity and residuation for lexicographic orders	0
A simple combinatorial proof for the small model property of two-variable logic	0
A diameter-revealing proof of the Bondy-Lovász lemma	0
On optimization problems in acyclic hypergraphs	0
The autocorrelation of a class of quaternary sequences of length pq with high complexity	0
Editorial Board	0
Regular resolution effectively simulates resolution	0
On the security of TrCBC	0
Strong hardness of approximation for tree transversals	0
A note on the network coloring game: A randomized distributed (Δ + 1)-coloring algorithm	0
Optimal approximations made easy	0
Faster deterministic algorithm for Co-Path Set	0
Statistical EL is ExpTime-complete	0
Expressive completeness by separation for discrete time interval temporal logic with expanding modalities	0
Editorial Board	0
A note on the integrality gap of the configuration LP for restricted Santa Claus	0
New bounds on antipowers in words	0
Exploring the optimality of byte-wise permutations of a piccolo-type block cipher	0
Editorial Board	0
An FPT algorithm for orthogonal buttons and scissors	0
Grid straight-line embeddings of trees with a minimum number of bends per path	0
Tight inapproximability of Nash equilibria in public goods games	0
A note on the fine-grained complexity of MIS on regular graphs	0
Editorial Board	0
Splitting NP-complete sets infinitely	0
Security weakness of a certificate-based proxy signature scheme for IIoT environments	0
Vertex-connectivity for node failure identification in Boolean Network Tomography	0
Deterministic treasure hunt and rendezvous in arbitrary connected graphs	0