Information Processing Letters

Article	Citations
About blockchain interoperability	46
Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost	19
Threshold changeable secret sharing with secure secret reconstruction	18
Tight binding number bound for P≥3-factor uniform graphs	12
Instability results for Euclidean distance, nearest neighbor search on high dimensional Gaussian data	11
Complexity and algorithms for injective edge-coloring in graphs	10
Mutual exclusion in fully anonymous shared memory systems	8
Quantum attacks on Sum of Even-Mansour pseudorandom functions	7
Lengths of words accepted by nondeterministic finite automata	7
Maximum-area triangle in a convex polygon, revisited	7
On computing Pareto optimal paths in weighted time-dependent networks	7
Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game	7
On the correctness of Egalitarian Paxos	7
Representations of stably continuous semi-lattices by information systems and abstract bases	6
Online leasing strategy for depreciable equipment considering opportunity cost	6
The first Zagreb index, reciprocal degree distance and Hamiltonian-connectedness of graphs	6
List k-colouring P-free graphs: A Mim-width perspective	5
Recognizing and realizing cactus metrics	5
Security analysis of a dynamic threshold secret sharing scheme using linear subspace method	5
A lower bound for the coverability problem in acyclic pushdown VAS	5
Small cycles, generalized prisms and Hamiltonian cycles in the Bubble-sort graph	5
Optimal-size problem kernels for d-Hitting Set in linear time and space	5
Embedded edge connectivity of k-ary n-cubes	5
Lot scheduling on a single machine to minimize the (weighted) number of tardy orders	4
Signed coloring of 2-dimensional grids	4

A refined approximation for Euclidean k-means	4
Longest common subsequence in sublinear space	4
A note on the concrete hardness of the shortest independent vector in lattices	4
An answer to an open problem of Mesnager on bent functions	4
An A⁎ search algorithm for the constrained longest common subsequence problem	4
A polylogarithmic approximation algorithm for 2-edge-connected dominating set	4
Tight bounds for reachability problems on one-counter and pushdown systems	4
Faster parameterized algorithm for Bicluster Editing	3
A note on matching-cut in P-free graphs	3
Testing gap k-planarity is NP-complete	3
Palindromic trees for a sliding window and its applications	3
An asymptotically tight online algorithm for m-Steiner Traveling Salesman Problem	3
An Algorithm for the Sequence Alignment with Gap Penalty Problem using Multiway Divide-and-Conquer and Matrix Transposition	3
A faster parameterized algorithm for temporal matching	3
The upper and lower bounds of R-conditional diagnosability of networks	3
Super spanning connectivity of split-star networks	3
Fast primal-dual update against local weight update in linear assignment problem and its application	3
A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands	3
Differentiators and detectors	3
A non-clausal tableau calculus for MinSat	3
Minimum projective linearizations of trees in linear time	3
On the computational complexity of length- and neighborhood-constrained path problems	3
Cluster deletion revisited	3
Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee	3
“The simplest protocol for oblivious transfer” revisited	3
Catalan and Schröder permutations sortable by two restricted stacks	3
On the probability of overlap of random subsequences of pseudorandom number generators	3
Remark on subcodes of linear complementary dual codes	3
Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes	3
Modified quadratic residue constructions and new extremal binary self-dual codes of lengths 64, 66 and 68	3
A queueing network-based distributed Laplacian solver for directed graphs	3
On complementing unambiguous automata and graphs with many cliques and cocliques	3
An improved exact algorithm for minimum dominating set in chordal graphs	3
Strategies for generating tree spanners: Algorithms, heuristics and optimal graph classes	2
A real polynomial for bipartite graph minimum weight perfect matchings	2
Raiders of the lost equivalence: Probabilistic branching bisimilarity	2
Computing the k densest subgraphs of a graph	2
Robbins and Ardila meet Berstel	2
On the (im)possibility of improving the round diffusion of generalized Feistel structures	2
A competitive analysis for the Start-Gap algorithm for online memory wear leveling	2
Packing batches of items into a single bin	2
Distinguisher on full-round compression function of GOST R	2
Surveying global verifiability	2
The complexity of the vertex-minor problem	2
Cryptanalysis and improvements of an efficient certificate-based proxy signature scheme for IIoT environments	2
A note on VNP-completeness and border complexity	2
Probabilistic weak bisimulation and axiomatization for probabilistic models	2
Approximation algorithms for a virtual machine allocation problem with finite types	2
Simpler FM-index for parameterized string matching	2
An algorithm for reconstructing level-2 phylogenetic networks from trinets	2

Faster algorithms for cograph edge modification problems	2
Geometric separability using orthogonal objects	2
Longest distance of a non-uniform dispersion process on the infinite line	2
Sorting can exponentially speed up pure dynamic programming	2
On the chromatic numbers of signed triangular and hexagonal grids	2
Extending de Bruijn sequences to larger alphabets	2
Runtime analysis of evolutionary algorithms via symmetry arguments	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
Online single-machine scheduling to minimize the linear combination of makespans of two agents	2
Independent domination versus weighted independent domination	2
Kernel for K-free Edge Deletion	2
End vertices of graph searches on bipartite graphs	2
Hardness and tractability of the γ-Complete Subgraph problem	2
On the k-means/median cost function	2
NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times	2
Space-efficient Huffman codes revisited	2
A generalization of the Blind Rotating Table game	2
Hard problems that quickly become very easy	2
Online search for a hyperplane in high-dimensional Euclidean space	2
Connectivity, super connectivity and generalized 3-connectivity of folded divide-and-swap cubes	2
Thou shalt covet the average of thy neighbors' cakes	1
Computing inductive vertex orderings	1
A simple proof of QBF hardness	1
On the complexity of detecting hazards	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
Improved bounds for rectangular monotone Min-Plus Product and applications	1
On clustering with discounts	1
Verification and generation of unrefinable partitions	1
Fault-tolerant Hamiltonicity of hypercubes with faulty subcubes	1
The complexity of finding temporal separators under waiting time constraints	1
Weighted automata are compact and actively learnable	1
Annotated regular expressions and input-driven languages	1
Upper bound for the number of closed and privileged words	1
On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees	1
On the non-efficient PAC learnability of conjunctive queries	1
The envy-free matching problem with pairwise preferences	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
Optimal circle search despite the presence of faulty robots	1
Improved cube-attack-like cryptanalysis of reduced-round Ketje-Jr and Keccak-MAC	1
A characterization of 3-γ-critical graphs which are not bicritical	1
Reverse greedy is bad for k-center	1
Randomized consensus with regular registers	1
An improved kernel for the flip distance problem on simple convex polygons	1
Horton-Strahler number, rooted pathwidth and upward drawings of trees	1
A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs - via half-edges	1
A note on distance-preserving graph sparsification	1
Online graph exploration on trees, unicyclic graphs and cactus graphs	1
Improved algorithms for left factorial residues	1
Approximating the minimal lookahead needed to win infinite games	1
New network entropy: The domination entropy of graphs	1
A note on algebraic techniques for subgraph detection	1
Order-preserving pattern matching with scaling	1
A constructive proof of a concentration bound for real-valued random variables	1
Longest previous overlapping factor array	1
Polynomial invariants for cactuses	1
New results on pairwise compatibility graphs	1
Grundy coloring in some subclasses of bipartite graphs and their complements	1
Lazy or eager dynamic matching may not be fast	1
Packing batches of cubes into a single bin	1
On public-coin zero-error randomized communication complexity	1
A polynomial algorithm for deciding the validity of an electrical distribution tree	1
On the longest common subsequence of Thue-Morse words	1
On the intractability of preemptive single-machine job scheduling with release times, deadlines, and family setup times	1
Determining asynchronous test equivalence for probabilistic processes	1
Improved entropy bounds for parity filtered self-timed ring based random number generators	1
Polynomial kernels for tracking shortest paths	1
A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption	1
Hamiltonian cycles and paths in hypercubes with disjoint faulty edges	1
Bounds and algorithms for generalized superimposed codes	1
RAC drawings in subcubic area	1
Tight FPT Approximation for Socially Fair Clustering	1
On the preferred extensions of argumentation frameworks: Bijections with naive sets	1
Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions	1
On cryptographic anonymity and unpredictability in secret sharing	1
Strong security of linear ramp secret sharing schemes with general access structures	1
Borders, palindrome prefixes, and square prefixes	1
A constant-time sampling algorithm for binary Gaussian distribution over the integers	1
There is no APTAS for 2-dimensional vector bin packing: Revisited	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
A new key recovery attack on a code-based signature from the Lyubashevsky framework	1
Simplicity in Eulerian circuits: Uniqueness and safety	1
A weakness in OCB3 used with short nonces allowing for a break of authenticity and confidentiality	1
Results and conjectures on the role of the uniform distribution in the coupon collector's problem with group drawings	1
Isomorphism for random k-uniform hypergraphs	1
Linear threshold functions in decision lists, decision trees, and depth-2 circuits	1
Constrained existence of weak subgame perfect equilibria in multiplayer Büchi games	1
Deterministic treasure hunt and rendezvous in arbitrary connected graphs	0
Faster deterministic algorithm for Co-Path Set	0
Security weakness of a certificate-based proxy signature scheme for IIoT environments	0
Quantitative controller synthesis for consumption Markov decision processes	0
A diameter-revealing proof of the Bondy-Lovász lemma	0
A simple approach to nondecreasing paths	0
Vertex degrees and 2-cuts in graphs with many hamiltonian vertex-deleted subgraphs	0
Faster deterministic algorithm for Cactus Vertex Deletion	0
Kruskal with embedded C-semirings to solve MST problems with partially-ordered costs	0
Editorial Board	0
Slightly improved lower bounds for homogeneous formulas of bounded depth and bounded individual degree	0
Guided blocks WOM codes	0
Waypoint routing on bounded treewidth graphs	0
A simple and improved parameterized algorithm for bicluster editing	0
The odd chromatic number of a toroidal graph is at most 9	0
Two-level hub Steiner trees	0
Editorial Board	0
Optimal approximations made easy	0
A note on the integrality gap of the configuration LP for restricted Santa Claus	0
Editorial Board	0
A note on integral generalized flows in directed partial 2-trees	0
Finding (s,d)-hypernetworks in F-hypergraphs is NP-hard	0
Editorial Board	0
Statistical EL is ExpTime-complete	0
Computing minimal solutions to the ring loading problem	0
Editorial Board	0
On product decomposition	0
Editorial Board	0
Comment on “An enhanced and secured RSA public cryptosystem algorithm using Chinese remainder theorem (ESRPKC)”	0
Algorithms with improved delay for enumerating connected induced subgraphs of a large cardinality	0
Polynomial recognition of vulnerable multi-commodities	0
Editorial Board	0
On the security of TrCBC	0
Rank and select operations on a word	0
The complexity of comparing optimal solutions	0
On matrices potentially useful for tree codes	0
Surveying definitions of election verifiability	0
Unbiased estimation of inner product via higher order count sketch	0
An Ore-type condition for the existence of two disjoint cycles	0
A note on the network coloring game: A randomized distributed (Δ + 1)-coloring algorithm	0
Erasure and error correcting ability of Parikh matrices	0
An FPT algorithm for orthogonal buttons and scissors	0
On the effectiveness of the genetic paradigm for polygonization	0
Editorial Board	0
QUIXO is EXPTIME-complete	0
A note on the class of languages generated by F-systems over regular languages	0
Variational networks of cube-connected cycles are recursive cubes of rings	0
Randomized distributed online algorithms against adaptive offline adversaries	0
Computability by monadic second-order logic	0
Non-uniform birthday problem revisited: Refined analysis and applications to discrete logarithms	0
Exploring the optimality of byte-wise permutations of a piccolo-type block cipher	0
Approximation ratio of LD algorithm for multi-processor scheduling and the Coffman–Sethi conjecture	0
A simple combinatorial proof for the small model property of two-variable logic	0
Transforming plane triangulations by simultaneous diagonal flips	0
Editorial Board	0
Editorial Board	0
The facility location problem with maximum distance constraint	0
Spectral independence, coupling, and the spectral gap of the Glauber dynamics	0
Recognizing well-dominated graphs is coNP-complete	0
A note on the satisfactory partition problem: Constant size requirement	0
Editorial Board	0
Distributivity and residuation for lexicographic orders	0
On the parameterized complexity of the Maximum Exposure Problem	0
Local linear set on graphs with bounded twin cover number	0
A note on the fine-grained complexity of MIS on regular graphs	0
Strong hardness of approximation for tree transversals	0
Algorithms for deletion problems on split graphs	0
Tight lower bound for average number of terms in optimal double-base number system using information-theoretic tools	0
On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions	0
On the additive chromatic number of several families of graphs	0
Density of distinct squares in non-primitive words	0
Grid straight-line embeddings of trees with a minimum number of bends per path	0
On parallel time in population protocols	0
A note on approximations of directed edge dominating set	0
Approximation algorithms for connected maximum coverage problem for the discovery of mutated driver pathways in cancer	0
New bounds on antipowers in words	0
Weakest preconditioned goto axiom	0
Corrigendum to “Revisiting reachability in polynomial interrupt timed automata” [Information Processing Letters 174 (2022) 106208]	0
Editorial Board	0
The complexity of computing (almost) orthogonal matrices with ε-copies of the Fourier transform	0
Entailment is Undecidable for Symbolic Heap Separation Logic Formulæ with Non-Established Inductive Rules	0
Ranking and unranking bordered and unbordered words	0
On the complexity of finding a Caristi's fixed point	0
The maximum linear arrangement problem for trees under projectivity and planarity	0
Editorial Board	0
Further results on the second relative greedy weight of 3-dimensional codes	0