Login / Signup
Inf. Process. Lett.
1971
1986
2006
2024
1971
2024
Keyphrases
Publications
volume 185, 2024
Debasish Pattanayak
,
Andrzej Pelc
Deterministic treasure hunt and rendezvous in arbitrary connected graphs.
Inf. Process. Lett.
185 (2024)
Qi Wei
,
Xiaolin Yao
,
Wenxin Zhang
,
Ruiyue Zhang
,
Yonggong Ren
On-line exploration of rectangular cellular environments with a rectangular hole.
Inf. Process. Lett.
185 (2024)
Caroline Brosse
,
Oscar Defrain
,
Kazuhiro Kurita
,
Vincent Limouzy
,
Takeaki Uno
,
Kunihiro Wasa
On the hardness of inclusion-wise minimal separators enumeration.
Inf. Process. Lett.
185 (2024)
Nikolas Klug
Computing minimal solutions to the ring loading problem.
Inf. Process. Lett.
185 (2024)
Daniele Dell'Erba
,
Sven Schewe
,
Qiyi Tang
,
Tansholpan Zhanabekova
Semantic flowers for good-for-games and deterministic automata.
Inf. Process. Lett.
185 (2024)
B. S. Panda
,
Soumyashree Rana
,
Sounaka Mishra
On the complexity of co-secure dominating set problem.
Inf. Process. Lett.
185 (2024)
Konstantinos Panagiotou
,
Simon Reisser
The effect of iterativity on adversarial opinion forming.
Inf. Process. Lett.
185 (2024)
Vugar E. Ismailov
Approximation error of single hidden layer neural networks with fixed weights.
Inf. Process. Lett.
185 (2024)
Mislav Blazevic
,
Stefan Canzar
,
Khaled Elbassioni
,
Domagoj Matijevic
Anti Tai mapping for unordered labeled trees.
Inf. Process. Lett.
185 (2024)
Fedor V. Fomin
,
Petr A. Golovach
,
Tanmay Inamdar
,
Tomohiro Koana
FPT approximation and subexponential algorithms for covering few or many edges.
Inf. Process. Lett.
185 (2024)
volume 184, 2024
Sukanya Maji
,
Sanjib Sadhu
Discrete and mixed two-center problems for line segments.
Inf. Process. Lett.
184 (2024)
Sergey Kitaev
,
Artem V. Pyatkin
On semi-transitive orientability of split graphs.
Inf. Process. Lett.
184 (2024)
Nicola Galesi
,
Fariba Ranjbar
,
Michele Zito
Vertex-connectivity for node failure identification in Boolean Network Tomography.
Inf. Process. Lett.
184 (2024)
Eduardo Sany Laber
The computational complexity of some explainable clustering problems.
Inf. Process. Lett.
184 (2024)
Sebastian Maneth
,
Helmut Seidl
Checking in polynomial time whether or not a regular tree language is deterministic top-down.
Inf. Process. Lett.
184 (2024)
Xiaowei Li
,
Xiwen Lu
The facility location problem with maximum distance constraint.
Inf. Process. Lett.
184 (2024)
Lijing Zheng
,
Haibin Kan
,
Jie Peng
,
Yanjun Li
,
Yanbin Zheng
A new class of generalized almost perfect nonlinear monomial functions.
Inf. Process. Lett.
184 (2024)
Md. Manzurul Hasan
,
Debajyoti Mondal
,
Md. Saidur Rahman
Relating planar graph drawings to planar satisfiability problems.
Inf. Process. Lett.
184 (2024)
Shion Utsumi
,
Motoki Nakahashi
,
Kosei Sakamoto
,
Takanori Isobe
Exploring the optimality of byte-wise permutations of a piccolo-type block cipher.
Inf. Process. Lett.
184 (2024)
Daniel Gabric
Ranking and unranking bordered and unbordered words.
Inf. Process. Lett.
184 (2024)
Pierre Hoppenot
,
Zoltán Szigeti
On reversing arcs to improve arc-connectivity.
Inf. Process. Lett.
184 (2024)
Reynaldo Gil Pons
,
Max Ward
,
Loïc Miller
)-hypernetworks in F-hypergraphs is NP-hard.
Inf. Process. Lett.
184 (2024)
Guoliang Qiu
,
Jiaheng Wang
Inapproximability of counting independent sets in linear hypergraphs.
Inf. Process. Lett.
184 (2024)
volume 183, 2024
Nidia Obscura Acosta
,
Alexandru I. Tomescu
Simplicity in Eulerian circuits: Uniqueness and safety.
Inf. Process. Lett.
183 (2024)
Je Hong Park
,
Woo-Hwan Kim
Security weakness of a certificate-based proxy signature scheme for IIoT environments.
Inf. Process. Lett.
183 (2024)
Maximilien Mackie
Recursion-free modular arithmetic in the lambda-calculus.
Inf. Process. Lett.
183 (2024)
Arka Ray
There is no APTAS for 2-dimensional vector bin packing: Revisited.
Inf. Process. Lett.
183 (2024)
Takuto Mitsunobu
,
Reiji Suda
,
Vorapong Suppakitpaisarn
Worst-case analysis of LPT scheduling on a small number of non-identical processors.
Inf. Process. Lett.
183 (2024)
Majid Mirzanezhad
On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions.
Inf. Process. Lett.
183 (2024)
Akanksha Agrawal
,
Henning Fernau
,
Philipp Kindermann
,
Kevin Mann
,
Uéverton S. Souza
Recognizing well-dominated graphs is coNP-complete.
Inf. Process. Lett.
183 (2024)
Kohei Morita
,
Shinya Shiroshita
,
Yutaro Yamaguchi
,
Yu Yokoi
Fast primal-dual update against local weight update in linear assignment problem and its application.
Inf. Process. Lett.
183 (2024)
Júlio Araújo
,
Victor A. Campos
,
Darlan Girão
,
João Nogueira
,
António Salgueiro
,
Ana Silva
On the hull number on cycle convexity of graphs.
Inf. Process. Lett.
183 (2024)
Jonas Lingg
,
Mateus de Oliveira Oliveira
,
Petra Wolf
Learning from positive and negative examples: New proof for binary alphabets.
Inf. Process. Lett.
183 (2024)
Chik How Tan
,
Theo Fanuela Prabowo
A new key recovery attack on a code-based signature from the Lyubashevsky framework.
Inf. Process. Lett.
183 (2024)
Yogesh Dahiya
,
K. Vignesh
,
Meena Mahajan
,
Karteek Sreenivasaiah
Linear threshold functions in decision lists, decision trees, and depth-2 circuits.
Inf. Process. Lett.
183 (2024)
Bhisham Dev Verma
,
Rameshwar Pratap
,
Manoj Thakur
Unbiased estimation of inner product via higher order count sketch.
Inf. Process. Lett.
183 (2024)
Dar-Li Yang
,
Yung-Tsung Hou
,
Wen-Hung Kuo
A short note on "A note on single-machine scheduling with job-dependent learning effects".
Inf. Process. Lett.
183 (2024)
Balder ten Cate
,
Maurice Funk
,
Jean Christoph Jung
,
Carsten Lutz
On the non-efficient PAC learnability of conjunctive queries.
Inf. Process. Lett.
183 (2024)
André Nies
,
Frank Stephan
Word automatic groups of nilpotency class 2.
Inf. Process. Lett.
183 (2024)
Shanshan Wang
,
Chenglong Xiao
,
Emmanuel Casseau
Algorithms with improved delay for enumerating connected induced subgraphs of a large cardinality.
Inf. Process. Lett.
183 (2024)
Pasin Manurangsi
A note on hardness of computing recursive teaching dimension.
Inf. Process. Lett.
183 (2024)
Florian Hörsch
,
Zoltán Szigeti
Steiner connectivity problems in hypergraphs.
Inf. Process. Lett.
183 (2024)
Jean Liénardy
,
Frédéric Lafitte
A weakness in OCB3 used with short nonces allowing for a break of authenticity and confidentiality.
Inf. Process. Lett.
183 (2024)
Lluís Alemany-Puig
,
Juan Luis Esteban
,
Ramon Ferrer-i-Cancho
The maximum linear arrangement problem for trees under projectivity and planarity.
Inf. Process. Lett.
183 (2024)
volume 182, 2023
Dishant Goyal
,
Ragesh Jaiswal
Tight FPT Approximation for Socially Fair Clustering.
Inf. Process. Lett.
182 (2023)
Mnacho Echenim
,
Nicolas Peltier
An undecidability result for Separation Logic with theory reasoning.
Inf. Process. Lett.
182 (2023)
Santiago Cifuentes
,
Francisco J. Soulignac
,
Pablo Terlisky
Complexity of solving a system of difference constraints with variables restricted to a finite set.
Inf. Process. Lett.
182 (2023)
Nikolaos Fryganiotis
,
Symeon Papavassiliou
,
Christos Pelekis
A note on the network coloring game: A randomized distributed (Δ + 1)-coloring algorithm.
Inf. Process. Lett.
182 (2023)
Canh V. Pham
,
Dung K. Ha
A note for approximating the submodular cover problem over integer lattice with low adaptive and query complexities.
Inf. Process. Lett.
182 (2023)
Hideo Bannai
,
Tomohiro I
,
Dominik Köppl
Longest bordered and periodic subsequences.
Inf. Process. Lett.
182 (2023)