| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Júlio Araújo 0001, Victor A. Campos, Darlan Girão, João Nogueira, António Salgueiro, Ana Silva 0001 |
On the hull number on cycle convexity of graphs.  |
Inf. Process. Lett.  |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Maximilien Mackie |
Recursion-free modular arithmetic in the lambda-calculus. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Majid Mirzanezhad |
On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Jonas Lingg, Mateus de Oliveira Oliveira, Petra Wolf 0002 |
Learning from positive and negative examples: New proof for binary alphabets. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Konstantinos Panagiotou, Simon Reisser |
The effect of iterativity on adversarial opinion forming. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Dell'Erba, Sven Schewe, Qiyi Tang 0001, Tansholpan Zhanabekova |
Semantic flowers for good-for-games and deterministic automata. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Chik How Tan, Theo Fanuela Prabowo |
A new key recovery attack on a code-based signature from the Lyubashevsky framework. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Shion Utsumi, Motoki Nakahashi, Kosei Sakamoto, Takanori Isobe 0001 |
Exploring the optimality of byte-wise permutations of a piccolo-type block cipher. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Pasin Manurangsi |
A note on hardness of computing recursive teaching dimension. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Debasish Pattanayak, Andrzej Pelc |
Deterministic treasure hunt and rendezvous in arbitrary connected graphs. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicola Galesi, Fariba Ranjbar, Michele Zito 0001 |
Vertex-connectivity for node failure identification in Boolean Network Tomography. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | B. S. Panda 0001, Soumyashree Rana, Sounaka Mishra |
On the complexity of co-secure dominating set problem. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikolas Klug |
Computing minimal solutions to the ring loading problem. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Md. Manzurul Hasan, Debajyoti Mondal, Md. Saidur Rahman 0001 |
Relating planar graph drawings to planar satisfiability problems. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Lijing Zheng, Haibin Kan, Jie Peng, Yanjun Li, Yanbin Zheng |
A new class of generalized almost perfect nonlinear monomial functions. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Akanksha Agrawal 0001, Henning Fernau, Philipp Kindermann, Kevin Mann, Uéverton S. Souza |
Recognizing well-dominated graphs is coNP-complete. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Kohei Morita, Shinya Shiroshita, Yutaro Yamaguchi 0001, Yu Yokoi |
Fast primal-dual update against local weight update in linear assignment problem and its application. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Yogesh Dahiya, K. Vignesh, Meena Mahajan, Karteek Sreenivasaiah |
Linear threshold functions in decision lists, decision trees, and depth-2 circuits. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Arka Ray |
There is no APTAS for 2-dimensional vector bin packing: Revisited. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Je Hong Park, Woo-Hwan Kim |
Security weakness of a certificate-based proxy signature scheme for IIoT environments. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Gabric |
Ranking and unranking bordered and unbordered words. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Nidia Obscura Acosta, Alexandru I. Tomescu |
Simplicity in Eulerian circuits: Uniqueness and safety. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Takuto Mitsunobu, Reiji Suda, Vorapong Suppakitpaisarn |
Worst-case analysis of LPT scheduling on a small number of non-identical processors. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Maneth, Helmut Seidl |
Checking in polynomial time whether or not a regular tree language is deterministic top-down. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Qi Wei 0005, Xiaolin Yao, Wenxin Zhang, Ruiyue Zhang, Yonggong Ren |
On-line exploration of rectangular cellular environments with a rectangular hole. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergey Kitaev, Artem V. Pyatkin |
On semi-transitive orientability of split graphs. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Eduardo Sany Laber |
The computational complexity of some explainable clustering problems. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Bhisham Dev Verma, Rameshwar Pratap, Manoj Thakur |
Unbiased estimation of inner product via higher order count sketch. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Caroline Brosse, Oscar Defrain, Kazuhiro Kurita, Vincent Limouzy, Takeaki Uno, Kunihiro Wasa |
On the hardness of inclusion-wise minimal separators enumeration. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Sukanya Maji, Sanjib Sadhu |
Discrete and mixed two-center problems for line segments. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Guoliang Qiu 0001, Jiaheng Wang 0002 |
Inapproximability of counting independent sets in linear hypergraphs. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Shanshan Wang, Chenglong Xiao, Emmanuel Casseau |
Algorithms with improved delay for enumerating connected induced subgraphs of a large cardinality. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Balder ten Cate, Maurice Funk, Jean Christoph Jung, Carsten Lutz |
On the non-efficient PAC learnability of conjunctive queries. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Reynaldo Gil Pons, Max Ward 0001, Loïc Miller |
Finding (s,d)-hypernetworks in F-hypergraphs is NP-hard. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Hoppenot, Zoltán Szigeti |
On reversing arcs to improve arc-connectivity. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Mislav Blazevic, Stefan Canzar, Khaled Elbassioni, Domagoj Matijevic |
Anti Tai mapping for unordered labeled trees. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Vugar E. Ismailov |
Approximation error of single hidden layer neural networks with fixed weights. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiaowei Li, Xiwen Lu |
The facility location problem with maximum distance constraint. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | André Nies, Frank Stephan 0001 |
Word automatic groups of nilpotency class 2. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar 0002, Tomohiro Koana |
FPT approximation and subexponential algorithms for covering few or many edges. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Florian Hörsch, Zoltán Szigeti |
Steiner connectivity problems in hypergraphs. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Moonju Park, Hyeongboo Baek |
Determining rate monotonic schedulability of real-time periodic tasks using continued fractions. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Brice Minaud, Charalampos Papamanthou |
Generalized cuckoo hashing with a stash, revisited. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Pasin Manurangsi, Erel Segal-Halevi, Warut Suksompong |
On maximum bipartite matching with separation. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Satyam Omar, Sahadeo Padhye, Dhananjoy Dey |
Cryptanalysis of multivariate threshold ring signature schemes. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Dario Fiorenza, Daniele Gorla, Ivano Salvo |
Polynomial recognition of vulnerable multi-commodities. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Cummings, Jeffrey O. Shallit, Paul Staadecker |
Mesosome avoidance. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Pratibha Choudhary, Michael T. Goodrich, Siddharth Gupta 0002, Hadi Khodabandeh, Pedro Matias 0001, Venkatesh Raman 0001 |
Improved kernels for tracking paths. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Steven Kelk, Simone Linz, Ruben Meuwese |
Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael B. Dillencourt, Michael T. Goodrich |
Simplified Chernoff bounds with powers-of-two probabilities. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Jamie Tucker-Foltz |
Thou shalt covet the average of thy neighbors' cakes. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Tim Zeitz |
NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Jorge C. Lucero, Slawek Staworko |
A note on the class of languages generated by F-systems over regular languages. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Gilad Baruch, Shmuel T. Klein, Dana Shapira |
Guided blocks WOM codes. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Leo van Iersel, Vincent Moulton, Yukihiro Murakami |
Polynomial invariants for cactuses. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Riccardo Aragona, Lorenzo Campioni, Roberto Civino, Massimo Lauria |
Verification and generation of unrefinable partitions. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Remi Raman, Shahin John J. S, R. Subashini, Subhasree Methirumangalath |
On the parameterized complexity of the Maximum Exposure Problem. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Alessandro Cimatti, Luca Geatti, Nicola Gigante, Angelo Montanari, Stefano Tonetta |
GR(1) is equivalent to R(1). |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Raynal, Gadi Taubenfeld |
Corrigendum to "Mutual exclusion in fully anonymous shared memory systems" [Inf. Process. Lett. 158 (2020) 105938]. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianling Fu, Cheng-Chao Huang, Yong Li 0031, Jingyi Mei, Ming Xu 0010, Lijun Zhang 0001 |
Quantitative controller synthesis for consumption Markov decision processes. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | José Luis Imaña, Siemen Dhooghe |
Domain-oriented masked bit-parallel finite-field multiplier against side-channel attacks. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Yilun Shang |
Long paths in heterogeneous random subgraphs of graphs with large minimum degree. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathalie Bertrand 0001, Hugo Francon, Nicolas Markey |
Synchronizing words under LTL constraints. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Riccardo Dondi, Danny Hermelin |
Computing the k densest subgraphs of a graph. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Hao Wu, Huan Long |
Probabilistic weak bisimulation and axiomatization for probabilistic models. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Anita Dürr |
Improved bounds for rectangular monotone Min-Plus Product and applications. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Dekel Tsur |
Faster deterministic algorithm for Co-Path Set. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Ming-Deh A. Huang |
On product decomposition. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Artur Czumaj, Andrzej Lingas |
On parallel time in population protocols. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Abolfazl Poureidi, Jafar Fathali |
Algorithmic results in Roman dominating functions on graphs. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Fangyu Tian, Yuxue Yin |
The odd chromatic number of a toroidal graph is at most 9. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Sahar Diskin, Dor Elboim |
Heavy and light paths and Hamilton cycles. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Szymon Grabowski, Dominik Köppl |
Space-efficient Huffman codes revisited. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla |
Polynomial kernels for tracking shortest paths. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Shu-Li Zhao, Jou-Ming Chang |
Connectivity, super connectivity and generalized 3-connectivity of folded divide-and-swap cubes. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Maneth, Helmut Seidl |
Deciding origin equivalence of weakly self-nesting macro tree transducers. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Naoyuki Kamiyama |
On optimization problems in acyclic hypergraphs. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Rauch, Dieter Rautenbach |
Efficiently recognizing graphs with equal independence and annihilation numbers. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Guingona, Alexei Kolesnikov, Julianne Nierwinski, Avery Schweitzer |
Comparing approximate and probabilistic differential privacy parameters. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Hideo Bannai, Tomohiro I, Dominik Köppl |
Longest bordered and periodic subsequences. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Canh V. Pham, Dung K. Ha 0001 |
A note for approximating the submodular cover problem over integer lattice with low adaptive and query complexities. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Kenji Mikawa, Ken Tanaka |
Efficient linear-time ranking and unranking of derangements. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Janusz Januszewski, Lukasz Zielonka |
Packing batches of cubes into a single bin. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Euiwoong Lee, Pengxiang Wang 0002 |
Strong hardness of approximation for tree transversals. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Wei Chen 0094 |
Weakest preconditioned goto axiom. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Debrup Chakraborty, Samir Kundu |
On the security of TrCBC. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Vahideh Keikha, Maria Saumell |
On Voronoi visibility maps of 1.5D terrains with multiple viewpoints. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Thorben Tröbst, Vijay V. Vazirani |
A real polynomial for bipartite graph minimum weight perfect matchings. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Aditya Pillai |
Analyzing Residual Random Greedy for monotone submodular maximization. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohammed Elaroussi, Lhouari Nourine, Mohammed Said Radjef, Simon Vilmin |
On the preferred extensions of argumentation frameworks: Bijections with naive sets. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Yossi Azar, Ilan Reuven Cohen, Iftah Gamzu |
The loss of serving in the dark. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Shuguang Li, Zhichao Geng |
Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuxing Yang |
Embedded edge connectivity of k-ary n-cubes. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Youngho Kim, Munseong Kang, Joong Chae Na, Jeong Seop Sim |
Order-preserving pattern matching with scaling. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Dishant Goyal, Ragesh Jaiswal |
Tight FPT Approximation for Socially Fair Clustering. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Aniruddha Biswas, Palash Sarkar 0001 |
On the "majority is least stable" conjecture. |
Inf. Process. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license